Are you over 18 and want to see adult content?
More Annotations
![A complete backup of instantanatomy.net](https://www.archivebay.com/archive2/2559dbfd-4287-4e55-94a8-f0675ee4353f.png)
A complete backup of instantanatomy.net
Are you over 18 and want to see adult content?
![A complete backup of 1000booksbeforekindergarten.org](https://www.archivebay.com/archive2/d5b89069-49d2-4745-b35b-00f8bfc9d525.png)
A complete backup of 1000booksbeforekindergarten.org
Are you over 18 and want to see adult content?
![A complete backup of implantdirectory.com](https://www.archivebay.com/archive2/81fad382-7415-448d-816c-8de2c2351b60.png)
A complete backup of implantdirectory.com
Are you over 18 and want to see adult content?
![A complete backup of pullensyards.co.uk](https://www.archivebay.com/archive2/84d6a605-7027-4a57-bd41-24fe4308a5d5.png)
A complete backup of pullensyards.co.uk
Are you over 18 and want to see adult content?
![A complete backup of trainingsworld.com](https://www.archivebay.com/archive2/93a6000f-ba44-4b22-99d6-4d3b90801c27.png)
A complete backup of trainingsworld.com
Are you over 18 and want to see adult content?
![A complete backup of travel-british-columbia.com](https://www.archivebay.com/archive2/55f79c1a-e7f7-4517-8c20-fd8b14d86d95.png)
A complete backup of travel-british-columbia.com
Are you over 18 and want to see adult content?
![A complete backup of casinolignefrancais.com](https://www.archivebay.com/archive2/2b97182f-0924-4272-9cd1-7c1b690f8b88.png)
A complete backup of casinolignefrancais.com
Are you over 18 and want to see adult content?
Favourite Annotations
![A complete backup of traveltrademena.com](https://www.archivebay.com/archive/524c6716-9958-460b-9ce7-98fc4e0b56f5.png)
A complete backup of traveltrademena.com
Are you over 18 and want to see adult content?
![A complete backup of streamlinepanel.com](https://www.archivebay.com/archive/41d8cd80-595b-478d-908c-5eeedf39c53a.png)
A complete backup of streamlinepanel.com
Are you over 18 and want to see adult content?
![A complete backup of easternaccents.com](https://www.archivebay.com/archive/d3a0a52e-0c7b-41d9-8cf3-b829b77f4e2e.png)
A complete backup of easternaccents.com
Are you over 18 and want to see adult content?
![A complete backup of wellington-college.school.nz](https://www.archivebay.com/archive/cd41f1bf-1851-4acb-9bcd-e24cdaae9ca9.png)
A complete backup of wellington-college.school.nz
Are you over 18 and want to see adult content?
![A complete backup of dragonalliance.com](https://www.archivebay.com/archive/5fcd294e-c758-4f60-982b-4b33d000ac47.png)
A complete backup of dragonalliance.com
Are you over 18 and want to see adult content?
Text
learning another.
HTTPS - ROSETTA CODE First grabbing the entire body as a string, and then by pulling from a stream. This is the same code as in HTTP Request; drakma:http-request supports SSL. (defun wget-drakma-string (url & optional (out *standard-output*))"Grab the body as a string, and write it to out."IMAGE CONVOLUTION
Image convolution You are encouraged to solve this task according to the task description, using any language you may know.CATEGORY:FORTH
Listed below are all of the tasks on Rosetta Code which have beensolved using Forth.
BITMAP/FLOOD FILL
Implement a flood fill.. A flood fill is a way of filling an area using color banks to define the contained area or a target color which "determines" the area (the valley that can be flooded; Wikipedia uses the term target color).It works almost like a water flooding from a point towards the banks (or: inside the valley): if there's a hole in the banks, the flood is not contained and all theKNUTH'S ALGORITHM S
the maximum sample size, returns a function s_of_n that takes one parameter, item.; Function s_of_n when called with successive items returns an equi-weighted random sample of up to n of its items so far, each time it is called, calculated using Knuths Algorithm S.; Test your functions by printing and showing the frequency of occurrences of the selected digits from 100,000 repetitions of: WRITE TO WINDOWS EVENT LOG Write to Windows event log You are encouraged to solve this task according to the task description, using any language you may know.CSV-TO-XML.XSLT
I'm working on modernizing Rosetta Code's infrastructure. Starting with communications. Please accept this time-limited open invite to RC's Slack..--Michael Mol 20:59, 30 May 2020 (UTC)TOWERS OF HANOI
* Towers of Hanoi 08/09/2015 HANOITOW CSECT USING HANOITOW,R12 r12 : base register LR R12,R15 establish base register KNAPSACK PROBLEM/CONTINUOUS A thief burgles a butcher's shop, where he can select from some items. The thief knows the weights and prices of each items. Because he has a knapsack with 15 kg maximal capacity, he wants to select the items such that he would have his profit maximized. ROSETTA CODECHAT/IRCPLANETTHE VILLAGE PUMPFINANCESLANGUAGESTASKS Rosetta Code is a programming chrestomathy site. The idea is to present solutions to the same task in as many different languages as possible, to demonstrate how languages are similar and different, and to aid a person with a grounding in one approach to a problem inlearning another.
HTTPS - ROSETTA CODE First grabbing the entire body as a string, and then by pulling from a stream. This is the same code as in HTTP Request; drakma:http-request supports SSL. (defun wget-drakma-string (url & optional (out *standard-output*))"Grab the body as a string, and write it to out."IMAGE CONVOLUTION
Image convolution You are encouraged to solve this task according to the task description, using any language you may know.CATEGORY:FORTH
Listed below are all of the tasks on Rosetta Code which have beensolved using Forth.
BITMAP/FLOOD FILL
Implement a flood fill.. A flood fill is a way of filling an area using color banks to define the contained area or a target color which "determines" the area (the valley that can be flooded; Wikipedia uses the term target color).It works almost like a water flooding from a point towards the banks (or: inside the valley): if there's a hole in the banks, the flood is not contained and all theKNUTH'S ALGORITHM S
the maximum sample size, returns a function s_of_n that takes one parameter, item.; Function s_of_n when called with successive items returns an equi-weighted random sample of up to n of its items so far, each time it is called, calculated using Knuths Algorithm S.; Test your functions by printing and showing the frequency of occurrences of the selected digits from 100,000 repetitions of: WRITE TO WINDOWS EVENT LOG Write to Windows event log You are encouraged to solve this task according to the task description, using any language you may know.CSV-TO-XML.XSLT
I'm working on modernizing Rosetta Code's infrastructure. Starting with communications. Please accept this time-limited open invite to RC's Slack..--Michael Mol 20:59, 30 May 2020 (UTC)TOWERS OF HANOI
* Towers of Hanoi 08/09/2015 HANOITOW CSECT USING HANOITOW,R12 r12 : base register LR R12,R15 establish base register KNAPSACK PROBLEM/CONTINUOUS A thief burgles a butcher's shop, where he can select from some items. The thief knows the weights and prices of each items. Because he has a knapsack with 15 kg maximal capacity, he wants to select the items such that he would have his profit maximized.CATEGORY:TUTORIALD
D is a data language specification (see ) and Tutorial D is a specific D that has been defined and implemented.To avoid confusion with another language called D, we have kept the Tutorial D name.CATEGORY:ADA
Ada is a structured, statically typed imperative computer programming language. Ada was initially standardized by ANSI in 1983 and by ISO in 1987. This version of the language is commonly known as Ada 83.The next version was standardized by ISO in 1995 (ISO/IEC 8652:1995) and is commonly known as Ada 95.Following that ISO published ISO/IEC 8652:1995/Amd 1:2007 in 2007,PERMUTATIONS
* Permutations 26/10/2015 PERMUTE CSECT USING PERMUTE,R15 set base register LA R9,TMP-A n=hbound(a) SR R10,R10 nn=0SUFFIX TREE
A suffix tree is a data structure commonly used in string algorithms.. Given a string S of length n, its suffix tree is a tree T such that: T has exactly n leaves numbered from 1 to n. Except for the root, every internal node has at least two children. DISTRIBUTION OF 0 DIGITS IN FACTORIAL SERIES Distribution of 0 Digits in Factorial Series is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page. CATEGORY:WREN-POLYGON Wren-polygon is a module which enables arbitrary polygons to be drawn and/or filled within a DOME script using the Wren programming language. It consists of a single class, Polygon. It is the twenty-second in a series of modules (listed on the language's main page) designed to assist with writing Rosetta Code tasks so the same code does not have to be written or copy/pasted time and time againHOUGH TRANSFORM
The idea is that where there is a straight line in the original image, it corresponds to a bright (or dark, depending on the color of the background field) spot; by applying a suitable filter to the results of the transform, it is possible to extract the locations of the lines in the original image.ARRAY CONCATENATION
Array concatenation You are encouraged to solve this task according to the task description, using any language you may know. DETERMINE IF A STRING HAS ALL UNIQUE CHARACTERS String of length 0 --> All characters are unique String . of length 1 --> All characters are unique String abcABC of length 6 --> All characters are unique String XYZ ZYX of length 7 --> Non-unique character Z #X5A found at position 4, before 2 --> Non-unique character Y #X59 found at position 5, before 1 --> Non-unique character X #X58 found at position 6, before 0 String TALK:SQUARE FORM FACTORIZATION Since most SquFoF solutions follow the fancy C code on Wp, I will expose how it might fail to factor a composite number and why it is better to stick to the original algorithm. ROSETTA CODECHAT/IRCPLANETTHE VILLAGE PUMPFINANCESLANGUAGESTASKS Rosetta Code is a programming chrestomathy site. The idea is to present solutions to the same task in as many different languages as possible, to demonstrate how languages are similar and different, and to aid a person with a grounding in one approach to a problem inlearning another.
CATEGORY:FORTH
Category:Forth. This programming language may be used to instruct a computer to perform a task. Listed below are all of the tasks on Rosetta Code which have been solved using Forth. If you know Forth, please write code for some of the tasks not implemented in Forth. Forth, a procedural, stack -oriented and reflective programminglanguage
BITMAP/FLOOD FILL
Implement a flood fill.. A flood fill is a way of filling an area using color banks to define the contained area or a target color which "determines" the area (the valley that can be flooded; Wikipedia uses the term target color).It works almost like a water flooding from a point towards the banks (or: inside the valley): if there's a hole in the banks, the flood is not contained and all the HTTPS - ROSETTA CODE First grabbing the entire body as a string, and then by pulling from a stream. This is the same code as in HTTP Request; drakma:http-request supports SSL. (defun wget-drakma-string (url & optional (out *standard-output*))"Grab the body as a string, and write it to out."CATEGORY:HOLYC
Category:HolyC. This programming language may be used to instruct a computer to perform a task. Listed below are all of the tasks on Rosetta Code which have been solved using HolyC. If you know HolyC, please write code for some of the tasks not implemented in HolyC. HolyC is a variation of C developed by Terry A. Davis.IMAGE CONVOLUTION
function ImOut = convImage ( Im, Ker, varargin) % ImOut = convImage (Im, Ker) % Filters an image using sliding-window kernel convolution. % Convolution is done layer-by-layer. Use rgb2gray if single-layer needed. % Zero-padding convolution will be used if no border handlingis specified.
KNUTH'S ALGORITHM S
Knuth's algorithm S. You are encouraged to solve this task according to the task description, using any language you may know. This is a method of randomly sampling n items from a set of M items, with equal probability; where M >= n and M, the number of items is unknown until the end. This means that the equal probability sampling should be WRITE TO WINDOWS EVENT LOG Write to Windows event log You are encouraged to solve this task according to the task description, using any language you may know.TOWERS OF HANOI
* Towers of Hanoi 08/09/2015 HANOITOW CSECT USING HANOITOW,R12 r12 : base register LR R12,R15 establish base register KNAPSACK PROBLEM/CONTINUOUS version 1. Originally used the Fortran program as a prototype. Some amount of code was added to format the output better. /*REXX pgm solves the continuous burglar's knapsack problem; items with weight and value*/. @. = /*═══════ name weight value ══════*/. @. 1 = 'flitch 4 30 '. ROSETTA CODECHAT/IRCPLANETTHE VILLAGE PUMPFINANCESLANGUAGESTASKS Rosetta Code is a programming chrestomathy site. The idea is to present solutions to the same task in as many different languages as possible, to demonstrate how languages are similar and different, and to aid a person with a grounding in one approach to a problem inlearning another.
CATEGORY:FORTH
Category:Forth. This programming language may be used to instruct a computer to perform a task. Listed below are all of the tasks on Rosetta Code which have been solved using Forth. If you know Forth, please write code for some of the tasks not implemented in Forth. Forth, a procedural, stack -oriented and reflective programminglanguage
BITMAP/FLOOD FILL
Implement a flood fill.. A flood fill is a way of filling an area using color banks to define the contained area or a target color which "determines" the area (the valley that can be flooded; Wikipedia uses the term target color).It works almost like a water flooding from a point towards the banks (or: inside the valley): if there's a hole in the banks, the flood is not contained and all the HTTPS - ROSETTA CODE First grabbing the entire body as a string, and then by pulling from a stream. This is the same code as in HTTP Request; drakma:http-request supports SSL. (defun wget-drakma-string (url & optional (out *standard-output*))"Grab the body as a string, and write it to out."CATEGORY:HOLYC
Category:HolyC. This programming language may be used to instruct a computer to perform a task. Listed below are all of the tasks on Rosetta Code which have been solved using HolyC. If you know HolyC, please write code for some of the tasks not implemented in HolyC. HolyC is a variation of C developed by Terry A. Davis.IMAGE CONVOLUTION
function ImOut = convImage ( Im, Ker, varargin) % ImOut = convImage (Im, Ker) % Filters an image using sliding-window kernel convolution. % Convolution is done layer-by-layer. Use rgb2gray if single-layer needed. % Zero-padding convolution will be used if no border handlingis specified.
KNUTH'S ALGORITHM S
Knuth's algorithm S. You are encouraged to solve this task according to the task description, using any language you may know. This is a method of randomly sampling n items from a set of M items, with equal probability; where M >= n and M, the number of items is unknown until the end. This means that the equal probability sampling should be WRITE TO WINDOWS EVENT LOG Write to Windows event log You are encouraged to solve this task according to the task description, using any language you may know.TOWERS OF HANOI
* Towers of Hanoi 08/09/2015 HANOITOW CSECT USING HANOITOW,R12 r12 : base register LR R12,R15 establish base register KNAPSACK PROBLEM/CONTINUOUS version 1. Originally used the Fortran program as a prototype. Some amount of code was added to format the output better. /*REXX pgm solves the continuous burglar's knapsack problem; items with weight and value*/. @. = /*═══════ name weight value ══════*/. @. 1 = 'flitch 4 30 '.CATEGORY:TUTORIALD
D is a data language specification (see ) and Tutorial D is a specific D that has been defined and implemented.To avoid confusion with another language called D, we have kept the Tutorial D name.CATEGORY:ADA
Ada is a structured, statically typed imperative computer programming language. Ada was initially standardized by ANSI in 1983 and by ISO in 1987. This version of the language is commonly known as Ada 83.The next version was standardized by ISO in 1995 (ISO/IEC 8652:1995) and is commonly known as Ada 95.Following that ISO published ISO/IEC 8652:1995/Amd 1:2007 in 2007, DISTRIBUTION OF 0 DIGITS IN FACTORIAL SERIES Distribution of 0 Digits in Factorial Series is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page. CATEGORY:Z80 ASSEMBLY Category:Z80 Assembly. This programming language may be used to instruct a computer to perform a task. Listed below are all of the tasks on Rosetta Code which have been solved using Z80 Assembly. If you know Z80 Assembly, please write code for some of the tasks not implemented in Z80 Assembly. Z80 Assembly is an assembly language forthe Zilog
CATEGORY:WREN-POLYGON Wren-polygon is a module which enables arbitrary polygons to be drawn and/or filled within a DOME script using the Wren programming language. It consists of a single class, Polygon. It is the twenty-second in a series of modules (listed on the language's main page) designed to assist with writing Rosetta Code tasks so the same code does not have to be written or copy/pasted time and time again TERMINAL CONTROL/CURSOR POSITIONING 1: @ loop length calculation. ldrb r1, @ read octet start position + index. cmp r1, # 0 @ if 0 its over. addne r2,r2, # 1 @ else add 1 in the length. bne 1b @ and loop. @ so here r2 contains the length of the message. mov r1,r0 @ address message in r1. mov r0, #STDOUT @ code to write to the standard output Linux. FINITE STATE MACHINE A Finite state machine (FSM) is computational abstraction which maps a finite number of states to other states within the same set, via transitions. An FSM can only be in one state at any given moment. Transitions can either be explicit or implicit; explicit transitions are triggered by an input signal and implicit transitions by the internal state of the system (that is, the current state).MCNUGGETS PROBLEM
BEGIN. # Solve the McNuggets problem: find the largest nDetails
Copyright © 2024 ArchiveBay.com. All rights reserved. Terms of Use | Privacy Policy | DMCA | 2021 | Feedback | Advertising | RSS 2.0