content
stringlengths 228
999k
| pred_label
stringclasses 1
value | pred_score
float64 0.5
1
|
|---|---|---|
blob: 2ee423279e358f59d8799ef2d47309a0e074dd4d [file] [log] [blame]
/*
* LCD panel support for the TI OMAP1510 Innovator board
*
* Copyright (C) 2004 Nokia Corporation
* Author: Imre Deak <[email protected]>
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include <linux/module.h>
#include <linux/platform_device.h>
#include <linux/io.h>
#include <mach/hardware.h>
#include "omapfb.h"
static int innovator1510_panel_init(struct lcd_panel *panel,
struct omapfb_device *fbdev)
{
return 0;
}
static void innovator1510_panel_cleanup(struct lcd_panel *panel)
{
}
static int innovator1510_panel_enable(struct lcd_panel *panel)
{
__raw_writeb(0x7, OMAP1510_FPGA_LCD_PANEL_CONTROL);
return 0;
}
static void innovator1510_panel_disable(struct lcd_panel *panel)
{
__raw_writeb(0x0, OMAP1510_FPGA_LCD_PANEL_CONTROL);
}
static unsigned long innovator1510_panel_get_caps(struct lcd_panel *panel)
{
return 0;
}
struct lcd_panel innovator1510_panel = {
.name = "inn1510",
.config = OMAP_LCDC_PANEL_TFT,
.bpp = 16,
.data_lines = 16,
.x_res = 240,
.y_res = 320,
.pixel_clock = 12500,
.hsw = 40,
.hfp = 40,
.hbp = 72,
.vsw = 1,
.vfp = 1,
.vbp = 0,
.pcd = 12,
.init = innovator1510_panel_init,
.cleanup = innovator1510_panel_cleanup,
.enable = innovator1510_panel_enable,
.disable = innovator1510_panel_disable,
.get_caps = innovator1510_panel_get_caps,
};
static int innovator1510_panel_probe(struct platform_device *pdev)
{
omapfb_register_panel(&innovator1510_panel);
return 0;
}
static int innovator1510_panel_remove(struct platform_device *pdev)
{
return 0;
}
static int innovator1510_panel_suspend(struct platform_device *pdev,
pm_message_t mesg)
{
return 0;
}
static int innovator1510_panel_resume(struct platform_device *pdev)
{
return 0;
}
static struct platform_driver innovator1510_panel_driver = {
.probe = innovator1510_panel_probe,
.remove = innovator1510_panel_remove,
.suspend = innovator1510_panel_suspend,
.resume = innovator1510_panel_resume,
.driver = {
.name = "lcd_inn1510",
.owner = THIS_MODULE,
},
};
module_platform_driver(innovator1510_panel_driver);
|
__label__pos
| 0.99841 |
Quick Answer: Is A Mesh Router Worth It?
Is mesh better than router?
Mesh WiFi systems are basically the same as regular routers and extenders, but they’re a lot smarter and work a lot better.
And they look better than traditional routers and extenders, which may encourage you to keep them out in the open instead of a closet, where WiFi signals can get muffled..
What are the disadvantages of a mesh network?
Disadvantages Of A Mesh TopologyComplexity. Each node needs to both send messages as well as act as a router, which causes the complexity of each node to go up pretty significantly. … Network Planning. … Latency. … Power Consumption.
Does a mesh system replace a router?
So, while a mesh system will replace the router part, you’ll still need to rely on the built-in modem. That’s why your first step of setting up a mesh system is to plug one of the modules into your existing router/modem using an Ethernet cable. … Now, you might see mesh devices with multiple Ethernet ports on them.
Is mesh WiFi dangerous?
If the SAR is exceeded (just as if you were to remove the mesh screens from a microwave oven), it’s possible to cause cataracts, irregular heart beats, unproven but potential interruption of gene expression, and overheating of organs with minimal blood flow.
Does mesh WiFi reduce speed?
The main downside of a mesh network is that you lose some speed with every so-called hop. … Netgear’s Orbi works differently than traditional mesh systems. It has a dedicated Wi-Fi band, or connection, in which only the router and satellites can talk to each other; no other devices can interfere with their connection.
Can you have too many WiFi access points?
Covering a large area with WiFi often will require multiple access points. … Overlapping WiFi access points can create issues on your network. These issues are just as bad as not having enough wireless access points on your network.
Can I use mesh WiFi with existing router?
The AmpliFi HD Mesh Point, by Ubiquiti Labs, lets you create a mesh system with an existing Wi-Fi router. … Setting up the device is done through the AmpliFi app (for smartphones) – you have the option of setting up the Mesh Point to an existing mesh (if you have one already) or connecting to a new Wi-Fi network.
What are the benefits of a mesh router?
Advantages of a Mesh Network:Better Coverage. A mesh network is a group of internet hubs working together. … Minimizing Dead Zones. Traditional routers tend to lose Wi-Fi signal the further away you are. … Smartphone Management. … Accommodating. … Customized Size. … Easy Configuration. … Less Connection Failure. … Slower Speed.More items…•
Is mesh better than access point?
Mesh networks are typically not as fast as a hardwired network. Choosing between a wireless access point and a mesh network may come down to cost of the devices themselves and their installation, and speed or performance you’re hoping to achieve.
Is mesh WiFi better than extender?
Mesh Network Systems Are More Seamless, Efficient, and Quick to Update. Unlike an extender, which you can add to an existing Wi-Fi network, mesh systems are typically complete replacements for your home Wi-Fi.
Will a mesh network improve speed?
With mesh WiFi satellites positioned throughout your home, you get a much more consistent, even speed wherever you go in a building. In fact, you could get a satellite for every single room in the house to make sure your devices run as quickly as they possibly can on your Internet service.
Is it bad to have a WiFi router in your bedroom?
It is safe to sleep next to a wireless router as it produces radio waves that, unlike X-rays or gamma rays, do not break chemical bonds or cause ionisation in humans.
Which mesh WiFi is best?
Best mesh Wi-Fi routers at a glanceAsus ZenWiFi AX (XT8)Netgear Orbi.Netgear Orbi WiFi 6.Netgear Nighthawk MK63.Netgear Orbi AC1200.TP-Link Deco M5.Ubiquiti Amplifi HD.Linksys Velop.More items…•
Does mesh WiFi need line of sight?
In a wireless mesh network, only one node needs to be physically wired to a network connection like a DSL Internet modem. … They are useful for Non-Line-of-Sight (NLoS) network configurations where wireless signals are intermittently blocked.
|
__label__pos
| 0.998284 |
Is there xResolver for PS4?
Xbox users can, unfortunately, fall victim to a malicious website called xResolver. As a result, PlayStation fans are wondering if they can also be affected while using the PS4 and PS5 online. So, is there xResolver for PS4? Is there an xResolver equivalent on PlayStation 5? Here’s the need-to-know to help with online safety while using PSN.
xResolver PlayStation | Is it on PS4 and PS5?
Is there xResolver for PS5?
xResolver allows Xbox Live users to search the Gamertag (username) of other online players and learn their IP address. That information is often then put to illegal use, mainly in the form of DDoS attacks. It’s an extreme reaction to losing that shouldn’t be leveraged, but, unfortunately, it often is by unsporting players from competitive communities. There are ways for Xbox players to protect themselves, but do PlayStation gamers need to worry about xResolver and/or similar websites?
There is no PlayStation equivalent to xResolver. Thankfully, PS4 and PS5 players aren’t at risk from xResolver or similar software. PSN users should still follow standard internet safety procedures to ensure their maintained online security, however.
PlayStation players can’t be targetted by xResolver, though there are still risks associated with Sony’s platforms. In general, there’s little to worry about, though always be mindful of things like PSN messaging scams. Additionally, try to avoid trash-talking online as this can provoke retaliation in some cases.
All in all, being sensible online is the best way to be safe; remember that and there should be no issues. That said, playing and talking with friends in online game sessions can also help users to stay out of trouble. Why not join the Game Revolution Discord and add a few new pals to the ol’ friends list?
Check out Game Revolution’s PS5 review for more PlayStation coverage. Additionally, we have the definitive verdict on anticipated launch titles like Spider-Man: Miles MoralesBugsnax, and Astro’s Playroom.
|
__label__pos
| 0.995483 |
+0
0
155
4
avatar+100
Cindy, Dorothy and Ellen each made an equal number of paper hearts for a fund raising project. Cindy and Dorothy each sold some paper hearts Ellen sold 70 paper hearts. The 3 girls had a total of 85 paper hearts left. Cindy had \( {1 \over 4}{}{}\) as many paper hearts as Dorothy left while Ellen had 5 fewer paper hearts than Cindy left. How many paper hearts did Dorothy sell?
Aug 24, 2021
edited by KourageKowardlyDog Aug 24, 2021
#1
avatar+115843
-1
Cindy, Dorothy, and Ellen each made an equal number of paper hearts for a fund raising project. Cindy and Dorothy each sold some paper hearts Ellen sold 70 paper hearts. The 3 girls had a total of 85 paper hearts left. Cindy had 1/4 as many paper hearts as Dorothy left while Ellen had 5 fewer paper hearts than Cindy left. How many paper hearts did Dorothy sell?
Let each of them start with H hearts
Cindy sells C hearts so she is left with H - c hearts
Dorothy sells D hears so she is left with H - d hearts
Ellen sells 70 so she is left with H - 70 hearts
Now make up equations for the other things you are told.
It will be easiest if you start with "Ellen had 5 fewer paper hearts than Cindy left."
From that statement alone you can work out how many Cindy sells.
But you need the other facts too because you need to find what Dorothy sells.
Aug 29, 2021
#3
avatar+318
0
Sorry if this was a late response.
Set they had equal number which is x, and
Dorothy left y paper hearts.
So, \( {1 \over 4}{}{}\)y + y + \( {1 \over 4}{}{}\)y - 5 = 85
y = 60
and Ellen (left) = \({1 \over 4}{}{}\)y - 5 = \( {1 \over 4}{}{}\) * 60 -5 =10
So the number of them had are x = 10 + 70 = 80
So Dorothy (sell) = 80 - 60 =20.
20 paper hearts.
Sep 5, 2021
#4
avatar+100
0
Thanks!
KourageKowardlyDog Sep 5, 2021
41 Online Users
avatar
avatar
avatar
|
__label__pos
| 0.992884 |
Source code for plotnine.scales.scale_manual
from warnings import warn
import numpy as np
from ..doctools import document
from ..exceptions import PlotnineWarning
from ..utils import alias
from .scale import scale_discrete
@document
class _scale_manual(scale_discrete):
"""
Abstract class for manual scales
Parameters
----------
{superclass_parameters}
"""
def __init__(self, values, **kwargs):
# Match the values of the scale with the breaks (if given)
if 'breaks' in kwargs:
breaks = kwargs['breaks']
if np.iterable(breaks) and not isinstance(breaks, str):
if iter(breaks) is breaks:
breaks = list(breaks)
kwargs['breaks'] = breaks
values = {b: v for b, v in zip(breaks, values)}
self._values = values
scale_discrete.__init__(self, **kwargs)
def palette(self, n):
max_n = len(self._values)
if n > max_n:
msg = (
f"The palette of {self.__class__.__name__} can return a "
f"maximum of {max_n} values. {n} were requested from it."
)
warn(msg, PlotnineWarning)
return self._values
[docs]@document class scale_color_manual(_scale_manual): """ Custom discrete color scale Parameters ---------- values : array_like | dict Colors that make up the palette. The values will be matched with the ``limits`` of the scale or the ``breaks`` if provided. If it is a dict then it should map data values to colors. {superclass_parameters} """ _aesthetics = ['color']
[docs]@document class scale_fill_manual(_scale_manual): """ Custom discrete fill scale Parameters ---------- values : array_like | dict Colors that make up the palette. The values will be matched with the ``limits`` of the scale or the ``breaks`` if provided. If it is a dict then it should map data values to colors. {superclass_parameters} """ _aesthetics = ['fill']
[docs]@document class scale_shape_manual(_scale_manual): """ Custom discrete shape scale Parameters ---------- values : array_like | dict Shapes that make up the palette. See :mod:`matplotlib.markers.` for list of all possible shapes. The values will be matched with the ``limits`` of the scale or the ``breaks`` if provided. If it is a dict then it should map data values to shapes. {superclass_parameters} See Also -------- :mod:`matplotlib.markers` """ _aesthetics = ['shape']
[docs]@document class scale_linetype_manual(_scale_manual): """ Custom discrete linetype scale Parameters ---------- values : list-like | dict Linetypes that make up the palette. Possible values of the list are: 1. Strings like :: 'solid' # solid line 'dashed' # dashed line 'dashdot' # dash-dotted line 'dotted' # dotted line 'None' or ' ' or '' # draw nothing 2. Tuples of the form (offset, (on, off, on, off, ....)) e.g. (0, (1, 1)), (1, (2, 2)), (2, (5, 3, 1, 3)) The values will be matched with the ``limits`` of the scale or the ``breaks`` if provided. If it is a dict then it should map data values to linetypes. {superclass_parameters} See Also -------- :mod:`matplotlib.markers` """ _aesthetics = ['linetype'] def map(self, x, limits=None): result = super().map(x, limits) # Ensure that custom linetypes are tuples, so that they can # be properly inserted and extracted from the dataframe if len(result) and hasattr(result[0], '__hash__'): result = [x if isinstance(x, str) else tuple(x) for x in result] return result
[docs]@document class scale_alpha_manual(_scale_manual): """ Custom discrete alpha scale Parameters ---------- values : array_like | dict Alpha values (in the [0, 1] range) that make up the palette. The values will be matched with the ``limits`` of the scale or the ``breaks`` if provided. If it is a dict then it should map data values to alpha values. {superclass_parameters} """ _aesthetics = ['alpha']
[docs]@document class scale_size_manual(_scale_manual): """ Custom discrete size scale Parameters ---------- values : array_like | dict Sizes that make up the palette. The values will be matched with the ``limits`` of the scale or the ``breaks`` if provided. If it is a dict then it should map data values to sizes. {superclass_parameters} """ _aesthetics = ['size']
# American to British spelling alias('scale_colour_manual', scale_color_manual)
|
__label__pos
| 0.997075 |
JAVA EXAMPLE PROGRAMS
JAVA EXAMPLE PROGRAMS
Checkout for Promo Codes
Configure default initialization and destroy methods in all spring beans
In case, if you have many spring beans with initialization and destory method, then you need to define init-method and destroy-method on each individual spring bean. Spring provides an alternative and flexible way to configure this. You can define only once with same method signature and you can use across all spring beans. You need to configure default-init-method and default-destroy-method attributes on the <beans> element. This example shows how to configure it.
package com.java2novice.beans;
import java.io.IOException;
import java.net.HttpURLConnection;
import java.net.MalformedURLException;
import java.net.URL;
public class NetworkManager{
private HttpURLConnection connection;
private String urlStr;
public void setUrlStr(String urlStr){
this.urlStr = urlStr;
}
public void init(){
System.out.println("Inside init() method...");
URL obj;
try {
obj = new URL(this.urlStr);
//initialize http connection here
this.connection = (HttpURLConnection) obj.openConnection();
} catch (MalformedURLException e) {
// TODO Auto-generated catch block
e.printStackTrace();
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
public void destroy(){
try{
System.out.println("Inside destroy() method...");
if(this.connection != null) {
connection.disconnect();
}
} catch(Exception ex){
}
}
public void readData(){
try {
int responseCode = this.connection.getResponseCode();
System.out.println("Response code: "+responseCode);
/**
* do your business logic here
*/
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
}
Xml based configuration file:
<beans xmlns="http://www.springframework.org/schema/beans"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://www.springframework.org/schema/beans
http://www.springframework.org/schema/beans/spring-beans-3.0.xsd"
default-init-method="init"
default-destroy-method="destroy">
<bean id="netManager" class="com.java2novice.beans.NetworkManager">
<property name="urlStr" value="http://www.google.com/search?q=java2novice"/>
</bean>
</beans>
Spring bean demo class:
package com.java2novice.test;
import org.springframework.context.ConfigurableApplicationContext;
import org.springframework.context.support.ClassPathXmlApplicationContext;
import com.java2novice.beans.NetworkManager;
public class SpringDemo {
public static void main(String a[]){
String confFile = "applicationContext.xml";
ConfigurableApplicationContext context
= new ClassPathXmlApplicationContext(confFile);
NetworkManager networkMng = (NetworkManager) context.getBean("netManager");
networkMng.readData();
context.close();
}
}
Output:
Inside init() method...
Response code: 403
Inside destroy() method...
<< Previous Program | Next Program >>
Spring framework examples
1. Spring 3 hello world example
2. Spring bean java based configuration using @Configuration and @Bean
3. How to get spring application context object reference?
4. How to load multiple spring bean configuration files?
5. Spring java based configuration @Import example
6. Spring Dependency Injection and Types
7. Spring Dependency Injection via setter method
8. Spring Dependency Injection via Constructor
9. Constructor overloading issue with spring constructor injection
10. Constructor vs Setter dependency Injection in Spring
11. How to inject value into spring bean instance variables?
12. Spring bean tag properties
13. Differen types of spring bean scopes
14. How to inject inner bean in spring?
15. Set spring bean scope using annotation
16. How to invoke spring bean init and destroy methods?
17. Spring bean initialization callback
18. Spring bean destruction callback
19. Configure default initialization and destroy method in all spring beans
20. Spring bean init and destroy methods using annotations
21. Spring Bean Post Processors
22. How to read property file in spring using xml based configuration file?
23. How to read property file in spring 3.0 using java based configuration?
24. How to inject date into spring bean property?
25. How to inject date into spring bean with CustomDateEditor?
26. Spring bean inheritance configuration
27. Spring dependency checking with @Required annotation
28. How to define a custom Required-style annotation for dependency checking?
29. How to inject List into spring bean?
30. How to inject Set into spring bean?
31. How to inject Map into spring bean?
32. How to enable auto component scanning in spring?
33. Difference between @Component, @Service, @Repository and @Controller
34. How to filter components in auto scanning?
35. Spring expression language basic example using xml based configuration.
36. Spring expression language basic example using annotations.
37. Bean reference example using spring expression language
38. Spring expression language operators example
39. Spring expression language ternary operator example
40. How to use regular expressions with spring expression language?
41. How to use collections with spring expression language?
42. Spring bean auto-wiring modes
43. Spring auto-wiring mode byName
44. Spring auto-wiring mode byType
45. Spring auto-wiring mode constructor
46. Spring auto-wiring using @Autowired annotation example
47. Spring auto-wiring using @Qualifier annotation example
48. Spring log4j configuration
49. How to schedule jobs using @Scheduled annotation in spring?
50. Send E-mail using spring 3
51. Send E-mail with attachment using spring 3
52. Simple spring JDBC example
53. Spring JDBC example with JdbcTemplate
54. Spring JDBC example with JdbcDaoSupport
55. Spring JDBC query example using JdbcDaoSupport
56. How to query single column using spring JdbcTemplate?
57. Spring JDBC batch updates using JdbcTemplate?
58. Spring AOP Advices - Before advice example - xml based configuration
59. Spring AOP Advices - After returning advice example - xml based configuration
60. Spring AOP Advices - After throwing advice example - xml based configuration
61. Spring AOP Advices - Around advice example - xml based configuration
62. Spring AOP Advice - Pointcuts – Name match example
63. Spring AOP Advice - Pointcuts – Regular expression example
64. Spring AOP - AspectJ - @Before example
65. Spring AOP - AspectJ - @After example
66. Spring AOP - AspectJ - @AfterReturning example
67. Spring AOP - AspectJ - @AfterThrowing example
68. Spring AOP - AspectJ - @Around example
Knowledge Centre
Class, Constructor and Primitive data types
Class is a template for multiple objects with similar features and it is a blue print for objects. It defines a type of object according to the data the object can hold and the operations the object can perform. Constructor is a special kind of method that determines how an object is initialized when created. Primitive data types are 8 types and they are: byte, short, int, long, float, double, boolean, char.
Famous Quotations
Before you go and criticize the younger generation, just remember who raised them.
-- Unknown Author
About Author
I'm Nataraja Gootooru, programmer by profession and passionate about technologies. All examples given here are as simple as possible to help beginners. The source code is compiled and tested in my dev environment.
If you come across any mistakes or bugs, please email me to [email protected].
Most Visited Pages
Other Interesting Sites
Reference: Java™ Platform Standard Ed. 7 - API Specification | Java™ Platform Standard Ed. 8 - API Specification | Java is registered trademark of Oracle.
Privacy Policy | Copyright © 2020 by Nataraja Gootooru. All Rights Reserved.
|
__label__pos
| 0.853198 |
...
XmlHTTP open url & import javascript from headers
tags26
12-29-2008, 09:36 PM
I am currently opening a URL within a page using XmlHTTP. The page imports, but none of the javascript on that page header is working. I tried just hardcoding the javascript on the main page, but it requires form fields that haven't yet been imported using the tag and i get an error.
Is there a way to also import the headers of the page I am calling?
Test3.cfm has a cfform that creates unique javascript on the header of that page. When i open the URL via XMLHTTP that javascript doesn't carry over.
ajaxCompare.js
*****************************************
/* Ultimater's edited version of:
http://jibbering.com/2002/4/httprequest.html
to serve IE7 with XMLHttpRequest instead of ActiveX */
var xmlhttp=false;
if (!xmlhttp && typeof XMLHttpRequest!='undefined') {
try {
xmlhttp = new XMLHttpRequest();
} catch (e) {
xmlhttp=false;
}
}
/*@cc_on @*/
/*@if (@_jscript_version >= 5)
// JScript gives us Conditional compilation, we can cope with old IE versions.
// and security blocked creation of the objects.
if (!xmlhttp){
try {
xmlhttp = new ActiveXObject("Msxml2.XMLHTTP");
} catch (e) {
try {
xmlhttp = new ActiveXObject("Microsoft.XMLHTTP");
} catch (E) {
xmlhttp = false;
}
}
}
@end @*/
if (!xmlhttp && window.createRequest) {
try {
xmlhttp = window.createRequest();
} catch (e) {
xmlhttp=false;
}
}
/* Ultimater's edited version of:
http://javascript.internet.com/ajax/ajax-navigation.html */
var please_wait = "Please wait...";
function close_url(targetId) {
var e=document.getElementById(targetId);if(!e)return false;
e.innerHTML='';
}
function open_url(url, targetId) {
if(!xmlhttp)return false;
var e=document.getElementById(targetId);if(!e)return false;
if(please_wait)e.innerHTML = please_wait;
xmlhttp.open("GET", url, true);
xmlhttp.onreadystatechange = function() { response(url, e); }
try{
xmlhttp.send(null);
}catch(l){
while(e.firstChild)e.removeChild(e.firstChild);//e.innerHTML="" the standard way
e.appendChild(document.createTextNode("request failed"));
}
}
function response(url, e) {
if(xmlhttp.readyState != 4)return;
var tmp= (xmlhttp.status == 200 || xmlhttp.status == 0) ? xmlhttp.responseText : "Ooops!! A broken link! Please contact the webmaster of this website ASAP and give him the following error code: " + xmlhttp.status+" "+xmlhttp.statusText;
var d=document.createElement("div");
d.innerHTML=tmp;
setTimeout(function(){
while(e.firstChild)e.removeChild(e.firstChild);//e.innerHTML="" the standard way
e.appendChild(d);
},10)
}
*********************************************************************
test.cfm
*********************************************************************
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>Untitled Document</title>
<script type="text/javascript" src="ajaxCompare.js"></script>
</head>
<body>
<table>
<tr>
<td valign=top width=150>
<H5>My Navagation links</H5>
<a href="javascript:void(0)" onclick="open_url('test2.cfm','my_site_content');">Open URL</a><br>
</td>
<td valign=top>
<div id="my_site_content">
</div>
</td>
</tr>
</table>
</body>
</html>
******************************************************************************
test3.cfm
*****************************************************************************
<cfform name="myform77">
<cfinput id="pickers4" name="pickmany" type="hidden" value="Apples">
<cfinput id="pickers5" name="pickmany" type="hidden" value="Oranges">
<cfinput id="pickers6" name="pickmany" type="hidden" value="Mangoes">
<cfinput type="hidden" name="pickmany-selected" bind="{pickmany@click}"><br />
</cfform>
A1ien51
12-31-2008, 09:12 PM
JavaScript does not evaluate code inserted into the page. You need to rip out the JavaScript and eval it. If you used libraries like Prototype.jjs or JQuery, they have it built into its Ajax code.
Plus I am not sure why you are recreating frames/normal postbacks if you are replacing the whole page.
Eric
EZ Archive Ads Plugin for vBulletin Copyright 2006 Computer Help Forum
|
__label__pos
| 0.887607 |
FANDOM
A DNA computers was computer that used DNA for computing. It was not well suited for general purpose use.
Background
Deoxyribonucleic acid or DNA is a molecule which holds the genetic information of a living organism. Frederich Mischer discovered it in 1869. However, it was not until 1953 that the double helix was discovered. The men who discovered the double helix were James Watson and Francis Crick. When DNA was discovered, few ever thought it could be used for anything. In 1984, however, Sir Alec Jeffries used DNA to prove paternity. In 1988, DNA evidence was used to convict Colin Pitchfork of the murders of Lynda Mann and Dawn Ashworth. In 1993, the Human Genome Project was started. It was intended to decode the entire human genome using computers. The project succeeded by 2001. It was thought that genetic engineering would soon take off. This was helped by a DNA computer.
Description
Tech Level: 10-11
In 1994, just as the Human Genome Project was starting, scientist Leonard Adelman of the University of Southern California demonstrated a successful DNA computer. Much of the success that followed came from the Weizmann Institute of Science in Rehovot, Israel. The scientists there developed a successful DNA computer in 2002. They incorporated a module that could cure cancer in 2004. After that, the DNA computer was commercialized. DNA computers never found there way into consumer products. However, DNA computers were used to better diagnose conditions. This made for better medicine. This also helped in improving the process of genetic engineering, thus allowing genetic disorders to be cured without compromising the good parts of the genes that caused them. It was a revolution in biotechnology.
Ad blocker interference detected!
Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers
Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.
|
__label__pos
| 0.778115 |
Module: Serializers::RDF
Included in:
Document
Defined in:
lib/serializers/rdf.rb
Overview
Convert a document to an RDF record
Class Method Summary (collapse)
Instance Method Summary (collapse)
Class Method Details
+ (Object) included(base)
Register this serializer in the Document list
11
12
13
14
15
16
17
18
19
20
21
22
# File 'lib/serializers/rdf.rb', line 11
def self.included(base)
base.register_serializer(
:rdf, 'RDF/XML',
->(doc) { doc.to_rdf_xml.to_xml(indent: 2) },
'http://www.w3.org/TR/rdf-syntax-grammar/'
)
base.register_serializer(
:n3, 'RDF/N3',
->(doc) { doc.to_rdf_n3 },
'http://www.w3.org/DesignIssues/Notation3.html'
)
end
Instance Method Details
- (RDF::Graph) to_rdf
Returns this document as a RDF::Graph object
For the moment, we provide only metadata items for the basic Dublin Core elements, and for the Dublin Core “bibliographicCitation” element. We also encode an OpenURL reference (using the standard OpenURL namespace), in a second bibliographicCitation element. The precise way to encode journal articles in DC is in serious flux, but this should provide a reasonable solution.
Examples:
Convert this document to RDF-Turtle
RDF::Writer.for(:turtle).buffer do |writer|
writer << doc.to_rdf
end
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
# File 'lib/serializers/rdf.rb', line 41
def to_rdf
graph = ::RDF::Graph.new
doc = ::RDF::Node.new
unless formatted_author_list.nil?
formatted_author_list.each do |a|
name = ''
name << "#{a.von} " unless a.von.blank?
name << "#{a.last}"
name << " #{a.suffix}" unless a.suffix.blank?
name << ", #{a.first}"
graph << [doc, ::RDF::DC.creator, name]
end
end
graph << [doc, ::RDF::DC.issued, year] unless year.blank?
citation = "#{journal}" unless journal.blank?
citation << " #{volume}" unless volume.blank?
citation << ' ' if volume.blank?
citation << "(#{number})" unless number.blank?
citation << ", #{pages}" unless pages.blank?
citation << ". (#{year})" unless year.blank?
graph << [doc, ::RDF::DC.bibliographicCitation, citation]
ourl = ::RDF::Literal.new(
'&' + to_openurl_params,
datatype: ::RDF::URI.new('info:ofi/fmt:kev:mtx:ctx')
)
graph << [doc, ::RDF::DC.bibliographicCitation, ourl]
graph << [doc, ::RDF::DC.relation, journal] unless journal.blank?
graph << [doc, ::RDF::DC.title, title] unless title.blank?
graph << [doc, ::RDF::DC.type, 'Journal Article']
graph << [doc, ::RDF::DC.identifier, "info:doi/#{doi}"] unless doi.blank?
graph
end
- (String) to_rdf_n3
Note:
No tests for this method, as it is implemented by the RDF gem.
Returns this document as RDF+N3
:nocov:
Examples:
Download this document as a n3 file
controller.send_data doc.to_rdf_turtle, filename: 'export.n3',
disposition: 'attachment'
88
89
90
91
92
# File 'lib/serializers/rdf.rb', line 88
def to_rdf_n3
::RDF::Writer.for(:n3).buffer do |writer|
writer << to_rdf
end
end
- (Nokogiri::XML::Document) to_rdf_xml
Returns this document as RDF+XML
Examples:
Download this document as an XML file
controller.send_data doc.to_rdf_xml.to_xml, filename: 'export.xml',
disposition: 'attachment'
137
138
139
140
141
142
143
144
145
146
147
# File 'lib/serializers/rdf.rb', line 137
def to_rdf_xml
doc = Nokogiri::XML::Document.new
rdf = Nokogiri::XML::Node.new('rdf', doc)
doc.add_child(rdf)
rdf.default_namespace = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#'
rdf.add_namespace_definition('dc', 'http://purl.org/dc/terms/')
rdf.add_child(to_rdf_xml_node(doc))
doc
end
- (Nokogiri::XML::Node) to_rdf_xml_node(doc)
This method is part of a private API. You should avoid using this method if possible, as it may be removed or be changed in the future.
Returns this document as an rdf:Description element
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
# File 'lib/serializers/rdf.rb', line 100
def to_rdf_xml_node(doc)
graph = to_rdf
desc = Nokogiri::XML::Node.new('Description', doc)
to_rdf.each_statement do |statement|
qname = statement.predicate.qname
unless qname
Rails.logger.warn "Cannot get qualified name for #{statement.predicate.to_s}, skipping predicate"
next
end
unless statement.object.literal?
Rails.logger.warn "Object #{statement.object.inspect} is not a literal, cannot parse"
next
end
node = Nokogiri::XML::Node.new("#{qname[0]}:#{qname[1]}", doc)
node.content = statement.object.value
if statement.object.has_datatype?
node['datatype'] = statement.object.datatype.to_s
end
desc.add_child(node)
end
desc
end
|
__label__pos
| 0.622608 |
ConvertOctopus
Unit Converter
Conversion formula
The conversion factor from ounces to pounds is 0.0625, which means that 1 ounce is equal to 0.0625 pounds:
1 oz = 0.0625 lb
To convert 182 ounces into pounds we have to multiply 182 by the conversion factor in order to get the mass amount from ounces to pounds. We can also form a simple proportion to calculate the result:
1 oz → 0.0625 lb
182 oz → M(lb)
Solve the above proportion to obtain the mass M in pounds:
M(lb) = 182 oz × 0.0625 lb
M(lb) = 11.375 lb
The final result is:
182 oz → 11.375 lb
We conclude that 182 ounces is equivalent to 11.375 pounds:
182 ounces = 11.375 pounds
Alternative conversion
We can also convert by utilizing the inverse value of the conversion factor. In this case 1 pound is equal to 0.087912087912088 × 182 ounces.
Another way is saying that 182 ounces is equal to 1 ÷ 0.087912087912088 pounds.
Approximate result
For practical purposes we can round our final result to an approximate numerical value. We can say that one hundred eighty-two ounces is approximately eleven point three seven five pounds:
182 oz ≅ 11.375 lb
An alternative is also that one pound is approximately zero point zero eight eight times one hundred eighty-two ounces.
Conversion table
ounces to pounds chart
For quick reference purposes, below is the conversion table you can use to convert from ounces to pounds
ounces (oz) pounds (lb)
183 ounces 11.438 pounds
184 ounces 11.5 pounds
185 ounces 11.563 pounds
186 ounces 11.625 pounds
187 ounces 11.688 pounds
188 ounces 11.75 pounds
189 ounces 11.813 pounds
190 ounces 11.875 pounds
191 ounces 11.938 pounds
192 ounces 12 pounds
|
__label__pos
| 0.879815 |
Source
tw2.d3 / tw2 / protovis / conventional / samples.py
The default branch has multiple heads
""" Samples of how to use tw2.jit
Each class exposed in the widgets submodule has an accompanying Demo<class>
widget here with some parameters filled out.
The demos implemented here are what is displayed in the tw2.devtools
WidgetBrowser.
"""
from widgets import AreaChart, BarChart, StreamGraph
from widgets import js
from tw2.core import JSSymbol
import math
import random
class DemoAreaChart(AreaChart):
p_data = [{'x': i, 'y' : math.sin(i) + random.random() * .5 + 2}
for i in map(lambda x : x / 10.0, range(100))]
class DemoBarChart(BarChart):
p_data = [random.random() for i in range(10)]
# The following are some data generation functions used by the streamgraph demo
def waves(n, m):
def f(i, j):
x = 20 * j / m - i / 3
if x > 0:
return 2 * x * math.exp(x * -0.5)
return 0
return map(lambda i : map(lambda j : f(i, j), range(m)), range(n))
def layers(n, m):
def bump(a):
x = 1.0 / (.1 + random.random())
y = 2.0 * random.random() - 0.5
z = 10.0 / (0.1 + random.random())
for i in range(m):
w = (float(i) / m - y) * z
a[i] += x * math.exp(-w * w)
return a
def f(*args):
a = [0] * m
for i in range(5):
a = bump(a)
return a
return map(f, range(n))
class DemoStreamGraph(StreamGraph):
def prepare(self):
self.p_data = layers(20, 400)
super(DemoStreamGraph, self).prepare()
|
__label__pos
| 0.994554 |
The tag has no wiki summary.
learn more… | top users | synonyms
1
vote
1answer
65 views
How do I author a playable DVD from an MKV file containing MPEG2 video, audio, subtitle and chapter streams?
I'm using MakeMKV to back up my DVD library to MKV files without re-encoding the video or audio streams (since space is cheap, and quality is top priority.) I'd like to know if there's a tool ...
0
votes
0answers
17 views
How to convert a mkv file to mp4 file and let it use AAC for audio using mkvtools?
I'm on Mac OS X and have used MKVTools for converting videos. But particularly, how to convert a mkv file to mp4 file and let it use AAC for audio using mkvtools?
0
votes
0answers
9 views
ConvertXtoDVD5 saying Project size is too big
Basically, I have a folder containing some video files, the entire folder, according to Windows, is 1.98GB. I am using ConvertXtoDVD5 with the plans of burning these files to a disc, the target size ...
0
votes
0answers
87 views
Burn .mkv to a .dvd for playback on DVD player while retaining multiple tracks?
If I use a program like ASVtoDVD or ConvertXToDVD to convert a .mkv to a .dvd, and the .mkv has multiple audio tracks/subtitle, will the produced .dvd only have one of those, or will it retain more or ...
|
__label__pos
| 0.515322 |
1. Reklam
1. joysro
asur
serenity
redsea
blacksro
plag
alaaddin
erix
bu siteyi inceleyebilecek ingizcesi olan birisi açıklarmı
1. alpay29
alpay29 rank8
Kayıt:
10 Mayıs 2007
Mesajlar:
526
Beğenilen Mesajlar:
0
Ödül Puanları:
16
2. DeSwa
DeSwa rank8
Kayıt:
7 Kasım 2007
Mesajlar:
613
Beğenilen Mesajlar:
0
Ödül Puanları:
0
Şehir:
Kocaeli
Pirate King online için bot Sro da calisirmi bilemicem
3. alpay29
alpay29 rank8
Kayıt:
10 Mayıs 2007
Mesajlar:
526
Beğenilen Mesajlar:
0
Ödül Puanları:
16
konu silkroad da açılmış vede teşekkürler var işte açıklaması.....
NAVIGATION
Use the Tab button to rotate through input boxes
HP HEAL
Currently set to 40$, to decrease to 30 or increase to 50, use the up and down keys on your keyboard DO NOT TYPE ANY NUMBERS OTHER THAN 30,40 AND 50
Monster Attacks
As you can see ive made it possible to attack more than one type of monster, enter as many as you want to attack, but make sure any empty fields display some of the same pixels as the other monsters your attacking
Reason for this,
a) the more times it searches for the same type of monster, the faster the bot becomes between kills,
b) any empty boxes or incorrect pixel colours will slow the bot down, so use it wisely.
Feel Free to tweak
This bot has been designed for you to tweak as much of it as you can, perfecting the right settings means a fast and smooth bot, with little detection by GM's.
FINDING THE RIGHT CODES FOR ATTACKING MONSTERS:
To be able to attack certain monsters you will need to find the colour value of them in HEX. There are a number of ways in which this can be done, however i will list two methods. Any other methods will have to be found by yourself.
USING JASC PAINTSHOP PRO DROPPER TOOL:
1. During gameplay, wait until the monster you wish to attack is in the window area.
2. Press PrtSc (Print Screen button)
3. Load PaintShop Pro and paste the new image
4. Select the Dropper tool, and select an area of the monster
5. Go into your colour settings tab and note down the HEX Value.
Example #FFFFFF.
6. Remove # and replace with 0x
Example 0xFFFFFF.
7. Paste your new code into the box provided on the bot and press F1 to activate.
USING AUTOIT WINDOW INFO TOOL:
1. During gameplay, wait until the monster you wish to attack is in the window area.
2. Press PrtSc (Print Screen button)
3. Load MS Paint and paste the new image
4. Load Autoit Window Info Tool and place your mouse over the monster in an area you desire
5. note down the HEX Value given.
Example 0xFFFFFF
6. Paste your new code into the box provided on the bot and press F1 to activate.
4. DeSwa
DeSwa rank8
Kayıt:
7 Kasım 2007
Mesajlar:
613
Beğenilen Mesajlar:
0
Ödül Puanları:
0
Şehir:
Kocaeli
kontrollerde sadece dedigim oyunu tariyor silkroad i degil
kodlar :
Kod:
WinActivate("Pirate King Online",""blahblahblah)
IF @Error then
WinActivate("Tales of Pirates",""blablah)
If Not @Error then (bot)
|
__label__pos
| 0.913772 |
265b FreshPorts -- head/security/scannedonly/files/scannedonly.in
FreshPorts -- The Place For Ports If you buy from Amazon USA, please support us by using this link.
Follow us
Blog
Twitter
Please give me your LTO-4 or better tape library and I'll put it to good use.
found NOTHING in cache
SELECT count(DISTINCT CL.id) AS count
FROM element_pathname EP, commit_log_elements CLE, commit_log CL
WHERE EP.pathname = '/ports/head/security/scannedonly/files/scannedonly.in'
AND EP.element_id = CLE.element_ID
AND CL.id = CLE.commit_log_id
PageNumber='1'
Offset='0'
SELECT DISTINCT
CL.commit_date - SystemTimeAdjust() AS commit_date_raw,
CL.id AS commit_log_id,
CL.encoding_losses AS encoding_losses,
CL.message_id AS message_id,
CL.committer AS committer,
CL.description AS commit_description,
to_char(CL.commit_date - SystemTimeAdjust(), 'DD Mon YYYY') AS commit_date,
to_char(CL.commit_date - SystemTimeAdjust(), 'HH24:MI') AS commit_time,
element.name AS port,
element_pathname(element.id) AS pathname,
element.status AS status,
element_pathname.pathname as element_pathname,
CL.message_subject,
NULL AS port_id,
0 AS needs_refresh,
NULL AS forbidden,
NULL AS broken,
NULL AS deprecated,
NULL AS ignore,
commit_log_elements.element_id,
NULL AS version,
NULL AS epoch,
NULL as date_added,
NULL AS short_description,
NULL AS category_id,
NULL AS category,
NULL AS watch,
NULL AS vulnerable_current,
NULL AS vulnerable_past,
NULL AS restricted,
NULL AS no_cdrom,
NULL AS expiration_date,
NULL AS is_interactive,
NULL AS only_for_archs,
NULL AS not_for_archs,
NULL AS stf_message,
commit_log_elements.revision_name as revision,
R.name AS repo_name,
R.svn_hostname AS hostname,
R.path_to_repo AS path_to_repo
FROM commit_log_elements, commit_log CL LEFT OUTER JOIN repo R on CL.repo_id = R.id, element_pathname, element
WHERE CL.id IN (SELECT tmp.ID FROM (SELECT DISTINCT CL.id, CL.commit_date
FROM element_pathname EP, commit_log_elements CLE, commit_log CL
WHERE EP.pathname = '/ports/head/security/scannedonly/files/scannedonly.in'
AND EP.element_id = CLE.element_ID
AND CL.id = CLE.commit_log_id
ORDER BY CL.commit_date DESC
LIMIT 100) AS tmp)
AND commit_log_elements.commit_log_id = CL.id
AND commit_log_elements.element_id = element.id
AND element_pathname.element_id = element.id
ORDER BY 1 desc,
commit_log_id, element_pathname
That would give us 957 rows 2469
non port: head/security/scannedonly/files/scannedonly.in
SVNWeb
Number of commits found: 2
Sat, 14 Jan 2012
[ 08:57 dougb ] Original commit
1.5 astro/gpsd/files/gpsd.in
1.3 astro/gpxloggerd/files/gpxloggerd.in
1.5 audio/aureal-kmod/files/aureal.in
1.4 audio/autocd/files/autocd.in
1.3 audio/darkice/files/darkice.in
1.3 audio/ezstream/files/ezstream.in
1.4 audio/firefly/files/mt-daapd.in
1.5 audio/gnump3d/files/gnump3d.sh.in
1.9 audio/icecast2/files/icecast2.sh.in
1.5 audio/ices0/files/ices0.sh.in
(Only the first 10 of 951 ports in this commit are shown above. View all ports for this commit)
In the rc.d scripts, change assignments to rcvar to use the
literal name_enable wherever possible, and ${name}_enable
when it's not, to prepare for the demise of set_rcvar().
In cases where I had to hand-edit unusual instances also
modify formatting slightly to be more uniform (and in
some cases, correct). This includes adding some $FreeBSD$
tags, and most importantly moving rcvar= to right after
name= so it's clear that one is derived from the other.
Thu, 1 Dec 2011
[ 20:01 crees ] Original commit
1.1232 security/Makefile
1.1 security/scannedonly/Makefile
1.1 security/scannedonly/distinfo
1.1 security/scannedonly/files/scannedonly.in
1.1 security/scannedonly/pkg-descr
1.1 security/scannedonly/pkg-message
Scannedonly is a samba VFS module and a scanning daemon that ensure that only
files that have been scanned for viruses are visible and accessible to the end
user.
Scannedonly was developed because of scalability problems with samba-vscan: high
server loads when (the same) files were requested often, and timeouts when large
zip files were requested. Scannedonly doesn't have these problems, but it does
introduce some other issues. Choose the product that suits you best.
Scannedonly is available under the open source GPL licence. The source code
repository is available on Sourceforge.
WWW: http://olivier.sessink.nl/scannedonly/
PR: ports/154202
Submitted by: [email protected]
Feature safe: yes
Number of commits found: 2
Login
User Login
Create account
Servers and bandwidth provided by
New York Internet, SuperNews, and RootBSD
This site
What is FreshPorts?
About the authors
FAQ
How big is it?
The latest upgrade!
Privacy
Forums
Blog
Contact
Search
Enter Keywords:
more...
Latest Vulnerabilities
cross-binutilsMar 24
jenkinsMar 24
jenkins-ltsMar 24
libressl*Mar 24
linux-c6-openssl*Mar 24
mingw32-openssl*Mar 24
mingw64-binutilsMar 24
openssl*Mar 24
firefoxMar 22
firefox-esrMar 22
libxulMar 22
linux-firefoxMar 22
linux-seamonkeyMar 22
seamonkeyMar 22
sympaMar 13
5 vulnerabilities affecting 24 ports have been reported in the past 14 days
* - modified, not new
All vulnerabilities
Ports
Home
Categories
Deleted ports
Sanity Test Failures
Newsfeeds
Statistics
Graphs
NEW Graphs (Javascript)
Traffic
Calculated hourly:
Port count 24719
Broken 100
Deprecated 143
Ignore 389
Forbidden 3
Restricted 203
No CDROM 94
Vulnerable 21
Expired 1
Set to expire 136
Interactive 0
new 24 hours 12
new 48 hours17
new 7 days32
new fortnight43
new month125
49b
Servers and bandwidth provided by
New York Internet, SuperNews, and RootBSD
Valid HTML, CSS, and RSS.
Copyright © 2000-2014 Dan Langille. All rights reserved.
0
|
__label__pos
| 0.788419 |
PS running numerous SQL scripts
This topic contains 4 replies, has 2 voices, and was last updated by Profile photo of Paul Tracey Paul Tracey 9 months, 3 weeks ago.
• Author
Posts
• #33323
Profile photo of Paul Tracey
Paul Tracey
Participant
I am writing a script to iterate through numerous SQL scripts. These have been generated through a Redgate tool, and will basically migrate a database. There are several hundred of these.
I have written the basic script that iterates through them, and it works. I am using the Invoke-Command (with a ScriptBlock), since the scripts have already been generated.
However, there is a lot of output generated, all the SQL table drops etc, and I really only want to see any output if there has been a failure. In such a situation, I would like to stop execution. I guess I would us a try-catch method.
So, given the above, I am after any tips regarding verbosity and error-catching.
Note, I am doing the PluralSight course in PS, but it is a bit basic so far.
• #33324
Profile photo of Dave Wyatt
Dave Wyatt
Moderator
How are you executing the sql scripts? That will determine how you do error handling as they're running.
• #33356
Profile photo of Paul Tracey
Paul Tracey
Participant
It is probably easiest to illustrate with the code:
#Amend the following as necessary:
$SQLServer = "XXXX\XXXXX";
$SQLDatabase = "XXXXX";
$SQLUser = "XXXXXX";
$SQLPassword = "XXXXXX";
$SQLFolderPath = "C:\XXXXXXX";
$FolderTop =$(get-childitem "$SQLFolderPath");
clear-host
foreach($Folder in $FolderTop)
{
$Message = "Processing Folder $Folder";
$MessageUnderLine = "=" * $Message.Length;
Write-Host `n"Processing Folder $Folder`n$MessageUnderLine`n";
# $Folder2=$(get-childitem -Filter "*Initial.sql" $Folder.FullName);
$Folder2=$(get-childitem $Folder.FullName -Include *.sql -Recurse);
foreach($File in $Folder2)
{
$MessageF = "Processing File $File";
$MessageUnderLineF = "=" * $MessageF.Length;
Write-Host "Processing File $File`n$MessageUnderLineF`n";
$scriptblock = {param($p1, $p2, $p3, $p4); `
sqlcmd -S `"$p1`" `
-U `"$P2`" `
-P `"$P3`" `
-i `"$P4`" }
Invoke-Command -ScriptBlock $scriptBlock -ArgumentList $SQLServer, $SQLUser, $SQLPassword, $file.FullName
}
}
Note, I have managed to suppress the output from SQLCMD using the -o switch to send the output to a file.
Maybe I can use a try-catch inside the script block. Or maybe Invoke-Command is the wrong way to go. They key thing is that the SQL files are all generated already, so I don't need any SQL in the script itself.
Any ideas greatly appreciated.
• #33359
Profile photo of Dave Wyatt
Dave Wyatt
Moderator
Okay, two things here. One, there's probably no advantage to using Invoke-Command, since you're still running it locally. You can just run sqlcmd directly, without the scriptBlock variable:
foreach($File in $Folder2)
{
$MessageF = "Processing File $File";
$MessageUnderLineF = "=" * $MessageF.Length;
Write-Host "Processing File $File`n$MessageUnderLineF`n";
$scriptblock = {param($p1, $p2, $p3, $p4); `
sqlcmd -S `"$p1`" `
-U `"$P2`" `
-P `"$P3`" `
-i `"$P4`" }
sqlcmd -S $SQLServer -U $SQLUser -P $SQLPassword -i $file.FullName -b
}
You shouldn't need to worry about injecting quotation marks; PowerShell will do that for you when it calls external commands.
Next is error handling. When you're working with external commands like sqlcmd.exe, you'll want to check the value of the automatic $LASTEXITCODE variable right after you execute the command. You may notice that I added the "-b" switch to the call to SqlCmd; that's from glancing at the documentation ( https://msdn.microsoft.com/en-us/library/ms162773.aspx ) and noting that you need -b in order to make sqlcmd return an exit code other than zero when there's a problem.
• #33367
Profile photo of Paul Tracey
Paul Tracey
Participant
Thanks for that Dave. I didn't realise there was a 'b' switch. that has worked a treat, many thanks.
I kept the script block, as it just looks neater. I simply check the $LASTEXITCODE, then break out of both loops displaying an appropriate error. Don't like breaking out of nested loops, but this is a one-off task.
I did try to get INVOKE-SQLCMD working, but the import module failed bizarrely.
Once again, many thanks.
You must be logged in to reply to this topic.
|
__label__pos
| 0.799027 |
Home » Blog » Find the limit of the given function
Find the limit of the given function
Find the value of the following limit.
\[ \lim_{x \to a^+} \frac{ \sqrt{x} - \sqrt{a} + \sqrt{x-a}}{\sqrt{x^2-a^2}}. \]
We compute as follows,
\begin{align*} \lim_{x \to a^+} \frac{\sqrt{x} - \sqrt{a} + \sqrt{x-a}}{\sqrt{x^2-a^2}} &= \lim_{x \to a^+} \left( \frac{\sqrt{x} - \sqrt{a}}{\sqrt{x^2 - a^2}} + \frac{\sqrt{x-a}}{\sqrt{(x+a)(x-a)}} \right) \\[9pt] &= \lim_{x \to a^+} \left( \frac{\sqrt{x} - \sqrt{a}}{\sqrt{x^2 - a^2}} \right) + \frac{1}{2\sqrt{a}} \\[9pt] &= \frac{1}{2 \sqrt{a}} + \lim_{x \to a^+} \frac{ \frac{1}{2 \sqrt{x}}}{\frac{x}{\sqrt{x^2-a^2}}} &(\text{L'Hopital})\\[9pt] &= \frac{1}{2\sqrt{a}} + \lim_{x \to a^+} \frac{\sqrt{x^2-a^2}}{2x^{\frac{3}{2}}} \\[9pt] &= \frac{1}{2\sqrt{a}} + 0 = \frac{1}{2\sqrt{a}}. \end{align*}
Since this limit exists, the application of L’Hopital’s rule was justified.
One comment
Point out an error, ask a question, offer an alternative solution (to use Latex type [latexpage] at the top of your comment):
|
__label__pos
| 1 |
Upgrading module/core versions
Upgrades with Tome should work the same as normal Drupal site upgrades:
1. Run composer commands to update module/core versions
2. Run "drush updb", possibly "drush cron" for some field changes
3. See updated content/config exported with Tome
But sometimes upgrades need manual steps. Here are some notes that may be helpful to you:
Upgrading from Drupal 8 to Drupal 9
1. In config/system.action.node_delete_action.yml, set "plugin" to "entity:delete_action:node"
2. In settings.php, replace "$config_directories['sync'] = '../config';" with "$settings['config_sync_directory'] = '../config';"
3. In config/core.extension.yml, add "path_alias: 0" to the module list
Upgrading to Paragraphs 1.6
1. Run "find ./content/ -name 'paragraph*' | xargs -I {} sh -c 'cat {} | jq "del(.behavior_settings)" --unbuffered --indent 4 | tee {}'"
2. Run "find ./content/ -name 'paragraph*' | xargs -I {} sh -c 'cat {} | jq "del(.uid)" --unbuffered --indent 4 | tee {}'"
3. Run "find ./content/ -name 'paragraph*' | xargs -I {} sh -c 'cat {} | jq "del(.revision_uid)" --unbuffered --indent 4 | tee {}'"
|
__label__pos
| 0.941195 |
1
Eu estou criando uma aplicação simples que envolve o banco de dados SQLite e ao longo do desenvolvimento minha função de inserir na tabela parou de funcionar. Através do debug pude notar que ela está executando até o final, porém os dados não estão sendo inseridos.
Tela de Cadastro
public class RestauranteCadastrar extends AppCompatActivity {
EditText edtNome, edtEndereco, edtDescricao;
Button btnConfirmar;
RestauranteDAO dao = new RestauranteDAO(RestauranteCadastrar.this);
TextView txtListagem;
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.activity_restaurante_cadastrar);
getSupportActionBar().setDisplayHomeAsUpEnabled(true); //Mostrar o botão
getSupportActionBar().setHomeButtonEnabled(true); //Ativar o botão
edtNome = (EditText) findViewById(R.id.edtNome);
edtEndereco = (EditText) findViewById(R.id.edtEndereco);
edtDescricao = (EditText) findViewById(R.id.edtDescricao);
btnConfirmar = (Button) findViewById(R.id.btnConfirmar);
CarregarInicial();
btnConfirmar.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
boolean camposPreenchidos = true;
if (edtNome.getText().toString().isEmpty()){
edtNome.setError("Campo Obrigatório.");
edtNome.requestFocus();
camposPreenchidos = false;
}
if (edtEndereco.getText().toString().isEmpty()){
edtEndereco.setError("Campo Obrigatório.");
edtEndereco.requestFocus();
camposPreenchidos = false;
}
if (edtDescricao.getText().toString().isEmpty()){
edtDescricao.setError("Campo Obrigatório.");
edtDescricao.requestFocus();
camposPreenchidos = false;
}
if (camposPreenchidos){
Restaurante restaurante = new Restaurante();
restaurante.setNome(edtNome.getText().toString());
restaurante.setDescricao(edtDescricao.getText().toString());
restaurante.setEndereco(edtEndereco.getText().toString());
restaurante.setLike(0);
restaurante.setDeslike(0);
restaurante.setLikeQuant(0);
restaurante.setDeslikeQuant(0);
dao.Abrir();
dao.Inserir(restaurante);
dao.Fechar();
Toast msg = Toast.makeText(RestauranteCadastrar.this, "Recomendação cadastrada com sucesso!",Toast.LENGTH_LONG);
msg.show();
//finish();
}
}
});
}
public void CarregarInicial(){
RestauranteDAO dao = new RestauranteDAO(RestauranteCadastrar.this);
dao.Abrir();
Listar(dao);
}
public void Listar(RestauranteDAO dao){
List<Restaurante> lista = dao.ListarTodos();
txtListagem = (TextView) findViewById(R.id.txtListagem);
txtListagem.setText("");
for (Restaurante c: lista){ //for each
txtListagem.setText(txtListagem.getText().toString() + c.getId() + "-" +c.getNome() + "\n");
}
}
Classe DAO onde se encontra a função inserir;
public class RestauranteDAO {
private SQLiteDatabase db;
private DBHelper helper;
public RestauranteDAO(Context context){
helper = new DBHelper(context);
}
public void Abrir(){
db = helper.getReadableDatabase();
}
public void Fechar(){
helper.close();
}
public long Inserir(Restaurante restaurante){
ContentValues dados = new ContentValues();
String query = "select * from restaurante";
Cursor cursor = db.rawQuery(query, null);
int count = cursor.getCount();
dados.put("ID", count);
dados.put("Nome", restaurante.getNome());
dados.put("Descricao", restaurante.getDescricao());
dados.put("Endereco", restaurante.getEndereco());
dados.put("Like", restaurante.getLike());
dados.put("Deslike", restaurante.getDeslike());
dados.put("LiqueQuant", restaurante.getLikeQuant());
dados.put("DeslikeQuant", restaurante.getDeslikeQuant());
long rowid = db.insert(DBHelper.TBL_RESTAURANTE, null, dados);
return rowid;
}
public long Atualizar(int id, int like, int deslike){
ContentValues dados = new ContentValues();
String where = "ID = " + id;
Abrir();
dados.put("Like", like);
dados.put("Deslike", deslike);
long rowid = db.update(DBHelper.TBL_RESTAURANTE, dados, where, null);
Fechar();
return rowid;
}
public Cursor carregaDados(){
Cursor cursor;
Abrir();
cursor = db.query(DBHelper.TBL_RESTAURANTE, new String[]{"ID", "Nome", "Descricao", "Endereco", "Like", "Deslike", "LikeQuant", "DeslikeQuant"}, null, null, null, null, "ID", null);
if(cursor!=null) {
cursor.moveToFirst();
}
Fechar();
return cursor;
}
public ArrayList procurarID(int id){
db = this.helper.getReadableDatabase();
String query = "select * from " + DBHelper.TBL_RESTAURANTE;
Cursor cursor = db.rawQuery(query, null);
int idComparacao = 99;
String vNome = "HQPZM", vDescricao = "HQPZM";
int vLike = 0, vDeslike = 0;
String vEndereco = "HQPZM";
int vLikeQuant = 0, vDeslikeQuant = 0;
if (cursor.moveToFirst()){
do {
idComparacao = cursor.getInt(0);
if (idComparacao == id){
vNome = cursor.getString(1);
vDescricao = cursor.getString(2);
vLike = cursor.getInt(3);
vDeslike = cursor.getInt(4);
vEndereco = cursor.getString(5);
vLikeQuant = cursor.getInt(6);
vDeslikeQuant = cursor.getInt(7);
break;
}
} while (cursor.moveToNext());
}
db.close();
ArrayList vetResult = new ArrayList();
vetResult.add(idComparacao); //0
vetResult.add(vNome); //1
vetResult.add(vDescricao); //2
vetResult.add(vLike); //3
vetResult.add(vDeslike); //4
vetResult.add(vEndereco); //5
vetResult.add(vLikeQuant); //6
vetResult.add(vDeslikeQuant);//7
return(vetResult);
}
public List<Restaurante> ListarTodos(){
List<Restaurante> lista = new ArrayList<Restaurante>();
Cursor cursor = db.query(DBHelper.TBL_RESTAURANTE, new String[]{"ID", "Nome", "Endereco", "Descricao"}, null, null, null, null, "Nome");
cursor.moveToFirst();
while (!cursor.isAfterLast()){
Restaurante restaurante = new Restaurante();
restaurante.setId(cursor.getInt(0));
restaurante.setNome(cursor.getString(1));
restaurante.setDescricao(cursor.getString(2));
lista.add(restaurante);
cursor.moveToNext();
}
cursor.close();
return lista;
}
}
Não consigo identificar o que possa estar errado.
1 Resposta 1
1
Se você substituir long rowid = db.insert(DBHelper.TBL_RESTAURANTE, null, dados); por long rowid = db.insertOrThrow(DBHelper.TBL_RESTAURANTE, null, dados);, ele funcionará, se der algo errado ele vai te retornar o erro. Bjos
Você deve fazer log-in para responder a esta pergunta.
Esta não é a resposta que você está procurando? Pesquise outras perguntas com a tag .
|
__label__pos
| 0.961182 |
Voronoi Noise VEX node
Computes 1D, 3D, and 4D Voronoi noise, which is similar to Worley noise but has add…
See also: Cellular Noise, Periodic Noise, Anti-Aliased Noise, Turbulent Noise
This operator computes 1D, 3D, and 4D Voronoi noise, which is similar to Worley noise but has additional control over jittering (i.e. how randomly the points are scattered through space) and returns the actual locations of the two nearest points.
Voronoi noise works by scattering points randomly through space according to a nice Poisson distribution, generating cell-like patterns. The generated noise is not anti-aliased. For best shading results, use the anti-aliased Celluar Noise instead.
Though this operator is slightly more expensive than Worley noise, the fact that it computes the actual point positions allows it to overcome some of the artifacts of Worley noise, such as getting even widths along the cell boundaries.
You can look at dist1 as the amount of generated noise (see other pattern generators such as Boxes or Stripes), which can be connected to a mixing bias (see Mix), a displacement amount (see Displace Along Normal), or other float inputs.
The seed associated with the first closest point is also returned. The seed is pretty much guaranteed to be unique for every point, meaning that it is unlikely that two points close by will have the same seed associated with them.
If the periodicity (period) input is connected, periodicity will be factored into the noise computation.
The relative costs for computing noise of different types is roughly:
Cost | Noise Type
-----+-------------------------
1.0 | Perlin Noise (see Periodic Noise operator)
1.1 | Original Perlin Noise (see Turbulent Noise operator)
1.8 | Worley Noise (see Worley Noise operator)
1.9 | Voronoi Noise
2.1 | Sparse Convolution Noise (see Turbulent Noise operator)
2.3 | Alligator Noise (see Turbulent Noise operator)
Usages in other examples
Example name Example for
Material shader
Load | Launch
|
__label__pos
| 0.805231 |
Spring Boot 集成 Akka 并是实现异步请求
摘要：本文主要介绍两个问题，一个是 SpringAKKA 的集成，另一个是如何使用 Spring 异步请求。最后结合两点，设计一个简单的场景。
Spring 集成 AKKA
首先我们需要在 Spring 中集成 AKKA。目前有若干篇博文介绍该方法，基本思路都是一致的，就是通过 AKKAExtension 机制将 AKKAActor 注入到 SpringIoC 容器中。然后通过 依赖注入 来使用 Actor
参考博文：
Introduction to Spring with Akka：该文章比较详细的介绍了配置过程
Spring-boot-akka-part1 & part2：该文章分两部分，除了介绍配置过程，另外还介绍了使用其进行异步调用。
以上两篇文章都是在 Spring 的配置中，配置系统级别的 Actor，然后在 Client 代码中创建新的 Actor
另外一篇文章 AKKA Actor Dependency Injection Using Spring，虽然文章比较老，但是该文章完全自己实现了注入的过程，没有依赖于 Extension，同时其配置也将业务层的 Actor 一同配置。
本文集合上面三篇文章进行说明，使用 Extension 机制，同时配置业务层 Actor，然后在其他地方全部使用注入方式来访问 Actore
依赖注入简介
[Akka](http://akka.io/) 是一个基于 Actor 并发模型的功能强大的应用程序框架。这个框架是用 Scala 编写的，当然它也可以在基于 java 的应用程序中完全使用。因此，我们常常希望将Akka 集成到现有的基于 Spring 的应用程序中，或者简单地使用 Springbean 连接到 actor 中。
Spring/Akka 集成的问题在于 Spring 中的 bean 管理与 Akka 中的 actor 管理之间的差异: actor 具有与典型 Spring bean 生命周期不同的特定生命周期。
此外，参与者被分割为参与者本身(这是一个内部实现细节，Spring 无法管理)和参与者引用(可由客户端代码访问)，以及可序列化和可移植的不同 Akka 运行时。
幸运的是，Akka 提供了一个机制，即 Akka 扩展 ，这使得使用外部依赖注入框架成为一项相当简单的任务。
maven 依赖
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
<properties>
<spring.version>4.3.1.RELEASE</spring.version>
<akka.version>2.5.14</akka.version>
</properties>
<dependencies>
<dependency>
<groupId>org.springframework</groupId>
<artifactId>spring-context</artifactId>
<version>${spring.version}</version>
</dependency>
<dependency>
<groupId>com.typesafe.akka</groupId>
<artifactId>akka-actor_2.11</artifactId>
<version>${akka.version}</version>
</dependency>
</dependencies>
如果使用 Spring Boot 则无需 spring-context 依赖。akka 的版本可以自行更新，如果有 breaking change 需要注意，可能本文不兼容。
ActorSystem 集成到 Spring ApplicationContext
Spring Been 注入到 Akka Actors
构造 SpringActorProducer
SpringActorProducer 的功能就是从 ApplicationContext 中以 Spring Bean 的形式通过名称来创建 actors
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
public class SpringActorProducer implements IndirectActorProducer {
private ApplicationContext applicationContext;
private String beanActorName;
public SpringActorProducer(ApplicationContext applicationContext,
String beanActorName) {
this.applicationContext = applicationContext;
this.beanActorName = beanActorName;
}
@Override
public Actor produce() {
return (Actor) applicationContext.getBean(beanActorName);
}
@Override
public Class<? extends Actor> actorClass() {
return (Class<? extends Actor>) applicationContext.getType(beanActorName);
}
}
IndirectActorProducerakka 提供的一个接口：
This interface defines a class of actor creation strategies deviating from the usual default of just reflectively instantiating the Actor subclass. It can be used to allow a dependency injection framework to determine the actual actor class and how it shall be instantiated.
这个接口定义了一个actor创建策略类，它偏离了通常的默认值，只是反射地实例化了 actor 子类。它可以用于允许依赖注入框架来确定实际的 actor 类以及如何实例化它。
其中 produce 方法用途：
This factory method must produce a fresh actor instance upon each invocation. It is not permitted to return the same instance more than once.
这个工厂方法必须在每次调用时生成一个新的actor实例。不允许多次返回同一个实例。
actorClass 方法用途：
This method is used by Props to determine the type of actor which will be created. This means that an instance of this IndirectActorProducer will be created in order to call this method during any call to Props.actorClass; it should be noted that such calls may performed during actor set-up before the actual actor’s instantiation, and that the instance created for calling actorClass is not necessarily reused later to produce the actor.
该方法被道具用来确定将要创建的参与者的类型。这意味着将创建这个IndirectActorProducer的实例，以便在调用Props.actorClass时调用该方法;应该注意的是，这样的调用可以在实际的actor实例化之前的actor设置期间执行，并且为调用actorClass而创建的实例并不一定要在以后重用以生成actor。
通俗的讲，该类是让 AKKA 知道在你的应用环境中如何创建 actor，由于我们使用 Spring，所以所有的 bean 都应该在 SpringContext 通过注册的名字获取。所以该类的构造函数注入了两个参数，一个是 ApplicationContext，另一个就是 beanActorName。然后实现接口并实现两个方法，一个方法是如何生成 Actor，根据 Spring 思想，就是通过 bean 的名称直接在 Context 进行查找。当然这里可以进一步扩展，比如 bean 有构造函数，需要传入参数，那么我们在多注入一个 Object.. args，然后通过名字加参数获取 bean 实例。（可以参考上面的文章 part2 的实例，代码如下）。理论上我们可以将任意的 IoC 容器注入到这个 Producer 中。
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
public class SpringActorProducer implements IndirectActorProducer {
final private ApplicationContext applicationContext;
final private String actorBeanName;
final private Object[] args;
public SpringActorProducer(ApplicationContext applicationContext, String actorBeanName, Object... args) {
this.applicationContext = applicationContext;
this.actorBeanName = actorBeanName;
this.args = args;
}
@Override
public Actor produce() {
if (args == null) {
return (Actor) applicationContext.getBean(actorBeanName);
} else {
return (Actor) applicationContext.getBean(actorBeanName, args);
}
}
@Override
public Class<? extends Actor> actorClass() {
return (Class<? extends Actor>) applicationContext.getType(actorBeanName);
}
}
创建 SpringAKKA 扩展
什么是 akka 扩展？ 一个扩展就是每个参与者系统创建的单例实例。
If you want to add features to Akka, there is a very elegant, but powerful mechanism for doing so. It’s called Akka Extensions and is comprised of 2 basic components: an Extension and an ExtensionId.
Extensions will only be loaded once per ActorSystem, which will be managed by Akka. You can choose to have your Extension loaded on-demand or at ActorSystem creation time through the Akka configuration. Details on how to make that happens are below, in the “Loading from Configuration” section.
如果想要为Akka添加特性，有一个非常优美而且强大的工具，称为 Akka 扩展。它由两部分组成： Extension 和 ExtensionId.
Extensions 在每个 ActorSystem 中只会加载一次, 并被Akka所管理。 你可以选择按需加载你的Extension或是在 ActorSystem 创建时通过Akka配置来加载。 关于这些细节，见下文 “从配置中加载” 的部分.
警告：由于扩展是hook到Akka自身的，所以扩展的实现者需要保证自己扩展的线程安全性。
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
public class SpringExtension extends AbstractExtensionId<SpringExtension.SpringExt> {
public static final SpringExtension SPRING_EXTENSION_PROVIDER = new SpringExtension();
@Override
public SpringExt createExtension(ExtendedActorSystem system) {
return new SpringExt();
}
public static class SpringExt implements Extension {
private volatile ApplicationContext applicationContext;
public void initialize(ApplicationContext applicationContext) {
this.applicationContext = applicationContext;
}
public Props props(String actorBeanName) {
return Props.create(
SpringActorProducer.class, applicationContext, actorBeanName);
}
}
}
理解这个扩展，我们首先要理解什么是 PropsProps 实例是 actor 的蓝图，也就是说 Props 用于获取 actore。具体用法就是如果我们希望获取一个 actor，我们可以使用该方法来获取 actorSystem.actorOf(props, actorName)。 这里有点绕，因为我们的 Props 是通过 SpringActorProducer 获取的，我们为什么不直接用 Producer 来获取 Actor 呢？应该是为了抽象，Props 的创造方法有多种，这里只是其中的一种。
该扩展中定义了一个静态的成员变量，类型就是类本身，也就是维护本身的实例的引用。而其中的 createExtension 方法，如果阅读源码的话，可以发现是在注册 extension 的时候被调用。这个类应该是增加一个私有的构造函数，从而表明该类是一个单例。
该扩展的使用就是通过静态成员 SPRING_EXTENSION_PROVIDER 根据 actor 名字获取其 Propsprops 方法每次需要使用 Spring 来管理 actor 的引用的时候，就需要调用方法。
创建 Spring 配置类
我们使用 Java 配置方法来配置 Akka。不同于前面两篇参考文章，本文配置了两个 Actor，一个全局的 system actor， 还配置了一个业务的 actor，这样我们在使用业务的 actor 的时候更加方便。
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
@Configuration
@ComponentScan
public class AkkaConfiguration {
public static final String ACTOR_SYSTEM = "ACTOR_SYSTEM";
public static final String LOGIN_ACTOR = "LOGIN_ACTOR";
@Autowired
private ApplicationContext applicationContext;
private ActorSystem actorSystem;
@Bean(name = ACTOR_SYSTEM)
public ActorSystem actorSystem() {
actorSystem = ActorSystem.create(ACTOR_SYSTEM);
SPRING_EXTENSION_PROVIDER.get(actorSystem).initialize(applicationContext);
return actorSystem;
}
@Bean(name = LOGIN_ACTOR)
@DependsOn({ACTOR_SYSTEM})
public ActorRef loginActor() {
return actorSystem
.actorOf(SPRING_EXTENSION_PROVIDER.get(actorSystem).props("loginActor"), LOGIN_ACTOR);
}
}
配置方法很简洁，首先我们需要注入 ApplicationContext，这个 context 需要传入 akka 扩展方法。我们首先配置系统级别的 actor，先使用 ActorSystem 的静态方法来使用名字创建一个 actor，然后将该 actor 放入到当前的 ApplicationContext 中，最后返回 ActorSystem 的引用。
然后在 ActorSystem 基础上我们在配置一个业务的 Actor，我们前面提到过，如何通过 Props 获取 Actor 的引用。这里就是其使用场景。我们通过 actorSystem.actorOf 方法传入蓝图（Props）和名称来获取其实例。
至此就完成了 AKKASpring 的配置。
Spring 使用 AKKA
使用 AKKA 重点在于需要理解 actor 的思想，很多文章介绍这方面的内容，比如这篇比较详细的介绍其设计思想。简单的将，Actor 就是一个消息的处理者，最常见的使用就是重载 onReceive 方法，然后根据消息的不同进行不同的处理，然后返回结果。在业务逻辑中，向相应功能的 actor 发送不同的消息。消息的发送和结果可以是异步的，比如我们执行一个比较费时的操作，这个操作可以放到actor，当执行该动作的消息发送到 actor 后，无需等待 actor 完成这个动作，而是先返回一个 Future，如果业务逻辑是 一个请求，请求就可以结束。知道 actor 完成，Future 会再次被触发从而获取处理结果。
Actor 类
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
@Component
public class GreetingService {
public String greet(String name) {
return "Hello, " + name;
}
}
@Component
@Scope(ConfigurableBeanFactory.SCOPE_PROTOTYPE)
public class GreetingActor extends UntypedActor {
private GreetingService greetingService;
// constructor
@Override
public void onReceive(Object message) throws Throwable {
if (message instanceof Greet) {
String name = ((Greet) message).getName();
getSender().tell(greetingService.greet(name), getSelf());
} else {
unhandled(message);
}
}
public static class Greet {
private String name;
// standard constructors/getters
}
}
使用 Actor
1
2
3
4
5
6
7
8
9
ActorRef greeter = system.actorOf(SPRING_EXTENSION_PROVIDER.get(system)
.props("greetingActor"), "greeter");
FiniteDuration duration = FiniteDuration.create(1, TimeUnit.SECONDS);
Timeout timeout = Timeout.durationToTimeout(duration);
Future<Object> result = ask(greeter, new Greet("John"), timeout);
Assert.assertEquals("Hello, John", Await.result(result, duration));
扩展场景设计
该场景十分简单，我们假定需要设计一个扫码登录的功能，我们抛去细节，只关注核心，实际上这个核心主要有三个 API
1. 初始登陆过程，比如我们打开微信网页版
2. polling 的过程，这个过程是不断判断是否用户完成了扫码并点击确认授权
3. 授权过程，这个 API 模拟了用户完成扫码，这时候 polling api 结束，并返回扫码后的结果。
|
__label__pos
| 0.925148 |
add labels to make checkboxes better clickable
[squirrelmail.git] / plugins / squirrelspell / sqspell_functions.php
CommitLineData
849bdf42 1<?php
4b4abf93 2
15e6162e 3/**
91e0dccc 4 * sqspell_functions.php
15e6162e 5 *
4b4abf93 6 * All SquirrelSpell-wide functions are in this file.
15e6162e 7 *
4b4abf93 8 * @author Konstantin Riabitsev <icon at duke.edu>
4b5049de 9 * @copyright © 1999-2007 The SquirrelMail Project Team
4b4abf93 10 * @license http://opensource.org/licenses/gpl-license.php GNU Public License
7996c920 11 * @version $Id$
ea5f4b8e 12 * @package plugins
13 * @subpackage squirrelspell
15e6162e 14 */
d112ed5a 15
e5af0839 16/** globalize configuration vars **/
17global $SQSPELL_APP, $SQSPELL_APP_DEFAULT, $SQSPELL_WORDS_FILE, $SQSPELL_CRYPTO;
18
202bcbcc 19/**
e5af0839 20 * load plugin configuration
21 * @todo allow storing configuration file in config/ directory
22 */
23include_once(SM_PATH . 'plugins/squirrelspell/sqspell_config.php');
24
bf15b3eb 25/**
26 * Workaround for including function squirrelspell_version() in SM 1.5 CVS,
27 * where plugins' setup.php is not included by default.
28 */
29include_once(SM_PATH . 'plugins/squirrelspell/setup.php');
30
e5af0839 31/** Hooked functions **/
32
33/**
34 * Register option page block (internal function)
35 * @since 1.5.1 (sqspell 0.5)
36 * @return void
37 */
38function squirrelspell_optpage_block_function() {
39 global $optpage_blocks;
40
41 /**
42 * Dependency on JavaScript is checked by SquirrelMail scripts
43 * Register Squirrelspell with the $optpage_blocks array.
44 */
45 $optpage_blocks[] =
46 array(
47 'name' => _("SpellChecker Options"),
48 'url' => '../plugins/squirrelspell/sqspell_options.php',
49 'desc' => _("Here you may set up how your personal dictionary is stored, edit it, or choose which languages should be available to you when spell-checking."),
50 'js' => TRUE);
51}
52
53/**
54 * This function adds a "Check Spelling" link to the "Compose" row
55 * during message composition (internal function).
56 * @since 1.5.1 (sqspell 0.5)
57 * @return void
58 */
59function squirrelspell_setup_function() {
60 /**
61 * Check if this browser is capable of displaying SquirrelSpell
62 * correctly.
63 */
64 if (checkForJavascript()) {
65 /**
66 * Some people may choose to disable javascript even though their
67 * browser is capable of using it. So these freaks don't complain,
68 * use document.write() so the "Check Spelling" button is not
69 * displayed if js is off in the browser.
70 */
7ffb780f 71 $output = "<script type=\"text/javascript\">\n".
e5af0839 72 "<!--\n".
73 'document.write("<input type=\"button\" value=\"'.
74 _("Check Spelling").
75 '\" name=\"check_spelling\" onclick=\"window.open(\'../plugins/squirrelspell/sqspell_'.
76 'interface.php\', \'sqspell\', \'status=yes,width=550,height=370,'.
77 'resizable=yes\')\" />");' . "\n".
78 "//-->\n".
79 "</script>\n";
7ffb780f 80 return array('compose_button_row' => $output);
e5af0839 81 }
82}
83
84/**
85 * Upgrade dictionaries (internal function)
86 *
87 * Transparently upgrades user's dictionaries when message listing is loaded
88 * @since 1.5.1 (sqspell 0.5)
89 */
90function squirrelspell_upgrade_function() {
91 global $data_dir, $username;
92
93 if (! sqspell_check_version(0,5)) {
94 $langs=sqspell_getSettings_old(null);
95 $words=sqspell_getWords_old();
96 sqspell_saveSettings($langs);
97 foreach ($langs as $lang) {
98 $lang_words=sqspell_getLang_old($words,$lang);
99 $aLang_words=explode("\n",$lang_words);
100 $new_words=array();
101 foreach($aLang_words as $word) {
102 if (! preg_match("/^#/",$word) && trim($word)!='') {
103 $new_words[]=$word;
104 }
105 }
106 sqspell_writeWords($new_words,$lang);
107 }
108 // bump up version number
109 setPref($data_dir,$username,'sqspell_version','0.5');
110 }
111}
112
113/** Internal functions **/
114
d112ed5a 115/**
116 * This function is the GUI wrapper for the options page. SquirrelSpell
117 * uses it for creating all Options pages.
118 *
7996c920 119 * @param string $title The title of the page to display
120 * @param string $scriptsrc This is used to link a file.js into the
d112ed5a 121 * <script src="file.js"></script> format. This
122 * allows to separate javascript from the rest of the
123 * plugin and place it into the js/ directory.
7996c920 124 * @param string $body The body of the message to display.
d112ed5a 125 * @return void
126 */
127function sqspell_makePage($title, $scriptsrc, $body){
8a9f9d09 128 global $color, $SQSPELL_VERSION;
129
b587ac51 130 if (! sqgetGlobalVar('MOD', $MOD, SQ_GET) ) {
8a9f9d09 131 $MOD = 'options_main';
132 }
133
91e0dccc 134 displayPageHeader($color, 'None');
2ad4cea9 135 echo " <br />\n";
d112ed5a 136 /**
137 * Check if we need to link in a script.
138 */
91e0dccc 139 if($scriptsrc) {
d112ed5a 140 echo "<script type=\"text/javascript\" src=\"js/$scriptsrc\"></script>\n";
141 }
484ed7c9 142 echo html_tag( 'table', '', 'center', '', 'width="95%" border="0" cellpadding="2" cellspacing="0"' ) . "\n"
143 . html_tag( 'tr', "\n" .
144 html_tag( 'td', '<strong>' . $title .'</strong>', 'center', $color[9] )
145 ) . "\n"
146 . html_tag( 'tr', "\n" .
04fa3c41 147 html_tag( 'td', '<hr />', 'left' )
484ed7c9 148 ) . "\n"
149 . html_tag( 'tr', "\n" .
150 html_tag( 'td', $body, 'left' )
151 ) . "\n";
d112ed5a 152 /**
153 * Generate a nice "Return to Options" link, unless this is the
154 * starting page.
155 */
91e0dccc 156 if ($MOD != "options_main"){
484ed7c9 157 echo html_tag( 'tr', "\n" .
04fa3c41 158 html_tag( 'td', '<hr />', 'left' )
484ed7c9 159 ) . "\n"
160 . html_tag( 'tr', "\n" .
161 html_tag( 'td', '<a href="sqspell_options.php">'
162 . _("Back to "SpellChecker Options" page")
163 . '</a>',
164 'center' )
165 ) . "\n";
d112ed5a 166 }
167 /**
168 * Close the table and display the version.
169 */
484ed7c9 170 echo html_tag( 'tr', "\n" .
04fa3c41 171 html_tag( 'td', '<hr />', 'left' )
484ed7c9 172 ) . "\n"
173 . html_tag( 'tr',
7996c920 174 html_tag( 'td', 'SquirrelSpell ' . squirrelspell_version(), 'center', $color[9] )
f6536dcf 175 ) . "\n</table>\n";
dcc1cc82 176 echo '</body></html>';
d112ed5a 177}
178
179/**
180 * Function similar to the one above. This one is a general wrapper
181 * for the Squirrelspell pop-up window. It's called form nearly
182 * everywhere, except the check_me module, since that one is highly
183 * customized.
184 *
7996c920 185 * @param string $onload Used to indicate and pass the name of a js function
d112ed5a 186 * to call in a <body onload="function()" for automatic
187 * onload script execution.
7996c920 188 * @param string $title Title of the page.
189 * @param string $scriptsrc If defined, link this javascript source page into
d112ed5a 190 * the document using <script src="file.js"> format.
7996c920 191 * @param string $body The content to include.
d112ed5a 192 * @return void
193 */
194function sqspell_makeWindow($onload, $title, $scriptsrc, $body){
fff30237 195 global $color, $SQSPELL_VERSION;
196
197 displayHtmlHeader($title,
198 ($scriptsrc ? "\n<script type=\"text/javascript\" src=\"js/$scriptsrc\"></script>\n" : ''));
199
200 echo "<body text=\"$color[8]\" bgcolor=\"$color[4]\" link=\"$color[7]\" "
201 . "vlink=\"$color[7]\" alink=\"$color[7]\"";
d112ed5a 202 /**
203 * Provide an onload="jsfunction()" if asked to.
204 */
205 if ($onload) {
fff30237 206 echo " onload=\"$onload\"";
d112ed5a 207 }
208 /**
209 * Draw the rest of the page.
210 */
fff30237 211 echo ">\n"
484ed7c9 212 . html_tag( 'table', "\n" .
213 html_tag( 'tr', "\n" .
214 html_tag( 'td', '<strong>' . $title . '</strong>', 'center', $color[9] )
215 ) . "\n" .
216 html_tag( 'tr', "\n" .
04fa3c41 217 html_tag( 'td', '<hr />', 'left' )
484ed7c9 218 ) . "\n" .
219 html_tag( 'tr', "\n" .
220 html_tag( 'td', $body, 'left' )
221 ) . "\n" .
222 html_tag( 'tr', "\n" .
04fa3c41 223 html_tag( 'td', '<hr />', 'left' )
484ed7c9 224 ) . "\n" .
225 html_tag( 'tr', "\n" .
7996c920 226 html_tag( 'td', 'SquirrelSpell ' . squirrelspell_version(), 'center', $color[9] )
484ed7c9 227 ) ,
80b24263 228 '', '', 'width="100%" border="0" cellpadding="2"' );
229
230 global $oTemplate;
231 $oTemplate->display('footer.tpl');
d112ed5a 232}
233
234/**
7996c920 235 * Encryption function used by plugin (old format)
236 *
d112ed5a 237 * This function does the encryption and decryption of the user
91e0dccc 238 * dictionary. It is only available when PHP is compiled with
d112ed5a 239 * mcrypt support (--with-mcrypt). See doc/CRYPTO for more
240 * information.
241 *
242 * @param $mode A string with either of the two recognized values:
243 * "encrypt" or "decrypt".
244 * @param $ckey The key to use for processing (the user's password
245 * in our case.
246 * @param $input Content to decrypt or encrypt, according to $mode.
247 * @return encrypted/decrypted content, or "PANIC" if the
248 * process bails out.
7996c920 249 * @since 1.5.1 (sqspell 0.5)
250 * @deprecated
d112ed5a 251 */
7996c920 252function sqspell_crypto_old($mode, $ckey, $input){
d112ed5a 253 /**
254 * Double-check if we have the mcrypt_generic function. Bail out if
255 * not so.
256 */
1c2a03c3 257 if (!function_exists('mcrypt_generic')) {
d112ed5a 258 return 'PANIC';
259 }
260 /**
261 * Setup mcrypt routines.
262 */
263 $td = mcrypt_module_open(MCRYPT_Blowfish, "", MCRYPT_MODE_ECB, "");
264 $iv = mcrypt_create_iv(mcrypt_enc_get_iv_size ($td), MCRYPT_RAND);
265 mcrypt_generic_init($td, $ckey, $iv);
266 /**
267 * See what we have to do depending on $mode.
268 * 'encrypt' -- Encrypt the content.
269 * 'decrypt' -- Decrypt the content.
270 */
271 switch ($mode){
272 case 'encrypt':
273 $crypto = mcrypt_generic($td, $input);
274 break;
275 case 'decrypt':
276 $crypto = mdecrypt_generic($td, $input);
91e0dccc 277 /**
d112ed5a 278 * See if it decrypted successfully. If so, it should contain
279 * the string "# SquirrelSpell". If not, then bail out.
280 */
281 if (!strstr($crypto, "# SquirrelSpell")){
282 $crypto='PANIC';
9804bcde 283 }
d112ed5a 284 break;
285 }
286 /**
287 * Finish up the mcrypt routines and return the processed content.
288 */
1c2a03c3 289 if (function_exists('mcrypt_generic_deinit')) {
290 // php 4.1.1+ syntax
291 mcrypt_generic_deinit ($td);
292 mcrypt_module_close ($td);
293 } else {
b765c366 294 // older deprecated function
1c2a03c3 295 mcrypt_generic_end ($td);
296 }
d112ed5a 297 return $crypto;
298}
299
300/**
7996c920 301 * Encryption function used by plugin
302 *
303 * This function does the encryption and decryption of the user
304 * dictionary. It is only available when PHP is compiled with
305 * mcrypt support (--with-mcrypt). See doc/CRYPTO for more
306 * information.
307 *
308 * @param $mode A string with either of the two recognized values:
309 * "encrypt" or "decrypt".
310 * @param $ckey The key to use for processing (the user's password
311 * in our case.
312 * @param $input Content to decrypt or encrypt, according to $mode.
313 * @return encrypted/decrypted content, or "PANIC" if the
314 * process bails out.
315 */
316function sqspell_crypto($mode, $ckey, $input){
317 /**
318 * Double-check if we have the mcrypt_generic function. Bail out if
319 * not so.
320 */
321 if (!function_exists('mcrypt_generic')) {
322 return 'PANIC';
323 }
324 /**
325 * Setup mcrypt routines.
326 */
327 $td = mcrypt_module_open(MCRYPT_Blowfish, "", MCRYPT_MODE_ECB, "");
328 $iv = mcrypt_create_iv(mcrypt_enc_get_iv_size ($td), MCRYPT_RAND);
329 mcrypt_generic_init($td, $ckey, $iv);
330 /**
331 * See what we have to do depending on $mode.
332 * 'encrypt' -- Encrypt the content.
333 * 'decrypt' -- Decrypt the content.
334 */
335 switch ($mode){
336 case 'encrypt':
337 $crypto = mcrypt_generic($td, '{sqspell}'.$input);
338 break;
339 case 'decrypt':
340 $crypto = mdecrypt_generic($td, $input);
341 if (preg_match("/^\{sqspell\}(.*)/",$crypto,$match)){
342 $crypto = trim($match[1]);
343 } else {
344 $crypto='PANIC';
345 }
346 break;
347 }
348 /**
349 * Finish up the mcrypt routines and return the processed content.
350 */
351 if (function_exists('mcrypt_generic_deinit')) {
352 // php 4.1.1+ syntax
353 mcrypt_generic_deinit ($td);
354 mcrypt_module_close ($td);
355 } else {
356 // older deprecated function
357 mcrypt_generic_end ($td);
358 }
359 return $crypto;
360}
361
362/**
d112ed5a 363 * This function transparently upgrades the 0.2 dictionary format to the
364 * 0.3 format, since user-defined languages have been added in 0.3 and
365 * the new format keeps user dictionaries selection in the file.
366 *
367 * This function will be retired soon, as it's been a while since anyone
368 * has been using SquirrelSpell-0.2.
369 *
370 * @param $words_string Contents of the 0.2-style user dictionary.
371 * @return Contents of the 0.3-style user dictionary.
7996c920 372 * @deprecated
91e0dccc 373 */
d112ed5a 374function sqspell_upgradeWordsFile($words_string){
375 global $SQSPELL_APP_DEFAULT, $SQSPELL_VERSION;
376 /**
377 * Define just one dictionary for this user -- the default.
378 * If the user wants more, s/he can set them up in personal
379 * preferences. See doc/UPGRADING for more info.
380 */
91e0dccc 381 $new_words_string =
382 substr_replace($words_string,
383 "# SquirrelSpell User Dictionary $SQSPELL_VERSION\n# "
384 . "Last Revision: " . date("Y-m-d")
385 . "\n# LANG: $SQSPELL_APP_DEFAULT\n# $SQSPELL_APP_DEFAULT",
386 0, strpos($words_string, "\n")) . "# End\n";
d112ed5a 387 sqspell_writeWords($new_words_string);
388 return $new_words_string;
389}
390
391/**
7996c920 392 * gets list of available dictionaries from user's prefs.
202bcbcc 393 * Function was modified in 1.5.1 (sqspell 0.5).
7996c920 394 * Older function is suffixed with '_old'
395 * @return array list of dictionaries used by end user.
396 */
397function sqspell_getSettings(){
398 global $data_dir, $username, $SQSPELL_APP_DEFAULT, $SQSPELL_APP;
399
400 $ret=array();
401
402 $sLangs=getPref($data_dir,$username,'sqspell_langs','');
403 if ($sLangs=='') {
404 $ret[0]=$SQSPELL_APP_DEFAULT;
405 } else {
406 $aLangs = explode(',',$sLangs);
407 foreach ($aLangs as $lang) {
408 if (array_key_exists($lang,$SQSPELL_APP)) {
773d8dcd 409 $ret[]=$lang;
7996c920 410 }
411 }
412 }
413 return $ret;
414}
415
416/**
417 * Saves user's language preferences
418 * @param array $langs languages array (first key is default language)
419 * @since 1.5.1 (sqspell 0.5)
420 */
421function sqspell_saveSettings($langs) {
422 global $data_dir, $username;
423 setPref($data_dir,$username,'sqspell_langs',implode(',',$langs));
424}
425
426/**
427 * Get list of enabled languages.
428 *
91e0dccc 429 * Right now it just returns an array with the dictionaries
d112ed5a 430 * available to the user for spell-checking. It will probably
431 * do more in the future, as features are added.
432 *
7996c920 433 * @param string $words The contents of the user's ".words" file.
434 * @return array a strings array with dictionaries available
d112ed5a 435 * to this user, e.g. {"English", "Spanish"}, etc.
7996c920 436 * @since 1.5.1 (sqspell 0.5)
437 * @deprecated
d112ed5a 438 */
7996c920 439function sqspell_getSettings_old($words){
d112ed5a 440 global $SQSPELL_APP, $SQSPELL_APP_DEFAULT;
441 /**
442 * Check if there is more than one dictionary configured in the
443 * system config.
444 */
445 if (sizeof($SQSPELL_APP) > 1){
446 /**
447 * Now load the user prefs. Check if $words was empty -- a bit of
448 * a dirty fall-back. TODO: make it so this is not required.
449 */
450 if(!$words){
7996c920 451 $words=sqspell_getWords_old();
9804bcde 452 }
d112ed5a 453 if ($words){
454 /**
455 * This user has a ".words" file.
456 * Find which dictionaries s/he wants to use and load them into
457 * the $langs array.
458 */
459 preg_match("/# LANG: (.*)/i", $words, $matches);
460 $langs=explode(", ", $matches[1]);
461 } else {
462 /**
463 * User doesn't have a personal dictionary. Grab the default
464 * system setting.
465 */
466 $langs[0]=$SQSPELL_APP_DEFAULT;
9804bcde 467 }
d112ed5a 468 } else {
469 /**
470 * There is no need to read the ".words" file as there is only one
471 * dictionary defined system-wide.
472 */
473 $langs[0]=$SQSPELL_APP_DEFAULT;
474 }
475 return $langs;
476}
477
478/**
7996c920 479 * Get user dictionary for selected language
480 * Function was modified in 1.5.1 (sqspell 0.5).
481 * Older function is suffixed with '_old'
482 * @param string $lang language
483 * @param array words stored in selected language dictionary
484 */
485function sqspell_getLang($lang) {
486 global $data_dir, $username,$SQSPELL_CRYPTO;
487 $sWords=getPref($data_dir,$username,'sqspell_dict_' . $lang,'');
488 if (preg_match("/^\{crypt\}(.*)/i",$sWords,$match)) {
489 /**
490 * Dictionary is encrypted or mangled. Try to decrypt it.
491 * If fails, complain loudly.
492 *
493 * $old_key would be a value submitted by one of the modules with
494 * the user's old mailbox password. I admin, this is rather dirty,
495 * but efficient. ;)
496 */
497 if (sqgetGlobalVar('old_key', $old_key, SQ_POST)) {
498 $clear_key=$old_key;
499 } else {
500 sqgetGlobalVar('key', $key, SQ_COOKIE);
501 sqgetGlobalVar('onetimepad', $onetimepad, SQ_SESSION);
502 /**
503 * Get user's password (the key).
504 */
505 $clear_key = OneTimePadDecrypt($key, $onetimepad);
506 }
507 /**
508 * Invoke the decryption routines.
509 */
510 $sWords=sqspell_crypto("decrypt", $clear_key, $match[1]);
511 /**
512 * See if decryption failed.
513 */
514 if ($sWords=="PANIC"){
515 sqspell_handle_crypt_panic($lang);
516 // script execution stops here
517 } else {
518 /**
519 * OK! Phew. Set the encryption flag to true so we can later on
520 * encrypt it again before saving to HDD.
521 */
522 $SQSPELL_CRYPTO=true;
523 }
524 } else {
525 /**
526 * No encryption is/was used. Set $SQSPELL_CRYPTO to false,
527 * in case we have to save the dictionary later.
528 */
529 $SQSPELL_CRYPTO=false;
530 }
531 // rebuild word list and remove empty entries
532 $aWords=array();
533 foreach (explode(',',$sWords) as $word) {
534 if (trim($word) !='') {
773d8dcd 535 $aWords[]=trim($word);
7996c920 536 }
537 }
538 return $aWords;
539}
540
541/**
542 * Get user's dictionary (old format)
543 *
d112ed5a 544 * This function returns only user-defined dictionary words that correspond
545 * to the requested language.
546 *
547 * @param $words The contents of the user's ".words" file.
91e0dccc 548 * @param $lang Which language words to return, e.g. requesting
d112ed5a 549 * "English" will return ONLY the words from user's
550 * English dictionary, disregarding any others.
551 * @return The list of words corresponding to the language
552 * requested.
7996c920 553 * @since 1.5.1 (sqspell 0.5)
554 * @deprecated
91e0dccc 555 */
7996c920 556function sqspell_getLang_old($words, $lang){
d112ed5a 557 $start=strpos($words, "# $lang\n");
558 /**
559 * strpos() will return -1 if no # $lang\n string was found.
560 * Use this to return a zero-length value and indicate that no
561 * words are present in the requested dictionary.
562 */
563 if (!$start) return '';
564 /**
565 * The words list will end with a new directive, which will start
566 * with "#". Locate the next "#" and thus find out where the
567 * words end.
568 */
569 $end=strpos($words, "#", $start+1);
570 $lang_words = substr($words, $start, $end-$start);
571 return $lang_words;
572}
573
574/**
7996c920 575 * Saves user's dictionary (old format)
576 *
d112ed5a 577 * This function operates the user dictionary. If the format is
578 * clear-text, then it just reads the file and returns it. However, if
579 * the file is encrypted (well, "garbled"), then it tries to decrypt
580 * it, checks whether the decryption was successful, troubleshoots if
581 * not, then returns the clear-text dictionary to the app.
91e0dccc 582 *
583 * @return the contents of the user's ".words" file, decrypted if
d112ed5a 584 * necessary.
7996c920 585 * @since 1.5.1 (sqspell 0.5)
586 * @deprecated
d112ed5a 587 */
7996c920 588function sqspell_getWords_old(){
d112ed5a 589 global $SQSPELL_WORDS_FILE, $SQSPELL_CRYPTO;
590 $words="";
591 if (file_exists($SQSPELL_WORDS_FILE)){
592 /**
593 * Gobble it up.
594 */
595 $fp=fopen($SQSPELL_WORDS_FILE, 'r');
596 $words=fread($fp, filesize($SQSPELL_WORDS_FILE));
597 fclose($fp);
598 }
599 /**
600 * Check if this is an encrypted file by looking for
601 * the string "# SquirrelSpell" in it (the crypto
602 * function does that).
603 */
604 if ($words && !strstr($words, "# SquirrelSpell")){
605 /**
606 * This file is encrypted or mangled. Try to decrypt it.
607 * If fails, complain loudly.
608 *
609 * $old_key would be a value submitted by one of the modules with
610 * the user's old mailbox password. I admin, this is rather dirty,
611 * but efficient. ;)
612 */
b587ac51 613 sqgetGlobalVar('key', $key, SQ_COOKIE);
614 sqgetGlobalVar('onetimepad', $onetimepad, SQ_SESSION);
615
616 sqgetGlobalVar('old_key', $old_key, SQ_POST);
8a9f9d09 617
618 if ($old_key != '') {
619 $clear_key=$old_key;
d112ed5a 620 } else {
621 /**
622 * Get user's password (the key).
623 */
624 $clear_key = OneTimePadDecrypt($key, $onetimepad);
9804bcde 625 }
d112ed5a 626 /**
627 * Invoke the decryption routines.
628 */
7996c920 629 $words=sqspell_crypto_old("decrypt", $clear_key, $words);
d112ed5a 630 /**
631 * See if decryption failed.
632 */
633 if ($words=="PANIC"){
7996c920 634 sqspell_handle_crypt_panic();
635 // script execution stops here.
d112ed5a 636 } else {
637 /**
91e0dccc 638 * OK! Phew. Set the encryption flag to true so we can later on
d112ed5a 639 * encrypt it again before saving to HDD.
640 */
641 $SQSPELL_CRYPTO=true;
9804bcde 642 }
d112ed5a 643 } else {
644 /**
91e0dccc 645 * No encryption is/was used. Set $SQSPELL_CRYPTO to false,
d112ed5a 646 * in case we have to save the dictionary later.
647 */
648 $SQSPELL_CRYPTO=false;
649 }
650 /**
651 * Check if we need to upgrade the dictionary from version 0.2.x
652 * This is going away soon.
653 */
654 if (strstr($words, "Dictionary v0.2")){
655 $words=sqspell_upgradeWordsFile($words);
656 }
657 return $words;
658}
91e0dccc 659
d112ed5a 660/**
7996c920 661 * Saves user's dictionary
662 * Function was replaced in 1.5.1 (sqspell 0.5).
663 * Older function is suffixed with '_old'
664 * @param array $words words that should be stored in dictionary
665 * @param string $lang language
666 */
667function sqspell_writeWords($words,$lang){
668 global $SQSPELL_CRYPTO,$username,$data_dir;
669
670 $sWords = implode(',',$words);
671 if ($SQSPELL_CRYPTO){
672 /**
673 * User wants to encrypt the file. So be it.
674 * Get the user's password to use as a key.
675 */
676 sqgetGlobalVar('key', $key, SQ_COOKIE);
677 sqgetGlobalVar('onetimepad', $onetimepad, SQ_SESSION);
202bcbcc 678
7996c920 679 $clear_key=OneTimePadDecrypt($key, $onetimepad);
680 /**
681 * Try encrypting it. If fails, scream bloody hell.
682 */
683 $save_words = sqspell_crypto("encrypt", $clear_key, $sWords);
684 if ($save_words == 'PANIC'){
685 // FIXME: handle errors here
686
687 }
688 $save_words='{crypt}'.$save_words;
689 } else {
690 $save_words=$sWords;
691 }
692 setPref($data_dir,$username,'sqspell_dict_'.$lang,$save_words);
693}
694
695/**
d112ed5a 696 * Writes user dictionary into the $username.words file, then changes mask
697 * to 0600. If encryption is needed -- does that, too.
698 *
699 * @param $words The contents of the ".words" file to write.
700 * @return void
7996c920 701 * @since 1.5.1 (sqspell 0.5)
702 * @deprecated
d112ed5a 703 */
7996c920 704function sqspell_writeWords_old($words){
d112ed5a 705 global $SQSPELL_WORDS_FILE, $SQSPELL_CRYPTO;
706 /**
707 * if $words is empty, create a template entry by calling the
708 * sqspell_makeDummy() function.
709 */
710 if (!$words){
711 $words=sqspell_makeDummy();
712 }
713 if ($SQSPELL_CRYPTO){
714 /**
715 * User wants to encrypt the file. So be it.
716 * Get the user's password to use as a key.
717 */
b587ac51 718 sqgetGlobalVar('key', $key, SQ_COOKIE);
719 sqgetGlobalVar('onetimepad', $onetimepad, SQ_SESSION);
8a9f9d09 720
d112ed5a 721 $clear_key=OneTimePadDecrypt($key, $onetimepad);
722 /**
723 * Try encrypting it. If fails, scream bloody hell.
724 */
725 $save_words = sqspell_crypto("encrypt", $clear_key, $words);
726 if ($save_words == 'PANIC'){
727 /**
728 * AAAAAAAAH! I'm not handling this yet, since obviously
729 * the admin of the site forgot to compile the MCRYPT support in
730 * when upgrading an existing PHP installation.
731 * I will add a handler for this case later, when I can come up
732 * with some work-around... Right now, do nothing. Let the Admin's
733 * head hurt.. ;)))
734 */
7996c920 735 /** save some hairs on admin's head and store error message in logs */
736 error_log('SquirrelSpell: php does not have mcrypt support');
9804bcde 737 }
d112ed5a 738 } else {
739 $save_words = $words;
740 }
741 /**
742 * Do the actual writing.
743 */
744 $fp=fopen($SQSPELL_WORDS_FILE, "w");
745 fwrite($fp, $save_words);
746 fclose($fp);
747 chmod($SQSPELL_WORDS_FILE, 0600);
748}
91e0dccc 749
7996c920 750/**
751 * Deletes user's dictionary
202bcbcc 752 * Function was modified in 1.5.1 (sqspell 0.5). Older function is suffixed
7996c920 753 * with '_old'
754 * @param string $lang dictionary
755 */
756function sqspell_deleteWords($lang) {
757 global $data_dir, $username;
758 removePref($data_dir,$username,'sqspell_dict_'.$lang);
759}
760
761/**
762 * Deletes user's dictionary when it is corrupted.
763 * @since 1.5.1 (sqspell 0.5)
764 * @deprecated
765 */
766function sqspell_deleteWords_old(){
d112ed5a 767 /**
768 * So I open the door to my enemies,
769 * and I ask can we wipe the slate clean,
770 * but they tell me to please go...
771 * uhm... Well, this just erases the user dictionary file.
772 */
773 global $SQSPELL_WORDS_FILE;
774 if (file_exists($SQSPELL_WORDS_FILE)){
775 unlink($SQSPELL_WORDS_FILE);
776 }
777}
778/**
779 * Creates an empty user dictionary for the sake of saving prefs or
780 * whatever.
781 *
782 * @return The template to use when storing the user dictionary.
7996c920 783 * @deprecated
91e0dccc 784 */
d112ed5a 785function sqspell_makeDummy(){
786 global $SQSPELL_VERSION, $SQSPELL_APP_DEFAULT;
787 $words = "# SquirrelSpell User Dictionary $SQSPELL_VERSION\n"
91e0dccc 788 . "# Last Revision: " . date('Y-m-d')
789 . "\n# LANG: $SQSPELL_APP_DEFAULT\n# End\n";
d112ed5a 790 return $words;
791}
792
793/**
794 * This function checks for security attacks. A $MOD variable is
795 * provided in the QUERY_STRING and includes one of the files from the
796 * modules directory ($MOD.mod). See if someone is trying to get out
797 * of the modules directory by providing dots, unicode strings, or
798 * slashes.
799 *
7996c920 800 * @param string $rMOD the name of the module requested to include.
801 * @return void, since it bails out with an access error if needed.
d112ed5a 802 */
803function sqspell_ckMOD($rMOD){
91e0dccc 804 if (strstr($rMOD, '.')
805 || strstr($rMOD, '/')
d112ed5a 806 || strstr($rMOD, '%')
91e0dccc 807 || strstr($rMOD, "\\")){
d112ed5a 808 echo _("Cute.");
809 exit;
810 }
811}
812
813/**
7996c920 814 * Used to check internal version of SquirrelSpell dictionary
815 * @param integer $major main version number
816 * @param integer $minor second version number
817 * @return boolean true if stored dictionary version is $major.$minor or newer
818 * @since 1.5.1 (sqspell 0.5)
819 */
820function sqspell_check_version($major,$minor) {
821 global $data_dir, $username;
822 // 0.4 version is internal version number that is used to indicate upgrade from
823 // separate files to generic SquirrelMail prefs storage.
824 $sqspell_version=getPref($data_dir,$username,'sqspell_version','0.4');
825
826 $aVersion=explode('.',$sqspell_version);
827
828 if ($aVersion[0] < $major ||
829 ( $aVersion[0] == $major && $aVersion[1] < $minor)) {
830 return false;
831 }
832 return true;
833}
834
835/**
836 * Displays form that allows to enter different password for dictionary decryption.
837 * If language is not set, function provides form to handle older dictionary files.
838 * @param string $lang language
839 * @since 1.5.1 (sqspell 0.5)
840 */
841function sqspell_handle_crypt_panic($lang=false) {
842 if (! sqgetGlobalVar('SCRIPT_NAME',$SCRIPT_NAME,SQ_SERVER))
843 $SCRIPT_NAME='';
844
845 /**
846 * AAAAAAAAAAAH!!!!! OK, ok, breathe!
847 * Let's hope the decryption failed because the user changed his
848 * password. Bring up the option to key in the old password
849 * or wipe the file and start over if everything else fails.
850 *
851 * The _("SquirrelSpell...) line has to be on one line, otherwise
852 * gettext will bork. ;(
853 */
854 $msg = html_tag( 'p', "\n" .
855 '<strong>' . _("ATTENTION:") . '</strong><br />'
856 . _("SquirrelSpell was unable to decrypt your personal dictionary. This is most likely due to the fact that you have changed your mailbox password. In order to proceed, you will have to supply your old password so that SquirrelSpell can decrypt your personal dictionary. It will be re-encrypted with your new password after this. If you haven't encrypted your dictionary, then it got mangled and is no longer valid. You will have to delete it and start anew. This is also true if you don't remember your old password -- without it, the encrypted data is no longer accessible.") ,
857 'left' ) . "\n"
858 . (($lang) ? html_tag('p',sprintf(_("Your %s dictionary is encrypted with password that differs from your current password."),
202bcbcc 859 htmlspecialchars($lang)),'left') : '')
7996c920 860 . '<blockquote>' . "\n"
861 . '<form method="post" onsubmit="return AYS()">' . "\n"
862 . '<input type="hidden" name="MOD" value="crypto_badkey" />' . "\n"
202bcbcc 863 . (($lang) ?
864 '<input type="hidden" name="dict_lang" value="'.htmlspecialchars($lang).'" />' :
7996c920 865 '<input type="hidden" name="old_setup" value="yes" />')
866 . html_tag( 'p', "\n" .
d4e2e61a 867 '<input type="checkbox" name="delete_words" value="ON" id="delete_words" />'
868 . '<label for="delete_words">'
869 . _("Delete my dictionary and start a new one")
870 . '</label><br /><label for="old_key">'
7996c920 871 . _("Decrypt my dictionary with my old password:")
d4e2e61a 872 . '</label><input type="text" name="old_key" id="old_key" size="10" />' ,
7996c920 873 'left' ) . "\n"
874 . '</blockquote>' . "\n"
875 . html_tag( 'p', "\n"
876 . '<input type="submit" value="'
877 . _("Proceed") . ' >>" />' ,
878 'center' ) . "\n"
879 . '</form>' . "\n";
880 /**
881 * Add some string vars so they can be i18n'd.
882 */
2c92ea9d 883 $msg .= "<script type=\"text/javascript\"><!--\n"
7996c920 884 . "var ui_choice = \"" . _("You must make a choice") ."\";\n"
885 . "var ui_candel = \"" . _("You can either delete your dictionary or type in the old password. Not both.") . "\";\n"
886 . "var ui_willdel = \"" . _("This will delete your personal dictionary file. Proceed?") . "\";\n"
887 . "//--></script>\n";
888 /**
889 * See if this happened in the pop-up window or when accessing
890 * the SpellChecker options page.
891 * This is a dirty solution, I agree.
892 * TODO: make this prettier.
893 */
894 if (strstr($SCRIPT_NAME, "sqspell_options")){
895 sqspell_makePage(_("Error Decrypting Dictionary"),
896 "decrypt_error.js", $msg);
897 } else {
898 sqspell_makeWindow(null, _("Error Decrypting Dictionary"),
899 "decrypt_error.js", $msg);
900 }
901 exit;
902}
903
904/**
d112ed5a 905 * SquirrelSpell version. Don't modify, since it identifies the format
91e0dccc 906 * of the user dictionary files and messing with this can do ugly
d112ed5a 907 * stuff. :)
7996c920 908 * @global string $SQSPELL_VERSION
909 * @deprecated
d112ed5a 910 */
d88c744e 911$SQSPELL_VERSION="v0.3.8";
|
__label__pos
| 0.920551 |
blob: 7ed8107b2dc0838240ae52ab6d241d8449468bfa [file] [log] [blame]
#!/usr/bin/env python
# Fill in checksum/size of an option rom, and pad it to proper length.
#
# Copyright (C) 2009 Kevin O'Connor <[email protected]>
#
# This file may be distributed under the terms of the GNU GPLv3 license.
import sys
def alignpos(pos, alignbytes):
mask = alignbytes - 1
return (pos + mask) & ~mask
def checksum(data):
ords = map(ord, data)
return sum(ords)
def main():
inname = sys.argv[1]
outname = sys.argv[2]
# Read data in
f = open(inname, 'rb')
data = f.read()
count = len(data)
# Pad to a 512 byte boundary
data += "\0" * (alignpos(count, 512) - count)
count = len(data)
# Check if a pci header is present
pcidata = ord(data[24:25]) + (ord(data[25:26]) << 8)
if pcidata != 0:
data = data[:pcidata + 16] + chr(count/512) + chr(0) + data[pcidata + 18:]
# Fill in size field; clear checksum field
data = data[:2] + chr(count/512) + data[3:6] + "\0" + data[7:]
# Checksum rom
newsum = (256 - checksum(data)) & 0xff
data = data[:6] + chr(newsum) + data[7:]
# Write new rom
f = open(outname, 'wb')
f.write(data)
if __name__ == '__main__':
main()
|
__label__pos
| 0.989921 |
Joining columns to create new column and adding commas unless they have commas
I have a dataframe like this:
name: othercol: col1: col2: col3: other_col:
aa 100 cc a, NaN 42
bb 100 a, NaN a, 100
I want to join all of the columns together (col1, col2, col3), separated by commas. Unless they already have a comma, and I don’t want comma at the end.
Expected outcome:
name: othercol: col1: col2: col3: other_col: output:
aa 100 cc a, NaN 42 cc, a
bb 100 a, NaN a, 100 a, a
I have tried using this method:
listy = ['col1', 'col2', 'col3', ']
df['output'] = df[listy].apply(lambda i: ', '.join(i[i.notnull()]) if str(i[:-1]) != ',' else ' '.join(i[i.notnull()]), axis = 1)
But I am getting repeated commas:
name: othercol: col1: col2: col3: other_col: output:
aa 100 cc a, NaN 42 cc, a
bb 100 a, NaN a, 100 a,, a
Answer
Add this under your line of code and it should give you the result you want:
df['output']=df['output'].str.replace(',,',', ')
|
__label__pos
| 0.936876 |
Measurements
This tutorial explains how to create, change and remove measurements using the user interface. A measurement describes a value of length, area or volume in regard to the geometry of the 3D space.
Currently, there are three types of measurements available: single, double and arc measurement.
The functionality to create and remove measurements is easily accessible via the user interface.A measurement can be performed by clicking the respective button in the toolbar on the right side.
Single Measurement
Once the single measurement button is clicked, the visualization automatically switches to rendering the topological entities of the 3D data to allow for their selection. For easier interaction, these entities are highlighted when hovered with the mouse cursor.
Clicking on a entity will create a measurement. The measurement contains the picked 3D position, the area of the selected entity and many more information. measure_single_area
When selecting a topological edge, the length of it will be measured.
measure_single_curve
Double Measurement
Interaction-wise the double measurement works similar to the single measurement, but takes two inputs instead of one. Points, shapes and (planar) faces are valid options, when selecting a face.
measure_double Or a point, shape, circular arc, start, end or center point or even an axis, when selecting an edge.
measure_double2
After selecting two values a measurement of the distance between the chosen entities is created and displayed as annotation.
measure_double3
Arc Measurement
An arc measurement takes three inputs and creates and measures a circular arc defined by those three points.
measure_arc
All measurements are collected in the measure tab of the bottom bar.
measure_tab
|
__label__pos
| 0.58482 |
Results 1 to 3 of 3
Thread: Spacing problem with Access Form
1. #1
Thread Starter
New Member
Join Date
Mar 2021
Posts
2
Spacing problem with Access Form
Name: questions.jpg
Views: 120
Size: 17.5 KBName: gap.jpg
Views: 98
Size: 21.5 KB
Hello
I'm new here, so apologies if I've posted in the wrong section. I am not remotely familiar with VB, coming from a perl/web tech background. I am writing an Access 2016 database for my girlfriend who owns a care agency. My problem involves the use of VB in the forms section.
The form contains a series of questions, Each question has a checkbox which when clicked drops down a further series of questions and another checkbox with further questions. I am using VB to control the actions of the checkboxes i.e hiding the questions underneath the main question. Fully expanded the form looks like (questions.jpg attached), the second question is underneath the last box.
When the checkboxes are not expanded, I want the second question to be underneath the first question. What I am actually getting is the second question halfway down the page (gap.jpg attached). Could somebody point me in the right direction to achieve this. Can it even be done by adding code to the VB script I am using? Code below.
Thank you in advance.
Code:
Option Compare Database
Private Sub Form_Open(Cancel As Integer)
'this runs both buttons on open this just syncs the code as it flip flops visibility
Call BreathingProbs_Click
Call CirculatoryProbs_Click
End Sub
Private Sub BrAss_Click()
'toggles visibility of text boxes on button press
If Me.BrAss = True Then BrRiskRating.Visible = True
BrPaR.Visible = True
BrRiskRed.Visible = True
BrAction.Visible = True
If Me.BrAss = False Then
BrRiskRating.Visible = False
BrPaR.Visible = False
BrRiskRed.Visible = False
BrAction.Visible = False
End If
End Sub
Private Sub BreathingProbs_Click()
'toggles visibility of text boxes on button press
If Me.BreathingProbs = True Then BrDetails.Visible = True
BrDetailsTxt.Visible = True
BrLevel.Visible = True
BrAss.Visible = True
Call BrAss_Click
If Me.BreathingProbs = False Then
BrDetails.Visible = False
BrDetailsTxt.Visible = False
BrLevel.Visible = False
BrAss.Visible = False
BrRiskRating.Visible = False
BrPaR.Visible = False
BrRiskRed.Visible = False
BrAction.Visible = False
'last 4 false commands clear up the BrAss toggle as if set to true and you toggle the BrethProbs to false they will get left on screen as the BrAss was not toggled to clean them up
End If
End Sub
'Private Sub Form_Open(Cancel As Integer)
'this runs both buttons on open this just syncs the code as it flip flops visibility
'Call CirculatoryProbs_Click
'End Sub
Private Sub CirAss_Click()
'toggles visibility of text boxes on button press
If Me.CirAss = True Then CirRiskRating.Visible = True
CirPar.Visible = True
CirRiskRed.Visible = True
CirAction.Visible = True
If Me.CirAss = False Then
CirRiskRating.Visible = False
CirPar.Visible = False
CirRiskRed.Visible = False
CirAction.Visible = False
End If
End Sub
Private Sub CirculatoryProbs_Click()
'toggles visibility of text boxes on button press
If Me.CirculatoryProbs = True Then CirDetails.Visible = True
CirDetailstxt.Visible = True
CirLevel.Visible = True
CirAss.Visible = True
Call CirAss_Click
If Me.CirculatoryProbs = False Then
CirDetails.Visible = False
CirDetailstxt.Visible = False
CirLevel.Visible = False
CirAss.Visible = False
CirRiskRating.Visible = False
CirPar.Visible = False
CirRiskRed.Visible = False
CirAction.Visible = False
'last 4 false commands clear up the CirAss toggle as if set to true and you toggle the BrethProbs to false they will get left on screen as the BrAss was not toggled to clean them up
End If
End Sub
Last edited by Dazz45; Mar 4th, 2021 at 12:26 PM.
2. #2
3. #3
Thread Starter
New Member
Join Date
Mar 2021
Posts
2
Re: Spacing problem with Access Form
Thanks jdc2000, I'll check those links out
Posting Permissions
• You may not post new threads
• You may not post replies
• You may not post attachments
• You may not edit your posts
•
Click Here to Expand Forum to Full Width
|
__label__pos
| 0.719083 |
blob: de681b6c595bd4081ef833eec1b8d6592a7b1048 [file] [log] [blame]
/*
* This file is part of the coreboot project.
*
* Copyright (C) 2007 Advanced Micro Devices, Inc.
* Copyright (C) 2008 LiPPERT Embedded Computers GmbH
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/* Based on romstage.c from AMD's DB800 and DBM690T mainboards. */
#include <stdlib.h>
#include <stdint.h>
#include <spd.h>
#include <device/pci_def.h>
#include <arch/io.h>
#include <device/pnp_def.h>
#include <arch/hlt.h>
#include <console/console.h>
#include "cpu/x86/bist.h"
#include "cpu/x86/msr.h"
#include <cpu/amd/lxdef.h>
#include "southbridge/amd/cs5536/cs5536.h"
#include "southbridge/amd/cs5536/early_smbus.c"
#include "southbridge/amd/cs5536/early_setup.c"
#include "superio/ite/it8712f/early_serial.c"
/* Bit0 enables Spread Spectrum, bit1 makes on-board SSD act as IDE slave. */
#if CONFIG_ONBOARD_IDE_SLAVE
#define SMC_CONFIG 0x03
#else
#define SMC_CONFIG 0x01
#endif
static const unsigned char spdbytes[] = { // 4x Promos V58C2512164SA-J5I
0xFF, 0xFF, // only values used by Geode-LX raminit.c are set
[SPD_MEMORY_TYPE] = SPD_MEMORY_TYPE_SDRAM_DDR, // (Fundamental) memory type
[SPD_NUM_ROWS] = 0x0D, // Number of row address bits [13]
[SPD_NUM_COLUMNS] = 0x0A, // Number of column address bits [10]
[SPD_NUM_DIMM_BANKS] = 1, // Number of module rows (banks)
0xFF, 0xFF, 0xFF,
[SPD_MIN_CYCLE_TIME_AT_CAS_MAX] = 0x50, // SDRAM cycle time (highest CAS latency), RAS access time (tRAC) [5.0 ns in BCD]
0xFF, 0xFF,
[SPD_REFRESH] = 0x82, // Refresh rate/type [Self Refresh, 7.8 us]
[SPD_PRIMARY_SDRAM_WIDTH] = 64, // SDRAM width (primary SDRAM) [64 bits]
0xFF, 0xFF, 0xFF,
[SPD_NUM_BANKS_PER_SDRAM] = 4, // SDRAM device attributes, number of banks on SDRAM device
[SPD_ACCEPTABLE_CAS_LATENCIES] = 0x1C, // SDRAM device attributes, CAS latency [3, 2.5, 2]
0xFF, 0xFF,
[SPD_MODULE_ATTRIBUTES] = 0x20, // SDRAM module attributes [differential clk]
[SPD_DEVICE_ATTRIBUTES_GENERAL] = 0x40, // SDRAM device attributes, general [Concurrent AP]
[SPD_SDRAM_CYCLE_TIME_2ND] = 0x60, // SDRAM cycle time (2nd highest CAS latency) [6.0 ns in BCD]
0xFF,
[SPD_SDRAM_CYCLE_TIME_3RD] = 0x75, // SDRAM cycle time (3rd highest CAS latency) [7.5 ns in BCD]
0xFF,
[SPD_tRP] = 60, // Min. row precharge time [15 ns in units of 0.25 ns]
[SPD_tRRD] = 40, // Min. row active to row active [10 ns in units of 0.25 ns]
[SPD_tRCD] = 60, // Min. RAS to CAS delay [15 ns in units of 0.25 ns]
[SPD_tRAS] = 40, // Min. RAS pulse width = active to precharge delay [40 ns]
[SPD_BANK_DENSITY] = 0x40, // Density of each row on module [256 MB]
0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
[SPD_tRFC] = 70 // SDRAM Device Minimum Auto Refresh to Active/Auto Refresh [70 ns]
};
static inline int spd_read_byte(unsigned int device, unsigned int address)
{
if (device != DIMM0)
return 0xFF; /* No DIMM1, don't even try. */
#if CONFIG_DEBUG_SMBUS
if (address >= sizeof(spdbytes) || spdbytes[address] == 0xFF) {
print_err("ERROR: spd_read_byte(DIMM0, 0x");
print_err_hex8(address);
print_err(") returns 0xff\n");
}
#endif
/* Fake SPD ROM value */
return (address < sizeof(spdbytes)) ? spdbytes[address] : 0xFF;
}
/* Send config data to System Management Controller via SMB. */
static int smc_send_config(unsigned char config_data)
{
if (smbus_check_stop_condition(SMBUS_IO_BASE))
return 1;
if (smbus_start_condition(SMBUS_IO_BASE))
return 2;
if (smbus_send_slave_address(SMBUS_IO_BASE, 0x50)) // SMC address
return 3;
if (smbus_send_command(SMBUS_IO_BASE, 0x28)) // set config data
return 4;
if (smbus_send_command(SMBUS_IO_BASE, 0x01)) // data length
return 5;
if (smbus_send_command(SMBUS_IO_BASE, config_data))
return 6;
smbus_stop_condition(SMBUS_IO_BASE);
return 0;
}
#include "northbridge/amd/lx/raminit.h"
#include "northbridge/amd/lx/pll_reset.c"
#include "northbridge/amd/lx/raminit.c"
#include "lib/generic_sdram.c"
#include "cpu/amd/geode_lx/cpureginit.c"
#include "cpu/amd/geode_lx/syspreinit.c"
#include "cpu/amd/geode_lx/msrinit.c"
static const u16 sio_init_table[] = { // hi=data, lo=index
0x0707, // select LDN 7 (GPIO, SPI, watchdog, ...)
0x072C, // VIN6 enabled, FAN4/5 disabled, VIN7,VIN3 internal
0x1423, // don't delay PoWeROK1/2
0x9072, // watchdog triggers PWROK, counts seconds
#if !CONFIG_USE_WATCHDOG_ON_BOOT
0x0073, 0x0074, // disarm watchdog by changing 56 s timeout to 0
#endif
0xBF25, 0x172A, 0xF326, // select GPIO function for most pins
0xFF27, 0xDF28, 0x2729, // (GP45=SUSB, GP23,22,16,15=SPI, GP13=PWROK1)
0x66B8, 0x0CB9, // enable pullups on SPI, RS485_EN
0x07C0, // enable Simple-I/O for GP12-10= RS485_EN2,1, LIVE_LED
0x07C8, // config GP12-10 as output
0x2DF5, // map Hw Monitor Thermal Output to GP55
0x08F8, // map GP LED Blinking 1 to GP10=LIVE_LED (deactivate Simple I/O to use)
};
/* Early mainboard specific GPIO setup. */
static void mb_gpio_init(void)
{
int i;
/* Init Super I/O WDT, GPIOs. Done early, WDT init may trigger reset! */
it8712f_enter_conf();
for (i = 0; i < ARRAY_SIZE(sio_init_table); i++) {
u16 val = sio_init_table[i];
outb((u8)val, SIO_INDEX);
outb(val >> 8, SIO_DATA);
}
it8712f_exit_conf();
}
void main(unsigned long bist)
{
int err;
static const struct mem_controller memctrl[] = {
{.channel0 = {DIMM0, DIMM1}}
};
SystemPreInit();
msr_init();
cs5536_early_setup();
/*
* Note: Must do this AFTER the early_setup! It is counting on some
* early MSR setup for CS5536.
*/
it8712f_enable_serial(0, CONFIG_TTYS0_BASE); // Does not use its 1st parameter
mb_gpio_init();
console_init();
/* Halt if there was a built in self test failure */
report_bist_failure(bist);
pll_reset();
cpuRegInit(0, DIMM0, DIMM1, DRAM_TERMINATED);
/* bit1 = on-board IDE is slave, bit0 = Spread Spectrum */
if ((err = smc_send_config(SMC_CONFIG))) {
print_err("ERROR ");
print_err_char('0'+err);
print_err(" sending config data to SMC\n");
}
sdram_initialize(1, memctrl);
/* Memory is setup. Return to cache_as_ram.inc and continue to boot. */
return;
}
|
__label__pos
| 0.887699 |
Hosting and Domain Management for Healthcare
Hosting and Domain Management for Healthcare
WHAT IS A WEBSITE DOMAIN?
A website domain is a unique name that identifies a website on the internet. It serves as the website's digital address, allowing users to access the website by typing the domain name into their web browser. A domain is composed of two parts: the actual name and the domain extension (example: .com, .org, .net, .ca). Domain names are registered and owned by individuals or organizations, and they must be renewed periodically. Choosing a domain name carefully is important for a website's branding, visibility, and credibility online.
You can buy your own domain and bring it to us, or we can buy it for you. See pricing here.
what is website domains
WHAT IS WEBSITE HOSTING?
Website hosting is a service that allows individuals or businesses to store their website files on a remote server, making them accessible to users over the internet. A website hosting provider typically offers storage space, bandwidth, and other resources necessary for a website to function and be viewed online. Websites are hosted on servers, which are powerful computers that are connected to the internet 24/7. When a user types in a website's domain name or clicks on a link, their request is sent to the hosting server, which retrieves the website files and delivers them to the user's web browser, allowing them to view the website. Website hosting is essential for making a website accessible to visitors on the internet.
All of these things are services offered by Web Health. See pricing here.
what is website hosting
Let's Make a Website.
Every website is carefully tailored to your individual needs.
We'll provide the industry experience and you bring your best imagination and vision!
|
__label__pos
| 0.88208 |
Duplicate binaries in Erlang process info
Hello, I’m trying to figure out how much binary memory a process is holding onto by summing the results from Process.info(pid, :binary) , but it’s giving me inaccurate results. On one machine with 128GB of RAM it says a process is using over 1TB of memory.
I think I’ve tracked the problem down to Process.info returning a list that contains the same binaries multiple times.
Here’s an Elixir script that demonstrates what I’m seeing. The “junk_file” is a file I created that has a bunch of JSON objects with one object per line.
result =
Stream.iterate(0, & &1 + 1)
|> Stream.take(10_000)
|> Flow.from_enumerable(max_demand: 1)
|> Flow.flat_map(fn _ ->
File.read!("junk_file") |> String.split("\n")
end)
|> Enum.to_list()
system_binary_bytes =
:erlang.memory() |> Keyword.get(:binary)
{:binary, binaries} =
Process.info(self(), :binary)
binary_ids =
Enum.map(binaries, &elem(&1, 0))
binary_bytes =
Enum.map(binaries, &elem(&1, 1))
|> Enum.sum()
unique_binary_bytes =
Enum.uniq_by(binaries, fn {id, _, _} -> id end)
|> Enum.map(&elem(&1, 1))
|> Enum.sum()
unique_ids =
MapSet.new(binary_ids)
unique_ids_times_ref =
Enum.uniq_by(binaries, fn {id, _, _} -> id end)
|> Enum.map(& elem(&1, 2))
|> Enum.sum()
IO.puts("binary_ids #{Enum.count(binary_ids)}")
IO.puts("unique_ids #{Enum.count(unique_ids)}")
IO.puts("binary_bytes #{binary_bytes}")
IO.puts("unique_bytes #{unique_binary_bytes}")
IO.puts("unique_ids_times_ref #{unique_ids_times_ref}")
IO.puts("system_binary_bytes #{system_binary_bytes}")
Enum.count(result)
Here are the results from an example run:
binary_ids 2166004
unique_ids 10003
binary_bytes 373817119944
unique_bytes 1725843360
unique_ids_times_ref 2166009
system_binary_bytes 1731508128
As you can see, quite a few ids are repeated and summing the reported memory of each binary after deduplicating them by binary id results in a total much closer to the system total.
Is it safe to assume that binary ids are unique and can be used to deduplicate the list? Is this the correct way to resolve my problem?
While I am not sure what exactly is it that you are trying to achieve – sorry for that – have you taken a look at these functions?
• :erts_debug.size(term)
• :erts_debug.flat_size(term)
• :erts_debug.size_shared(term)
1 Like
|
__label__pos
| 0.974495 |
The Hidden Dangers Lurking Behind Your Favorite Social Apps
The landscape of social media is expanding rapidly, with more individuals engaging in the sharing of posts, videos, and images, not to mention the lively interaction that characterizes these platforms. Nevertheless, the growing concern for privacy is tangible, as users become increasingly vigilant about the confidentiality of their personal details.
The content they choose to share and the information handling by social networks are under close scrutiny. Despite stringent privacy regulations, there remains a lingering threat to the security of sensitive data.
Those in charge of managing social media accounts, including social media managers, content creators, and entrepreneurs, bear the responsibility of safeguarding data privacy on diverse channels. Recognizing the privacy challenges present within social media is a crucial initial step.
Following this recognition, it’s imperative to take appropriate measures to secure privacy while using these platforms. Within this guide, we shall outline the prevalent privacy concerns encountered on social media and discuss how to address them effectively.
change location on hinge
Social Media Privacy Issues
Data Mining
It takes surprisingly little for a thief to hijack one’s identity—a few snippets of personal data harvested from usually innocuous sources can suffice. Social media platforms, rich with user details, are often the hunting grounds where cybercriminals initiate their schemes.
Commonly accessible data such as usernames, home addresses, and contact information paves the way for targeted phishing expeditions.
Third-Party Data Sharing
Numerous platforms collaborate with external services, exchanging user information in the process. This practice permits the seamless incorporation of various services but also raises considerable concerns about privacy.
Frequently, users inadvertently authorize the dissemination or commercialization of their personal data to these entities. Therefore, when agreeing to a Terms of Service contract or consenting to cookies, it’s imperative to scrutinize the details of what you’re agreeing to.
Harassment, Cyberbullying
Social media platforms, while being hubs of connectivity, can unfortunately serve as mediums for cyberbullying and cyberstalking. The individuals behind these acts aren’t necessarily skilled hackers; they can be overly persistent coworkers utilizing intimidation through messages, or your child’s peers flooding them with hurtful comments. Victims can also include individuals targeted by ex-partners who choose to disseminate sensitive personal details online, or worse, compromise their social media accounts to reach out to their network under a false identity, attempting to inflict reputational damage.
Privacy Setting Loopholes
Social media platforms often give users a false sense of privacy. Consider a scenario where you post content intended for just one friend’s eyes. If your friend decides to share this content, it instantly becomes accessible to a broader audience—namely, their entire friend list.
What’s more, participating in supposedly private groups doesn’t always ensure confidentiality. Your posts and comments within these groups could potentially show up in search results, making them more public than you might initially think.
Malware and Viruses
Social media channels have become fertile grounds for the proliferation of malware and viruses. These malicious entities are capable of hijacking sensitive information, compromising system performance, or fully seizing control of users’ computers. The insidious nature of these threats means that a single compromised social media account can serve as a conduit, propelling malware not only through the invaded account but also across the network of contacts associated with it. Cyber offenders leverage this method to amplify the spread of digital contagions, amplifying the risk to a broader audience.
How to Avoid Data Privacy Concerns When Using Social Networks?
Use VPN
If you use a VPN, you encrypt your data and make it anonymous. For example, you can use VPN for Hinge to prevent surveillance and personal data leakage. You can even change location on Hinge via VPN so that no one can track you. The main condition for success is a VPN from a good provider such as VeePN. In this case, you can anonymize, encrypt data, change location, and even protect yourself from viruses.
Don’t Reveal Too Much Information About Yourself
When setting up accounts, share just what’s essential. It’s often not required to include details like your address or birth date.
Avoid Public Devices
For your security, avoid linking your smartphone to publicly accessible computers, as they are often hotspots for viruses and malware. Refrain from entering sensitive information such as credit card details or social media credentials on any shared computer. Always remember to sign out of all accounts after using a communal machine to ensure your privacy is maintained.
Double Check
Consider carefully before signing up for a new social media platform, particularly if it’s based outside of the United States or Europe, as the data privacy regulations may not be as rigorous. Every new account presents extra risks, so avoid sharing personal information if it’s not necessary. Should you choose to proceed, ensure the platform’s security and credibility by researching the service provider and reviewing user feedback.
Conclusion
The only way to protect yourself from the many risks associated with social media is to be alert. You need to double-check everything, think ahead about the data you disclose and use additional tools for protection – VPN.
No related posts found...
Leave a Reply
Your email address will not be published. Required fields are marked *
|
__label__pos
| 0.731198 |
Workplace training E-learning
8 minute read
Types of Learning Management Systems Explained
Hugo Britt
Hugo Britt
Are you considering implementing a Learning Management System (LMS) in your organization, but you’re unsure of what type you might need?
In this article, we look at what an LMS is, what they are capable of, and cover some common learning management system examples in use today.
What is a learning management system?
A learning management system (LMS) is a one-stop-shop or platform for learning and development opportunities. It is an easy way to deploy e-learning options such as online courses to employees or other users and then track their progress.
Organizations can use an LMS to add, create, and administer courses, assign them to specific people or teams, monitor progress, measure performance, and generate detailed reports.
Is a learning management system the same as eLearning software?
A learning management system is the platform, while eLearning software powers the online courses that sit within that platform. For this reason, an LMS is sometimes referred to as an eLearning platform.
Learning Management System examplesThe concept is similar to that of the smartphone. Rather than attempting to build a single system (like early Nokias and Motorolas), modern IoS and Android phones provide a platform or ecosystem which can host apps developed by other organizations.
This move to the platform model reflects a wider trend wherein business activity will shift to an ecosystem. A McKinsey report on the platform economy predicted 30% of global economic activity (that’s $60 trillion) could be mediated by digital platforms within the next six years.
Many LMS providers offer much more than a basic platform that hosts third-party content. They may also:
• Allow users to create their own courses
• Enable instructors to create teams and assign courses to them
• Allow users to communicate with each other within the system
• Allow users to set up and track their own goals
• Provide visibility on what others within the organization are learning (social learning
• Gamify the learning experience for users
• Provide content storage
• Provide certification
• Provide real-time reporting and analytics.
Third-party providers make sure their software products play well with LMS by building them to be SCORM-compliant. SCORM (Shareable Content Object Reference Model) is a way of standardizing the way eLearning courses are authored. Without SCORM-conformant LMSs and training content, shareability and integration would be a major challenge. Other formats include xAPI, AICC, and CM15.
Learning management system examples
LMSs can come in several shapes and sizes. Here are some commonly used learning management system examples:
Cloud-based LMS
“Cloud-based” systems can be accessed from anywhere because they do not require specific hardware or software to be installed on the users’ computer. Instead, users log on via a web portal. Benefits of the Cloud model include low start-up costs, easy implementation, and automatic updates. Cloud environments provide a high level of cybersecurity.
A study by Capterra found that 87% of LMS buyers opted for Cloud-based systems rather than on-premise hosting.
Accessible anytime from anywhere, cloud-based LMSs have proven vital in continuing training and education during the COVID-19 crisis, while companies with on-premise hardware and software have had more difficulty.
Software-as-a-Service (SaaS)
Cloud-based SaaS means software is licensed on a subscription basis and is hosted centrally by the software provider. A common pricing model will offer different levels based on the number of users, which means they can be scaled fast as the user base grows or shrinks. SaaS is also known as on-demand software, web-based software, and hosted software.
Open-source LMS
An open-source LMS means the creators have made its source code available for any developer or user to modify for any purpose. There are no licensing fees, but this does not necessarily mean it is free. There may be a cost involved in downloading the software.
Open-source is a popular option with organizations that want to customize the source code to suit their eLearning needs, or for businesses that want to avoid ongoing license costs.
Examples of open-source software you may be familiar with outside the LMS space are the web browser Mozilla Firefox and the website creation platform WordPress. Both of these platforms allow you to modify and redistribute the source code.
Free LMS
“Freemium” learning management systems often come with limited courses and other features, but they can be an ideal entry point into LMS for SMEs with budget constraints.
A popular example of a freemium product is the music streaming service Spotify, which offers free and paid options. Freemium LMSs function in a similar way, where they are free up to a certain number of features or users, beyond which the business must purchase a subscription.
The GoSkills LMS is free for an unlimited number of users, with optional upgrades for off-the-shelf courses and enterprise-level features.
training tab
Proprietary LMS
Proprietary learning management systems are basically the opposite of open-source systems. Built by a single company, the software is closed-source, and users cannot change the source code.
A proprietary LMS is usually a “full-package” service, with technical support teams and managed upgrades paid for by subscription and licensing fees. GoSkills is an example of a proprietary, cloud-based, SaaS LMS.
Types of courses
There is no one-size-fits-all learning method in LMSs. To choose the best eLearning format for your organization, ask yourself when, where, and how often learners are likely to need the training. Ask yourself whether the training will stand alone or be part of a larger course of study.
Take into account the technical know-how of your training team and determine if they have the skill-set required to create custom courses or if off-the-shelf training would be more convenient. Consider the costs of different formats – for example, instructor-led courses tend to be the most expensive option.
Depending on the content being shared, course options include:
• Video-based courses (these could be purchased off-the-shelf or spend time to create your own)
• Instructor-led classroom-style courses
• Courses that link to external resources (for example, a survey hosted on Google Docs)
• Custom courses based on SCORM, xAPI, and other common digital course formats
• Links to virtual training (for example, a Zoom training session or presentation).
Popular applications include:
Get in touch
A learning management system provides a platform on which to manage all your learning needs in one place. Out of all the learning management system examples listed above, where should you start?
Start training your team with GoSkills, a powerful LMS designed to help your organization streamline your learning programs with bite-sized courses.
It's completely free to sign up and add an unlimited number of learners. Sign up and start training your team today!
A better way to train
It's easier than ever to track and manage your team's training with the GoSkills LMS.
Try for free
Hugo Britt
Hugo Britt
Hugo Britt is a freelance content writer who believes that every topic is fascinating if you dig deeply enough. Hugo is the co-founder of content marketing agency Discontent.
No comments
LoginSign up
|
__label__pos
| 0.590918 |
Uploaded image for project: 'JDK'
1. JDK
2. JDK-7017837
Compiler binds base class incorrectly (shortcoming of base circularity spec)
XMLWordPrintable
Details
• Cause Known
• x86
• windows_7
Description
FULL PRODUCT VERSION :
1.6.0_18
ADDITIONAL OS VERSION INFORMATION :
Windows 7 Enterprise 64-bit
A DESCRIPTION OF THE PROBLEM :
Javac (any version) compiles the attached code without error, but when Main is run it prints "X.Q" instead of "A<T>.X.Q" as required by the language specification. I think this is really a shortcoming of the specification for circular class declarations, but demonstrating my point is easier if I just start by reporting it as a compiler bug.
STEPS TO FOLLOW TO REPRODUCE THE PROBLEM :
Compile and run attached program
EXPECTED VERSUS ACTUAL BEHAVIOR :
EXPECTED -
A<T>.X.Q
-or-
Compilation error complaining about base class circularity.
REPRODUCIBILITY :
This bug can be reproduced always.
---------- BEGIN SOURCE ----------
class A<T> {
static class X {
static class Q {
public static void main() {
System.out.println("A<T>.X.Q");
}
}
}
}
class B extends A<B.Y.Q> {
static class Y extends X { } // X here is inherited from A
}
class X {
static class Q {
public static void main() {
System.out.println("X.Q");
}
}
}
class Main {
public static void main(String[] args) {
B.Y.Q.main();
}
}
---------- END SOURCE ----------
Attachments
Issue Links
Activity
People
dlsmith Dan Smith
webbuggrp Webbug Group
Votes:
0 Vote for this issue
Watchers:
3 Start watching this issue
Dates
Created:
Updated:
Imported:
Indexed:
|
__label__pos
| 0.999825 |
#1
1. No Profile Picture
Registered User
Devshed Newbie (0 - 499 posts)
Join Date
Jan 2013
Posts
4
Rep Power
0
Memory of Python
hello all i am new in python community. i study python couple of months and i try to make to make a program with WxPython (GUI)
program name : Crypter And Decrypter
this is not something new there are a lot of copies in web so i would like to create mine
all was very good in first try and the program works great the idea was to set an algorith like :
read a text and then :
'a'='0x'
'b'='6s'
....
....
so to encrypt the text...
but that was kind of easy in decryption progress so i say to make it litle more complex.
and the program was great too but then i discover something .. that the program was great only with small texts and crashing with big texts like : aDSAKJSFKLSABFHASKL HDFKLASKLDFKL NALSHFKLBKLWAJEFKLHDSKNFLHAKBSLJKHFRWHLFKHSDKLAHFKLHASKLDHFSKLADHFKLHASKLDHFLNAWJFHIDSHVUOHAISNFOU SDHFB AWNFIUSDIFHOASD I etc..
so the questing is the problem is my program or the python has some errors with the memory and is crashing ?
if someone want to check my program let me know if it is allowed to put a link here
sorry about my bad english i am from Greece so pls be lenient
you will new the image below because i use it in the program :
http://img694.imageshack.us/img694/2461/hered.jpg
for some reasons i can use the Insert Image button :P
the code :
Code:
import wx
# this def find the location of the (code or the message) letter
def location(x,letters):
i = 0
while True :
if x == letters[i]:
break
i = i + 1
if i == len(letters) and x != letters[i]:
return 0
return i
# this def just put the first item of the list to the end of the list
def algorith(codes):
for i in range(0,len(codes)-1):
k=codes[i]
codes[i]=codes[i+1]
codes[i+1]=k
# main program all inside here! ;)
class main(wx.Frame):
def __init__(self,parent,id):
# Create Panel ( backGround )
wx.Frame.__init__(self,parent,id,'Crypter & Decrypter',size = (805,628),style=wx.SYSTEM_MENU | wx.CAPTION | wx.CLOSE_BOX)
panel=wx.Panel(self)
# take the image from the working directory
image_file = 'here.jpg'
bmp1 = wx.Image(image_file, wx.BITMAP_TYPE_ANY).ConvertToBitmap()
# image's upper left corner anchors at panel coordinates (0, 0)
self.bitmap1 = wx.StaticBitmap(self, -1, bmp1, (0, 0))
# Create 3 buttons for Task Choice
button1=wx.Button(self.bitmap1,label="Task 1",pos=(100 ,350),size=(100,50))
button2=wx.Button(self.bitmap1,label="Task 2",pos=(270 ,350),size=(100,50))
button3=wx.Button(self.bitmap1,label="Task 3",pos=(430 ,350),size=(100,50))
self.Bind(wx.EVT_BUTTON,self.TextCryption,button1)
self.Bind(wx.EVT_BUTTON,self.TextDecryption,button2)
self.Bind(wx.EVT_BUTTON,self.closebutton,button3)
# Close Button Def for button 3
def closebutton(self,event):
self.Close(True)
# def for event in button 1!
def TextCryption(self,event):
found=[]
F=[]
codes = ['Bp','Pc','{a','[A',']s','}s','S:','"s','d;',';x',';X','<s','S>',':)',':P',':d',':(','G^','j&','l@','@l','p$','F!','!F','(D',')D','A$','$A','%A','A%','u*','A0','4A','9C','9F','4Q','5(','4K','9W','WW','X4','0S','0)','XX','V8','7W','W7','QQ','9Q','SS','AZ','XP','1^','1V','0B','C0','0A','0a','a0','4a','9c','9f','4q','54','4k','9w','ww','x4','0s','09','xx','v8','7w','w7','qq','9q','ss','aZ','xp','1S','1v','0b','c0','00','s1','1s','s2','2s','s3','3s','s4','4s','s5','5s']
letters = ['\'','\\','[','{','}',']','|',';',':','"',',','<','.','>','/','?','!','@','#','$','%','^','&','*','(',')','_','-','=','+','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B','N','M','Q','q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m',' ','0','1','2','3','4','5','6','7','8','9']
box=wx.TextEntryDialog(None,"Just put your text below","Cryption progress","")
if box.ShowModal()==wx.ID_OK:
message = box.GetValue()
cryption = ''
for i in range(0,len(message)):
if message[i] in found :
F.append(i)
algorith(codes)
cryption = cryption + codes[location(message[i],letters)]
if message[i] not in found:
found.append(message[i])
topothesia='' # topothesia = location in greek.. i just want to put in front of the code the location of the repeating letter and then XXXX for example
# code will be : -1-5-10-20XXXXaksdkhqklhqw this is useful for decryption because now i know that the code list has changed 4 times in
# location 1,5,10 and 20
for i in range(0,len(F)):
topothesia=topothesia+'-'+str(F[i]) # put - and the location of the reapetable letter ( my english sucks :P )
topothesia=topothesia+'XXXX'
cryption=topothesia+cryption
box=wx.MessageDialog(None,"The code has Been Copied to the clipboard just Paste it somewhere",'Cryption Finished',wx.OK)
answer=box.ShowModal()
self.dataObj = wx.TextDataObject()
self.dataObj.SetText(cryption)
if wx.TheClipboard.Open():
wx.TheClipboard.SetData(self.dataObj)
wx.TheClipboard.Close()
# def for event in button 2!
def TextDecryption(self,event):
found=[]
codes = ['Bp','Pc','{a','[A',']s','}s','S:','"s','d;',';x',';X','<s','S>',':)',':P',':d',':(','G^','j&','l@','@l','p$','F!','!F','(D',')D','A$','$A','%A','A%','u*','A0','4A','9C','9F','4Q','5(','4K','9W','WW','X4','0S','0)','XX','V8','7W','W7','QQ','9Q','SS','AZ','XP','1^','1V','0B','C0','0A','0a','a0','4a','9c','9f','4q','54','4k','9w','ww','x4','0s','09','xx','v8','7w','w7','qq','9q','ss','aZ','xp','1S','1v','0b','c0','00','s1','1s','s2','2s','s3','3s','s4','4s','s5','5s']
letters = ['\'','\\','[','{','}',']','|',';',':','"',',','<','.','>','/','?','!','@','#','$','%','^','&','*','(',')','_','-','=','+','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B','N','M','Q','q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m',' ','0','1','2','3','4','5','6','7','8','9']
box=wx.TextEntryDialog(None,"Put the code Below For Decryption","Decryption progress","")
if box.ShowModal()==wx.ID_OK:
A=[]
code = box.GetValue()
for i in range(0,len(code)):
if code[i] =='X' and code[i+1] =='X' and code[i+2] =='X' and code[i+3] =='X':
for p in range(0,i):
l=''
while code[p]!='-' and code[p] !='X': # i am taking only the numbers without '-'
l=l+code[p]
p=p+1
if l!='':
A.append(int(l))
if len(A)>1:
# i do this below because the code is puting more that i need ... for example if the code is -20-15-10 the program puts on A
# the 20 and 0 and 15 and 5 and 10 and 0 and i want only the 20 15 10 ;) i hope you understand
if A[len(A)-1] < A[len(A)-2]:
A.remove(A[len(A)-1])
A.sort() # to make sure that all items are in the right order
edw=[]
for K in range(0,len(code)):
edw.append(code[K])
code=''
for X in range(i+4,len(edw)):
code=code+edw[X]
break
decryption = ''
m = 0
q=0
for i in range(0,(len(code)/2)): # len(code)/2 because one letter = 2 letters in cryption
if code[i+m:i+2+m] not in codes:
decryption='Wrong Code!' # if someone just something that's not in code list just print Wrong code ;)
break
else:
if A !=[] and q < len(A):
if i == int(A[q]):
algorith(codes)
q=q+1
decryption = decryption + letters[location(code[i+m:i+2+m],codes)]
m = m + 1
box=wx.MessageDialog(None,decryption,'Decryption Finished',wx.OK)
answer=box.ShowModal()
if __name__=='__main__':
app=wx.App()
frame=main(parent=None,id=-1)
frame.Show()
app.MainLoop()
2. #2
3. Contributing User
Devshed God 1st Plane (5500 - 5999 posts)
Join Date
Aug 2011
Posts
5,796
Rep Power
508
Not having wxpython, I extracted TextCryption from your program, not sure I faithfully reproduced it.
Code:
# this def find the location of the (code or the message) letter
def location(x,letters):
i = 0
while not (i == len(letters) and x != letters[i]):
if x == letters[i]:
return i
i += 1
return 0
# this def just put the first item of the list to the end of the list
def algorith(codes):
for i in range(0,len(codes)-1):
k=codes[i]
codes[i]=codes[i+1]
codes[i+1]=k
def TextCryption(message):
found=[]
F=[]
codes = ['Bp','Pc','{a','[A',']s','}s','S:','"s','d;',';x',';X','<s','S>',':)',':P',':d',':(','G^','j&','l@','@l','p$','F!','!F','(D',')D','A$','$A','%A','A%','u*','A0','4A','9C','9F','4Q','5(','4K','9W ','WW','X4','0S','0)','XX','V8','7W','W7','QQ','9Q','SS','AZ','XP','1^','1V','0B','C0','0A','0a','a0 ','4a','9c','9f','4q','54','4k','9w','ww','x4','0s','09','xx','v8','7w','w7','qq','9q','ss','aZ','xp ','1S','1v','0b','c0','00','s1','1s','s2','2s','s3','3s','s4','4s','s5','5s']
letters = ['\'','\\','[','{','}',']','|',';',':','"',',','<','.','>','/','?','!','@','#','$','%','^','&','*','(',')','_','-','=','+','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B ','N','M','Q','q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c ','v','b','n','m',' ','0','1','2','3','4','5','6','7','8','9']
cryption = ''
for i in range(0,len(message)):
if message[i] in found :
F.append(i)
algorith(codes)
cryption += codes[location(message[i],letters)]
if message[i] not in found:
found.append(message[i])
topothesia = ''
for i in range(0,len(F)):
topothesia+='-'+str(F[i])
topothesia+='XXXX'
cryption=topothesia+cryption
return cryption
Then I ran it on a particular sequence of letters:
Code:
>>> for a in string.ascii_letters:print a,p.TextCryption(a)
...
a XXXXww
b XXXX1S
c
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "p.py", line 28, in TextCryption
cryption += codes[location(message[i],letters)]
File "p.py", line 4, in location
while not (i == len(letters) and x != letters[i]):
IndexError: list index out of range
>>>
Your program failed at "c". Do you really mean to have extra spaces in your letters data?
Code:
...','x','c ','v','...
There are several similar occurrences.
[code]Code tags[/code] are essential for python code and Makefiles!
4. #3
5. No Profile Picture
Registered User
Devshed Newbie (0 - 499 posts)
Join Date
Jan 2013
Posts
4
Rep Power
0
Strange.. mine work great with all letters and all numbers...
let me post the code without WxPython commands...
the code must be this :
Code:
def location(x,letters):
i = 0
while True :
if x == letters[i]:
break
i = i + 1
if i == len(letters) and x != letters[i]:
return 0
return i
def algorith(codes):
for i in range(0,len(codes)-1):
k=codes[i]
codes[i]=codes[i+1]
codes[i+1]=k
def TextCryption(message):
codes = ['Bp','Pc','{a','[A',']s','}s','S:','"s','d;',';x',';X','<s','S>',':)',':P',':d',':(','G^','j&','l@','@l','p$','F!','!F','(D',')D','A$','$A','%A','A%','u*','A0','4A','9C','9F','4Q','5(','4K','9W','WW','X4','0S','0)','XX','V8','7W','W7','QQ','9Q','SS','AZ','XP','1^','1V','0B','C0','0A','0a','a0','4a','9c','9f','4q','54','4k','9w','ww','x4','0s','09','xx','v8','7w','w7','qq','9q','ss','aZ','xp','1S','1v','0b','c0','00','s1','1s','s2','2s','s3','3s','s4','4s','s5','5s']
letters = ['\'','\\','[','{','}',']','|',';',':','"',',','<','.','>','/','?','!','@','#','$','%','^','&','*','(',')','_','-','=','+','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B','N','M','Q','q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m',' ','0','1','2','3','4','5','6','7','8','9']
found=[]
F=[]
cryption = ''
print len(message)
for i in range(0,len(message)):
if message[i] in found :
F.append(i)
algorith(codes)
cryption = cryption + codes[location(message[i],letters)]
if message[i] not in found:
found.append(message[i])
topothesia=''
for i in range(0,len(F)):
topothesia=topothesia+'-'+str(F[i])
topothesia=topothesia+'XXXX'
cryption=topothesia+cryption
print cryption
return
def TextDecryption(code):
found=[]
codes = ['Bp','Pc','{a','[A',']s','}s','S:','"s','d;',';x',';X','<s','S>',':)',':P',':d',':(','G^','j&','l@','@l','p$','F!','!F','(D',')D','A$','$A','%A','A%','u*','A0','4A','9C','9F','4Q','5(','4K','9W','WW','X4','0S','0)','XX','V8','7W','W7','QQ','9Q','SS','AZ','XP','1^','1V','0B','C0','0A','0a','a0','4a','9c','9f','4q','54','4k','9w','ww','x4','0s','09','xx','v8','7w','w7','qq','9q','ss','aZ','xp','1S','1v','0b','c0','00','s1','1s','s2','2s','s3','3s','s4','4s','s5','5s']
letters = ['\'','\\','[','{','}',']','|',';',':','"',',','<','.','>','/','?','!','@','#','$','%','^','&','*','(',')','_','-','=','+','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B','N','M','Q','q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m',' ','0','1','2','3','4','5','6','7','8','9']
A=[]
for i in range(0,len(code)):
if code[i] =='X' and code[i+1] =='X' and code[i+2] =='X' and code[i+3] =='X':
for p in range(0,i):
l=''
while code[p]!='-' and code[p] !='X':
l=l+code[p]
p=p+1
if l!='':
A.append(int(l))
if len(A)>1:
if A[len(A)-1] < A[len(A)-2]:
A.remove(A[len(A)-1])
A.sort()
edw=[]
for K in range(0,len(code)):
edw.append(code[K])
code=''
for X in range(i+4,len(edw)):
code=code+edw[X]
break
decryption = ''
m = 0
q=0
for i in range(0,(len(code)/2)):
if code[i+m:i+2+m] not in codes:
decryption='Wrong Code!'
break
else:
if A !=[] and q < len(A):
if i == int(A[q]):
algorith(codes)
q=q+1
decryption = decryption + letters[location(code[i+m:i+2+m],codes)]
m = m + 1
print decryption
return
# main program
task = '5'
while task != '3' :
task =raw_input("give task ( 1 for cryption , 2 for decryption ,3 to exit ): ")
if task == '1' :
message=raw_input("give your message:")
TextCryption(message)
elif task == '2' :
code = raw_input("give the code here :")
TextDecryption(code)
Wait a sec... when i check the code to my PC all it is great.. but when i post it here and then take it back to check it again something fail with letter 'c' check the txt file below it have the code and tell me if it's works.. it should be good now.. take the code from the file no here..
link for code :
http://txtup.co/tjIac
or
http://textuploader.com/?p=6&id=tjIac
6. #4
7. No Profile Picture
Registered User
Devshed Newbie (0 - 499 posts)
Join Date
Jan 2013
Posts
4
Rep Power
0
for some reason when i put the code here in ["code"] some letters take one or two spaces.. for example.. if you check the letter list you will see that the c letter is 'c ' instead of 'c' strange... hmm
8. #5
9. Contributing User
Devshed God 1st Plane (5500 - 5999 posts)
Join Date
Aug 2011
Posts
5,796
Rep Power
508
1) As far as I can tell your location function is equivalent in this program to the index method. (Error type may differ, but you don't test this.)
2) I inserted tests using increasing length of ascii letters in random order, testing that
decrypt(encrypt(STRING))==STRING
The test fails at a string length of 105.
3) I have not yet duplicated the memory problem.
Code:
# http://textuploader.com/?p=6&id=tjIac
def location(x,letters):
return letters.index(x)
def algorith(codes):
for i in range(0,len(codes)-1):
k=codes[i]
codes[i]=codes[i+1]
codes[i+1]=k
def TextCryption(message):
codes = ['Bp','Pc','{a','[A',']s','}s','S:','"s','d;',';x',';X','<s','S>',':)',':P',':d',':(','G^','j&','l@','@l','p$','F!','!F','(D',')D','A$','$A','%A','A%','u*','A0','4A','9C','9F','4Q','5(','4K','9W','WW','X4','0S','0)','XX','V8','7W','W7','QQ','9Q','SS','AZ','XP','1^','1V','0B','C0','0A','0a','a0','4a','9c','9f','4q','54','4k','9w','ww','x4','0s','09','xx','v8','7w','w7','qq','9q','ss','aZ','xp','1S','1v','0b','c0','00','s1','1s','s2','2s','s3','3s','s4','4s','s5','5s']
letters = ['\'','\\','[','{','}',']','|',';',':','"',',','<','.','>','/','?','!','@','#','$','%','^','&','*','(',')','_','-','=','+','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B','N','M','Q','q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m',' ','0','1','2','3','4','5','6','7','8','9']
found=[]
F=[]
cryption = ''
for i in range(0,len(message)):
if message[i] in found :
F.append(i)
algorith(codes)
cryption = cryption + codes[location(message[i],letters)]
if message[i] not in found:
found.append(message[i])
topothesia=''
for i in range(0,len(F)):
topothesia=topothesia+'-'+str(F[i])
topothesia=topothesia+'XXXX'
cryption=topothesia+cryption
return cryption
def TextDecryption(code):
found=[]
codes = ['Bp','Pc','{a','[A',']s','}s','S:','"s','d;',';x',';X','<s','S>',':)',':P',':d',':(','G^','j&','l@','@l','p$','F!','!F','(D',')D','A$','$A','%A','A%','u*','A0','4A','9C','9F','4Q','5(','4K','9W','WW','X4','0S','0)','XX','V8','7W','W7','QQ','9Q','SS','AZ','XP','1^','1V','0B','C0','0A','0a','a0','4a','9c','9f','4q','54','4k','9w','ww','x4','0s','09','xx','v8','7w','w7','qq','9q','ss','aZ','xp','1S','1v','0b','c0','00','s1','1s','s2','2s','s3','3s','s4','4s','s5','5s']
letters = ['\'','\\','[','{','}',']','|',';',':','"',',','<','.','>','/','?','!','@','#','$','%','^','&','*','(',')','_','-','=','+','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B','N','M','Q','q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m',' ','0','1','2','3','4','5','6','7','8','9']
A=[]
for i in range(0,len(code)):
if code[i] =='X' and code[i+1] =='X' and code[i+2] =='X' and code[i+3] =='X':
for p in range(0,i):
l=''
while code[p]!='-' and code[p] !='X':
l=l+code[p]
p=p+1
if l!='':
A.append(int(l))
if len(A)>1:
if A[len(A)-1] < A[len(A)-2]:
A.remove(A[len(A)-1])
A.sort()
edw=[]
for K in range(0,len(code)):
edw.append(code[K])
code=''
for X in range(i+4,len(edw)):
code=code+edw[X]
break
decryption = ''
m = 0
q=0
for i in range(0,(len(code)/2)):
if code[i+m:i+2+m] not in codes:
decryption='Wrong Code!'
break
else:
if A !=[] and q < len(A):
if i == int(A[q]):
algorith(codes)
q=q+1
decryption = decryption + letters[location(code[i+m:i+2+m],codes)]
m = m + 1
return decryption
def main():
task = '5'
while task != '3' :
task =raw_input("give task ( 1 for cryption , 2 for decryption ,3 to exit ): ")
if task == '1' :
message=raw_input("give your message:")
print(TextCryption(message))
elif task == '2' :
code = raw_input("give the code here :")
print(TextDecryption(code))
if '__main__' == __name__:
import random,string,sys
i = 0
L = 26
A = string.ascii_letters*10
for L in range(100,208):
sys.stdout.write('string length: %d'%L)
B = list(A[:L])
random.shuffle(B)
sys.stdout.write(' to encrypt')
C = TextCryption(B)
sys.stdout.write(' to decrypt')
D = TextDecryption(C)
sys.stdout.write('\n')
SB = ''.join(B)
SD = ''.join(D)
try:
assert SB == SD
except:
if (len(SB) < 500) and (len(SD) < 500):
print(SB)
print(SD)
if len(SB) != len(SD):
print('lengths differ')
for (I,(E,F,)) in enumerate(zip(SB,SD,)):
if E != F:
print('differ on character %d\n'%I)
raise
raise
if '__main__' == __name__:
import random,string,sys
i = 0
L = 26
A = string.ascii_letters[:]
while L < 50*1000*1000:
L = len(A)
sys.stdout.write('string length: %d'%L)
B = list(A)
random.shuffle(B)
sys.stdout.write(' to encrypt')
C = TextCryption(B)
sys.stdout.write(' to decrypt')
D = TextDecryption(C)
sys.stdout.write('\n')
SB = ''.join(B)
SD = ''.join(D)
try:
assert SB == SD
except:
if (len(SB) < 500) and (len(SD) < 500):
print(SB)
print(SD)
if len(SB) != len(SD):
print('lengths differ')
for (I,(E,F,)) in enumerate(zip(SB,SD,)):
if E != F:
print('differ on character %d\n'%I)
raise
raise
A *= 2
[code]Code tags[/code] are essential for python code and Makefiles!
10. #6
11. No Profile Picture
Registered User
Devshed Newbie (0 - 499 posts)
Join Date
Jan 2013
Posts
4
Rep Power
0
so if i have understand right there is a problem with my code ..
i thought that memory of python has error and that's why the program crash.. i will try to check your code .. as i said i am studying python only couple of months :P so i hope to understand it thx you for your help!
( My english sucks i know :P )
edit :
Code:
if '__main__' == __name__:
import random,string,sys
i = 0
L = 26
A = string.ascii_letters[:]
while L < 50*1000*1000:
L = len(A)
sys.stdout.write('string length: %d'%L)
B = list(A)
random.shuffle(B)
sys.stdout.write(' to encrypt')
C = TextCryption(B)
sys.stdout.write(' to decrypt')
D = TextDecryption(C)
sys.stdout.write('\n')
SB = ''.join(B)
SD = ''.join(D)
try:
assert SB == SD
except:
if (len(SB) < 500) and (len(SD) < 500):
print(SB)
print(SD)
if len(SB) != len(SD):
print('lengths differ')
for (I,(E,F,)) in enumerate(zip(SB,SD,)):
if E != F:
print('differ on character %d\n'%I)
raise
raise
A *= 2
ok i got what you are doing but i can't understand why are you doing all this?
let's see if have understand all right :
first you put on A list a lot of letters letters ( 520 len) and then you take a B list with only 24 of them.. ( all letters ) then you shuffle it and then you create two list on with the cryption of the letters and the other one with decryption of the letters and then you check if they had the same lenght? of course the don't.. because one letters in cryption = 2 letters in decryption..
hmmm i didn't get it... but i would think about it i sure that i will understand.. give me some time :P
the point is that the problem is with my code! so i will find it ! thx again for your help! and thx for this command : list.index(element) i didn't know that very useful!!!
IMN logo majestic logo threadwatch logo seochat tools logo
|
__label__pos
| 0.857491 |
Take the tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
I am having trouble distinguishing some terms here. I got these from my book
A group is a nonempty set G together with binary operation * that satisfies the three properties
G1. Associativity
G2. Identity
G3. Inverse
If a group also satisfies Commutativity, then it is abelian, if it doesn't then it is nonabelian
Okay here is my confusion, the last statement seems to throw the term group aside. Is it basically telling me to check whether Commutativity is satisfied or not and label them abelian and nonabelian?
share|improve this question
1
But what about "If a group"...? – draks ... Oct 10 '12 at 5:45
add comment
5 Answers
up vote 1 down vote accepted
A group $\{G,*\}$ satisfies the following conditions:
1. $a*b\in G, \forall a,b\in G$
2. $(a*b)*c=a*(b*c), \forall a,b,c\in G$
3. $\exists! e\in G:e*a=a*e=a,\forall a\in G$
4. $\exists! a^{-1}:a a^{-1}=a^{-1}a=e, \forall a\in G$
An abelian group is just a specific type of group which also satisfies $$a*b=b*a,\ \ \forall a,b\in G$$ If it does not meet this condition it is non-abelian.
A useful analogy might be to consider the natural numbers. A number is prime if it has no positive divisors other than 1 and itself. If it does not meet this condition it is non-prime (also known as composite). Similarly, a group is abelian if all its elements commute, otherwise it is non-abelian.
share|improve this answer
add comment
You seem to be getting confused over two types of adjective usage. Wikipedia highlights the difference with this example:
• That's an interesting idea. (attributive)
• That idea is interesting. (predicative)
So, it's legitimate to say e.g.:
• $\mathbb{Z}_n$ is an abelian group.
• $\mathbb{Z}_n$ is abelian.
And they have the same meaning.
share|improve this answer
add comment
Abelianness (commutativity) is a property a group can have. If G is a group and * also is commutative, then G "is abelian". We can call G an "abelian group" or just say "G is abelian". The same goes for nonabelian.
share|improve this answer
add comment
The adjective abelian typically only applies to groups. If a ring satisfies the commutativity condition, then we call the ring commutative (or noncommutative if it doesn't) rather than abelian or nonabelian. So if you see a structure described simply as abelian, it's probably understood to be a group. With regards to your specific question, when referring to a group $G$ satisfying the commutativity property, calling $G$ abelian or calling $G$ an abelian group are both acceptable.
share|improve this answer
add comment
Not every group is commutative. For instance, check the group of $2\times 2$ matrices under multiplication with determinant does not equal to zero. This group in not abelian (commutative) group since $AB \neq BA$ in general.
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.985445 |
Online chat 24/7
01.06.2022
14138
Error 0x80072f8f
Error 0x80072f8f can occur when activating Windows 10 and Windows 7, and this error can also occur when activating Microsoft Office. In addition, such an error can also occur when trying to install updates on Windows 7 and Windows 10. Let's consider in this article why this error can occur and how to fix it.
Error on Windows 7:
Error on Windows 10:
Error in Microsoft Office:
There are several solutions, we will consider each separately.
1. Wrong system time.
A broken time zone, or an incorrectly set system time, can cause errors when activating Windows and Microsoft Office. The solution to the problem is to set the correct time and time zone manually, or use automatic time synchronization, for example, using time.windows.com.
2. Disabling proxy and VPN services.
This error may be related to proxy servers and VPN services running on your PC, because the same error as in the first case can play here, your IP does not match the configured time zone on your PC.
3. Alternative activation.
Try to activate your key in the system via the command line. You can find out how to do this in our previous article. This guide works on both Windows 7 and Windows 10.
4. Registry fix. (Applicable for Windows 7)
The error may be due to the settings in the registry, for example, if you have used pirated activation bypass systems before, or tried to activate with another key that did not work for some reason.
Open the registry with hotkeys Win + R => Enter in the regedit field => Go to the HKLM/Software/Microsoft/Windows/CurrentVersion/Setup/OOBE branch => Go to the MediaBootInstall parameter and set the value to 0. After saving the procedure, restart the PC.
5. Activation by phone.
Instructions on how to activate Windows 7 by phone
Instructions on how to activate Windows 10 by phone
Or you can use the activation by phone in text mode without a call, instructions:
- In the window with an error, we go to other activation methods
- Next, go to automatic activation by phone
- Select your country in the drop-down menu, for example "Russia" and click next.
- Now we have moved to the phone activation window. Pay attention to "Step 2", six-digit numbers in each block from 1 to 9, they will need to be entered into text activation by phone. Attention: you will have your numbers in step 2 and you need to enter exactly what is on your activation window by phone, in the screenshot below - this is an example.
- Go to the text activation page using the following link. And choose "6 Digits"
- Now you will see a window with input fields, enter there your numbers from "step 2" activation by phone. After all the numbers are entered, click "Submit"
- Next, in the next window you will get response numbers that you will need to enter in "Step 3" in the text fields from A to H. Enter your numbers exactly, from the text activation site, in the screenshot below - this is an example.
After entering all the numbers in the fields from A to H, in the activation window by phone, click "Next" and activate your system.
Related Articles
Write a review
Note: HTML is not translated!
|
__label__pos
| 0.917371 |
#include "license.hunspell" #include "license.myspell" #ifndef MOZILLA_CLIENT #include #include #include #include #else #include #include #include #include #endif #include "hashmgr.hxx" #include "csutil.hxx" #include "atypes.hxx" #ifdef MOZILLA_CLIENT #ifdef __SUNPRO_CC // for SunONE Studio compiler using namespace std; #endif #else #ifndef W32 using namespace std; #endif #endif // build a hash table from a munched word list HashMgr::HashMgr(const char * tpath, const char * apath) { tablesize = 0; tableptr = NULL; flag_mode = FLAG_CHAR; complexprefixes = 0; utf8 = 0; ignorechars = NULL; ignorechars_utf16 = NULL; ignorechars_utf16_len = 0; numaliasf = 0; aliasf = NULL; numaliasm = 0; aliasm = NULL; load_config(apath); int ec = load_tables(tpath); if (ec) { /* error condition - what should we do here */ HUNSPELL_WARNING(stderr, "Hash Manager Error : %d\n",ec); if (tableptr) { free(tableptr); } tablesize = 0; } } HashMgr::~HashMgr() { if (tableptr) { // now pass through hash table freeing up everything // go through column by column of the table for (int i=0; i < tablesize; i++) { struct hentry * pt = &tableptr[i]; struct hentry * nt = NULL; if (pt) { if (pt->astr && !aliasf) free(pt->astr); if (pt->word) free(pt->word); #ifdef HUNSPELL_EXPERIMENTAL if (pt->description && !aliasm) free(pt->description); #endif pt = pt->next; } while(pt) { nt = pt->next; if (pt->astr && !aliasf) free(pt->astr); if (pt->word) free(pt->word); #ifdef HUNSPELL_EXPERIMENTAL if (pt->description && !aliasm) free(pt->description); #endif free(pt); pt = nt; } } free(tableptr); } tablesize = 0; if (aliasf) { for (int j = 0; j < (numaliasf); j++) free(aliasf[j]); free(aliasf); aliasf = NULL; if (aliasflen) { free(aliasflen); aliasflen = NULL; } } if (aliasm) { for (int j = 0; j < (numaliasm); j++) free(aliasm[j]); free(aliasm); aliasm = NULL; } if (ignorechars) free(ignorechars); if (ignorechars_utf16) free(ignorechars_utf16); } // lookup a root word in the hashtable struct hentry * HashMgr::lookup(const char *word) const { struct hentry * dp; if (tableptr) { dp = &tableptr[hash(word)]; if (dp->word == NULL) return NULL; for ( ; dp != NULL; dp = dp->next) { if (strcmp(word,dp->word) == 0) return dp; } } return NULL; } // add a word to the hash table (private) int HashMgr::add_word(const char * word, int wl, unsigned short * aff, int al, const char * desc) { char * st = mystrdup(word); if (wl && !st) return 1; if (ignorechars != NULL) { if (utf8) { remove_ignored_chars_utf(st, ignorechars_utf16, ignorechars_utf16_len); } else { remove_ignored_chars(st, ignorechars); } } if (complexprefixes) { if (utf8) reverseword_utf(st); else reverseword(st); } int i = hash(st); struct hentry * dp = &tableptr[i]; if (dp->word == NULL) { dp->wlen = (short) wl; dp->alen = (short) al; dp->word = st; dp->astr = aff; dp->next = NULL; dp->next_homonym = NULL; #ifdef HUNSPELL_EXPERIMENTAL if (aliasm) { dp->description = (desc) ? get_aliasm(atoi(desc)) : mystrdup(desc); } else { dp->description = mystrdup(desc); if (desc && !dp->description) return 1; if (dp->description && complexprefixes) { if (utf8) reverseword_utf(dp->description); else reverseword(dp->description); } } #endif } else { struct hentry* hp = (struct hentry *) malloc (sizeof(struct hentry)); if (!hp) return 1; hp->wlen = (short) wl; hp->alen = (short) al; hp->word = st; hp->astr = aff; hp->next = NULL; hp->next_homonym = NULL; #ifdef HUNSPELL_EXPERIMENTAL if (aliasm) { hp->description = (desc) ? get_aliasm(atoi(desc)) : mystrdup(desc); } else { hp->description = mystrdup(desc); if (desc && !hp->description) return 1; if (dp->description && complexprefixes) { if (utf8) reverseword_utf(hp->description); else reverseword(hp->description); } } #endif while (dp->next != NULL) { if ((!dp->next_homonym) && (strcmp(hp->word, dp->word) == 0)) dp->next_homonym = hp; dp=dp->next; } if ((!dp->next_homonym) && (strcmp(hp->word, dp->word) == 0)) dp->next_homonym = hp; dp->next = hp; } return 0; } // add a custom dic. word to the hash table (public) int HashMgr::put_word(const char * word, int wl, char * aff) { unsigned short * flags; int al = 0; if (aff) { al = decode_flags(&flags, aff); flag_qsort(flags, 0, al); } else { flags = NULL; } add_word(word, wl, flags, al, NULL); return 0; } int HashMgr::put_word_pattern(const char * word, int wl, const char * pattern) { unsigned short * flags; struct hentry * dp = lookup(pattern); if (!dp || !dp->astr) return 1; flags = (unsigned short *) malloc (dp->alen * sizeof(short)); memcpy((void *) flags, (void *) dp->astr, dp->alen * sizeof(short)); add_word(word, wl, flags, dp->alen, NULL); return 0; } // walk the hash table entry by entry - null at end struct hentry * HashMgr::walk_hashtable(int &col, struct hentry * hp) const { //reset to start if ((col < 0) || (hp == NULL)) { col = -1; hp = NULL; } if (hp && hp->next != NULL) { hp = hp->next; } else { col++; hp = (col < tablesize) ? &tableptr[col] : NULL; // search for next non-blank column entry while (hp && (hp->word == NULL)) { col ++; hp = (col < tablesize) ? &tableptr[col] : NULL; } if (col < tablesize) return hp; hp = NULL; col = -1; } return hp; } // load a munched word list and build a hash table on the fly int HashMgr::load_tables(const char * tpath) { int wl, al; char * ap; char * dp; unsigned short * flags; // raw dictionary - munched file FILE * rawdict = fopen(tpath, "r"); if (rawdict == NULL) return 1; // first read the first line of file to get hash table size */ char ts[MAXDELEN]; if (! fgets(ts, MAXDELEN-1,rawdict)) return 2; mychomp(ts); /* remove byte order mark */ if (strncmp(ts,"",3) == 0) { memmove(ts, ts+3, strlen(ts+3)+1); HUNSPELL_WARNING(stderr, "warning: dic file begins with byte order mark: possible incompatibility with old Hunspell versions\n"); } if ((*ts < '1') || (*ts > '9')) HUNSPELL_WARNING(stderr, "error - missing word count in dictionary file\n"); tablesize = atoi(ts); if (!tablesize) return 4; tablesize = tablesize + 5 + USERWORD; if ((tablesize %2) == 0) tablesize++; // allocate the hash table tableptr = (struct hentry *) calloc(tablesize, sizeof(struct hentry)); if (! tableptr) return 3; for (int i=0; i 1x 2y Zz) len = strlen(flags); if (len%2 == 1) HUNSPELL_WARNING(stderr, "error: length of FLAG_LONG flagvector is odd: %s\n", flags); len = len/2; *result = (unsigned short *) malloc(len * sizeof(short)); for (int i = 0; i < len; i++) { (*result)[i] = (((unsigned short) flags[i * 2]) << 8) + (unsigned short) flags[i * 2 + 1]; } break; } case FLAG_NUM: { // decimal numbers separated by comma (4521,23,233 -> 4521 23 233) len = 1; char * src = flags; unsigned short * dest; char * p; for (p = flags; *p; p++) { if (*p == ',') len++; } *result = (unsigned short *) malloc(len * sizeof(short)); dest = *result; for (p = flags; *p; p++) { if (*p == ',') { *dest = (unsigned short) atoi(src); if (*dest == 0) HUNSPELL_WARNING(stderr, "error: 0 is wrong flag id\n"); src = p + 1; dest++; } } *dest = (unsigned short) atoi(src); if (*dest == 0) HUNSPELL_WARNING(stderr, "error: 0 is wrong flag id\n"); break; } case FLAG_UNI: { // UTF-8 characters w_char w[MAXDELEN/2]; len = u8_u16(w, MAXDELEN/2, flags); *result = (unsigned short *) malloc(len * sizeof(short)); memcpy(*result, w, len * sizeof(short)); break; } default: { // Ispell's one-character flags (erfg -> e r f g) unsigned short * dest; len = strlen(flags); *result = (unsigned short *) malloc(len * sizeof(short)); dest = *result; for (unsigned char * p = (unsigned char *) flags; *p; p++) { *dest = (unsigned short) *p; dest++; } } } return len; } unsigned short HashMgr::decode_flag(const char * f) { unsigned short s = 0; switch (flag_mode) { case FLAG_LONG: s = ((unsigned short) f[0] << 8) + (unsigned short) f[1]; break; case FLAG_NUM: s = (unsigned short) atoi(f); break; case FLAG_UNI: u8_u16((w_char *) &s, 1, f); break; default: s = (unsigned short) *((unsigned char *)f); } if (!s) HUNSPELL_WARNING(stderr, "error: 0 is wrong flag id\n"); return s; } char * HashMgr::encode_flag(unsigned short f) { unsigned char ch[10]; if (f==0) return mystrdup("(NULL)"); if (flag_mode == FLAG_LONG) { ch[0] = (unsigned char) (f >> 8); ch[1] = (unsigned char) (f - ((f >> 8) << 8)); ch[2] = '\0'; } else if (flag_mode == FLAG_NUM) { sprintf((char *) ch, "%d", f); } else if (flag_mode == FLAG_UNI) { u16_u8((char *) &ch, 10, (w_char *) &f, 1); } else { ch[0] = (unsigned char) (f); ch[1] = '\0'; } return mystrdup((char *) ch); } // read in aff file and set flag mode int HashMgr::load_config(const char * affpath) { int firstline = 1; // io buffers char line[MAXDELEN+1]; // open the affix file FILE * afflst; afflst = fopen(affpath,"r"); if (!afflst) { HUNSPELL_WARNING(stderr, "Error - could not open affix description file %s\n",affpath); return 1; } // read in each line ignoring any that do not // start with a known line type indicator while (fgets(line,MAXDELEN,afflst)) { mychomp(line); /* remove byte order mark */ if (firstline) { firstline = 0; if (strncmp(line,"",3) == 0) memmove(line, line+3, strlen(line+3)+1); } /* parse in the try string */ if ((strncmp(line,"FLAG",4) == 0) && isspace(line[4])) { if (flag_mode != FLAG_CHAR) { HUNSPELL_WARNING(stderr, "error: duplicate FLAG parameter\n"); } if (strstr(line, "long")) flag_mode = FLAG_LONG; if (strstr(line, "num")) flag_mode = FLAG_NUM; if (strstr(line, "UTF-8")) flag_mode = FLAG_UNI; if (flag_mode == FLAG_CHAR) { HUNSPELL_WARNING(stderr, "error: FLAG need `num', `long' or `UTF-8' parameter: %s\n", line); } } if ((strncmp(line,"SET",3) == 0) && isspace(line[3]) && strstr(line, "UTF-8")) utf8 = 1; /* parse in the ignored characters (for example, Arabic optional diacritics characters */ if (strncmp(line,"IGNORE",6) == 0) { if (parse_array(line, &ignorechars, &ignorechars_utf16, &ignorechars_utf16_len, "IGNORE", utf8)) { fclose(afflst); return 1; } } if ((strncmp(line,"AF",2) == 0) && isspace(line[2])) { if (parse_aliasf(line, afflst)) { fclose(afflst); return 1; } } #ifdef HUNSPELL_EXPERIMENTAL if ((strncmp(line,"AM",2) == 0) && isspace(line[2])) { if (parse_aliasm(line, afflst)) { fclose(afflst); return 1; } } #endif if (strncmp(line,"COMPLEXPREFIXES",15) == 0) complexprefixes = 1; if (((strncmp(line,"SFX",3) == 0) || (strncmp(line,"PFX",3) == 0)) && isspace(line[3])) break; } fclose(afflst); return 0; } /* parse in the ALIAS table */ int HashMgr::parse_aliasf(char * line, FILE * af) { if (numaliasf != 0) { HUNSPELL_WARNING(stderr, "error: duplicate AF (alias for flag vector) tables used\n"); return 1; } char * tp = line; char * piece; int i = 0; int np = 0; piece = mystrsep(&tp, 0); while (piece) { if (*piece != '\0') { switch(i) { case 0: { np++; break; } case 1: { numaliasf = atoi(piece); if (numaliasf < 1) { numaliasf = 0; aliasf = NULL; aliasflen = NULL; HUNSPELL_WARNING(stderr, "incorrect number of entries in AF table\n"); free(piece); return 1; } aliasf = (unsigned short **) malloc(numaliasf * sizeof(unsigned short *)); aliasflen = (unsigned short *) malloc(numaliasf * sizeof(short)); if (!aliasf || !aliasflen) { numaliasf = 0; if (aliasf) free(aliasf); if (aliasflen) free(aliasflen); aliasf = NULL; aliasflen = NULL; return 1; } np++; break; } default: break; } i++; } free(piece); piece = mystrsep(&tp, 0); } if (np != 2) { numaliasf = 0; free(aliasf); free(aliasflen); aliasf = NULL; aliasflen = NULL; HUNSPELL_WARNING(stderr, "error: missing AF table information\n"); return 1; } /* now parse the numaliasf lines to read in the remainder of the table */ char * nl = line; for (int j=0; j < numaliasf; j++) { if (!fgets(nl,MAXDELEN,af)) return 1; mychomp(nl); tp = nl; i = 0; aliasf[j] = NULL; aliasflen[j] = 0; piece = mystrsep(&tp, 0); while (piece) { if (*piece != '\0') { switch(i) { case 0: { if (strncmp(piece,"AF",2) != 0) { numaliasf = 0; free(aliasf); free(aliasflen); aliasf = NULL; aliasflen = NULL; HUNSPELL_WARNING(stderr, "error: AF table is corrupt\n"); free(piece); return 1; } break; } case 1: { aliasflen[j] = (unsigned short) decode_flags(&(aliasf[j]), piece); flag_qsort(aliasf[j], 0, aliasflen[j]); break; } default: break; } i++; } free(piece); piece = mystrsep(&tp, 0); } if (!aliasf[j]) { free(aliasf); free(aliasflen); aliasf = NULL; aliasflen = NULL; numaliasf = 0; HUNSPELL_WARNING(stderr, "error: AF table is corrupt\n"); return 1; } } return 0; } int HashMgr::is_aliasf() { return (aliasf != NULL); } int HashMgr::get_aliasf(int index, unsigned short ** fvec) { if ((index > 0) && (index <= numaliasf)) { *fvec = aliasf[index - 1]; return aliasflen[index - 1]; } HUNSPELL_WARNING(stderr, "error: bad flag alias index: %d\n", index); *fvec = NULL; return 0; } #ifdef HUNSPELL_EXPERIMENTAL /* parse morph alias definitions */ int HashMgr::parse_aliasm(char * line, FILE * af) { if (numaliasm != 0) { HUNSPELL_WARNING(stderr, "error: duplicate AM (aliases for morphological descriptions) tables used\n"); return 1; } char * tp = line; char * piece; int i = 0; int np = 0; piece = mystrsep(&tp, 0); while (piece) { if (*piece != '\0') { switch(i) { case 0: { np++; break; } case 1: { numaliasm = atoi(piece); if (numaliasm < 1) { HUNSPELL_WARNING(stderr, "incorrect number of entries in AM table\n"); free(piece); return 1; } aliasm = (char **) malloc(numaliasm * sizeof(char *)); if (!aliasm) { numaliasm = 0; return 1; } np++; break; } default: break; } i++; } free(piece); piece = mystrsep(&tp, 0); } if (np != 2) { numaliasm = 0; free(aliasm); aliasm = NULL; HUNSPELL_WARNING(stderr, "error: missing AM alias information\n"); return 1; } /* now parse the numaliasm lines to read in the remainder of the table */ char * nl = line; for (int j=0; j < numaliasm; j++) { if (!fgets(nl,MAXDELEN,af)) return 1; mychomp(nl); tp = nl; i = 0; aliasm[j] = NULL; piece = mystrsep(&tp, 0); while (piece) { if (*piece != '\0') { switch(i) { case 0: { if (strncmp(piece,"AM",2) != 0) { HUNSPELL_WARNING(stderr, "error: AM table is corrupt\n"); free(piece); numaliasm = 0; free(aliasm); aliasm = NULL; return 1; } break; } case 1: { if (complexprefixes) { if (utf8) reverseword_utf(piece); else reverseword(piece); } aliasm[j] = mystrdup(piece); break; } default: break; } i++; } free(piece); piece = mystrsep(&tp, 0); } if (!aliasm[j]) { numaliasm = 0; free(aliasm); aliasm = NULL; HUNSPELL_WARNING(stderr, "error: map table is corrupt\n"); return 1; } } return 0; } int HashMgr::is_aliasm() { return (aliasm != NULL); } char * HashMgr::get_aliasm(int index) { if ((index > 0) && (index <= numaliasm)) return aliasm[index - 1]; HUNSPELL_WARNING(stderr, "error: bad morph. alias index: %d\n", index); return NULL; } #endif
|
__label__pos
| 0.999901 |
Generating a Document
• 12 Jun 2024
• 1 Minute to read
• Dark
Light
• PDF
Generating a Document
• Dark
Light
• PDF
Article summary
Introduction
Users can manually generate documents in Azure Documenter using the generate document option.
The different kinds of documents that can be generated using Azure Documenter include:
• Executive summary
• Resource details
• Billing details
• Security compliance
• Cost comparison
• Resource auditing
• Access details
• Rightsizing recommendations
• Reservation recommendations
• Network diagrams
Generate a Document
1. Click Generate document in the context menu of an existing configuration
2. Choose the type of document to be generated, and specify a billing date range if necessary
When selecting document types such as Executive summary, Billing details, Cost comparison, Resource Auditing or Rightsizing recommendations, it is essential to also choose the currency type in which the cost details for those documents are to be displayed.
In the Generate document blade, the details of the published platform, configured subscriptions, and notifications are displayed so that the user is aware of all the relevant information regarding document generation.
1. Click Generate
The document generation process takes some time since it combines all the relevant information about resource usage and the user's Azure subscription costs into a single Azure technical document. The processing steps are determined by the type of document chosen during the document generation process.
gen.gif
By choosing Preview Document, users can gain insight into the selected document type, providing a preview of its content and structure.
Added information
• The document configuration determines the type of document, the subscription used to create the document, the configured notification channels, and the corresponding published platform.
• Users can update the subscription(s), notification channels, Filters and published platform by editing the document configuration.
Was this article helpful?
|
__label__pos
| 0.942339 |
What is best practice data engineering?
In today's data-driven world, data engineering has become an essential function within organizations. As businesses accumulate massive amounts of data, the need to manage, process, and derive actionable insights from that data has never been more critical. But what does it mean to follow best practices in data engineering? Let's dive into the core principles that make data engineering effective and sustainable.
Understand Your Data
• Data Quality Assessment
• Before jumping into data processing and analysis, it's crucial to assess the quality of the data you have. Data quality refers to the accuracy, completeness, consistency, and timeliness of your data.
• Practical Tip: Implement automated data validation checks to ensure your data is clean and reliable. For instance, you could use Python libraries, such as Pandas, to check for missing values or outliers before ingestion.
• Data Modeling
• Designing an appropriate data model is foundational for scalable data engineering. Data models help you communicate what the data represents and how to structure it for efficient access and analysis.
• Practical Tip: Use Entity-Relationship (ER) diagrams to visualize the relationships between different entities within your dataset. For example, if you're handling sales data, you'd want to model entities like Customers, Products, and Orders to show how they interact.
Optimize Data Pipeline Performance
• Efficient Data Storage
• Storing data efficiently can significantly enhance performance and reduce costs. Choose the right storage technology based on your use case—whether that’s a traditional relational database or a cloud-based solution.
• Practical Tip: Use columnar storage formats (like Parquet or ORC) for big data workloads. These formats optimize query performance and reduce storage costs since they only store necessary columns.
• Data Pipeline Orchestration
• Streamlining your data pipeline ensures smooth data flow from one stage to another. This involves orchestrating tasks like data extraction, transformation, and loading (ETL) systematically.
• Practical Tip: Leverage tools like Apache Airflow or Dagster for task orchestration. For example, you could create a DAG (Directed Acyclic Graph) to represent the sequence of data tasks and manage dependencies effectively.
Emphasize Scalability and Flexibility
• Scalable Infrastructure
• As data volumes grow, having a scalable infrastructure becomes paramount. Cloud platforms such as AWS, Google Cloud, or Azure provide the elasticity needed to handle peaks in data processing demands.
• Practical Tip: Use services like AWS S3 for data storage and AWS Lambda for serverless compute power. This setup allows you to scale resources based on actual needs without over-provisioning.
• Adaptability to Change
• Business needs and data requirements often change. Building a flexible data pipeline can save time and resources when adapting to new requirements.
• Practical Tip: Implement feature toggles in your data pipeline. This allows you to make incremental changes without affecting the entire workflow. For instance, you can run A/B tests with new data transformations by toggling features on or off, enabling iterative improvements.
Conclusion
Embracing best practices in data engineering is not just about employing the latest technologies or following trends; it's about understanding your data, optimizing performance, and ensuring your system is adaptable to changes. By focusing on data quality, pipeline efficiency, infrastructure scalability, and flexibility, organizations can create a robust data framework that supports informed decision-making. The end result—a well-engineered data environment—will empower businesses to extract valuable insights, ultimately driving growth and innovation.
|
__label__pos
| 0.985391 |
AnsweredAssumed Answered
NxpNfcRdLib Linux timespec bugs (and proposed patch)
Question asked by Christian Hack on Sep 13, 2018
Latest reply on May 23, 2019 by Alexander Baar
We have just attempted to upgrade to v05.19.00 of the reader library (using SW369319). We had been using v05.02.00.
There are a number of simple bugs we have discovered in the Linux abstraction layer, some of which have been introduced since previous versions by the someone just blindly changing all the uses of timespec and not testing them. In some cases the timespec needs to be an absolute time and in others it needs to be a relative time. They have all been changed to assume a relative time.
phOsal_EventPend() has had a bug introduced by removing the code adding the wait time required and supplying the timespec structure as just the time. This means pthread_cond_timewait returns immediately. This was fine in v05.02.00 but was introduced somewhere along the way to v05.19.00. Without a public repo I'm unable to pinpoint where or why or do a pull request or similar. What is the best process to submit bug fixes and improvements?
Similarly phOsal_SemPend() needs an absolute time rather than a relative time as does phOsal_MutexLock
With these bugs, the library would hang almost immediately in phacDiscLoop_Run and was very unreliable. Is the library ever tested because it appears it couldn't have been with such glaring issues?
Patch attached.
Attachments
Outcomes
|
__label__pos
| 0.678786 |
Detecting Outbreaks and Significant Changes in Signals
This example shows how to determine changes or breakouts in signals via cumulative sums and changepoint detection.
Detecting Outbreaks via Cumulative Sums
There are many practical applications where you are monitoring data and you want to be alerted as quickly as possible when the underlying process has changed. A very popular technique to achieve this is by means of a cumulative sum (CUSUM) control chart.
To illustrate how CUSUM works, first examine the total reported cases of the 2014 West African Ebola outbreak.
Source: Centers for Disease Control and Prevention
load WestAfricanEbolaOutbreak2014
plot(WHOreportdate, [TotalCasesGuinea TotalCasesLiberia TotalCasesSierraLeone],'.-')
legend('Guinea','Liberia','Sierra Leone');
title('Total suspected, probable and confirmed cases of Ebola virus disease');
If you look at the leading edge of the first outbreak in Guinea, you can see that the first hundred cases were reported around March 25, 2014, and increase significantly after that date. What is interesting to note is that while Liberia also had a few suspected cases in March, the number of cases stayed relatively in control until about thirty days later.
To get a sense of the incoming rate of new patients, plot the relative day-to-day changes in the total number of cases, beginning at the onset on March 25, 2015.
daysSinceOutbreak = datetime(2014, 3, 24+(0:400));
cases = interp1(WHOreportdate, TotalCasesLiberia, daysSinceOutbreak);
dayOverDayCases = diff(cases);
plot(dayOverDayCases)
title('Rate of new cases (per diem) in Liberia since March 25, 2014');
ylabel('Change in number of reported cases per diem');
xlabel('Number of days since outbreak began');
If you zoom in on the first hundred days of data, you can see that while there was an initial influx of cases, many of them were ruled out after day 30, where rate of changes dropped below zero temporarily. You also see a significant upward trend between days 95 and 100, where a rate of seven new cases per day was reached.
xlim([1 101])
Performing a CUSUM test on the input data can be a quick way to determine when an outbreak occurs. CUSUM keeps track of two cumulative sums: an upper sum that detects when the local mean shifts upward, and a lower sum that detects when the mean shifts downward. The integration technique provides CUSUM the ability to ignore a large (transient) spike in the incoming rate but still have sensitivity to steadier small changes in rate.
Calling CUSUM with default arguments will inspect the data of the first twenty-five samples and alarm when it encounters a shift in mean more than five standard deviations from within the initial data.
cusum(dayOverDayCases(1:101))
legend('Upper sum','Lower sum')
Note that CUSUM caught the false reported cases at day 30 (at day 33) and picked up the initial onset of the outbreak starting at day 80 (at day 90). If you compare these results carefully against the previous plot, you can see that CUSUM was able to ignore the spurious uptick at day 29 but still trigger an alarm five days before the large upward trend starting on day 95.
If you adjust CUSUM so that it has a target mean of zero cases/day with a target of plus or minus three cases/day, you can ignore the false alarm at day 30 and pick up the outbreak at day 92:
climit = 5;
mshift = 1;
tmean = 0;
tdev = 3;
cusum(dayOverDayCases(1:100),climit,mshift,tmean,tdev)
Finding a Significant Change in Variance
Another method of detecting abrupt changes in statistics is through changepoint detection, which partitions a signal into adjacent segments where a statistic (e.g. mean, variance, slope, etc.) is constant within each segment.
The next example analyzes the yearly minimal water level of the Nile river for the years 622 to 1281 AD measured at the Roda gauge near Cairo.
load nilometer
years = 622:1284;
plot(years,nileriverminima)
title('Yearly Minimum level of Nile River')
xlabel('Year')
ylabel('Level (m)')
Construction began on a newer more accurate measuring device around 715 AD. Not much is known before this time, but on further examination, you can see that there is considerably less variability after around 722. To find the period of time when the new device became operational, you can search for the best change in the root-mean-square water level after performing element-wise differentiation to remove any slowly varying trends.
i = findchangepts(diff(nileriverminima),'Statistic','rms');
ax = gca;
xp = [years(i) ax.XLim([2 2]) years(i)];
yp = ax.YLim([1 1 2 2]);
patch(datenum(xp),yp,[.5 .5 .5],'facealpha',0.1);
While sample-wise differentiation is a simple method to remove trends, there are other more sophisticated methods to examine variance over larger scales. For an example of how to perform changepoint detection via wavelets using this dataset, see Wavelet Changepoint Detection (Wavelet Toolbox).
Detecting Multiple Changes in an Input Signal
The next example is concerned with a 45 second simulation of a CR-CR 4-speed transmission block, sampled at 1 ms intervals. The simulation data of the car engine RPM and torque are shown below.
load simcarsig
subplot(2,1,2);
plot(carTorqueNM);
xlabel('Samples');
ylabel('Torque (N m)');
title('Torque');
subplot(2,1,1);
plot(carEngineRPM);
xlabel('Samples');
ylabel('Speed (RPM)');
title('Engine Speed');
Here the car accelerates, changes gears three times, switches to neutral, and then applies the brake.
Since the engine speed can be naturally modeled as a series of linear segments, you can use findchangepts to find the samples where the car changes gears.
figure
findchangepts(carEngineRPM,'Statistic','linear','MaxNumChanges',4)
xlabel('Samples');
ylabel('Engine speed (RPM)');
Here you can see four changes (between five linear segments) and that they occurred around the 10,000, 20,000, 30,000, and 40,000 sample mark. Zoom into the idle portion of the waveform:
xlim([18000 22000])
Note that the straight-line fit closely tracks the input waveform, however it can be improved.
Observing Changes of a Multi-Stage Event Shared Between Signals
To see the improvement, increase the number of changepoints to 20, and observe the changes within the vicinity of the gear change at sample number 19000
findchangepts(carEngineRPM,'Statistic','linear','MaxNumChanges',20)
xlim([18000 22000])
Observe that the engine speed started decreasing at sample 19035 and took 510 samples before it settled at sample 19550. Since the sampling interval is 1 ms, this is a ~0.51 s delay and is a typical amount of time after changing gears.
Now look at the changepoints of engine torque within the same region:
findchangepts(carTorqueNM,'Statistic','Linear','MaxNumChanges',20)
xlim([19000 20000])
Observe that the engine torque was fully delivered to the axle at sample 19605, 55 milliseconds after the engine speed finished settling. This time is related to the delay between the intake stroke of the engine and torque production.
To find when the clutch became engaged you can zoom further into the signal.
xlim([19000 19050])
The clutch was depressed at sample 19011 and took about 30 samples (milliseconds) to become completely disengaged.
See Also
| |
|
__label__pos
| 0.808609 |
Tag Info
New answers tagged
1
Because MonoIntervals[f[x],x] will evaluate like this: MonoIntervals[f[x], x] MonoIntervals[x^2+2*x-10, x] And it stops there because x^2+2*x-10 doesn't match the pattern func_[arg_]. What precisely are you trying to achieve by using this pattern?
1
It appears that 1879 is correct. Cofactor[a,{1,1}] is equivalent to Det[a[[2 ;;, 2 ;;]]], which is 1879. More generally, Cofactor[a,{i,j}] is equivalent to Det[Drop[a, {i}, {j}]]*(2*Mod[i*j, 2] - 1) The second term here accounts cofactors for the fact that the even positions of odd rows (and the odd positions of even rows) are the negative of the ...
1
The book A Mathematical Introduction to Robotic Manipulation talks about kinematic and dynamic modeling for manipulators based on Screw theory. It provides a Mathematica Package for Screw Calculus. I find it quite useful.
3
Here is an example of how to do it. We need xTensor and xCoba packages. First is made to work with abstract objects, whilst the second is for operations with explicitly specified metric and basis: << xAct`xTensor` << xAct`xCoba`(*Package*) Then comes an example of how to define and get all the quantities for Kerr metric. In your case you ...
2
I don't have a general approach but in a world where 19 and x^4+23 define our number field, a decomposition can be found by factoring the polynomial. InputForm[Factor[x^4+23,Modulus->19]] (* Out[3]//InputForm= (2 + 2*x + x^2)*(2 + 17*x + x^2) *) The upshot is that the ideal <19,x^4+23> in Z[x] is the ...
5
You need to use Remove[Global`Convert] instead of Remove[Convert] Convert is coloured red as a warning because both Units`Convert and Global`Convert exist, so when you simply type Convert one of the two has to be chosen, which might not be the one you wanted.
1
Messages defined for a symbol are stored in list of rules Messages[sym] similar to DownValues, UpValues etc. We can use this fact to create general message inheritance mechanism. Let's start with defining custom message on our own general symbol: ClearAll[general] general::myMessage = "text of general myMessage" As expected this message is stored in a ...
Top 50 recent answers are included
|
__label__pos
| 0.996852 |
Android 3D旋轉動畫效果實現分解
來源：互聯網
上載者：User
這篇文章主要介紹一下如何?View的3D旋轉效果，實現的主要原理就是圍繞Y軸旋轉，同時在Z軸方面上有一個深入的縮放。
示範的demo主要有以下幾個重點：
1，自訂旋轉動畫
2，動畫做完後，重設ImageView
先看一下程式的運行效果：
1，自訂動畫類
這裡實現了一個Rotate3dAnimation的類，它擴充了Animation類，重寫applyTransformation()方法，提供指定時間的矩陣變換，我們在這個方法裡，就可以利用Camera類得得到一個圍繞Y軸旋轉的matrix，把這個matrix設定到Transformation對象中。 具體的實現代碼如下： 複製代碼 代碼如下:@Override
protected void applyTransformation(float interpolatedTime, Transformation t)
{
final float fromDegrees = mFromDegrees;
float degrees = fromDegrees + ((mToDegrees - fromDegrees) * interpolatedTime);
final float centerX = mCenterX;
final float centerY = mCenterY;
final Camera camera = mCamera;
final Matrix matrix = t.getMatrix();
camera.save();
if (mReverse) {
camera.translate(0.0f, 0.0f, mDepthZ * interpolatedTime);
} else {
camera.translate(0.0f, 0.0f, mDepthZ * (1.0f - interpolatedTime));
}
camera.rotateY(degrees);
camera.getMatrix(matrix);
camera.restore();
matrix.preTranslate(-centerX, -centerY);
matrix.postTranslate(centerX, centerY);
}
2，如何使用這個動畫類
在Activity中，我們有兩個大小一樣的ImageView，它們都放在FrameLayout中，這樣他們位置是重疊的，對最上面的ImageView做動畫（旋轉角度從0到90），當動畫做完後，再對後面的ImageView做動畫（旋轉角度從90到180），在這裡，要控制相應的ImageView隱藏或顯示。
動畫的listener實現如下： 複製代碼 代碼如下:private final class DisplayNextView implements Animation.AnimationListener {
public void onAnimationStart(Animation animation) {
}
public void onAnimationEnd(Animation animation) {
mContainer.post(new SwapViews());
}
public void onAnimationRepeat(Animation animation) {
}
}
動畫做完後，執行的代碼如下： 複製代碼 代碼如下:private final class SwapViews implements Runnable
{
@Override
public void run()
{
mImageView1.setVisibility(View.GONE);
mImageView2.setVisibility(View.GONE);
mIndex++;
if (0 == mIndex % 2)
{
mStartAnimView = mImageView1;
}
else
{
mStartAnimView = mImageView2;
}
mStartAnimView.setVisibility(View.VISIBLE);
mStartAnimView.requestFocus();
Rotate3dAnimation rotation = new Rotate3dAnimation(
-90,
0,
mCenterX,
mCenterY, mDepthZ, false);
rotation.setDuration(mDuration);
rotation.setFillAfter(true);
rotation.setInterpolator(new DecelerateInterpolator());
mStartAnimView.startAnimation(rotation);
}
}
點擊Button的事件處理實現: 複製代碼 代碼如下:@Override
public void onClick(View v)
{
mCenterX = mContainer.getWidth() / 2;
mCenterY = mContainer.getHeight() / 2;
getDepthZ();
applyRotation(mStartAnimView, 0, 90);
}
applyRotation的實現如下： 複製代碼 代碼如下:private void applyRotation(View animView, float startAngle, float toAngle)
{
float centerX = mCenterX;
float centerY = mCenterY;
Rotate3dAnimation rotation = new Rotate3dAnimation(
startAngle, toAngle, centerX, centerY, mDepthZ, true);
rotation.setDuration(mDuration);
rotation.setFillAfter(true);
rotation.setInterpolator(new AccelerateInterpolator());
rotation.setAnimationListener(new DisplayNextView());
animView.startAnimation(rotation);
}
3，完整代碼如下
Rotate3dAnimActivity.java 複製代碼 代碼如下:public class Rotate3dAnimActivity extends Activity
{
ImageView mImageView1 = null;
ImageView mImageView2 = null;
ImageView mStartAnimView = null;
View mContainer = null;
int mDuration = 500;
float mCenterX = 0.0f;
float mCenterY = 0.0f;
float mDepthZ = 0.0f;
int mIndex = 0;
@Override
public void onCreate(Bundle savedInstanceState)
{
super.onCreate(savedInstanceState);
setContentView(R.layout.rotate_anim);
mImageView1 = (ImageView) findViewById(R.id.imageView1);
mImageView2 = (ImageView) findViewById(R.id.imageView2);
mContainer = findViewById(R.id.container);
mStartAnimView = mImageView1;
findViewById(R.id.button1).setOnClickListener(new View.OnClickListener()
{
@Override
public void onClick(View v)
{
mCenterX = mContainer.getWidth() / 2;
mCenterY = mContainer.getHeight() / 2;
getDepthZ();
applyRotation(mStartAnimView, 0, 90);
}
});
InputMethodManager imm = (InputMethodManager)getSystemService(INPUT_METHOD_SERVICE);
imm.hideSoftInputFromWindow(getWindow().getDecorView().getWindowToken(), InputMethodManager.HIDE_NOT_ALWAYS);
}
private void getDepthZ()
{
EditText editText = (EditText) findViewById(R.id.edit_depthz);
String string = editText.getText().toString();
try
{
mDepthZ = (float)Integer.parseInt(string);
//mDepthZ = Math.min(mDepthZ, 300.0f);
}
catch (Exception e)
{
e.printStackTrace();
}
}
private void applyRotation(View animView, float startAngle, float toAngle)
{
float centerX = mCenterX;
float centerY = mCenterY;
Rotate3dAnimation rotation = new Rotate3dAnimation(
startAngle, toAngle, centerX, centerY, mDepthZ, true);
rotation.setDuration(mDuration);
rotation.setFillAfter(true);
rotation.setInterpolator(new AccelerateInterpolator());
rotation.setAnimationListener(new DisplayNextView());
animView.startAnimation(rotation);
}
/**
* This class listens for the end of the first half of the animation.
* It then posts a new action that effectively swaps the views when the container
* is rotated 90 degrees and thus invisible.
*/
private final class DisplayNextView implements Animation.AnimationListener {
public void onAnimationStart(Animation animation) {
}
public void onAnimationEnd(Animation animation) {
mContainer.post(new SwapViews());
}
public void onAnimationRepeat(Animation animation) {
}
}
private final class SwapViews implements Runnable
{
@Override
public void run()
{
mImageView1.setVisibility(View.GONE);
mImageView2.setVisibility(View.GONE);
mIndex++;
if (0 == mIndex % 2)
{
mStartAnimView = mImageView1;
}
else
{
mStartAnimView = mImageView2;
}
mStartAnimView.setVisibility(View.VISIBLE);
mStartAnimView.requestFocus();
Rotate3dAnimation rotation = new Rotate3dAnimation(
-90,
0,
mCenterX,
mCenterY, mDepthZ, false);
rotation.setDuration(mDuration);
rotation.setFillAfter(true);
rotation.setInterpolator(new DecelerateInterpolator());
mStartAnimView.startAnimation(rotation);
}
}
}
rotate_anim.xml 複製代碼 代碼如下:<?xml version="1.0" encoding="utf-8"?>
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
android:layout_width="fill_parent"
android:layout_height="fill_parent"
android:orientation="vertical" >
<Button
android:id="@+id/button1"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:layout_margin="20dp"
android:text="Do 3d animation" />
<TextView
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:layout_marginLeft="20px"
android:text="Input Depth on Z axis. [0, 300]"
/>
<EditText
android:id="@+id/edit_depthz"
android:layout_width="200dp"
android:layout_height="wrap_content"
android:layout_margin="20dp"
android:text="0"/>
<FrameLayout
android:id="@+id/container"
android:layout_width="wrap_content"
android:layout_height="wrap_content">
<ImageView
android:id="@+id/imageView1"
android:layout_width="200dp"
android:layout_height="200dp"
android:layout_margin="20dp"
android:src="@drawable/f" />
<ImageView
android:id="@+id/imageView2"
android:layout_width="200dp"
android:layout_height="200dp"
android:layout_margin="20dp"
android:src="@drawable/s"
android:visibility="gone"/>
</FrameLayout>
</LinearLayout>
Rotate3dAnimation.java 複製代碼 代碼如下:package com.nj1s.lib.anim;
import android.graphics.Camera;
import android.graphics.Matrix;
import android.view.animation.Animation;
import android.view.animation.Transformation;
/**
* An animation that rotates the view on the Y axis between two specified angles.
* This animation also adds a translation on the Z axis (depth) to improve the effect.
*/
public class Rotate3dAnimation extends Animation {
private final float mFromDegrees;
private final float mToDegrees;
private final float mCenterX;
private final float mCenterY;
private final float mDepthZ;
private final boolean mReverse;
private Camera mCamera;
/**
* Creates a new 3D rotation on the Y axis. The rotation is defined by its
* start angle and its end angle. Both angles are in degrees. The rotation
* is performed around a center point on the 2D space, definied by a pair
* of X and Y coordinates, called centerX and centerY. When the animation
* starts, a translation on the Z axis (depth) is performed. The length
* of the translation can be specified, as well as whether the translation
* should be reversed in time.
*
* @param fromDegrees the start angle of the 3D rotation
* @param toDegrees the end angle of the 3D rotation
* @param centerX the X center of the 3D rotation
* @param centerY the Y center of the 3D rotation
* @param reverse true if the translation should be reversed, false otherwise
*/
public Rotate3dAnimation(float fromDegrees, float toDegrees,
float centerX, float centerY, float depthZ, boolean reverse) {
mFromDegrees = fromDegrees;
mToDegrees = toDegrees;
mCenterX = centerX;
mCenterY = centerY;
mDepthZ = depthZ;
mReverse = reverse;
}
@Override
public void initialize(int width, int height, int parentWidth, int parentHeight) {
super.initialize(width, height, parentWidth, parentHeight);
mCamera = new Camera();
}
@Override
protected void applyTransformation(float interpolatedTime, Transformation t) {
final float fromDegrees = mFromDegrees;
float degrees = fromDegrees + ((mToDegrees - fromDegrees) * interpolatedTime);
final float centerX = mCenterX;
final float centerY = mCenterY;
final Camera camera = mCamera;
final Matrix matrix = t.getMatrix();
camera.save();
if (mReverse) {
camera.translate(0.0f, 0.0f, mDepthZ * interpolatedTime);
} else {
camera.translate(0.0f, 0.0f, mDepthZ * (1.0f - interpolatedTime));
}
camera.rotateY(degrees);
camera.getMatrix(matrix);
camera.restore();
matrix.preTranslate(-centerX, -centerY);
matrix.postTranslate(centerX, centerY);
}
}
各位，請想一想，為實現applyTransformation方法時，最後的為什麼要有這兩句話：
matrix.preTranslate(-centerX, -centerY);
matrix.postTranslate(centerX, centerY);
相關文章
聯繫我們
該頁面正文內容均來源於網絡整理，並不代表阿里雲官方的觀點，該頁面所提到的產品和服務也與阿里云無關，如果該頁面內容對您造成了困擾，歡迎寫郵件給我們，收到郵件我們將在5個工作日內處理。
如果您發現本社區中有涉嫌抄襲的內容，歡迎發送郵件至： [email protected] 進行舉報並提供相關證據，工作人員會在 5 個工作天內聯絡您，一經查實，本站將立刻刪除涉嫌侵權內容。
Tags Index:
|
__label__pos
| 0.958882 |
A pretty good presentation from Adam McCrea already explains how to use meta-programming to build your own Javascript libraries. However I’d argue that it’s more about clever APIs than strictly meta-programming. For the best or the worst, meta-programming involves magic. Like dynamic finders in Rails or should() and have() in RSpec. It’s mostly about dynamically catching method calls, adding methods on the fly or proxying them. Like reprogramming while executing. Hence the name.
So I’m going to show you some techniques available in Javascript to achieve the same results. I’ll start with fairly trivial stuff to move into the nitty-gritty details. Be aware that it’s very easy to shoot yourself in the foot if you abuse these tricks, guaranteeing endless hours of pain for you and your users. You know, with great powers come great responsibilities and such…
A last warning. Some of the techniques are simple plain Javascript but most of them use features only available in SpiderMonkey and Rhino. So if you’re thinking browser, forget about IEÂ and most non-Mozilla stuff. But I’m thinking server anyway. The good news is that ECMAScript 4 (aka Javascript 2.0) will include some variations of these as part of the standard language (which doesn’t mean the Redmond people will give a shit).
Altering Built-in Prototypes
Javascript is prototype based, so if you want to alter the behavior of all objects of a given “type” you have to alter its prototype. However it’s possible to alter the built-in prototypes in any Javascript engine and make them do whatever suits your fancy. A fairly common way to use this is to add utility functions that make your code nicer, like array.first() for example. Another far more dangerous way is to alter the behavior of existing functions. Needless to say, it’s fairly easy to break a lot of code this way.
For example, imagine we’d like all string concatenation to be separated by a dash:
js> var oldConcat = String.prototype.concat
js> String.prototype.concat = function(other) { return oldConcat.call(oldConcat.call(this, “-“), other); }
js> “aa”.concat(“bb”)
aa-bb
js> String.prototype.concat = oldConcat;
js> “aa”.concat(“bb”)
aabb
As demonstrated above, cleaning up your mess by restoring the original function is highly recommended.
Accessors
A set of methods have been defined in SpiderMonkey and Rhino to let you mess with accessors. These are the sweetly named __defineGetter__, __defineSetter__, __lookupGetter__ and __lookupSetter__. That’s a lot of underscores. The idea is you can get an object, override one of its accessors with a function of yours and do all sort of neat things with it, like proxying calls for example. Here is an example that will let you do just that:
var watchableAttr = function(obj, attr, onSet, onGet) {
if (!obj.__lookupGetter__(attr)) {
var value = obj[attr];
var valueChanged = false;
obj.__defineSetter__(attr, function(v) {
valueChanged = true;
if (onSet) value = onSet(obj, attr, v);
else value = v;
});
obj.__defineGetter__(attr, function() {
if (onGet) return onGet(obj, attr, value);
else return value;
});
obj.__defineGetter__(attr + “Changed”, function() {
return valueChanged;
});
}
};
This function will watch property changes, setting valueChanged to true if it did change. Additionally, if functions are provided for the onSet and onGet attributes, these will get invoked to eventually intercept the call and change its result.
There’s a little gotcha to be aware of here, it’s not directly related to meta-programming but is also interesting. This function call will create three closures, referencing the value and the valueChanged local variables. So when the setter is invoked, the variable that will be set is value, not the underlying accessor. Similarly, the getter will return value, not what the accessor contains. Why doing it that way? Simply because using the accessor directly would result in an endless loop.
One more little detail. These accessor methods also work for array indexes. After all, an array is just an object whose properties are numbers. So if you really want an array to have a constant value at the 0 position:
js> arr.__defineGetter__(0, function() { return 0; });
js> arr[0] = 5;
5
js> arr[0]
0
No Missed Calls
In Ruby, magic is very often implemented with method_missing. It’s a method that’s used as a callback by the interpreter when it can’t find a method being invoked on an object. Add a method_missing method to your classes and all of a sudden you can intercept any missed call.
It turns out that Rhino and SpiderMonkey also have their own callback method: __noSuchMethod__. Let’s see a trivial example:
js> var myObj = { __noSuchMethod__: function(name, params) { print(“Function ” + name + ” has been called.”); } }
js> myObj.foo();
Function foo has been called.
Neat, isn’t it? Let’s see how a Rails style dynamic finder could be implemented.
this.__noSuchMethod__ = dbCall(function(name, params) {
if (name.startsWith(“findBy”)) {
var criteria = ju.camelAndToArray(name.substring(6));
var stmt = “SELECT * FROM ” + jh.quote(ju.underscore(this.name)) + ” WHERE ” + jh.toParamsNameEq(criteria);
return buildObjects.call(this, jo.db.query(stmt, params));
} else {
throw new ReferenceError(“”” + name + “” is not defined.”);
}
});
}();
There are quite a few utility methods used here but their code isn’t really needed to understand the example. The name of the function being called is checked to see if it starts with “findBy”. Whatever comes after is used as parameters to generate a query dynamically. The most important part of this code is actually the exception thrown. When you’re playing with that sort of tricks, it’s very important to handle everything you can handle properly and fail as soon as something goes through the cracks. Otherwise you’re up for looong debugging sessions.
This code could also be further optimized. Always going through the __noSuchMethod__ callback has a performance penalty. But if findByName is called once, you can safely assume that it’s going to be called at least a few more times. A better implementation would add the findByName method in the called object so that any subsequent call would find its destination directly. Yep, you can also do that in Javascript.
Conclusion
I’ve detailed the 3 main techniques of meta-programming I’ve seen used in libraries in the wild. The magic bit. Javascript is already a very dynamic language, allowing a lot. But sometimes, having the possibility to do this one more thing makes all the difference between a good framework (JUnit) and a wonderful framework (RSpec). Some would call them hacks. I call them powerful tools that I keep in a special place in my toolbox and try to use wisely.
About these ads
|
__label__pos
| 0.919708 |
Basic Pascal Tutorial/Chapter 4/Functions
From Lazarus wiki
Jump to navigationJump to search
български (bg) English (en) français (fr) 日本語 (ja) 中文（中国大陆） (zh_CN)
◄ ▲ ►
4C - Functions (author: Tao Yue, state: unchanged)
Functions work the same way as procedures, but they always return a single value to the main program through its own name:
function Name (parameter_list) : return_type;
Functions are called in the main program by using them in expressions:
a := Name (5) + 3;
If your function has no argument, be careful not to use the name of the function on the right side of any equation inside the function. That is:
function Name : integer;
begin
Name := 2;
Name := Name + 1
end.
is a no-no. Instead of returning the value 3, as might be expected, this sets up an infinite recursive loop in certain language modes (e.g. {$MODE DELPHI} or {$MODE TP}; other modes require brackets for function call even if the brackets are empty due to no parameters being required for the particular function). Name will call Name, which will call Name, which will call Name, etc.
The return value is set by assigning a value to the function identifier.
Name := 5;
It is generally bad programming form to make use of VAR parameters in functions -- functions should return only one value. You certainly don't want the sin function to change your pi radians to 0 radians because they're equivalent -- you just want the answer 0.
◄ ▲ ►
|
__label__pos
| 0.589297 |
• Single point line (two verteces on top of each other) = NO POINT DRAWN
From Skybuck Flying@21:1/5 to All on Sat Apr 30 08:44:32 2022
Code is currently:
with TOpenGLAPIVersion110 do
begin
// render ray
glLineWidth( 1 );
glBegin(GL_LINES);
// begin of ray is dark gray
glColor3f( 0.25, 0.25, 0.25 );
glVertex2f( mRay.Start.X, mRay.Start.Y);
glColor3f( 0.75, 0.75, 0.75 );
glVertex2f( mRay.Stop.X, mRay.Stop.Y);
glEnd();
end;
When x,y,z coordinates of Ray.Start is equal to those of Ray.Stop OpenGL does not draw a "point".
Why is this ?
Are the end points of lines "not inclusive" ?
Bye,
Skybuck.
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)
|
__label__pos
| 0.980471 |
3
$\begingroup$
This question is related to ElGamal signature scheme as defined here ElGamal signature without calculating the inverse
Show how one could exploit an implementation ElGamal signature scheme in which it is not checked that $0 \leq \gamma \leq p-1.$
As far as I can see, we have to find a $\gamma$ such that $\alpha^{a\gamma-x}\gamma^\delta \equiv 1 \pmod{p}$ for a message $x$.
Anyone happens to see a good choice of $\gamma$?
$\endgroup$
1
$\begingroup$
As Wikipedia’s Chinese remainder theorem article states:
The Chinese remainder theorem is a theorem of number theory, which states that if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime.
Using that, you can solve this by finding a $\gamma$ satisfying
$$\gamma \equiv 0 \pmod{p-1}$$
and
$$\gamma \equiv \alpha^x \pmod{p}$$
and you’re done.
| improve this answer | |
$\endgroup$
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.98773 |
Kae Travis
Using PowerShell to Read and Write XML
Posted on by in PowerShell
Tags:
This blog provides a simple example of using PowerShell to read and write XML nodes and attribute names.
Using PowerShell to Write XML
In this example, we first create a new [System.Xml.XmlDocument] object to represent our XML document. We then create a root node and append it to the document. We create a child node, add an attribute and inner text, and append it to the root node.
Finally, we save the XML document to a file using the Save method.
# Create new XML document
$xml = New-Object -TypeName System.Xml.XmlDocument
# Create root node
$root = $xml.CreateElement("RootNode")
$xml.AppendChild($root)
# Create child node with attribute and value
$child = $xml.CreateElement("ChildNode")
$child.SetAttribute("AttributeName", "AttributeValue")
$child.InnerText = "Inner text"
$root.AppendChild($child)
# Save XML to file
$xml.Save("C:\alkane\example.xml")
Using PowerShell to Read XML
In this example, we first load an XML file using the Get-Content cmdlet and cast it as an [xml] object using the PowerShell type accelerator. We can then access specific elements and attributes within the XML document using dot notation.
# Load XML file
[xml]$xml = Get-Content -Path C:\alkane\example.xml
# Access XML elements and attributes
$xml.RootNode.ChildNode.AttributeName
$xml.RootNode.ChildNode.InnerText
Using PowerShell to Iterate Through XML Nodes and Attributes
Let’s suppose our XML file has more than one child node like so:
# Create new XML document
$xml = New-Object -TypeName System.Xml.XmlDocument
# Create root node
$root = $xml.CreateElement("RootNode")
$xml.AppendChild($root)
# Create child node with attribute and value
$child = $xml.CreateElement("ChildNode")
$child.SetAttribute("AttributeName", "AttributeValue1")
$child.InnerText = "Inner text 1"
$root.AppendChild($child)
# Create another child node with attribute and value
$child = $xml.CreateElement("ChildNode")
$child.SetAttribute("AttributeName", "AttributeValue2")
$child.InnerText = "Inner text 2"
$root.AppendChild($child)
# Save XML to file
$xml.Save("C:\alkane\example.xml")
We might then want to loop through these child nodes to read each node text and attribute. We can do this like so:
# Load XML file
[xml]$xml = Get-Content -Path C:\alkane\example.xml
# Loop through nodes and attributes
foreach ($node in $xml.RootNode.ChildNodes) {
Write-Host "Node name: $($node.Name)"
Write-Host "Node value: $($node.InnerText)"
foreach ($attribute in $node.Attributes) {
Write-Host "Attribute name: $($attribute.Name)"
Write-Host "Attribute value: $($attribute.Value)"
}
}
Using PowerShell to Read and Write XML
Using PowerShell to Read and Write XML
Leave a Reply
|
__label__pos
| 0.999316 |
{ "servicePath": "", "version": "v1", "parameters": { "oauth_token": { "description": "OAuth 2.0 token for the current user.", "location": "query", "type": "string" }, "$.xgafv": { "enumDescriptions": [ "v1 error format", "v2 error format" ], "location": "query", "description": "V1 error format.", "type": "string", "enum": [ "1", "2" ] }, "callback": { "location": "query", "type": "string", "description": "JSONP" }, "quotaUser": { "location": "query", "description": "Available to use for quota purposes for server-side applications. Can be any arbitrary string assigned to a user, but should not exceed 40 characters.", "type": "string" }, "fields": { "location": "query", "description": "Selector specifying which fields to include in a partial response.", "type": "string" }, "uploadType": { "location": "query", "description": "Legacy upload protocol for media (e.g. \"media\", \"multipart\").", "type": "string" }, "access_token": { "description": "OAuth access token.", "type": "string", "location": "query" }, "alt": { "enumDescriptions": [ "Responses with Content-Type of application/json", "Media download with context-dependent Content-Type", "Responses with Content-Type of application/x-protobuf" ], "location": "query", "description": "Data format for response.", "default": "json", "type": "string", "enum": [ "json", "media", "proto" ] }, "key": { "location": "query", "type": "string", "description": "API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token." }, "upload_protocol": { "type": "string", "location": "query", "description": "Upload protocol for media (e.g. \"raw\", \"multipart\")." }, "prettyPrint": { "description": "Returns response with indentations and line breaks.", "type": "boolean", "location": "query", "default": "true" } }, "ownerName": "Google", "version_module": true, "mtlsRootUrl": "https://accesscontextmanager.mtls.googleapis.com/", "kind": "discovery#restDescription", "icons": { "x32": "http://www.google.com/images/icons/product/search-32.gif", "x16": "http://www.google.com/images/icons/product/search-16.gif" }, "name": "accesscontextmanager", "ownerDomain": "google.com", "id": "accesscontextmanager:v1", "rootUrl": "https://accesscontextmanager.googleapis.com/", "baseUrl": "https://accesscontextmanager.googleapis.com/", "canonicalName": "Access Context Manager", "fullyEncodeReservedExpansion": true, "resources": { "accessPolicies": { "methods": { "patch": { "response": { "$ref": "Operation" }, "parameters": { "updateMask": { "description": "Required. Mask to control which fields get updated. Must be non-empty.", "location": "query", "format": "google-fieldmask", "type": "string" }, "name": { "description": "Output only. Resource name of the `AccessPolicy`. Format: `accessPolicies/{policy_id}`", "pattern": "^accessPolicies/[^/]+$", "type": "string", "location": "path", "required": true } }, "id": "accesscontextmanager.accessPolicies.patch", "request": { "$ref": "AccessPolicy" }, "parameterOrder": [ "name" ], "flatPath": "v1/accessPolicies/{accessPoliciesId}", "httpMethod": "PATCH", "description": "Update an AccessPolicy. The longrunning Operation from this RPC will have a successful status once the changes to the AccessPolicy have propagated to long-lasting storage. Syntactic and basic semantic errors will be returned in `metadata` as a BadRequest proto.", "path": "v1/{+name}", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ] }, "delete": { "flatPath": "v1/accessPolicies/{accessPoliciesId}", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "httpMethod": "DELETE", "description": "Delete an AccessPolicy by resource name. The longrunning Operation will have a successful status once the AccessPolicy has been removed from long-lasting storage.", "id": "accesscontextmanager.accessPolicies.delete", "path": "v1/{+name}", "response": { "$ref": "Operation" }, "parameters": { "name": { "required": true, "description": "Required. Resource name for the access policy to delete. Format `accessPolicies/{policy_id}`", "location": "path", "pattern": "^accessPolicies/[^/]+$", "type": "string" } }, "parameterOrder": [ "name" ] }, "create": { "flatPath": "v1/accessPolicies", "parameters": {}, "description": "Create an `AccessPolicy`. Fails if this organization already has a `AccessPolicy`. The longrunning Operation will have a successful status once the `AccessPolicy` has propagated to long-lasting storage. Syntactic and basic semantic errors will be returned in `metadata` as a BadRequest proto.", "request": { "$ref": "AccessPolicy" }, "parameterOrder": [], "httpMethod": "POST", "response": { "$ref": "Operation" }, "path": "v1/accessPolicies", "id": "accesscontextmanager.accessPolicies.create", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ] }, "list": { "description": "List all AccessPolicies under a container.", "response": { "$ref": "ListAccessPoliciesResponse" }, "flatPath": "v1/accessPolicies", "httpMethod": "GET", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "id": "accesscontextmanager.accessPolicies.list", "path": "v1/accessPolicies", "parameterOrder": [], "parameters": { "parent": { "location": "query", "type": "string", "description": "Required. Resource name for the container to list AccessPolicy instances from. Format: `organizations/{org_id}`" }, "pageSize": { "format": "int32", "description": "Number of AccessPolicy instances to include in the list. Default 100.", "type": "integer", "location": "query" }, "pageToken": { "description": "Next page token for the next batch of AccessPolicy instances. Defaults to the first page of results.", "type": "string", "location": "query" } } }, "get": { "id": "accesscontextmanager.accessPolicies.get", "path": "v1/{+name}", "response": { "$ref": "AccessPolicy" }, "flatPath": "v1/accessPolicies/{accessPoliciesId}", "httpMethod": "GET", "description": "Get an AccessPolicy by name.", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "parameters": { "name": { "type": "string", "required": true, "pattern": "^accessPolicies/[^/]+$", "location": "path", "description": "Required. Resource name for the access policy to get. Format `accessPolicies/{policy_id}`" } }, "parameterOrder": [ "name" ] } }, "resources": { "servicePerimeters": { "methods": { "delete": { "description": "Delete a Service Perimeter by resource name. The longrunning operation from this RPC will have a successful status once the Service Perimeter has been removed from long-lasting storage.", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "id": "accesscontextmanager.accessPolicies.servicePerimeters.delete", "flatPath": "v1/accessPolicies/{accessPoliciesId}/servicePerimeters/{servicePerimetersId}", "httpMethod": "DELETE", "path": "v1/{+name}", "parameterOrder": [ "name" ], "parameters": { "name": { "pattern": "^accessPolicies/[^/]+/servicePerimeters/[^/]+$", "type": "string", "location": "path", "description": "Required. Resource name for the Service Perimeter. Format: `accessPolicies/{policy_id}/servicePerimeters/{service_perimeter_id}`", "required": true } }, "response": { "$ref": "Operation" } }, "commit": { "request": { "$ref": "CommitServicePerimetersRequest" }, "path": "v1/{+parent}/servicePerimeters:commit", "parameters": { "parent": { "type": "string", "pattern": "^accessPolicies/[^/]+$", "description": "Required. Resource name for the parent Access Policy which owns all Service Perimeters in scope for the commit operation. Format: `accessPolicies/{policy_id}`", "location": "path", "required": true } }, "parameterOrder": [ "parent" ], "response": { "$ref": "Operation" }, "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "description": "Commit the dry-run spec for all the Service Perimeters in an Access Policy. A commit operation on a Service Perimeter involves copying its `spec` field to that Service Perimeter's `status` field. Only Service Perimeters with `use_explicit_dry_run_spec` field set to true are affected by a commit operation. The longrunning operation from this RPC will have a successful status once the dry-run specs for all the Service Perimeters have been committed. If a commit fails, it will cause the longrunning operation to return an error response and the entire commit operation will be cancelled. When successful, Operation.response field will contain CommitServicePerimetersResponse. The `dry_run` and the `spec` fields will be cleared after a successful commit operation.", "httpMethod": "POST", "flatPath": "v1/accessPolicies/{accessPoliciesId}/servicePerimeters:commit", "id": "accesscontextmanager.accessPolicies.servicePerimeters.commit" }, "list": { "description": "List all Service Perimeters for an access policy.", "response": { "$ref": "ListServicePerimetersResponse" }, "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "parameterOrder": [ "parent" ], "path": "v1/{+parent}/servicePerimeters", "flatPath": "v1/accessPolicies/{accessPoliciesId}/servicePerimeters", "id": "accesscontextmanager.accessPolicies.servicePerimeters.list", "parameters": { "parent": { "location": "path", "required": true, "description": "Required. Resource name for the access policy to list Service Perimeters from. Format: `accessPolicies/{policy_id}`", "pattern": "^accessPolicies/[^/]+$", "type": "string" }, "pageSize": { "type": "integer", "description": "Number of Service Perimeters to include in the list. Default 100.", "format": "int32", "location": "query" }, "pageToken": { "description": "Next page token for the next batch of Service Perimeter instances. Defaults to the first page of results.", "location": "query", "type": "string" } }, "httpMethod": "GET" }, "get": { "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "response": { "$ref": "ServicePerimeter" }, "id": "accesscontextmanager.accessPolicies.servicePerimeters.get", "parameters": { "name": { "required": true, "pattern": "^accessPolicies/[^/]+/servicePerimeters/[^/]+$", "type": "string", "description": "Required. Resource name for the Service Perimeter. Format: `accessPolicies/{policy_id}/servicePerimeters/{service_perimeters_id}`", "location": "path" } }, "description": "Get a Service Perimeter by resource name.", "httpMethod": "GET", "flatPath": "v1/accessPolicies/{accessPoliciesId}/servicePerimeters/{servicePerimetersId}", "path": "v1/{+name}", "parameterOrder": [ "name" ] }, "patch": { "id": "accesscontextmanager.accessPolicies.servicePerimeters.patch", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "description": "Update a Service Perimeter. The longrunning operation from this RPC will have a successful status once the changes to the Service Perimeter have propagated to long-lasting storage. Service Perimeter containing errors will result in an error response for the first error encountered.", "path": "v1/{+name}", "response": { "$ref": "Operation" }, "parameters": { "name": { "type": "string", "description": "Required. Resource name for the ServicePerimeter. The `short_name` component must begin with a letter and only include alphanumeric and '_'. Format: `accessPolicies/{policy_id}/servicePerimeters/{short_name}`", "required": true, "pattern": "^accessPolicies/[^/]+/servicePerimeters/[^/]+$", "location": "path" }, "updateMask": { "location": "query", "format": "google-fieldmask", "description": "Required. Mask to control which fields get updated. Must be non-empty.", "type": "string" } }, "httpMethod": "PATCH", "request": { "$ref": "ServicePerimeter" }, "parameterOrder": [ "name" ], "flatPath": "v1/accessPolicies/{accessPoliciesId}/servicePerimeters/{servicePerimetersId}" }, "create": { "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "response": { "$ref": "Operation" }, "parameterOrder": [ "parent" ], "flatPath": "v1/accessPolicies/{accessPoliciesId}/servicePerimeters", "path": "v1/{+parent}/servicePerimeters", "httpMethod": "POST", "id": "accesscontextmanager.accessPolicies.servicePerimeters.create", "description": "Create a Service Perimeter. The longrunning operation from this RPC will have a successful status once the Service Perimeter has propagated to long-lasting storage. Service Perimeters containing errors will result in an error response for the first error encountered.", "request": { "$ref": "ServicePerimeter" }, "parameters": { "parent": { "location": "path", "required": true, "type": "string", "description": "Required. Resource name for the access policy which owns this Service Perimeter. Format: `accessPolicies/{policy_id}`", "pattern": "^accessPolicies/[^/]+$" } } }, "replaceAll": { "parameterOrder": [ "parent" ], "parameters": { "parent": { "type": "string", "pattern": "^accessPolicies/[^/]+$", "required": true, "description": "Required. Resource name for the access policy which owns these Service Perimeters. Format: `accessPolicies/{policy_id}`", "location": "path" } }, "description": "Replace all existing Service Perimeters in an Access Policy with the Service Perimeters provided. This is done atomically. The longrunning operation from this RPC will have a successful status once all replacements have propagated to long-lasting storage. Replacements containing errors will result in an error response for the first error encountered. Replacement will be cancelled on error, existing Service Perimeters will not be affected. Operation.response field will contain ReplaceServicePerimetersResponse.", "id": "accesscontextmanager.accessPolicies.servicePerimeters.replaceAll", "request": { "$ref": "ReplaceServicePerimetersRequest" }, "response": { "$ref": "Operation" }, "path": "v1/{+parent}/servicePerimeters:replaceAll", "flatPath": "v1/accessPolicies/{accessPoliciesId}/servicePerimeters:replaceAll", "httpMethod": "POST", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ] } } }, "accessLevels": { "methods": { "replaceAll": { "response": { "$ref": "Operation" }, "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "request": { "$ref": "ReplaceAccessLevelsRequest" }, "path": "v1/{+parent}/accessLevels:replaceAll", "flatPath": "v1/accessPolicies/{accessPoliciesId}/accessLevels:replaceAll", "httpMethod": "POST", "parameterOrder": [ "parent" ], "description": "Replace all existing Access Levels in an Access Policy with the Access Levels provided. This is done atomically. The longrunning operation from this RPC will have a successful status once all replacements have propagated to long-lasting storage. Replacements containing errors will result in an error response for the first error encountered. Replacement will be cancelled on error, existing Access Levels will not be affected. Operation.response field will contain ReplaceAccessLevelsResponse. Removing Access Levels contained in existing Service Perimeters will result in error.", "id": "accesscontextmanager.accessPolicies.accessLevels.replaceAll", "parameters": { "parent": { "location": "path", "type": "string", "required": true, "description": "Required. Resource name for the access policy which owns these Access Levels. Format: `accessPolicies/{policy_id}`", "pattern": "^accessPolicies/[^/]+$" } } }, "list": { "response": { "$ref": "ListAccessLevelsResponse" }, "parameters": { "accessLevelFormat": { "type": "string", "enumDescriptions": [ "The format was not specified.", "Uses the format the resource was defined in. BasicLevels are returned as BasicLevels, CustomLevels are returned as CustomLevels.", "Use Cloud Common Expression Language when returning the resource. Both BasicLevels and CustomLevels are returned as CustomLevels." ], "location": "query", "description": "Whether to return `BasicLevels` in the Cloud Common Expression language, as `CustomLevels`, rather than as `BasicLevels`. Defaults to returning `AccessLevels` in the format they were defined.", "enum": [ "LEVEL_FORMAT_UNSPECIFIED", "AS_DEFINED", "CEL" ] }, "pageSize": { "description": "Number of Access Levels to include in the list. Default 100.", "format": "int32", "location": "query", "type": "integer" }, "pageToken": { "description": "Next page token for the next batch of Access Level instances. Defaults to the first page of results.", "location": "query", "type": "string" }, "parent": { "type": "string", "description": "Required. Resource name for the access policy to list Access Levels from. Format: `accessPolicies/{policy_id}`", "location": "path", "required": true, "pattern": "^accessPolicies/[^/]+$" } }, "parameterOrder": [ "parent" ], "httpMethod": "GET", "description": "List all Access Levels for an access policy.", "id": "accesscontextmanager.accessPolicies.accessLevels.list", "flatPath": "v1/accessPolicies/{accessPoliciesId}/accessLevels", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "path": "v1/{+parent}/accessLevels" }, "create": { "httpMethod": "POST", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "flatPath": "v1/accessPolicies/{accessPoliciesId}/accessLevels", "parameters": { "parent": { "type": "string", "required": true, "description": "Required. Resource name for the access policy which owns this Access Level. Format: `accessPolicies/{policy_id}`", "location": "path", "pattern": "^accessPolicies/[^/]+$" } }, "description": "Create an Access Level. The longrunning operation from this RPC will have a successful status once the Access Level has propagated to long-lasting storage. Access Levels containing errors will result in an error response for the first error encountered.", "id": "accesscontextmanager.accessPolicies.accessLevels.create", "response": { "$ref": "Operation" }, "request": { "$ref": "AccessLevel" }, "path": "v1/{+parent}/accessLevels", "parameterOrder": [ "parent" ] }, "delete": { "description": "Delete an Access Level by resource name. The longrunning operation from this RPC will have a successful status once the Access Level has been removed from long-lasting storage.", "path": "v1/{+name}", "parameterOrder": [ "name" ], "parameters": { "name": { "type": "string", "location": "path", "required": true, "description": "Required. Resource name for the Access Level. Format: `accessPolicies/{policy_id}/accessLevels/{access_level_id}`", "pattern": "^accessPolicies/[^/]+/accessLevels/[^/]+$" } }, "response": { "$ref": "Operation" }, "flatPath": "v1/accessPolicies/{accessPoliciesId}/accessLevels/{accessLevelsId}", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "httpMethod": "DELETE", "id": "accesscontextmanager.accessPolicies.accessLevels.delete" }, "get": { "path": "v1/{+name}", "response": { "$ref": "AccessLevel" }, "id": "accesscontextmanager.accessPolicies.accessLevels.get", "parameters": { "name": { "type": "string", "description": "Required. Resource name for the Access Level. Format: `accessPolicies/{policy_id}/accessLevels/{access_level_id}`", "location": "path", "required": true, "pattern": "^accessPolicies/[^/]+/accessLevels/[^/]+$" }, "accessLevelFormat": { "location": "query", "type": "string", "description": "Whether to return `BasicLevels` in the Cloud Common Expression Language rather than as `BasicLevels`. Defaults to AS_DEFINED, where Access Levels are returned as `BasicLevels` or `CustomLevels` based on how they were created. If set to CEL, all Access Levels are returned as `CustomLevels`. In the CEL case, `BasicLevels` are translated to equivalent `CustomLevels`.", "enumDescriptions": [ "The format was not specified.", "Uses the format the resource was defined in. BasicLevels are returned as BasicLevels, CustomLevels are returned as CustomLevels.", "Use Cloud Common Expression Language when returning the resource. Both BasicLevels and CustomLevels are returned as CustomLevels." ], "enum": [ "LEVEL_FORMAT_UNSPECIFIED", "AS_DEFINED", "CEL" ] } }, "parameterOrder": [ "name" ], "httpMethod": "GET", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "description": "Get an Access Level by resource name.", "flatPath": "v1/accessPolicies/{accessPoliciesId}/accessLevels/{accessLevelsId}" }, "patch": { "response": { "$ref": "Operation" }, "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "description": "Update an Access Level. The longrunning operation from this RPC will have a successful status once the changes to the Access Level have propagated to long-lasting storage. Access Levels containing errors will result in an error response for the first error encountered.", "httpMethod": "PATCH", "parameterOrder": [ "name" ], "path": "v1/{+name}", "flatPath": "v1/accessPolicies/{accessPoliciesId}/accessLevels/{accessLevelsId}", "id": "accesscontextmanager.accessPolicies.accessLevels.patch", "parameters": { "updateMask": { "description": "Required. Mask to control which fields get updated. Must be non-empty.", "type": "string", "format": "google-fieldmask", "location": "query" }, "name": { "description": "Required. Resource name for the Access Level. The `short_name` component must begin with a letter and only include alphanumeric and '_'. Format: `accessPolicies/{policy_id}/accessLevels/{short_name}`. The maximum length of the `short_name` component is 50 characters.", "location": "path", "pattern": "^accessPolicies/[^/]+/accessLevels/[^/]+$", "required": true, "type": "string" } }, "request": { "$ref": "AccessLevel" } } } } } }, "operations": { "methods": { "get": { "httpMethod": "GET", "description": "Gets the latest state of a long-running operation. Clients can use this method to poll the operation result at intervals as recommended by the API service.", "id": "accesscontextmanager.operations.get", "path": "v1/{+name}", "response": { "$ref": "Operation" }, "flatPath": "v1/operations/{operationsId}", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "parameterOrder": [ "name" ], "parameters": { "name": { "type": "string", "pattern": "^operations/.*$", "required": true, "description": "The name of the operation resource.", "location": "path" } } }, "cancel": { "request": { "$ref": "CancelOperationRequest" }, "id": "accesscontextmanager.operations.cancel", "flatPath": "v1/operations/{operationsId}:cancel", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "path": "v1/{+name}:cancel", "response": { "$ref": "Empty" }, "httpMethod": "POST", "parameters": { "name": { "description": "The name of the operation resource to be cancelled.", "type": "string", "location": "path", "required": true, "pattern": "^operations/.*$" } }, "parameterOrder": [ "name" ], "description": "Starts asynchronous cancellation on a long-running operation. The server makes a best effort to cancel the operation, but success is not guaranteed. If the server doesn't support this method, it returns `google.rpc.Code.UNIMPLEMENTED`. Clients can use Operations.GetOperation or other methods to check whether the cancellation succeeded or whether the operation completed despite cancellation. On successful cancellation, the operation is not deleted; instead, it becomes an operation with an Operation.error value with a google.rpc.Status.code of 1, corresponding to `Code.CANCELLED`." }, "delete": { "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "response": { "$ref": "Empty" }, "httpMethod": "DELETE", "parameters": { "name": { "pattern": "^operations/.*$", "location": "path", "required": true, "type": "string", "description": "The name of the operation resource to be deleted." } }, "description": "Deletes a long-running operation. This method indicates that the client is no longer interested in the operation result. It does not cancel the operation. If the server doesn't support this method, it returns `google.rpc.Code.UNIMPLEMENTED`.", "id": "accesscontextmanager.operations.delete", "flatPath": "v1/operations/{operationsId}", "path": "v1/{+name}", "parameterOrder": [ "name" ] }, "list": { "response": { "$ref": "ListOperationsResponse" }, "parameterOrder": [ "name" ], "parameters": { "pageSize": { "location": "query", "type": "integer", "format": "int32", "description": "The standard list page size." }, "filter": { "location": "query", "description": "The standard list filter.", "type": "string" }, "pageToken": { "type": "string", "description": "The standard list page token.", "location": "query" }, "name": { "location": "path", "required": true, "description": "The name of the operation's parent resource.", "pattern": "^operations$", "type": "string" } }, "flatPath": "v1/operations", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "httpMethod": "GET", "path": "v1/{+name}", "id": "accesscontextmanager.operations.list", "description": "Lists operations that match the specified filter in the request. If the server doesn't support this method, it returns `UNIMPLEMENTED`. NOTE: the `name` binding allows API services to override the binding to use different resource name schemes, such as `users/*/operations`. To override the binding, API services can add a binding such as `\"/v1/{name=users/*}/operations\"` to their service configuration. For backwards compatibility, the default name includes the operations collection id, however overriding users must ensure the name binding is the parent resource, without the operations collection id." } } }, "organizations": { "resources": { "gcpUserAccessBindings": { "methods": { "get": { "path": "v1/{+name}", "parameterOrder": [ "name" ], "httpMethod": "GET", "response": { "$ref": "GcpUserAccessBinding" }, "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "parameters": { "name": { "required": true, "description": "Required. Example: \"organizations/256/gcpUserAccessBindings/b3-BhcX_Ud5N\"", "location": "path", "type": "string", "pattern": "^organizations/[^/]+/gcpUserAccessBindings/[^/]+$" } }, "description": "Gets the GcpUserAccessBinding with the given name.", "flatPath": "v1/organizations/{organizationsId}/gcpUserAccessBindings/{gcpUserAccessBindingsId}", "id": "accesscontextmanager.organizations.gcpUserAccessBindings.get" }, "create": { "parameters": { "parent": { "pattern": "^organizations/[^/]+$", "type": "string", "required": true, "location": "path", "description": "Required. Example: \"organizations/256\"" } }, "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "id": "accesscontextmanager.organizations.gcpUserAccessBindings.create", "parameterOrder": [ "parent" ], "description": "Creates a GcpUserAccessBinding. If the client specifies a name, the server will ignore it. Fails if a resource already exists with the same group_key. Completion of this long-running operation does not necessarily signify that the new binding is deployed onto all affected users, which may take more time.", "flatPath": "v1/organizations/{organizationsId}/gcpUserAccessBindings", "path": "v1/{+parent}/gcpUserAccessBindings", "httpMethod": "POST", "response": { "$ref": "Operation" }, "request": { "$ref": "GcpUserAccessBinding" } }, "list": { "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ], "description": "Lists all GcpUserAccessBindings for a Google Cloud organization.", "httpMethod": "GET", "id": "accesscontextmanager.organizations.gcpUserAccessBindings.list", "response": { "$ref": "ListGcpUserAccessBindingsResponse" }, "path": "v1/{+parent}/gcpUserAccessBindings", "flatPath": "v1/organizations/{organizationsId}/gcpUserAccessBindings", "parameterOrder": [ "parent" ], "parameters": { "parent": { "type": "string", "required": true, "pattern": "^organizations/[^/]+$", "location": "path", "description": "Required. Example: \"organizations/256\"" }, "pageToken": { "type": "string", "description": "Optional. If left blank, returns the first page. To enumerate all items, use the next_page_token from your previous list operation.", "location": "query" }, "pageSize": { "description": "Optional. Maximum number of items to return. The server may return fewer items. If left blank, the server may return any number of items.", "type": "integer", "location": "query", "format": "int32" } } }, "patch": { "flatPath": "v1/organizations/{organizationsId}/gcpUserAccessBindings/{gcpUserAccessBindingsId}", "path": "v1/{+name}", "httpMethod": "PATCH", "request": { "$ref": "GcpUserAccessBinding" }, "id": "accesscontextmanager.organizations.gcpUserAccessBindings.patch", "response": { "$ref": "Operation" }, "parameters": { "name": { "location": "path", "pattern": "^organizations/[^/]+/gcpUserAccessBindings/[^/]+$", "description": "Immutable. Assigned by the server during creation. The last segment has an arbitrary length and has only URI unreserved characters (as defined by [RFC 3986 Section 2.3](https://tools.ietf.org/html/rfc3986#section-2.3)). Should not be specified by the client during creation. Example: \"organizations/256/gcpUserAccessBindings/b3-BhcX_Ud5N\"", "type": "string", "required": true }, "updateMask": { "format": "google-fieldmask", "type": "string", "description": "Required. Only the fields specified in this mask are updated. Because name and group_key cannot be changed, update_mask is required and must always be: update_mask { paths: \"access_levels\" }", "location": "query" } }, "parameterOrder": [ "name" ], "description": "Updates a GcpUserAccessBinding. Completion of this long-running operation does not necessarily signify that the changed binding is deployed onto all affected users, which may take more time.", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ] }, "delete": { "id": "accesscontextmanager.organizations.gcpUserAccessBindings.delete", "path": "v1/{+name}", "flatPath": "v1/organizations/{organizationsId}/gcpUserAccessBindings/{gcpUserAccessBindingsId}", "parameters": { "name": { "location": "path", "description": "Required. Example: \"organizations/256/gcpUserAccessBindings/b3-BhcX_Ud5N\"", "type": "string", "required": true, "pattern": "^organizations/[^/]+/gcpUserAccessBindings/[^/]+$" } }, "description": "Deletes a GcpUserAccessBinding. Completion of this long-running operation does not necessarily signify that the binding deletion is deployed onto all affected users, which may take more time.", "parameterOrder": [ "name" ], "response": { "$ref": "Operation" }, "httpMethod": "DELETE", "scopes": [ "https://www.googleapis.com/auth/cloud-platform" ] } } } } } }, "basePath": "", "documentationLink": "https://cloud.google.com/access-context-manager/docs/reference/rest/", "revision": "20201231", "protocol": "rest", "title": "Access Context Manager API", "discoveryVersion": "v1", "batchPath": "batch", "auth": { "oauth2": { "scopes": { "https://www.googleapis.com/auth/cloud-platform": { "description": "View and manage your data across Google Cloud Platform services" } } } }, "schemas": { "MethodSelector": { "id": "MethodSelector", "type": "object", "description": "An allowed method or permission of a service specified in ApiOperation.", "properties": { "permission": { "type": "string", "description": "Value for `permission` should be a valid Cloud IAM permission for the corresponding `service_name` in ApiOperation." }, "method": { "type": "string", "description": "Value for `method` should be a valid method name for the corresponding `service_name` in ApiOperation. If `*` used as value for `method`, then ALL methods and permissions are allowed." } } }, "IngressFrom": { "properties": { "identityType": { "type": "string", "description": "Specifies the type of identities that are allowed access from outside the perimeter. If left unspecified, then members of `identities` field will be allowed access.", "enum": [ "IDENTITY_TYPE_UNSPECIFIED", "ANY_IDENTITY", "ANY_USER_ACCOUNT", "ANY_SERVICE_ACCOUNT" ], "enumDescriptions": [ "No blanket identity group specified.", "Authorize access from all identities outside the perimeter.", "Authorize access from all human users outside the perimeter.", "Authorize access from all service accounts outside the perimeter." ] }, "sources": { "description": "Sources that this IngressPolicy authorizes access from.", "type": "array", "items": { "$ref": "IngressSource" } }, "identities": { "items": { "type": "string" }, "type": "array", "description": "A list of identities that are allowed access through this ingress policy. Should be in the format of email address. The email address should represent individual user or service account only." } }, "id": "IngressFrom", "description": "Defines the conditions under which an IngressPolicy matches a request. Conditions are based on information about the source of the request.", "type": "object" }, "CommitServicePerimetersRequest": { "type": "object", "id": "CommitServicePerimetersRequest", "properties": { "etag": { "type": "string", "description": "Optional. The etag for the version of the Access Policy that this commit operation is to be performed on. If, at the time of commit, the etag for the Access Policy stored in Access Context Manager is different from the specified etag, then the commit operation will not be performed and the call will fail. This field is not required. If etag is not provided, the operation will be performed as if a valid etag is provided." } }, "description": "A request to commit dry-run specs in all Service Perimeters belonging to an Access Policy." }, "CommitServicePerimetersResponse": { "description": "A response to CommitServicePerimetersRequest. This will be put inside of Operation.response field.", "properties": { "servicePerimeters": { "description": "List of all the Service Perimeter instances in the Access Policy.", "items": { "$ref": "ServicePerimeter" }, "type": "array" } }, "type": "object", "id": "CommitServicePerimetersResponse" }, "ReplaceServicePerimetersResponse": { "properties": { "servicePerimeters": { "description": "List of the Service Perimeter instances.", "items": { "$ref": "ServicePerimeter" }, "type": "array" } }, "type": "object", "description": "A response to ReplaceServicePerimetersRequest. This will be put inside of Operation.response field.", "id": "ReplaceServicePerimetersResponse" }, "ServicePerimeterConfig": { "description": "`ServicePerimeterConfig` specifies a set of Google Cloud resources that describe specific Service Perimeter configuration.", "type": "object", "properties": { "resources": { "items": { "type": "string" }, "type": "array", "description": "A list of Google Cloud resources that are inside of the service perimeter. Currently only projects are allowed. Format: `projects/{project_number}`" }, "ingressPolicies": { "description": "List of IngressPolicies to apply to the perimeter. A perimeter may have multiple IngressPolicies, each of which is evaluated separately. Access is granted if any Ingress Policy grants it. Must be empty for a perimeter bridge.", "type": "array", "items": { "$ref": "IngressPolicy" } }, "restrictedServices": { "type": "array", "items": { "type": "string" }, "description": "Google Cloud services that are subject to the Service Perimeter restrictions. For example, if `storage.googleapis.com` is specified, access to the storage buckets inside the perimeter must meet the perimeter's access restrictions." }, "vpcAccessibleServices": { "description": "Configuration for APIs allowed within Perimeter.", "$ref": "VpcAccessibleServices" }, "accessLevels": { "type": "array", "items": { "type": "string" }, "description": "A list of `AccessLevel` resource names that allow resources within the `ServicePerimeter` to be accessed from the internet. `AccessLevels` listed must be in the same policy as this `ServicePerimeter`. Referencing a nonexistent `AccessLevel` is a syntax error. If no `AccessLevel` names are listed, resources within the perimeter can only be accessed via Google Cloud calls with request origins within the perimeter. Example: `\"accessPolicies/MY_POLICY/accessLevels/MY_LEVEL\"`. For Service Perimeter Bridge, must be empty." }, "egressPolicies": { "description": "List of EgressPolicies to apply to the perimeter. A perimeter may have multiple EgressPolicies, each of which is evaluated separately. Access is granted if any EgressPolicy grants it. Must be empty for a perimeter bridge.", "items": { "$ref": "EgressPolicy" }, "type": "array" } }, "id": "ServicePerimeterConfig" }, "ListOperationsResponse": { "description": "The response message for Operations.ListOperations.", "type": "object", "id": "ListOperationsResponse", "properties": { "nextPageToken": { "type": "string", "description": "The standard List next-page token." }, "operations": { "type": "array", "description": "A list of operations that matches the specified filter in the request.", "items": { "$ref": "Operation" } } } }, "OsConstraint": { "type": "object", "id": "OsConstraint", "properties": { "osType": { "type": "string", "enumDescriptions": [ "The operating system of the device is not specified or not known.", "A desktop Mac operating system.", "A desktop Windows operating system.", "A desktop Linux operating system.", "A desktop ChromeOS operating system.", "An Android operating system.", "An iOS operating system." ], "description": "Required. The allowed OS type.", "enum": [ "OS_UNSPECIFIED", "DESKTOP_MAC", "DESKTOP_WINDOWS", "DESKTOP_LINUX", "DESKTOP_CHROME_OS", "ANDROID", "IOS" ] }, "minimumVersion": { "type": "string", "description": "The minimum allowed OS version. If not set, any version of this OS satisfies the constraint. Format: `\"major.minor.patch\"`. Examples: `\"10.5.301\"`, `\"9.2.1\"`." }, "requireVerifiedChromeOs": { "description": "Only allows requests from devices with a verified Chrome OS. Verifications includes requirements that the device is enterprise-managed, conformant to domain policies, and the caller has permission to call the API targeted by the request.", "type": "boolean" } }, "description": "A restriction on the OS type and version of devices making requests." }, "ReplaceAccessLevelsRequest": { "type": "object", "id": "ReplaceAccessLevelsRequest", "properties": { "accessLevels": { "description": "Required. The desired Access Levels that should replace all existing Access Levels in the Access Policy.", "items": { "$ref": "AccessLevel" }, "type": "array" }, "etag": { "type": "string", "description": "Optional. The etag for the version of the Access Policy that this replace operation is to be performed on. If, at the time of replace, the etag for the Access Policy stored in Access Context Manager is different from the specified etag, then the replace operation will not be performed and the call will fail. This field is not required. If etag is not provided, the operation will be performed as if a valid etag is provided." } }, "description": "A request to replace all existing Access Levels in an Access Policy with the Access Levels provided. This is done atomically." }, "ListAccessLevelsResponse": { "properties": { "accessLevels": { "items": { "$ref": "AccessLevel" }, "type": "array", "description": "List of the Access Level instances." }, "nextPageToken": { "type": "string", "description": "The pagination token to retrieve the next page of results. If the value is empty, no further results remain." } }, "id": "ListAccessLevelsResponse", "description": "A response to `ListAccessLevelsRequest`.", "type": "object" }, "ListGcpUserAccessBindingsResponse": { "type": "object", "properties": { "gcpUserAccessBindings": { "type": "array", "items": { "$ref": "GcpUserAccessBinding" }, "description": "GcpUserAccessBinding" }, "nextPageToken": { "type": "string", "description": "Token to get the next page of items. If blank, there are no more items." } }, "id": "ListGcpUserAccessBindingsResponse", "description": "Response of ListGcpUserAccessBindings." }, "Expr": { "properties": { "location": { "description": "Optional. String indicating the location of the expression for error reporting, e.g. a file name and a position in the file.", "type": "string" }, "title": { "type": "string", "description": "Optional. Title for the expression, i.e. a short string describing its purpose. This can be used e.g. in UIs which allow to enter the expression." }, "description": { "type": "string", "description": "Optional. Description of the expression. This is a longer text which describes the expression, e.g. when hovered over it in a UI." }, "expression": { "type": "string", "description": "Textual representation of an expression in Common Expression Language syntax." } }, "id": "Expr", "type": "object", "description": "Represents a textual expression in the Common Expression Language (CEL) syntax. CEL is a C-like expression language. The syntax and semantics of CEL are documented at https://github.com/google/cel-spec. Example (Comparison): title: \"Summary size limit\" description: \"Determines if a summary is less than 100 chars\" expression: \"document.summary.size() \u003c 100\" Example (Equality): title: \"Requestor is owner\" description: \"Determines if requestor is the document owner\" expression: \"document.owner == request.auth.claims.email\" Example (Logic): title: \"Public documents\" description: \"Determine whether the document should be publicly visible\" expression: \"document.type != 'private' && document.type != 'internal'\" Example (Data Manipulation): title: \"Notification string\" description: \"Create a notification string with a timestamp.\" expression: \"'New message received at ' + string(document.create_time)\" The exact variables and functions that may be referenced within an expression are determined by the service that evaluates it. See the service documentation for additional information." }, "EgressPolicy": { "id": "EgressPolicy", "type": "object", "properties": { "egressFrom": { "$ref": "EgressFrom", "description": "Defines conditions on the source of a request causing this EgressPolicy to apply." }, "egressTo": { "$ref": "EgressTo", "description": "Defines the conditions on the ApiOperation and destination resources that cause this EgressPolicy to apply." } }, "description": "Policy for egress from perimeter. EgressPolicies match requests based on `egress_from` and `egress_to` stanzas. For an EgressPolicy to match, both `egress_from` and `egress_to` stanzas must be matched. If an EgressPolicy matches a request, the request is allowed to span the ServicePerimeter boundary. For example, an EgressPolicy can be used to allow VMs on networks within the ServicePerimeter to access a defined set of projects outside the perimeter in certain contexts (e.g. to read data from a Cloud Storage bucket or query against a BigQuery dataset). EgressPolicies are concerned with the *resources* that a request relates as well as the API services and API actions being used. They do not related to the direction of data movement. More detailed documentation for this concept can be found in the descriptions of EgressFrom and EgressTo." }, "EgressFrom": { "description": "Defines the conditions under which an EgressPolicy matches a request. Conditions based on information about the source of the request. Note that if the destination of the request is protected by a ServicePerimeter, then that ServicePerimeter must have an IngressPolicy which allows access in order for this request to succeed.", "properties": { "identities": { "items": { "type": "string" }, "type": "array", "description": "A list of identities that are allowed access through this [EgressPolicy]. Should be in the format of email address. The email address should represent individual user or service account only." }, "identityType": { "type": "string", "enum": [ "IDENTITY_TYPE_UNSPECIFIED", "ANY_IDENTITY", "ANY_USER_ACCOUNT", "ANY_SERVICE_ACCOUNT" ], "description": "Specifies the type of identities that are allowed access to outside the perimeter. If left unspecified, then members of `identities` field will be allowed access.", "enumDescriptions": [ "No blanket identity group specified.", "Authorize access from all identities outside the perimeter.", "Authorize access from all human users outside the perimeter.", "Authorize access from all service accounts outside the perimeter." ] } }, "type": "object", "id": "EgressFrom" }, "Empty": { "id": "Empty", "properties": {}, "description": "A generic empty message that you can re-use to avoid defining duplicated empty messages in your APIs. A typical example is to use it as the request or the response type of an API method. For instance: service Foo { rpc Bar(google.protobuf.Empty) returns (google.protobuf.Empty); } The JSON representation for `Empty` is empty JSON object `{}`.", "type": "object" }, "GcpUserAccessBinding": { "id": "GcpUserAccessBinding", "type": "object", "description": "Restricts access to Cloud Console and Google Cloud APIs for a set of users using Context-Aware Access.", "properties": { "name": { "type": "string", "description": "Immutable. Assigned by the server during creation. The last segment has an arbitrary length and has only URI unreserved characters (as defined by [RFC 3986 Section 2.3](https://tools.ietf.org/html/rfc3986#section-2.3)). Should not be specified by the client during creation. Example: \"organizations/256/gcpUserAccessBindings/b3-BhcX_Ud5N\"" }, "groupKey": { "type": "string", "description": "Required. Immutable. Google Group id whose members are subject to this binding's restrictions. See \"id\" in the [G Suite Directory API's Groups resource] (https://developers.google.com/admin-sdk/directory/v1/reference/groups#resource). If a group's email address/alias is changed, this resource will continue to point at the changed group. This field does not accept group email addresses or aliases. Example: \"01d520gv4vjcrht\"" }, "accessLevels": { "type": "array", "items": { "type": "string" }, "description": "Required. Access level that a user must have to be granted access. Only one access level is supported, not multiple. This repeated field must have exactly one element. Example: \"accessPolicies/9522/accessLevels/device_trusted\"" } } }, "BasicLevel": { "type": "object", "id": "BasicLevel", "description": "`BasicLevel` is an `AccessLevel` using a set of recommended features.", "properties": { "conditions": { "description": "Required. A list of requirements for the `AccessLevel` to be granted.", "type": "array", "items": { "$ref": "Condition" } }, "combiningFunction": { "enumDescriptions": [ "All `Conditions` must be true for the `BasicLevel` to be true.", "If at least one `Condition` is true, then the `BasicLevel` is true." ], "enum": [ "AND", "OR" ], "type": "string", "description": "How the `conditions` list should be combined to determine if a request is granted this `AccessLevel`. If AND is used, each `Condition` in `conditions` must be satisfied for the `AccessLevel` to be applied. If OR is used, at least one `Condition` in `conditions` must be satisfied for the `AccessLevel` to be applied. Default behavior is AND." } } }, "ReplaceServicePerimetersRequest": { "description": "A request to replace all existing Service Perimeters in an Access Policy with the Service Perimeters provided. This is done atomically.", "properties": { "etag": { "description": "Optional. The etag for the version of the Access Policy that this replace operation is to be performed on. If, at the time of replace, the etag for the Access Policy stored in Access Context Manager is different from the specified etag, then the replace operation will not be performed and the call will fail. This field is not required. If etag is not provided, the operation will be performed as if a valid etag is provided.", "type": "string" }, "servicePerimeters": { "description": "Required. The desired Service Perimeters that should replace all existing Service Perimeters in the Access Policy.", "type": "array", "items": { "$ref": "ServicePerimeter" } } }, "type": "object", "id": "ReplaceServicePerimetersRequest" }, "Condition": { "type": "object", "id": "Condition", "properties": { "ipSubnetworks": { "items": { "type": "string" }, "type": "array", "description": "CIDR block IP subnetwork specification. May be IPv4 or IPv6. Note that for a CIDR IP address block, the specified IP address portion must be properly truncated (i.e. all the host bits must be zero) or the input is considered malformed. For example, \"192.0.2.0/24\" is accepted but \"192.0.2.1/24\" is not. Similarly, for IPv6, \"2001:db8::/32\" is accepted whereas \"2001:db8::1/32\" is not. The originating IP of a request must be in one of the listed subnets in order for this Condition to be true. If empty, all IP addresses are allowed." }, "requiredAccessLevels": { "type": "array", "items": { "type": "string" }, "description": "A list of other access levels defined in the same `Policy`, referenced by resource name. Referencing an `AccessLevel` which does not exist is an error. All access levels listed must be granted for the Condition to be true. Example: \"`accessPolicies/MY_POLICY/accessLevels/LEVEL_NAME\"`" }, "members": { "type": "array", "description": "The request must be made by one of the provided user or service accounts. Groups are not supported. Syntax: `user:{emailid}` `serviceAccount:{emailid}` If not specified, a request may come from any user.", "items": { "type": "string" } }, "negate": { "description": "Whether to negate the Condition. If true, the Condition becomes a NAND over its non-empty fields, each field must be false for the Condition overall to be satisfied. Defaults to false.", "type": "boolean" }, "regions": { "type": "array", "description": "The request must originate from one of the provided countries/regions. Must be valid ISO 3166-1 alpha-2 codes.", "items": { "type": "string" } }, "devicePolicy": { "description": "Device specific restrictions, all restrictions must hold for the Condition to be true. If not specified, all devices are allowed.", "$ref": "DevicePolicy" } }, "description": "A condition necessary for an `AccessLevel` to be granted. The Condition is an AND over its fields. So a Condition is true if: 1) the request IP is from one of the listed subnetworks AND 2) the originating device complies with the listed device policy AND 3) all listed access levels are granted AND 4) the request was sent at a time allowed by the DateTimeRestriction." }, "CustomLevel": { "properties": { "expr": { "description": "Required. A Cloud CEL expression evaluating to a boolean.", "$ref": "Expr" } }, "type": "object", "id": "CustomLevel", "description": "`CustomLevel` is an `AccessLevel` using the Cloud Common Expression Language to represent the necessary conditions for the level to apply to a request. See CEL spec at: https://github.com/google/cel-spec" }, "EgressTo": { "id": "EgressTo", "type": "object", "description": "Defines the conditions under which an EgressPolicy matches a request. Conditions are based on information about the ApiOperation intended to be performed on the `resources` specified. Note that if the destination of the request is protected by a ServicePerimeter, then that ServicePerimeter must have an IngressPolicy which allows access in order for this request to succeed.", "properties": { "resources": { "items": { "type": "string" }, "type": "array", "description": "A list of resources, currently only projects in the form `projects/`, that match this to stanza. A request matches if it contains a resource in this list. If `*` is specified for resources, then this EgressTo rule will authorize access to all resources outside the perimeter." }, "operations": { "description": "A list of ApiOperations that this egress rule applies to. A request matches if it contains an operation/service in this list.", "type": "array", "items": { "$ref": "ApiOperation" } } } }, "AccessPolicy": { "type": "object", "id": "AccessPolicy", "properties": { "name": { "type": "string", "description": "Output only. Resource name of the `AccessPolicy`. Format: `accessPolicies/{policy_id}`" }, "parent": { "type": "string", "description": "Required. The parent of this `AccessPolicy` in the Cloud Resource Hierarchy. Currently immutable once created. Format: `organizations/{organization_id}`" }, "title": { "type": "string", "description": "Required. Human readable title. Does not affect behavior." }, "etag": { "description": "Output only. An opaque identifier for the current version of the `AccessPolicy`. This will always be a strongly validated etag, meaning that two Access Polices will be identical if and only if their etags are identical. Clients should not expect this to be in any specific format.", "type": "string" } }, "description": "`AccessPolicy` is a container for `AccessLevels` (which define the necessary attributes to use Google Cloud services) and `ServicePerimeters` (which define regions of services able to freely pass data within a perimeter). An access policy is globally visible within an organization, and the restrictions it specifies apply to all projects within an organization." }, "IngressTo": { "properties": { "resources": { "type": "array", "items": { "type": "string" }, "description": "A list of resources, currently only projects in the form `projects/`, protected by this ServicePerimeter that are allowed to be accessed by sources defined in the corresponding IngressFrom. A request matches if it contains a resource in this list. If `*` is specified for resources, then this IngressTo rule will authorize access to all resources inside the perimeter, provided that the request also matches the `operations` field." }, "operations": { "items": { "$ref": "ApiOperation" }, "type": "array", "description": "A list of ApiOperations the sources specified in corresponding IngressFrom are allowed to perform in this ServicePerimeter." } }, "type": "object", "description": "Defines the conditions under which an IngressPolicy matches a request. Conditions are based on information about the ApiOperation intended to be performed on the destination of the request.", "id": "IngressTo" }, "IngressSource": { "properties": { "accessLevel": { "type": "string", "description": "An AccessLevel resource name that allow resources within the ServicePerimeters to be accessed from the internet. AccessLevels listed must be in the same policy as this ServicePerimeter. Referencing a nonexistent AccessLevel will cause an error. If no AccessLevel names are listed, resources within the perimeter can only be accessed via Google Cloud calls with request origins within the perimeter. Example: `accessPolicies/MY_POLICY/accessLevels/MY_LEVEL`. If `*` is specified, then all IngressSources will be allowed." }, "resource": { "type": "string", "description": "A Google Cloud resource that is allowed to ingress the perimeter. Requests from these resources will be allowed to access perimeter data. Currently only projects are allowed. Format: `projects/{project_number}` The project may be in any Google Cloud organization, not just the organization that the perimeter is defined in. `*` is not allowed, the case of allowing all Google Cloud resources only is not supported." } }, "type": "object", "id": "IngressSource", "description": "The source that IngressPolicy authorizes access from." }, "ApiOperation": { "id": "ApiOperation", "description": "Identification for an API Operation.", "properties": { "methodSelectors": { "type": "array", "items": { "$ref": "MethodSelector" }, "description": "API methods or permissions to allow. Method or permission must belong to the service specified by `service_name` field. A single MethodSelector entry with `*` specified for the `method` field will allow all methods AND permissions for the service specified in `service_name`." }, "serviceName": { "type": "string", "description": "The name of the API whose methods or permissions the IngressPolicy or EgressPolicy want to allow. A single ApiOperation with `service_name` field set to `*` will allow all methods AND permissions for all services." } }, "type": "object" }, "IngressPolicy": { "properties": { "ingressTo": { "description": "Defines the conditions on the ApiOperation and request destination that cause this IngressPolicy to apply.", "$ref": "IngressTo" }, "ingressFrom": { "$ref": "IngressFrom", "description": "Defines the conditions on the source of a request causing this IngressPolicy to apply." } }, "type": "object", "id": "IngressPolicy", "description": "Policy for ingress into ServicePerimeter. IngressPolicies match requests based on `ingress_from` and `ingress_to` stanzas. For an ingress policy to match, both the `ingress_from` and `ingress_to` stanzas must be matched. If an IngressPolicy matches a request, the request is allowed through the perimeter boundary from outside the perimeter. For example, access from the internet can be allowed either based on an AccessLevel or, for traffic hosted on Google Cloud, the project of the source network. For access from private networks, using the project of the hosting network is required. Individual ingress policies can be limited by restricting which services and/or actions they match using the `ingress_to` field." }, "AccessLevel": { "type": "object", "properties": { "name": { "description": "Required. Resource name for the Access Level. The `short_name` component must begin with a letter and only include alphanumeric and '_'. Format: `accessPolicies/{policy_id}/accessLevels/{short_name}`. The maximum length of the `short_name` component is 50 characters.", "type": "string" }, "description": { "type": "string", "description": "Description of the `AccessLevel` and its use. Does not affect behavior." }, "custom": { "description": "A `CustomLevel` written in the Common Expression Language.", "$ref": "CustomLevel" }, "title": { "description": "Human readable title. Must be unique within the Policy.", "type": "string" }, "basic": { "$ref": "BasicLevel", "description": "A `BasicLevel` composed of `Conditions`." } }, "description": "An `AccessLevel` is a label that can be applied to requests to Google Cloud services, along with a list of requirements necessary for the label to be applied.", "id": "AccessLevel" }, "ListServicePerimetersResponse": { "type": "object", "properties": { "servicePerimeters": { "type": "array", "items": { "$ref": "ServicePerimeter" }, "description": "List of the Service Perimeter instances." }, "nextPageToken": { "description": "The pagination token to retrieve the next page of results. If the value is empty, no further results remain.", "type": "string" } }, "description": "A response to `ListServicePerimetersRequest`.", "id": "ListServicePerimetersResponse" }, "DevicePolicy": { "type": "object", "description": "`DevicePolicy` specifies device specific restrictions necessary to acquire a given access level. A `DevicePolicy` specifies requirements for requests from devices to be granted access levels, it does not do any enforcement on the device. `DevicePolicy` acts as an AND over all specified fields, and each repeated field is an OR over its elements. Any unset fields are ignored. For example, if the proto is { os_type : DESKTOP_WINDOWS, os_type : DESKTOP_LINUX, encryption_status: ENCRYPTED}, then the DevicePolicy will be true for requests originating from encrypted Linux desktops and encrypted Windows desktops.", "properties": { "allowedEncryptionStatuses": { "description": "Allowed encryptions statuses, an empty list allows all statuses.", "items": { "enumDescriptions": [ "The encryption status of the device is not specified or not known.", "The device does not support encryption.", "The device supports encryption, but is currently unencrypted.", "The device is encrypted." ], "enum": [ "ENCRYPTION_UNSPECIFIED", "ENCRYPTION_UNSUPPORTED", "UNENCRYPTED", "ENCRYPTED" ], "type": "string" }, "type": "array" }, "requireAdminApproval": { "description": "Whether the device needs to be approved by the customer admin.", "type": "boolean" }, "osConstraints": { "type": "array", "items": { "$ref": "OsConstraint" }, "description": "Allowed OS versions, an empty list allows all types and all versions." }, "requireCorpOwned": { "description": "Whether the device needs to be corp owned.", "type": "boolean" }, "requireScreenlock": { "description": "Whether or not screenlock is required for the DevicePolicy to be true. Defaults to `false`.", "type": "boolean" }, "allowedDeviceManagementLevels": { "description": "Allowed device management levels, an empty list allows all management levels.", "items": { "enumDescriptions": [ "The device's management level is not specified or not known.", "The device is not managed.", "Basic management is enabled, which is generally limited to monitoring and wiping the corporate account.", "Complete device management. This includes more thorough monitoring and the ability to directly manage the device (such as remote wiping). This can be enabled through the Android Enterprise Platform." ], "enum": [ "MANAGEMENT_UNSPECIFIED", "NONE", "BASIC", "COMPLETE" ], "type": "string" }, "type": "array" } }, "id": "DevicePolicy" }, "ReplaceAccessLevelsResponse": { "type": "object", "properties": { "accessLevels": { "description": "List of the Access Level instances.", "items": { "$ref": "AccessLevel" }, "type": "array" } }, "description": "A response to ReplaceAccessLevelsRequest. This will be put inside of Operation.response field.", "id": "ReplaceAccessLevelsResponse" }, "Operation": { "type": "object", "properties": { "done": { "type": "boolean", "description": "If the value is `false`, it means the operation is still in progress. If `true`, the operation is completed, and either `error` or `response` is available." }, "response": { "description": "The normal response of the operation in case of success. If the original method returns no data on success, such as `Delete`, the response is `google.protobuf.Empty`. If the original method is standard `Get`/`Create`/`Update`, the response should be the resource. For other methods, the response should have the type `XxxResponse`, where `Xxx` is the original method name. For example, if the original method name is `TakeSnapshot()`, the inferred response type is `TakeSnapshotResponse`.", "type": "object", "additionalProperties": { "type": "any", "description": "Properties of the object. Contains field @type with type URL." } }, "metadata": { "additionalProperties": { "type": "any", "description": "Properties of the object. Contains field @type with type URL." }, "description": "Service-specific metadata associated with the operation. It typically contains progress information and common metadata such as create time. Some services might not provide such metadata. Any method that returns a long-running operation should document the metadata type, if any.", "type": "object" }, "error": { "$ref": "Status", "description": "The error result of the operation in case of failure or cancellation." }, "name": { "description": "The server-assigned name, which is only unique within the same service that originally returns it. If you use the default HTTP mapping, the `name` should be a resource name ending with `operations/{unique_id}`.", "type": "string" } }, "description": "This resource represents a long-running operation that is the result of a network API call.", "id": "Operation" }, "CancelOperationRequest": { "description": "The request message for Operations.CancelOperation.", "type": "object", "properties": {}, "id": "CancelOperationRequest" }, "Status": { "type": "object", "id": "Status", "properties": { "details": { "items": { "additionalProperties": { "type": "any", "description": "Properties of the object. Contains field @type with type URL." }, "type": "object" }, "type": "array", "description": "A list of messages that carry the error details. There is a common set of message types for APIs to use." }, "message": { "type": "string", "description": "A developer-facing error message, which should be in English. Any user-facing error message should be localized and sent in the google.rpc.Status.details field, or localized by the client." }, "code": { "format": "int32", "description": "The status code, which should be an enum value of google.rpc.Code.", "type": "integer" } }, "description": "The `Status` type defines a logical error model that is suitable for different programming environments, including REST APIs and RPC APIs. It is used by [gRPC](https://github.com/grpc). Each `Status` message contains three pieces of data: error code, error message, and error details. You can find out more about this error model and how to work with it in the [API Design Guide](https://cloud.google.com/apis/design/errors)." }, "ServicePerimeter": { "properties": { "perimeterType": { "description": "Perimeter type indicator. A single project is allowed to be a member of single regular perimeter, but multiple service perimeter bridges. A project cannot be a included in a perimeter bridge without being included in regular perimeter. For perimeter bridges, the restricted service list as well as access level lists must be empty.", "enum": [ "PERIMETER_TYPE_REGULAR", "PERIMETER_TYPE_BRIDGE" ], "type": "string", "enumDescriptions": [ "Regular Perimeter.", "Perimeter Bridge." ] }, "name": { "type": "string", "description": "Required. Resource name for the ServicePerimeter. The `short_name` component must begin with a letter and only include alphanumeric and '_'. Format: `accessPolicies/{policy_id}/servicePerimeters/{short_name}`" }, "spec": { "$ref": "ServicePerimeterConfig", "description": "Proposed (or dry run) ServicePerimeter configuration. This configuration allows to specify and test ServicePerimeter configuration without enforcing actual access restrictions. Only allowed to be set when the \"use_explicit_dry_run_spec\" flag is set." }, "status": { "$ref": "ServicePerimeterConfig", "description": "Current ServicePerimeter configuration. Specifies sets of resources, restricted services and access levels that determine perimeter content and boundaries." }, "useExplicitDryRunSpec": { "description": "Use explicit dry run spec flag. Ordinarily, a dry-run spec implicitly exists for all Service Perimeters, and that spec is identical to the status for those Service Perimeters. When this flag is set, it inhibits the generation of the implicit spec, thereby allowing the user to explicitly provide a configuration (\"spec\") to use in a dry-run version of the Service Perimeter. This allows the user to test changes to the enforced config (\"status\") without actually enforcing them. This testing is done through analyzing the differences between currently enforced and suggested restrictions. use_explicit_dry_run_spec must bet set to True if any of the fields in the spec are set to non-default values.", "type": "boolean" }, "title": { "description": "Human readable title. Must be unique within the Policy.", "type": "string" }, "description": { "description": "Description of the `ServicePerimeter` and its use. Does not affect behavior.", "type": "string" } }, "id": "ServicePerimeter", "type": "object", "description": "`ServicePerimeter` describes a set of Google Cloud resources which can freely import and export data amongst themselves, but not export outside of the `ServicePerimeter`. If a request with a source within this `ServicePerimeter` has a target outside of the `ServicePerimeter`, the request will be blocked. Otherwise the request is allowed. There are two types of Service Perimeter - Regular and Bridge. Regular Service Perimeters cannot overlap, a single Google Cloud project can only belong to a single regular Service Perimeter. Service Perimeter Bridges can contain only Google Cloud projects as members, a single Google Cloud project may belong to multiple Service Perimeter Bridges." }, "VpcAccessibleServices": { "properties": { "enableRestriction": { "type": "boolean", "description": "Whether to restrict API calls within the Service Perimeter to the list of APIs specified in 'allowed_services'." }, "allowedServices": { "description": "The list of APIs usable within the Service Perimeter. Must be empty unless 'enable_restriction' is True. You can specify a list of individual services, as well as include the 'RESTRICTED-SERVICES' value, which automatically includes all of the services protected by the perimeter.", "items": { "type": "string" }, "type": "array" } }, "description": "Specifies how APIs are allowed to communicate within the Service Perimeter.", "id": "VpcAccessibleServices", "type": "object" }, "ListAccessPoliciesResponse": { "description": "A response to `ListAccessPoliciesRequest`.", "properties": { "nextPageToken": { "type": "string", "description": "The pagination token to retrieve the next page of results. If the value is empty, no further results remain." }, "accessPolicies": { "items": { "$ref": "AccessPolicy" }, "type": "array", "description": "List of the AccessPolicy instances." } }, "type": "object", "id": "ListAccessPoliciesResponse" } }, "description": "An API for setting attribute based access control to requests to GCP services." }
|
__label__pos
| 0.986518 |
Skip to main content
Actor-based Multiplayer Card Game
·3410 words·17 mins·
Akka and the Actor Model - This article is part of a series.
Part 4: This Article
In previous articles we’ve talked about how we can implement a simple game using actors, and how we can use Akka’s remoting functions to build actor networks, so it’s time we put the pieces together and create a multiplayer game.
The game we’ll implement is called pişti or bastra, a card game that can be played with 2 to 4 people, and is pretty popular among people of all ages due to its simplicity.
At the start, each player is dealt 4 cards, and 4 other cards are placed in the middle of the table (also called the board), with one of them open. To ensure fairness, any jacks that are dealt on the board stack is randomly replaced with another from the deck so the players can get them later. On each turn, a player plays a card from their hand and places it on the board. If the card that is played is a jack, or if it matches the one on top of the board stack, the player collects the board (also called fishing) and earns points. If not, the card is left on the stack and the turn passes over to the next player. If the player runs out of cards they’re dealt 4 more, and the game lasts until all cards are played out. Once they are, whoever has the highest score wins the game.
ygunayer/bastra
Scala
8
0
Rules
#
There are different versions of bastra that have different scoring rules, but the one we’ll implement (possibly the most common one) goes like this:
• Jacks or aces are worth 1 point
• Two of clubs is worth 2 points
• Ten of diamonds is worth 3 points
• Performing a bastra (i.e. fishing a single card from the board using the same card) is worth 10 points
Planning
#
Before moving on to the implementation, let’s plan our approach.
Dedicated Servers or Peer-to-Peer
#
Whether or not a game should have dedicated servers to run the game logic on, or would P2P with a “master” peer suffice, is the age old problem for multiplayer games. The latter method is sometimes the go-to solution for even big companies since it basically induces no cost for server maintenance, but it’s susceptible to cheating and hacking, as was the case in many Call of Duty games. It’s not very difficult to alter the program’s memory and mess up with the game logic, and that’s how modern bots, wall hacks and aimbots work anyways.
Since we’re dealing with a game logic that depends heavily (solely?) on memory (i.e. the game state), there’s no way we can make our game cheat-proof if we run P2P. As such, we’ll create dedicated servers that keep the game’s state and run its logic, and verify clients’ commands as they come.
Communication Flow
#
The flow of communication is the main topic of this article, so we’ll delve more deeply into this in following sections, but let’s see the outline first.
Since we’re not running a P2P network, it’s our servers’ responsibility to peer clients together and manage the flow of information. So the first thing we need to do is to let clients find a game server and introduce themselves to it.
Once a client connects, the server put them in a matchmaking queue, and if there are at least two players, they will be put into a game room where the game will actually played. Once the game ends, they’ll be back in the matchmaking queue.
To summarize, here’s an overview of the client flow:
Overview of the client flow
Scores and Matchmaking
#
This post is more about the client-server communication in a multiplayer game than other aspects of multiplayer gaming such as scoring and matchmaking, so we won’t cover these here. They are, however, among the main topic of future posts, so please stay tuned. Until then, we won’t score players and the matchmaking will simply take the first two player in the queue and put them in a game.
That said, players do have to wait until they’re placed in a game, so we’ll call this state “waiting in the lobby”, and implement a special actor to handle it.
User Interaction and UI
#
We need no user interaction on the server side (aside from logging stuff), and on the client side we’ll just go ahead and use the terminal for both input and output since we don’t have much visual data. Therefore, no UI.
Project Outline
#
We’ll have one project each for both the server and the client, and another project called commons to that we can share the same domain objects and messages. Since we don’t need a professional-grade project structure, we’ll simply create a multi-project setup.
Here’s what the folder structure looks like at first:
(workspace folder)
|
\- bastra
+- .gitignore
+- build.sbt
+- client
| +- src
| | \- main
| | \- scala
| | \- com
| | \- yalingunayer
| | \- bastra
| | \- BastraClient.scala
| \- build.sbt
+- commons
\- server
+- src
| \- main
| \- scala
| \- com
| \- yalingunayer
| \- bastra
| \- BastraServer.scala
\- build.sbt
Implementation
#
The codebase for this project is considerably larger than previous examples, so rather than going line by line over the code, I’ll try to explain it by going over flowcharts and samples of code. The codebase has a sufficient (hopefully) amount of comments as well, so we should be fine.
P.S. Since we have multiple actors running different state machines, I’ve colored their diagrams differently. Use the following legend if needed.
Legend for the state diagrams
Domain Objects
#
Since we’re making a card game our domain objects are cards, decks, ranks and suits, and we can implement a few case classes and companion objects to represent them with convenience.
Suits
#
Suits basically represent the class or category of a card, and consists of a name and a symbol. The following is a list of suit names and their symbols.
Suit Name Symbol
Clubs
Spades
Diamonds
Hearts
We can represent these as follows:
abstract class Suit(val name: String, val shortName: String) extends Serializable
...
object Suit {
case class Clubs() extends Suit("Clubs", "♣")
case class Spades() extends Suit("Spades", "♠")
case class Diamonds() extends Suit("Diamonds", "♦")
case class Hearts() extends Suit("Hearts", "♥")
def all: List[Suit] = List(Clubs(), Spades(), Diamonds(), Hearts())
implicit def string2suit(s: String) = s match {
case "♣" => Clubs()
case "♠" => Spades()
case "♦" => Diamonds()
case "♥" => Hearts()
case _ => throw new RuntimeException(f"Unknown suit ${s}")
}
}
Ranks
#
Ranks represent the value of a card, and have a special ordering such as A, 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, where A is sometimes larger than K and sometimes isn’t. Even so, we can just go ahead and implement this as follows:
abstract class Rank(val value: Int, val name: String, val shortName: String) extends Serializable
...
object Rank {
case class Ace() extends Rank(14, "Ace", "A")
case class Two() extends Rank(2, "Two", "2")
case class Three() extends Rank(3, "Three", "3")
case class Four() extends Rank(4, "Four", "4")
case class One() extends Rank(5, "Five", "5")
case class Six() extends Rank(6, "Six", "6")
case class Seven() extends Rank(7, "Seven", "7")
case class Eight() extends Rank(8, "Eight", "8")
case class Nine() extends Rank(9, "Nine", "9")
case class Ten() extends Rank(10, "Ten", "10")
case class Jack() extends Rank(11, "Jack", "J")
case class Queen() extends Rank(12, "Queen", "Q")
case class King() extends Rank(13, "King", "K")
def all: List[Rank] = List(Ace(), Two(), Three(), Four(), One(), Six(), Seven(), Eight(), Nine(), Ten(), Jack(), Queen(), King())
implicit def string2rank(s: String) = s match {
case "A" => Ace()
case "2" => Two()
case "3" => Three()
case "4" => Four()
case "5" => One()
case "6" => Six()
case "7" => Seven()
case "8" => Eight()
case "9" => Nine()
case "0" => Ten()
case "J" => Jack()
case "Q" => Queen()
case "K" => King()
case _ => throw new RuntimeException(f"Unknown rank ${s}")
}
Cards
#
We usually have two ways to refer to a card: “Ace of Spades” or “A♠”. We can call these the name and short names, and with suits and ranks implemented, it’s easy to create a class that can represent both.
case class Card(val rank: Rank, val suit: Suit) {
def name(): String = f"${rank.name} of ${suit.name}"
def shortName(): String = f"${rank.shortName}${suit.shortName}"
def score(): Int = {
(rank, suit) match {
case (Rank.Two(), Suit.Clubs()) => 2
case (Rank.Ten(), Suit.Diamonds()) => 3
case (Rank.Jack(), _) => 1
case (Rank.Ace(), _) => 1
case _ => 0
}
}
def canFish(other: Card) = {
if (rank == Rank.Jack()) true
else this == other
}
override def toString(): String = shortName
}
Decks
#
A regular deck consists of 52 cards, one from each suit and rank. Let’s put this on the Card class.
object Card {
private val pattern = "^([AJKQ2-9])\\s*([♣♠♦♥])$".r
def fullDeck: List[Card] = for {
suit <- Suit.all
rank <- Rank.all
} yield Card(rank, suit)
implicit def string2card(s: String): Card = s match {
case pattern(rank, suit) => Card(rank, suit)
case _ => throw new RuntimeException(f"Invalid card string ${s}")
}
}
A list of cards isn’t exactly a domain object, we can’t really build on that, so let’s abstract that into another class called CardStack. This will allow us to generate ordered or randomly ordered decks, and with or without a specific card.
object CardStack {
def sorted: CardStack = CardStack(Card.fullDeck)
def shuffled: CardStack = CardStack(scala.util.Random.shuffle(Card.fullDeck))
def empty: CardStack = CardStack(List())
implicit def cards2stack(cards: List[Card]): CardStack = CardStack(cards)
}
case class CardStack(val cards: List[Card]) {
def removed(card: Card): CardStack = CardStack(Utils.removeLast(cards, card))
override def toString(): String = cards.mkString(", ")
}
Establishing the Connection
#
Now that we’ve created our domain objects, it’s time to implement the flow. Looking back at the overview in the previous section, our first task is to connect the client to a server. In order to do that, we’ll simply let the client connect to a specific actor system on a specific IP address and port. In the ideal world this is pretty much the same, only the IP address is replaced by a hostname, quite possibly prefixed by a region code. Here’s an example: eu.logon.worldofwarcraft.com
One thing to note here is that there are dozens of reasons that we can’t establish the connection in the first attempt (if the client doesn’t have an internet connection we may never connect at all!), so we’ll let the client retry connecting every 5 seconds.
Also, we need a name for each player since we want to introduce them to their opponents, so we ask the player their name before initiating the connection request. This also acts as a pseudo-login phase which we might need in future examples.
Here’s the client’s state diagram for the connection phase:
Connection phase state diagram for the client
And here’s an excerpt from the client code that implements this flow.
class PlayerActor extends Actor {
...
def tryReconnect = {
def doTry(attempts: Int): Unit = {
context.system.actorSelection("akka.tcp://[email protected]:47000/user/lobby").resolveOne()(10.seconds).onComplete(x => x match {
case Success(ref: ActorRef) => {
println("Server found, attempting to connect...")
server = ref
server ! Messages.Server.Connect(me)
}
case Failure(t) => {
System.err.println(f"No game server found, retrying (${attempts + 1})...")
Thread.sleep(5000) // this is almost always a bad idea, but let's keep it for simplicity's sake
doTry(attempts + 1)
}
})
}
println("Attempting to find a game server...")
context.become(connecting)
doTry(0)
}
override def preStart(): Unit = {
println("Welcome to Bastra! Please enter your name.")
Utils.readResponse.onComplete {
case Success(name: String) => {
me = Player(Utils.uuid(), name)
tryReconnect
}
case _ => self ! PoisonPill
}
}
...
}
Matchmaking
#
The matchmaking is performed on the server’s end, and as stated in the previous section it’s really nothing special. For the sake of completeness, I’ve also included the initialization phase.
Matchmaking phase state diagram for the server
Game Logic
#
We’ve finally found a match, so it’s time to run the game logic now!
As always, our game room actor will be responsible for not only running the game logic, but also watching the players’ connections and terminating if one of them disconnects. Upon termination, it should also return whoever’s left in the room to the lobby so they can play another game.
Server’s flow diagram for handling the game logic
As for the client, remember that in previous sections we left them in the lobby, and now it’s time to let them into a game. They’ll start out from the matchmaking phase and will then begin waiting for the game to start. As seen on the server’s flow, it’ll first prepare the deck and decide on who’s going first, announce these details and then give the turn to a random player. We’ll have anticipate each step on our client.
Client’s flow diagram for handling the game logic
With the flows in place, let’s implement the actual game logic. We’ll do this by keeping the game’s current state and updating it based on the cards played by the players, assuming that a valid card was played, and we’ll also keep the game score so we can determine the winner in the end. Looking at the game rules in the first section, here’s our ruleset:
• Only the player in turn can play a card
• A player can only play a card that they have in their hand
• When a card played, it’s removed from the player’s hand
• When a card is played on an empty board it’s placed on the board
• When a card is played on top of a card that it cannot match, it’s placed on top of the board stack
• When a card is played on top of a card that it can match, it’s placed on the player’s bucket along with all the cards on the board, and the player earns points. This is called fishing.
• If both players’ hands are empty upon removing a card, the game deals 4 cards to each player
• If the deck and both players’ hands are empty upon removing a card, the game ends, and the player who has the higher score is elected winner
Here’s one way of implementing these rules.
...
/**
* Determine the next state based on a card that was played
*/
def determineNextState(card: Card, playerInfo: PlayerInformation, opponentInfo: PlayerInformation, deckCards: List[Card], middleCards: List[Card]): StateResult = {
val player = playerInfo.state
val opponent = opponentInfo.state
// determine if the player has fished a card, what their scores will be, and what their bucket will contain on the next turn
// since this will also affect the middle stack, determine its new state as well
val (isFished, newScore, newMiddleStack, newBucketStack) = middleCards.headOption match {
case Some(other) if card.canFish(other) => {
val newBucketCards = card :: middleCards ++ player.bucket.cards
// find out if a bastra is performed
val isBastra = middleCards match {
case x :: Nil if (x == card) => true
case _ => false
}
val earnedPoints = (card :: middleCards).map(_.score).sum + (if (isBastra) 10 else 0)
val newScore = PlayerScore(earnedPoints + player.score.totalPoints, player.score.bastras + (if (isBastra) 1 else 0), newBucketCards.length)
(true, newScore, CardStack.empty, CardStack(newBucketCards))
}
case _ => (false, player.score, CardStack(card :: middleCards), player.bucket)
}
val proposedNextHand = player.hand.removed(card).cards
val bothHandsEmpty = proposedNextHand.isEmpty && opponent.hand.isEmpty
val isFinished = bothHandsEmpty && deckCards.isEmpty
val shouldDeal = !isFinished && bothHandsEmpty
// determine if we need to deal new cards to players
val (nextDeck, nextPlayerHand, nextOpponentHand) = shouldDeal match {
case true => (deckCards.drop(8), deckCards.take(4), deckCards.drop(4).take(4))
case _ => (deckCards, proposedNextHand, opponent.hand.cards)
}
val nextPlayerState = PlayerState(CardStack(nextPlayerHand), newBucketStack, newScore)
val nextPlayerInfo = PlayerInformation(playerInfo.session, nextPlayerState)
val nextOpponentState = PlayerState(CardStack(nextOpponentHand), opponent.bucket, opponent.score)
val nextOpponentInfo = PlayerInformation(opponentInfo.session, nextOpponentState)
val nextState = GameState(isFinished, CardStack(nextDeck), newMiddleStack, nextOpponentInfo, nextPlayerInfo)
// determine the winner (if any)
val winner: Option[PlayerInformation] = isFinished match {
case true => (nextPlayerInfo :: nextOpponentInfo :: Nil).sortBy(_.state.score.totalPoints).tail.headOption
case _ => None
}
StateResult(nextState, winner, isFished)
}
...
Ouch! This looks a bit messy and difficult to maintain, so we’d better write a few (albeit incomprehensive) unit tests for it. We’ll have three test cases; one for fishing a card, another for a regular round without fishing a card, and another to verify that the game successfully terminates when all cards are played out. So here they are, in order:
class GameRoomActorSpec extends FlatSpec with Matchers {
it should "fish when necessary" in {
val baseDeck = CardStack.sorted
val p1 = Player("foo", "Foo")
val p2 = Player("bar", "Bar")
val card: Card = "J♠"
val hand1: List[Card] = List("A♠", "2♠", "3♠", card)
val hand2: List[Card] = List("A♦", "2♦", "3♦", "4♦")
val middleStack: List[Card] = List("A♣")
val deck = baseDeck.removed(hand1 ++ hand2 ++ middleStack)
val player1 = PlayerInformation(PlayerSession(p1, null), PlayerState(hand1, CardStack.empty, PlayerScore.zero))
val player2 = PlayerInformation(PlayerSession(p2, null), PlayerState(hand2, CardStack.empty, PlayerScore.zero))
val result = GameRoomActor.determineNextState(card, player1, player2, deck.cards, middleStack)
result.winner should be (None)
result.newState.deck should be (deck)
result.newState.playerInTurn.state.hand should be (CardStack(hand2))
result.newState.playerWaiting.state.hand should be (CardStack(hand1).removed(card))
result.newState.playerWaiting.state.bucket should be (CardStack(card :: middleStack))
result.newState.middleStack.isEmpty should be (true)
result.isFished should be (true)
}
it should "not fish when not possible" in {
val baseDeck = CardStack.sorted
val p1 = Player("foo", "Foo")
val p2 = Player("bar", "Bar")
val card: Card = "4♠"
val hand1: List[Card] = List("A♠", "2♠", "3♠", card)
val hand2: List[Card] = List("A♦", "2♦", "3♦", "4♦")
val middleStack: List[Card] = List("A♣")
val deck = baseDeck.removed(hand1 ++ hand2 ++ middleStack)
val player1 = PlayerInformation(PlayerSession(p1, null), PlayerState(hand1, CardStack.empty, PlayerScore.zero))
val player2 = PlayerInformation(PlayerSession(p2, null), PlayerState(hand2, CardStack.empty, PlayerScore.zero))
val result = GameRoomActor.determineNextState(card, player1, player2, deck.cards, middleStack)
result.winner should be (None)
result.newState.deck should be (deck)
result.newState.playerInTurn.state.hand should be (CardStack(hand2))
result.newState.playerWaiting.state.hand should be (CardStack(hand1).removed(card))
result.newState.playerWaiting.state.bucket should be (CardStack.empty)
result.newState.middleStack should be (CardStack(card :: middleStack))
result.isFished should be (false)
}
it should "should end the round and elect a winner when no cards remain" in {
val baseDeck = CardStack.sorted
val p1 = Player("foo", "Foo")
val p2 = Player("bar", "Bar")
val hand1 = baseDeck.cards.take(4)
val hand2 = baseDeck.cards.drop(4).take(4)
val middleStack = baseDeck.cards.drop(8).take(4)
val deck = baseDeck.cards.drop(12)
val player1 = PlayerInformation(PlayerSession(p1, null), PlayerState(hand1, CardStack.empty, PlayerScore.zero))
val player2 = PlayerInformation(PlayerSession(p2, null), PlayerState(hand2, CardStack.empty, PlayerScore.zero))
// simulate the game by running playing the first card on all turns for each player
def playAllRounds(player: PlayerInformation, opponent: PlayerInformation, remaining: CardStack, middle: CardStack): GameRoomActor.StateResult = {
def doPlayRound(round: Int, player: PlayerInformation, opponent: PlayerInformation, remaining: CardStack, middle: CardStack): GameRoomActor.StateResult = {
if (round >= 1000) {
throw new RuntimeException("The game wasn't finished after 1000 rounds");
}
val card = player.state.hand.cards.head
val result = GameRoomActor.determineNextState(card, player, opponent, remaining.cards, middle.cards)
if (result.winner.isDefined) result
else {
val nextState = result.newState
doPlayRound(round + 1, nextState.playerInTurn, nextState.playerWaiting, result.newState.deck, result.newState.middleStack)
}
}
doPlayRound(0, player, opponent, remaining, middle)
}
val result = playAllRounds(player1, player2, deck, middleStack)
result.winner.isDefined should be (true)
}
}
Let’s find out if our tests actually pass:
$ sbt "project server" test
...
[info] GameRoomActorSpec:
[info] - should fish when necessary
[info] - should not fish when not possible
[info] - should should end the round and elect a winner when no cards remain
[info] Run completed in 337 milliseconds.
[info] Total number of tests run: 3
[info] Suites: completed 1, aborted 0
[info] Tests: succeeded 3, failed 0, canceled 0, ignored 0, pending 0
[info] All tests passed.
...
Building and Running
#
The implementation phase is finally over, so it’s time to build the game and play it. To do that, we’ll use the same method as before (see the previous article), but this time, since we’re using a multi-project setup, we’ll need to specify the project we’re building when running our stage command.
Server
$ sbt "project server" stage
Client
$ sbt "project client" stage
And, voila! We now have two executables for each app, and therefore can play the game! Let’s run the server first:
$ ./bastra-server/target/universal/stage/bin/bastra-server
Server is now ready to accept connections
...
And then the clients:
$ ./bastra-client/target/universal/stage/bin/bastra-client
Welcome to Bastra! Please enter your name.
> foo
...
$ ./bastra-client/target/universal/stage/bin/bastra-client
Welcome to Bastra! Please enter your name.
> bar
...
Here’s what the gameplay looks like:
Conclusion
#
So that’s pretty much it for the “basic” implementation of a turn based multiplayer game. While we do have a fully functional gameplay, the game can only be served and played on the same machine, and it simply lacks a UI, but at least we’ve made some progress.
In upcoming articles we’ll take care of these issues. We’ll deploy the server on a separate machine, implement a simple UI so the game can be played on the browser, and also a WebSocket-based web application to acts as a gateway between the front-end and the game server. So stay tuned!
See the code at Github: https://github.com/ygunayer/bastra
Akka and the Actor Model - This article is part of a series.
Part 4: This Article
|
__label__pos
| 0.61331 |
Will you do everything on the existing equipment, or will you need to buy more?
During the audit and planning phase, it will be clear if the company has sufficient up-to-date equipment to resolve any issues.
An IT audit is the evaluation of an organization's IT system to determine its strengths and weaknesses. It includes an analysis of hardware and software infrastructures, information flow management procedures, security measures, user service policies, the effectiveness of using information technology in business processes, and much more.
Was this article helpful?
Was this article helpful?
Related articles
Business information security
Business information security
What is business information security and how to ensure it? Information security is a set of measures that you take to protect your confidential data, developments, ideas, technologies and, eventually corporate money.
How to defend against cyber-attacks?
How to defend against cyber-attacks?
News of another data breach due to a cyber-attack on large companies appears almost every day.
Reference
|
__label__pos
| 0.99982 |
0
Could someone find an obvious reason this while loop performs once and then breaks? I don't think the condition on the while loop is dropping it out. I must be when I call the formatted writers but I 'm not sure how to make it stay in the while loop. Any suggestion will help. thanks
while(transval!=0){
System.out.println("Account#: " +cc.getAccountNo());
System.out.println("Credit Limit: " + cc.getCreditLimit());
System.out.println("Available Credit: " + cc.getAvailable());
System.out.println("Outstanding Balance: " + cc.getBalance());
System.out.println("Charge: " + cc.getAmount());
System.out.println("Description; " + cc.getDescription());
System.out.println("payment: " + cc.getPayment());
System.out.println("Total Charges: " + cc.getTotalCharges());
System.out.println("Total Payments " + cc.getTotalPayments());
System.out.println("\n");
System.out.println("Transaction (0=Quit, +$=charge, -$=payment, 9999=Limit increase): ");
transval = Console.in.readDouble();
if (transval == 0){
break;
}
if (transval == 9999){
cc.creditIncrease();
}
if (transval > 0) {
System.out.println("Transaction description: ");
transdesc = Console.in.readLine();
transdesc = Console.in.readLine();
cc.setAmount(transval);
cc.setDescription(transdesc);
cc.Transaction();
} else if (transval < 0){
cc.setAmount(transval);
cc.setDescription("Payment");
cc.setPayment(transval);
cc.Transaction();
}
}
4
Contributors
4
Replies
5
Views
9 Years
Discussion Span
Last Post by sb7000
0
When debugging I often find it helpful to add some println statements to see exactly what is happening. In your case I would insert a println statement immediately after
transval=Console.in.readDouble();
Something like
System.out.println("### transaval = "+transval+"###");
will help find out what is happening to your variable. Obviously this is the only thing that can exit your while loop both in your condition and your break statement. I personally have never used Console.in but prefer to use an InputStreamReader class (often in conjunction with a BufferedReader) and then parse the input received. But I hope I have given you a pointer in finding your error.
0
When debugging I often find it helpful to add some println statements to see exactly what is happening. In your case I would insert a println statement immediately after
transval=Console.in.readDouble();
Something like
System.out.println("### transaval = "+transval+"###");
will help find out what is happening to your variable. Obviously this is the only thing that can exit your while loop both in your condition and your break statement. I personally have never used Console.in but prefer to use an InputStreamReader class (often in conjunction with a BufferedReader) and then parse the input received. But I hope I have given you a pointer in finding your error.
Thanks that's a start.
0
Just try and use true as your statement for the while and then break out of the loop...
while(true){
code...
if(transval==0){
break;
}
This question has already been answered. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.
|
__label__pos
| 0.839578 |
Reduce Cyber Risk with Attack Surface Discovery
Attack Surface Discovery
Last Updated on 11 September 2023 by Alastair Digby
To mitigate against their most significant threats and reduce cyber risks, businesses need to know exactly what assets and systems unauthorized users can seek to enter and set their malicious activities in motion.
The problem is that getting visibility into all these entry points—which add up to your attack surface—is no mean feat given today’s dynamic and distributed IT environments. This article overviews why and how to reduce cyber risk with attack surface discovery at your organization.
Why Do You Need Attack Surface Discovery?
It’s not too long ago that IT infrastructures at companies of all sizes were, on the whole, relatively easy to understand and secure. There were servers, workstations, applications, and digital assets like sensitive data, all of which were securely protected on-premise and guarded by a firewall. Maintaining visibility into the attack surface within such an environment was almost trivial.
Fast forward to today, and digital transformation strategies have rapidly expanded the average attack surface. In addition to typical on-premise infrastructure, companies now have a smorgasbord of other potential entry points into their network, such as:
• Cloud computing services (storage and infrastructure provisioned as services to store sensitive data or host web applications)
• Containerized applications hosted on virtual machines and leveraging third-party dependencies (libraries, frameworks) that could be unsecured
• Remote workers connecting from potentially unsafe networks
• SaaS solutions used by employees to facilitate anytime, anywhere access, improve collaboration, or solve specific business problems
• Shadow IT assets that get added to your environment without the express oversight of your central IT team
The crux of this complex, external-facing attack surface is that you can’t protect what you can’t see. And, even with your own custom security tools and scripts, it’s unlikely you’re able to see and track everything you need to in order to adequately defend against threats.
Furthermore, just because you have no visibility into all possible entry points, that doesn’t mean that malicious actors can’t find them. In fact, the prudent assumption is that with vastly increased external-facing systems, services, and applications, an outsider will find any exploitable entry points.
It stands to reason, therefore, that discovering the full extent of your attack surface is a pivotal task in reducing cyber risks. A critical component of modern attack surface management is the ability to discover and map all the Internet-facing assets that make up your external attack surface.
Attack surface discovery empowers a truly risk-based approach because you know exactly what attackers can see. Full visibility into your attack surface is the foundation of a wider external attack surface management (EASM) strategy.
How Does Attack Surface Discovery Work?
You could go out and look for your known and unknown internet-facing assets manually, but you would soon understand the enormity of the task at hand (if you hadn’t already). Attack surface discovery solutions automate much of the work involved in discovering and mapping your entire external attack surface.
Older script-based methods for doing attack surface discovery aren’t suited for the complexity and dynamism of IT environments today; they’ll find devices and applications running behind a network firewall but they won’t account for cloud infrastructure. This leaves a glaring hole in your ability to manage cyber risks effectively.
The engine that powers modern, advanced attack surface discovery solutions deploys open-source and proprietary intelligence techniques along with advanced crawling and scanning of far-reaching corners of the Internet. The best solutions will be able to find inactive apps and shadow IT assets that you previously had zero visibility into or information about.
What also sets apart dedicated modern asset discovery tools is that they focus on continuously discovering your attack surface. Point-in-time snapshots of how your environment appears from an attacker’s perspective aren’t especially useful when DevOps teams can launch new (potentially vulnerable) web apps in days or employees can make cloud configuration changes that expose previously protected sensitive data to the whole Internet. You need an approach that works at lightning speed to keep up with your constantly expanding attack surface.
The findings you can expect to see presented in an attack surface solution include:
• All your web apps, mobile apps, services, and APIs
• Cloud software, storage, and infrastructure
• Domain names (including subdomains) along with their SSL certificates
• All IP addresses on the network
• Third-party libraries, frameworks, and other dependencies upon which the functionality of your custom apps and services relies
These findings get presented in the form of a comprehensive asset inventory that provides a true view of your environment from the outside. The discovery and asset inventory together build the foundation for attack surface monitoring, which can rapidly detect risky changes, weaknesses, or vulnerabilities emerging in any of your external assets.
Why Do All Internet-Facing Assets Need Security?
The medieval castle and moat model inspired the traditional approach used by businesses to secure information and systems against external threats. This model focused cyber risk management and defensive mechanisms on securing the network perimeter so that nobody outside the perimeter could access what’s on the inside.
Initial forays into remote work began to complicate the feasibility of this model, but its death knell truly sounded with the widespread digital transformation strategies of the last decade or so. Hackers now have a plethora of business assets to target that fall outside the traditional network boundary and firewall. Compromising these Internet-facing assets can ultimately provide malicious actors with the easiest path to achieve what they’re seeking.
External facing assets need their own security measures to deter threat actors, but failing to keep track of your digital footprint means not knowing whether your Internet-facing assets are properly secured against their most relevant risks.
Gain a Deeper Understanding of Attack Surface Risks
The discipline of EASM is all about managing the risks presented by the influx of Internet-facing assets and systems and implementing effective security measures. And it starts with attack surface discovery. The outside-in view gleaned from attack surface discovery leads to a deeper understanding of the extent of risks you face.
The statistics from one comprehensive report alone provide compelling evidence for the power of attack surface discovery:
• 73% of global organizations are worried about their growing attack surface.
• Just 51% of companies could fully define the extent of their attack surface.
• Respondents estimated having just 62% visibility of their entire attack surface.
By following your entire digital footprint over the Internet, attack surface discovery lets you see every Internet-facing asset that attackers can and will find as they perform reconnaissance from the anonymity of their own devices. Continuous visibility and proactive security measures are imperative for combating threats to the assets that adversaries focus on compromising across the Internet, mobile, and cloud environments.
Strengthen Your External Security Posture
Informer’s automated external asset discovery tools accurately identify and map all the assets that make up your Internet-facing digital ecosystem. These attack surface discovery capabilities form a core element of our external attack surface management platform, which layers monitoring, risk-based vulnerability management, and remediation on top of automated discovery and asset inventory.
The strength of your security posture today depends as much, if not more, on your external security posture as on the strength of any measures protecting your internal corporate network. In a matter of minutes, you can reduce cyber risk with attack surface discovery.
Frequently Asked Questions
What is attack surface discovery?
Attack surface discovery is the process of identifying and mapping potential points of vulnerability in an organization’s digital infrastructure.
How does attack surface discovery help reduce cyber risk?
Attack surface discovery helps reduce cyber risk by proactively identifying and assessing vulnerabilities, allowing organizations to prioritize remediation efforts and strengthen their security defenses.
What are the benefits of attack surface discovery?
Attack surface discovery offers benefits such as enhanced visibility into digital assets, proactive risk mitigation, resource prioritization, and compliance adherence.
How often should attack surface discovery be conducted?
Attack surface discovery should be conducted regularly, typically at least annually or when significant changes occur within the environment.
Is attack surface discovery a one-time activity?
No, attack surface discovery is an ongoing process due to the dynamic nature of digital infrastructures and evolving cyber threats.
|
__label__pos
| 0.949199 |
Indexing arrays in APL: Squad indexing on multi-dimensional arrays
James HeslipAPLLeave a Comment
I had a question for the team in our regular meeting on Wednesday, but it relied on an understanding on squad indexing, and nobody felt comfortable enough with to answer my question.
I’ve since reach a conclusion and thought I’d share.
Squad indexing vs. Square bracket indexing
⎕←cube←?3 4 5⍴7
4 3 4 1 1
5 5 7 6 3
2 2 5 1 4
4 6 5 4 3
1 6 1 6 6
3 1 5 3 3
2 5 5 4 7
1 5 6 5 2
5 6 6 4 1
7 1 5 1 1
1 1 4 1 1
6 6 4 1 1
For a given 3-dimensional object, I can use square bracket indexing to retrieve the indices I want. I can even omit a dimension completely to receive all items in that dimension, i.e. here I am asking for the first plane, the second row, and all columns:
cube[1;2;]
5 5 7 6 3
In this example, you can do the same with squad indexing- just omit any indices for that axis:
1 2⌷cube
5 5 7 6 3
Square bracket indexing has a bit more of an advantage for some cases, though. If the axes you want are non-contiguous, you can ask for [x;;y]. With squad indexing it’s not so simple. See the below example:
cube[1;;2]
3 5 2 6
1 ⍬ 2⌷cube
⍝ empty result
My thoughts were with [x;;y], ;; ←→ ⍬, representing an empty numeric array. This is not the case, however. As with typical indexing, the shape of the index is the shape of your result. Zilde is of shape 0 (⍬←→ 0⍴0), and therefore I would get back a shape 0 result:
⍴1 ⍬ 2⌷cube
0
My question to the team was how would I perform an operation like this, similar to [x;;y]?
Gilgamesh Athoraya has since told me the only way of performing this kind of indexing is to use axis specification:
1 2⌷[1 3]cube
3 5 2 6
I feel like there should be a way to do it using without specifying axis. Zilde may not be appropriate, but it was my immediate go-to answer. In fact, what we’re after is not an empty array, but an array whose shape is that of the actual object- identity () would achieve something like this. There is a slight issue with using identity, though:
1 ⊢ 2⌷cube
Here, right tack will be used dyadically as a function, and return the right argument. Let me know your thoughts: how should squad indexing behave? Should there be a way of achieving this in APL without axis specification (identity, zilde, etc), or do you have a different opinion entirely?
Why am I against axis specification with squad indexing?
I have an answer to my original question so I’ve quenched my thirst for knowledge and I have a workaround. The issue lies in performance. If we consider the same cube which was defined earlier (cube←?3 4 5⍴7) there are several ways of getting at all of the rows, some more efficient than others:
]runtime 'cube[1;;2]' '1 2⌷[1 3]cube' '1(1 2 3 4)2⌷cube' '1(⍳4)2⌷cube' -compare
cube[1;;2] → 6.1E¯7 | 0% ⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕
1 2⌷[1 3]cube → 8.7E¯7 | +43% ⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕
1(1 2 3 4)2⌷cube → 9.5E¯7 | +55% ⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕
1(⍳4)2⌷cube → 1.1E¯6 | +84% ⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕⎕
Figure 1. Version: 17.0.36114.0 32 Unicode
Using axis-specification I am immediately hit by a 43% speed penalty and this is worsened further if I actually specify all rows by hand! Naturally, using ⍳4 in place of (1 2 3 4) yields a slower result still as a function is taking place to generate the indices.
Something about the omission of the indices with square-bracket indexing allows for a fast execution time, and this is something I’d like to see in squad indexing if it’s not already a feature.
About the Author
James Heslip
APL Developer
James is an APL Programmer with a keen interest in mathematics. His love for computing was almost an accident. From a young age he always enjoyed using them- playing video games and such- but it was never considered that anything more would come from it. James originally had plans to pursue a career in finance. More about James.
More from James
Other Posts
|
__label__pos
| 0.589549 |
Instructions for quiz two point each
Posted 2019-06-30
Filed in Saskatchewan
Assigning Point Values to Graded Questions E-Learning Heroes
instructions for quiz two point each
Quia Foundations 2 Quiz 1 Word 1. Quiz & Worksheet - Point-of-View in Easily view each student's lesson progress and quiz scores; to the point, and the quiz allows me to test their knowledge on whatever subject in social, Quiz for Chapter 1 Computer Abstractions and Technology Page 2 of 12 2. [10 points] (Amdahl’s law question) Suppose you have a machine which executes a program consisting of 50% floating point multiply, 20% floating point divide, and the remaining 30% are from other instructions. (a) Management wants the machine to run 4 times faster..
week3 quiz 8/14 OL1 UMUC Math-107 Quiz#2 Instructor
Instructions This quiz has 37 questions. The use of. May 20, 2013 · How to Find the Slope of a Line Using Two Points. Finding the slope of a line is an essential skill in coordinate geometry, and is often used to draw a line on graph, or to determine the x- and y-intercepts of a line. The slope of a line..., Quizzes will be taken using Blackboard (Bb). You will have one attempt at each quiz. Each quiz has an allotted time limit. You will loose one (1) point for each half minute or portion thereof that you exceed the time limit. There will be a 15 second grace period to allow you ….
When you are done with each part, use the CLOSE button (under the question numbers) to close out. You can use this page to link to the two sections. Quiz 3 Multiple Choice. 10 questions - 5 points each. Every answer is recorded immediately upon selection. You can change your answer as many times as you want. Quizzes will be taken using Blackboard (Bb). You will have one attempt at each quiz. Each quiz has an allotted time limit. You will loose one (1) point for each half minute or portion thereof that you exceed the time limit. There will be a 15 second grace period to allow you …
Quiz for Chapter 1 Computer Abstractions and Technology Page 2 of 12 2. [10 points] (Amdahl’s law question) Suppose you have a machine which executes a program consisting of 50% floating point multiply, 20% floating point divide, and the remaining 30% are from other instructions. (a) Management wants the machine to run 4 times faster. Start studying Access Test. Learn vocabulary, terms, and more with flashcards, games, and other study tools. Each Access database may be as large as two gigabytes in size and may have up to 255 people using the database at the same time? Which two keys on the keyboard allow an Access user to move the insertion point to the next field to
Oct 15, 2019 · Go on adding the correct and the incorrect answer slides after each question of your PowerPoint quiz. Step 5: Add Navigation to Your Quiz. Now it’s time to link the right and wrong answers to the relevant feedback slides. To do this, click on the answer … bit along each line. • Two types of buses are commonly found in computer systems: point-to-point, and multipoint buses. 14 30,000 instructions on the average, with all instructions requiring 3 clock cycles. It is desired to have an average execution time of 10 milliseconds.
Quiz 2 courses.csail.mit.edu. 6. Put an X in each square that you’ve just drawn. 7. Put a circle around each square. 8. Put a circle around all of instruction #7. 9. Put a large X at the end of this sentence. 10. On the back of this paper, multiply 3 by 19, and circle your answer. 11. Draw a small circle around the LARGER of the two numbers in instruction #10. 12., Oct 15, 2019 · Go on adding the correct and the incorrect answer slides after each question of your PowerPoint quiz. Step 5: Add Navigation to Your Quiz. Now it’s time to link the right and wrong answers to the relevant feedback slides. To do this, click on the answer ….
Quiz & Worksheet Point-of-View in Writing Study.com
instructions for quiz two point each
EXERCISE FLIPCHART TARGET ANSWER KEY. Quiz for Chapter 1 Computer Abstractions and Technology 3.10 Solutions in Red 1. [15 points] Consider two different implementations, M1 and M2, of the same instruction set. There are three classes of instructions (A, B, and C) in the instruction set. M1 has a clock rate of 80 MHz and (the same floating point instructions run 15 times, Math 275 Quiz 2 Spring 2019 Instructions: This is a take-home quiz due at the start of class Wednesday, January 30th. Print pages 2 and 3 of the quiz to hand in. Do not include the instructions with the quiz. Quality of presentation is a signi cant part of your grade. This includes: { Neatness. Sloppy work will score poorly, if it gets graded.
Math 275 Quiz 2 Spring 2019 Instructions. 7 points 5) Change the font size of the first paragraph heading Job Boards to 16 point. 6 points 6) Change the case of the first paragraph heading Job Boards to Capitalize Each Word. 6 points 7) Use the Format Painter to format the two remaining paragraph headings Recruiters and Research Companies to match the first heading Job Boards., Instructions: This quiz has 37 questions. The use of calculators is forbidden. Click on the box with the right answer. To initialise the quiz you must click on “BEGIN QUIZ.” When you finish the quiz you click on “END QUIZ” in order to see your score. Begin Quiz Answer each of the following. 1. Collect like terms:.
Quiz 2 courses.csail.mit.edu
instructions for quiz two point each
Scaffolding eTool Suspended Scaffolds Two-point (swing. Quiz #2. INSTRUCTIONS: This test is in two parts. The questions in Part A require multi-step calculations and/or proofs. The questions in Part B are SHORT and should require very short calculations, answers by inspection, or short verbal answers.. Part A. 1. Dihedral Angle (15 points) Computer Architecture and Engineering CS152 Quiz #3 March 22nd, 2012 -three cycles for floating-point add instructions (X1,X2,X3)-four cycles for floating-point multiply instructions (X1,X2,X3,X4) You can assume that: • Two instructions are decoded and renamed at a time..
instructions for quiz two point each
• Quiz 2
• EF 230 Quiz 3 Instructions 45 minutes
• Quiz for Chapter 1 with Solutions Home College of
• 6. Put an X in each square that you’ve just drawn. 7. Put a circle around each square. 8. Put a circle around all of instruction #7. 9. Put a large X at the end of this sentence. 10. On the back of this paper, multiply 3 by 19, and circle your answer. 11. Draw a small circle around the LARGER of the two numbers in instruction #10. 12. Sep 03, 2018В В· US States by First Two Letters in 30 Seconds. It's amazing how many people will attempt a quiz without reading the instructions. Now I understand why so many do poorly on standardized tests such as the SATs; it's not because they are not smart, it's because they refuse to READ THE INSTRUCTIONS! Countries by First Two Letters in 90
Dec 23, 2018В В· Can you pick the popular games based on excerpts from their setup instructions? Test your knowledge on this gaming quiz to see how you do and compare your score to others. play quizzes ad-free . Random Quiz Gaming Quiz / Board Game Match 'Em Up Random Gaming or Popular Quiz Can you pick the popular games based on excerpts from their setup 7 points 5) Change the font size of the first paragraph heading Job Boards to 16 point. 6 points 6) Change the case of the first paragraph heading Job Boards to Capitalize Each Word. 6 points 7) Use the Format Painter to format the two remaining paragraph headings Recruiters and Research Companies to match the first heading Job Boards.
Montreal Cognitive Assessment (MoCA) Administration and Scoring Instructions The Montreal Cognitive Assessment (MoCA) was designed as a rapid screening inst rument for mild cognitive One point each is given for the following responses: (1) camel or dromedary, (2) Only the last two item pairs are scored. Give 1 point to each item pair 7 points 5) Change the font size of the first paragraph heading Job Boards to 16 point. 6 points 6) Change the case of the first paragraph heading Job Boards to Capitalize Each Word. 6 points 7) Use the Format Painter to format the two remaining paragraph headings Recruiters and Research Companies to match the first heading Job Boards.
instructions for quiz two point each
the quiz. If you have inadvertently been exposed to a quiz prior to taking it, you must tell the instructor or TA. • You will get no credit for selecting multiple-choice answers without giving explanations if the instructions ask you to explain your choice. Writing name on each sheet _____ 1 Point Instructions: There are 35 questions below. You only have to answer 20. Clearly indicate the 20 questions you want graded by circling their numbers. Each question is worth 1 point; incorrect answers score 0. If more than 20 questions are circled, each incorrect answer deducts 1 point. Some questions may have multiple correct answers. 1.
Saskatchewan Cities: Lashburn, Chamberlain, Lloydminster, Shellbrook, Tugaske, Lampman, Hafford, Meadow Lake, Hanley, Buchanan
|
__label__pos
| 0.695235 |
Skip to content
Permalink
Branch: master
Find file Copy path
Find file Copy path
Adhemerval Zanella Regenerated configure scripts. 656ee79 Feb 18, 2016
0 contributors
Users who have contributed to this file
executable file 8002 lines (7132 sloc) 225 KB
#! /bin/sh
# Guess values for system-dependent variables and create Makefiles.
# Generated by GNU Autoconf 2.69 for GNU C Library (see version.h).
#
# Report bugs to <http://sourceware.org/bugzilla/>.
#
#
# Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
#
#
# This configure script is free software; the Free Software Foundation
# gives unlimited permission to copy, distribute and modify it.
## -------------------- ##
## M4sh Initialization. ##
## -------------------- ##
# Be more Bourne compatible
DUALCASE=1; export DUALCASE # for MKS sh
if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
emulate sh
NULLCMD=:
# Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
# is contrary to our usage. Disable this feature.
alias -g '${1+"$@"}'='"$@"'
setopt NO_GLOB_SUBST
else
case `(set -o) 2>/dev/null` in #(
*posix*) :
set -o posix ;; #(
*) :
;;
esac
fi
as_nl='
'
export as_nl
# Printing a long string crashes Solaris 7 /usr/bin/printf.
as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
# Prefer a ksh shell builtin over an external printf program on Solaris,
# but without wasting forks for bash or zsh.
if test -z "$BASH_VERSION$ZSH_VERSION" \
&& (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
as_echo='print -r --'
as_echo_n='print -rn --'
elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
as_echo='printf %s\n'
as_echo_n='printf %s'
else
if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
as_echo_n='/usr/ucb/echo -n'
else
as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
as_echo_n_body='eval
arg=$1;
case $arg in #(
*"$as_nl"*)
expr "X$arg" : "X\\(.*\\)$as_nl";
arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
esac;
expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
'
export as_echo_n_body
as_echo_n='sh -c $as_echo_n_body as_echo'
fi
export as_echo_body
as_echo='sh -c $as_echo_body as_echo'
fi
# The user is always right.
if test "${PATH_SEPARATOR+set}" != set; then
PATH_SEPARATOR=:
(PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
(PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
PATH_SEPARATOR=';'
}
fi
# IFS
# We need space, tab and new line, in precisely that order. Quoting is
# there to prevent editors from complaining about space-tab.
# (If _AS_PATH_WALK were called with IFS unset, it would disable word
# splitting by setting IFS to empty value.)
IFS=" "" $as_nl"
# Find who we are. Look in the path if we contain no directory separator.
as_myself=
case $0 in #((
*[\\/]* ) as_myself=$0 ;;
*) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
done
IFS=$as_save_IFS
;;
esac
# We did not find ourselves, most probably we were run as `sh COMMAND'
# in which case we are not to be found in the path.
if test "x$as_myself" = x; then
as_myself=$0
fi
if test ! -f "$as_myself"; then
$as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
exit 1
fi
# Unset variables that we do not need and which cause bugs (e.g. in
# pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1"
# suppresses any "Segmentation fault" message there. '((' could
# trigger a bug in pdksh 5.2.14.
for as_var in BASH_ENV ENV MAIL MAILPATH
do eval test x\${$as_var+set} = xset \
&& ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
done
PS1='$ '
PS2='> '
PS4='+ '
# NLS nuisances.
LC_ALL=C
export LC_ALL
LANGUAGE=C
export LANGUAGE
# CDPATH.
(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
# Use a proper internal environment variable to ensure we don't fall
# into an infinite loop, continuously re-executing ourselves.
if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
_as_can_reexec=no; export _as_can_reexec;
# We cannot yet assume a decent shell, so we have to provide a
# neutralization value for shells without unset; and this also
# works around shells that cannot unset nonexistent variables.
# Preserve -v and -x to the replacement shell.
BASH_ENV=/dev/null
ENV=/dev/null
(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
case $- in # ((((
*v*x* | *x*v* ) as_opts=-vx ;;
*v* ) as_opts=-v ;;
*x* ) as_opts=-x ;;
* ) as_opts= ;;
esac
exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
# Admittedly, this is quite paranoid, since all the known shells bail
# out after a failed `exec'.
$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
as_fn_exit 255
fi
# We don't want this to propagate to other subprocesses.
{ _as_can_reexec=; unset _as_can_reexec;}
if test "x$CONFIG_SHELL" = x; then
as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
emulate sh
NULLCMD=:
# Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
# is contrary to our usage. Disable this feature.
alias -g '\${1+\"\$@\"}'='\"\$@\"'
setopt NO_GLOB_SUBST
else
case \`(set -o) 2>/dev/null\` in #(
*posix*) :
set -o posix ;; #(
*) :
;;
esac
fi
"
as_required="as_fn_return () { (exit \$1); }
as_fn_success () { as_fn_return 0; }
as_fn_failure () { as_fn_return 1; }
as_fn_ret_success () { return 0; }
as_fn_ret_failure () { return 1; }
exitcode=0
as_fn_success || { exitcode=1; echo as_fn_success failed.; }
as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
else
exitcode=1; echo positional parameters were not saved.
fi
test x\$exitcode = x0 || exit 1
test -x / || exit 1"
as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1"
if (eval "$as_required") 2>/dev/null; then :
as_have_required=yes
else
as_have_required=no
fi
if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
as_found=false
for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
as_found=:
case $as_dir in #(
/*)
for as_base in sh bash ksh sh5; do
# Try only shells that exist, to save several forks.
as_shell=$as_dir/$as_base
if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
{ $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
CONFIG_SHELL=$as_shell as_have_required=yes
if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
break 2
fi
fi
done;;
esac
as_found=false
done
$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
{ $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
CONFIG_SHELL=$SHELL as_have_required=yes
fi; }
IFS=$as_save_IFS
if test "x$CONFIG_SHELL" != x; then :
export CONFIG_SHELL
# We cannot yet assume a decent shell, so we have to provide a
# neutralization value for shells without unset; and this also
# works around shells that cannot unset nonexistent variables.
# Preserve -v and -x to the replacement shell.
BASH_ENV=/dev/null
ENV=/dev/null
(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
case $- in # ((((
*v*x* | *x*v* ) as_opts=-vx ;;
*v* ) as_opts=-v ;;
*x* ) as_opts=-x ;;
* ) as_opts= ;;
esac
exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
# Admittedly, this is quite paranoid, since all the known shells bail
# out after a failed `exec'.
$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
exit 255
fi
if test x$as_have_required = xno; then :
$as_echo "$0: This script requires a shell more modern than all"
$as_echo "$0: the shells that I found on your system."
if test x${ZSH_VERSION+set} = xset ; then
$as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
$as_echo "$0: be upgraded to zsh 4.3.4 or later."
else
$as_echo "$0: Please tell [email protected] and
$0: http://sourceware.org/bugzilla/ about your system,
$0: including any error possibly output before this
$0: message. Then install a modern shell, or manually run
$0: the script under such a shell if you do have one."
fi
exit 1
fi
fi
fi
SHELL=${CONFIG_SHELL-/bin/sh}
export SHELL
# Unset more variables known to interfere with behavior of common tools.
CLICOLOR_FORCE= GREP_OPTIONS=
unset CLICOLOR_FORCE GREP_OPTIONS
## --------------------- ##
## M4sh Shell Functions. ##
## --------------------- ##
# as_fn_unset VAR
# ---------------
# Portably unset VAR.
as_fn_unset ()
{
{ eval $1=; unset $1;}
}
as_unset=as_fn_unset
# as_fn_set_status STATUS
# -----------------------
# Set $? to STATUS, without forking.
as_fn_set_status ()
{
return $1
} # as_fn_set_status
# as_fn_exit STATUS
# -----------------
# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
as_fn_exit ()
{
set +e
as_fn_set_status $1
exit $1
} # as_fn_exit
# as_fn_mkdir_p
# -------------
# Create "$as_dir" as a directory, including parents if necessary.
as_fn_mkdir_p ()
{
case $as_dir in #(
-*) as_dir=./$as_dir;;
esac
test -d "$as_dir" || eval $as_mkdir_p || {
as_dirs=
while :; do
case $as_dir in #(
*\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
*) as_qdir=$as_dir;;
esac
as_dirs="'$as_qdir' $as_dirs"
as_dir=`$as_dirname -- "$as_dir" ||
$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
X"$as_dir" : 'X\(//\)[^/]' \| \
X"$as_dir" : 'X\(//\)$' \| \
X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
$as_echo X"$as_dir" |
sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
s//\1/
q
}
/^X\(\/\/\)[^/].*/{
s//\1/
q
}
/^X\(\/\/\)$/{
s//\1/
q
}
/^X\(\/\).*/{
s//\1/
q
}
s/.*/./; q'`
test -d "$as_dir" && break
done
test -z "$as_dirs" || eval "mkdir $as_dirs"
} || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
} # as_fn_mkdir_p
# as_fn_executable_p FILE
# -----------------------
# Test if FILE is an executable regular file.
as_fn_executable_p ()
{
test -f "$1" && test -x "$1"
} # as_fn_executable_p
# as_fn_append VAR VALUE
# ----------------------
# Append the text in VALUE to the end of the definition contained in VAR. Take
# advantage of any shell optimizations that allow amortized linear growth over
# repeated appends, instead of the typical quadratic growth present in naive
# implementations.
if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
eval 'as_fn_append ()
{
eval $1+=\$2
}'
else
as_fn_append ()
{
eval $1=\$$1\$2
}
fi # as_fn_append
# as_fn_arith ARG...
# ------------------
# Perform arithmetic evaluation on the ARGs, and store the result in the
# global $as_val. Take advantage of shells that can avoid forks. The arguments
# must be portable across $(()) and expr.
if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
eval 'as_fn_arith ()
{
as_val=$(( $* ))
}'
else
as_fn_arith ()
{
as_val=`expr "$@" || test $? -eq 1`
}
fi # as_fn_arith
# as_fn_error STATUS ERROR [LINENO LOG_FD]
# ----------------------------------------
# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
# script with STATUS, using 1 if that was 0.
as_fn_error ()
{
as_status=$1; test $as_status -eq 0 && as_status=1
if test "$4"; then
as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
$as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
fi
$as_echo "$as_me: error: $2" >&2
as_fn_exit $as_status
} # as_fn_error
if expr a : '\(a\)' >/dev/null 2>&1 &&
test "X`expr 00001 : '.*\(...\)'`" = X001; then
as_expr=expr
else
as_expr=false
fi
if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
as_basename=basename
else
as_basename=false
fi
if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
as_dirname=dirname
else
as_dirname=false
fi
as_me=`$as_basename -- "$0" ||
$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
X"$0" : 'X\(//\)$' \| \
X"$0" : 'X\(/\)' \| . 2>/dev/null ||
$as_echo X/"$0" |
sed '/^.*\/\([^/][^/]*\)\/*$/{
s//\1/
q
}
/^X\/\(\/\/\)$/{
s//\1/
q
}
/^X\/\(\/\).*/{
s//\1/
q
}
s/.*/./; q'`
# Avoid depending upon Character Ranges.
as_cr_letters='abcdefghijklmnopqrstuvwxyz'
as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
as_cr_Letters=$as_cr_letters$as_cr_LETTERS
as_cr_digits='0123456789'
as_cr_alnum=$as_cr_Letters$as_cr_digits
as_lineno_1=$LINENO as_lineno_1a=$LINENO
as_lineno_2=$LINENO as_lineno_2a=$LINENO
eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
# Blame Lee E. McMahon (1931-1989) for sed's syntax. :-)
sed -n '
p
/[$]LINENO/=
' <$as_myself |
sed '
s/[$]LINENO.*/&-/
t lineno
b
:lineno
N
:loop
s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
t loop
s/-\n.*//
' >$as_me.lineno &&
chmod +x "$as_me.lineno" ||
{ $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
# If we had to re-execute with $CONFIG_SHELL, we're ensured to have
# already done that, so ensure we don't try to do so again and fall
# in an infinite loop. This has already happened in practice.
_as_can_reexec=no; export _as_can_reexec
# Don't try to exec as it changes $[0], causing all sort of problems
# (the dirname of $[0] is not the place where we might find the
# original and so on. Autoconf is especially sensitive to this).
. "./$as_me.lineno"
# Exit status is that of the last command.
exit
}
ECHO_C= ECHO_N= ECHO_T=
case `echo -n x` in #(((((
-n*)
case `echo 'xy\c'` in
*c*) ECHO_T=' ';; # ECHO_T is single tab character.
xy) ECHO_C='\c';;
*) echo `echo ksh88 bug on AIX 6.1` > /dev/null
ECHO_T=' ';;
esac;;
*)
ECHO_N='-n';;
esac
rm -f conf$$ conf$$.exe conf$$.file
if test -d conf$$.dir; then
rm -f conf$$.dir/conf$$.file
else
rm -f conf$$.dir
mkdir conf$$.dir 2>/dev/null
fi
if (echo >conf$$.file) 2>/dev/null; then
if ln -s conf$$.file conf$$ 2>/dev/null; then
as_ln_s='ln -s'
# ... but there are two gotchas:
# 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
# 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
# In both cases, we have to default to `cp -pR'.
ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
as_ln_s='cp -pR'
elif ln conf$$.file conf$$ 2>/dev/null; then
as_ln_s=ln
else
as_ln_s='cp -pR'
fi
else
as_ln_s='cp -pR'
fi
rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
rmdir conf$$.dir 2>/dev/null
if mkdir -p . 2>/dev/null; then
as_mkdir_p='mkdir -p "$as_dir"'
else
test -d ./-p && rmdir ./-p
as_mkdir_p=false
fi
as_test_x='test -x'
as_executable_p=as_fn_executable_p
# Sed expression to map a string onto a valid CPP name.
as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
# Sed expression to map a string onto a valid variable name.
as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
test -n "$DJDIR" || exec 7<&0 </dev/null
exec 6>&1
# Name of the host.
# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
# so uname gets run too.
ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
#
# Initializations.
#
ac_default_prefix=/usr/local
ac_clean_files=
ac_config_libobj_dir=.
LIBOBJS=
cross_compiling=no
subdirs=
MFLAGS=
MAKEFLAGS=
# Identity of this package.
PACKAGE_NAME='GNU C Library'
PACKAGE_TARNAME='glibc'
PACKAGE_VERSION='(see version.h)'
PACKAGE_STRING='GNU C Library (see version.h)'
PACKAGE_BUGREPORT='http://sourceware.org/bugzilla/'
PACKAGE_URL='http://www.gnu.org/software/glibc/'
ac_unique_file="include/features.h"
enable_option_checking=no
ac_subst_vars='LTLIBOBJS
LIBOBJS
RELEASE
VERSION
mach_interface_list
DEFINES
static_nss
profile
libc_cv_pie_default
libc_cv_pic_default
shared
static
ldd_rewrite_script
use_ldconfig
libc_cv_rootsbindir
libc_cv_localstatedir
libc_cv_sysconfdir
libc_cv_complocaledir
libc_cv_rtlddir
libc_cv_slibdir
use_nscd
libc_cv_gcc_unwind_find_fde
libc_extra_cppflags
libc_extra_cflags
libc_cv_cxx_thread_local
CPPUNDEFS
have_selinux
have_libcap
have_libaudit
LIBGD
libc_cv_cc_loop_to_function
libc_cv_cc_submachine
libc_cv_cc_nofma
stack_protector
fno_unit_at_a_time
libc_cv_output_format
libc_cv_has_glob_dat
libc_cv_hashstyle
libc_cv_fpie
libc_cv_z_execstack
libc_cv_z_combreloc
ASFLAGS_config
libc_cv_cc_with_libunwind
libc_cv_protected_data
BISON
INSTALL_INFO
PERL
BASH_SHELL
CXX_SYSINCLUDES
SYSINCLUDES
AUTOCONF
NM
AWK
SED
MAKEINFO
MSGFMT
MAKE
LD
AS
OBJCOPY
OBJDUMP
AR
LN_S
INSTALL_DATA
INSTALL_SCRIPT
INSTALL_PROGRAM
sysdeps_add_ons
sysnames
submachine
multi_arch
base_machine
add_on_subdirs
add_ons
build_pt_chown
build_nscd
link_obsolete_rpc
libc_cv_nss_crypt
enable_werror
all_warnings
force_install
bindnow
enable_lock_elision
hardcoded_path_in_tests
enable_timezone_tools
use_default_link
sysheaders
with_fp
ac_ct_CXX
CXXFLAGS
CXX
READELF
CPP
cross_compiling
BUILD_CC
OBJEXT
ac_ct_CC
CPPFLAGS
LDFLAGS
CFLAGS
CC
host_os
host_vendor
host_cpu
host
build_os
build_vendor
build_cpu
build
subdirs
REPORT_BUGS_TEXI
REPORT_BUGS_TO
PKGVERSION_TEXI
PKGVERSION
target_alias
host_alias
build_alias
LIBS
ECHO_T
ECHO_N
ECHO_C
DEFS
mandir
localedir
libdir
psdir
pdfdir
dvidir
htmldir
infodir
docdir
oldincludedir
includedir
localstatedir
sharedstatedir
sysconfdir
datadir
datarootdir
libexecdir
sbindir
bindir
program_transform_name
prefix
exec_prefix
PACKAGE_URL
PACKAGE_BUGREPORT
PACKAGE_STRING
PACKAGE_VERSION
PACKAGE_TARNAME
PACKAGE_NAME
PATH_SEPARATOR
SHELL'
ac_subst_files=''
ac_user_opts='
enable_option_checking
with_pkgversion
with_bugurl
with_gd
with_gd_include
with_gd_lib
with_fp
with_binutils
with_selinux
with_headers
with_default_link
enable_sanity_checks
enable_shared
enable_profile
enable_timezone_tools
enable_hardcoded_path_in_tests
enable_stackguard_randomization
enable_lock_elision
enable_add_ons
enable_hidden_plt
enable_bind_now
enable_static_nss
enable_force_install
enable_maintainer_mode
enable_kernel
enable_all_warnings
enable_werror
enable_multi_arch
enable_nss_crypt
enable_obsolete_rpc
enable_systemtap
enable_build_nscd
enable_nscd
enable_pt_chown
enable_mathvec
with_cpu
'
ac_precious_vars='build_alias
host_alias
target_alias
CC
CFLAGS
LDFLAGS
LIBS
CPPFLAGS
CPP
CXX
CXXFLAGS
CCC'
ac_subdirs_all='
'
# Initialize some variables set by options.
ac_init_help=
ac_init_version=false
ac_unrecognized_opts=
ac_unrecognized_sep=
# The variables have the same names as the options, with
# dashes changed to underlines.
cache_file=/dev/null
exec_prefix=NONE
no_create=
no_recursion=
prefix=NONE
program_prefix=NONE
program_suffix=NONE
program_transform_name=s,x,x,
silent=
site=
srcdir=
verbose=
x_includes=NONE
x_libraries=NONE
# Installation directory options.
# These are left unexpanded so users can "make install exec_prefix=/foo"
# and all the variables that are supposed to be based on exec_prefix
# by default will actually change.
# Use braces instead of parens because sh, perl, etc. also accept them.
# (The list follows the same order as the GNU Coding Standards.)
bindir='${exec_prefix}/bin'
sbindir='${exec_prefix}/sbin'
libexecdir='${exec_prefix}/libexec'
datarootdir='${prefix}/share'
datadir='${datarootdir}'
sysconfdir='${prefix}/etc'
sharedstatedir='${prefix}/com'
localstatedir='${prefix}/var'
includedir='${prefix}/include'
oldincludedir='/usr/include'
docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
infodir='${datarootdir}/info'
htmldir='${docdir}'
dvidir='${docdir}'
pdfdir='${docdir}'
psdir='${docdir}'
libdir='${exec_prefix}/lib'
localedir='${datarootdir}/locale'
mandir='${datarootdir}/man'
ac_prev=
ac_dashdash=
for ac_option
do
# If the previous option needs an argument, assign it.
if test -n "$ac_prev"; then
eval $ac_prev=\$ac_option
ac_prev=
continue
fi
case $ac_option in
*=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
*=) ac_optarg= ;;
*) ac_optarg=yes ;;
esac
# Accept the important Cygnus configure options, so we can diagnose typos.
case $ac_dashdash$ac_option in
--)
ac_dashdash=yes ;;
-bindir | --bindir | --bindi | --bind | --bin | --bi)
ac_prev=bindir ;;
-bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
bindir=$ac_optarg ;;
-build | --build | --buil | --bui | --bu)
ac_prev=build_alias ;;
-build=* | --build=* | --buil=* | --bui=* | --bu=*)
build_alias=$ac_optarg ;;
-cache-file | --cache-file | --cache-fil | --cache-fi \
| --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
ac_prev=cache_file ;;
-cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
| --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
cache_file=$ac_optarg ;;
--config-cache | -C)
cache_file=config.cache ;;
-datadir | --datadir | --datadi | --datad)
ac_prev=datadir ;;
-datadir=* | --datadir=* | --datadi=* | --datad=*)
datadir=$ac_optarg ;;
-datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
| --dataroo | --dataro | --datar)
ac_prev=datarootdir ;;
-datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
| --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
datarootdir=$ac_optarg ;;
-disable-* | --disable-*)
ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
# Reject names that are not valid shell variable names.
expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
as_fn_error $? "invalid feature name: $ac_useropt"
ac_useropt_orig=$ac_useropt
ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
case $ac_user_opts in
*"
"enable_$ac_useropt"
"*) ;;
*) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
ac_unrecognized_sep=', ';;
esac
eval enable_$ac_useropt=no ;;
-docdir | --docdir | --docdi | --doc | --do)
ac_prev=docdir ;;
-docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
docdir=$ac_optarg ;;
-dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
ac_prev=dvidir ;;
-dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
dvidir=$ac_optarg ;;
-enable-* | --enable-*)
ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
# Reject names that are not valid shell variable names.
expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
as_fn_error $? "invalid feature name: $ac_useropt"
ac_useropt_orig=$ac_useropt
ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
case $ac_user_opts in
*"
"enable_$ac_useropt"
"*) ;;
*) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
ac_unrecognized_sep=', ';;
esac
eval enable_$ac_useropt=\$ac_optarg ;;
-exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
| --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
| --exec | --exe | --ex)
ac_prev=exec_prefix ;;
-exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
| --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
| --exec=* | --exe=* | --ex=*)
exec_prefix=$ac_optarg ;;
-gas | --gas | --ga | --g)
# Obsolete; use --with-gas.
with_gas=yes ;;
-help | --help | --hel | --he | -h)
ac_init_help=long ;;
-help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
ac_init_help=recursive ;;
-help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
ac_init_help=short ;;
-host | --host | --hos | --ho)
ac_prev=host_alias ;;
-host=* | --host=* | --hos=* | --ho=*)
host_alias=$ac_optarg ;;
-htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
ac_prev=htmldir ;;
-htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
| --ht=*)
htmldir=$ac_optarg ;;
-includedir | --includedir | --includedi | --included | --include \
| --includ | --inclu | --incl | --inc)
ac_prev=includedir ;;
-includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
| --includ=* | --inclu=* | --incl=* | --inc=*)
includedir=$ac_optarg ;;
-infodir | --infodir | --infodi | --infod | --info | --inf)
ac_prev=infodir ;;
-infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
infodir=$ac_optarg ;;
-libdir | --libdir | --libdi | --libd)
ac_prev=libdir ;;
-libdir=* | --libdir=* | --libdi=* | --libd=*)
libdir=$ac_optarg ;;
-libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
| --libexe | --libex | --libe)
ac_prev=libexecdir ;;
-libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
| --libexe=* | --libex=* | --libe=*)
libexecdir=$ac_optarg ;;
-localedir | --localedir | --localedi | --localed | --locale)
ac_prev=localedir ;;
-localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
localedir=$ac_optarg ;;
-localstatedir | --localstatedir | --localstatedi | --localstated \
| --localstate | --localstat | --localsta | --localst | --locals)
ac_prev=localstatedir ;;
-localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
| --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
localstatedir=$ac_optarg ;;
-mandir | --mandir | --mandi | --mand | --man | --ma | --m)
ac_prev=mandir ;;
-mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
mandir=$ac_optarg ;;
-nfp | --nfp | --nf)
# Obsolete; use --without-fp.
with_fp=no ;;
-no-create | --no-create | --no-creat | --no-crea | --no-cre \
| --no-cr | --no-c | -n)
no_create=yes ;;
-no-recursion | --no-recursion | --no-recursio | --no-recursi \
| --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
no_recursion=yes ;;
-oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
| --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
| --oldin | --oldi | --old | --ol | --o)
ac_prev=oldincludedir ;;
-oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
| --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
| --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
oldincludedir=$ac_optarg ;;
-prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
ac_prev=prefix ;;
-prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
prefix=$ac_optarg ;;
-program-prefix | --program-prefix | --program-prefi | --program-pref \
| --program-pre | --program-pr | --program-p)
ac_prev=program_prefix ;;
-program-prefix=* | --program-prefix=* | --program-prefi=* \
| --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
program_prefix=$ac_optarg ;;
-program-suffix | --program-suffix | --program-suffi | --program-suff \
| --program-suf | --program-su | --program-s)
ac_prev=program_suffix ;;
-program-suffix=* | --program-suffix=* | --program-suffi=* \
| --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
program_suffix=$ac_optarg ;;
-program-transform-name | --program-transform-name \
| --program-transform-nam | --program-transform-na \
| --program-transform-n | --program-transform- \
| --program-transform | --program-transfor \
| --program-transfo | --program-transf \
| --program-trans | --program-tran \
| --progr-tra | --program-tr | --program-t)
ac_prev=program_transform_name ;;
-program-transform-name=* | --program-transform-name=* \
| --program-transform-nam=* | --program-transform-na=* \
| --program-transform-n=* | --program-transform-=* \
| --program-transform=* | --program-transfor=* \
| --program-transfo=* | --program-transf=* \
| --program-trans=* | --program-tran=* \
| --progr-tra=* | --program-tr=* | --program-t=*)
program_transform_name=$ac_optarg ;;
-pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
ac_prev=pdfdir ;;
-pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
pdfdir=$ac_optarg ;;
-psdir | --psdir | --psdi | --psd | --ps)
ac_prev=psdir ;;
-psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
psdir=$ac_optarg ;;
-q | -quiet | --quiet | --quie | --qui | --qu | --q \
| -silent | --silent | --silen | --sile | --sil)
silent=yes ;;
-sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
ac_prev=sbindir ;;
-sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
| --sbi=* | --sb=*)
sbindir=$ac_optarg ;;
-sharedstatedir | --sharedstatedir | --sharedstatedi \
| --sharedstated | --sharedstate | --sharedstat | --sharedsta \
| --sharedst | --shareds | --shared | --share | --shar \
| --sha | --sh)
ac_prev=sharedstatedir ;;
-sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
| --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
| --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
| --sha=* | --sh=*)
sharedstatedir=$ac_optarg ;;
-site | --site | --sit)
ac_prev=site ;;
-site=* | --site=* | --sit=*)
site=$ac_optarg ;;
-srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
ac_prev=srcdir ;;
-srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
srcdir=$ac_optarg ;;
-sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
| --syscon | --sysco | --sysc | --sys | --sy)
ac_prev=sysconfdir ;;
-sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
| --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
sysconfdir=$ac_optarg ;;
-target | --target | --targe | --targ | --tar | --ta | --t)
ac_prev=target_alias ;;
-target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
target_alias=$ac_optarg ;;
-v | -verbose | --verbose | --verbos | --verbo | --verb)
verbose=yes ;;
-version | --version | --versio | --versi | --vers | -V)
ac_init_version=: ;;
-with-* | --with-*)
ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
# Reject names that are not valid shell variable names.
expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
as_fn_error $? "invalid package name: $ac_useropt"
ac_useropt_orig=$ac_useropt
ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
case $ac_user_opts in
*"
"with_$ac_useropt"
"*) ;;
*) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
ac_unrecognized_sep=', ';;
esac
eval with_$ac_useropt=\$ac_optarg ;;
-without-* | --without-*)
ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
# Reject names that are not valid shell variable names.
expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
as_fn_error $? "invalid package name: $ac_useropt"
ac_useropt_orig=$ac_useropt
ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
case $ac_user_opts in
*"
"with_$ac_useropt"
"*) ;;
*) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
ac_unrecognized_sep=', ';;
esac
eval with_$ac_useropt=no ;;
--x)
# Obsolete; use --with-x.
with_x=yes ;;
-x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
| --x-incl | --x-inc | --x-in | --x-i)
ac_prev=x_includes ;;
-x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
| --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
x_includes=$ac_optarg ;;
-x-libraries | --x-libraries | --x-librarie | --x-librari \
| --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
ac_prev=x_libraries ;;
-x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
| --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
x_libraries=$ac_optarg ;;
-*) as_fn_error $? "unrecognized option: \`$ac_option'
Try \`$0 --help' for more information"
;;
*=*)
ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
# Reject names that are not valid shell variable names.
case $ac_envvar in #(
'' | [0-9]* | *[!_$as_cr_alnum]* )
as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
esac
eval $ac_envvar=\$ac_optarg
export $ac_envvar ;;
*)
# FIXME: should be removed in autoconf 3.0.
$as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
$as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
: "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
;;
esac
done
if test -n "$ac_prev"; then
ac_option=--`echo $ac_prev | sed 's/_/-/g'`
as_fn_error $? "missing argument to $ac_option"
fi
if test -n "$ac_unrecognized_opts"; then
case $enable_option_checking in
no) ;;
fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
*) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
esac
fi
# Check all directory arguments for consistency.
for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \
datadir sysconfdir sharedstatedir localstatedir includedir \
oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
libdir localedir mandir
do
eval ac_val=\$$ac_var
# Remove trailing slashes.
case $ac_val in
*/ )
ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
eval $ac_var=\$ac_val;;
esac
# Be sure to have absolute directory names.
case $ac_val in
[\\/$]* | ?:[\\/]* ) continue;;
NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
esac
as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
done
# There might be people who depend on the old broken behavior: `$host'
# used to hold the argument of --host etc.
# FIXME: To remove some day.
build=$build_alias
host=$host_alias
target=$target_alias
# FIXME: To remove some day.
if test "x$host_alias" != x; then
if test "x$build_alias" = x; then
cross_compiling=maybe
elif test "x$build_alias" != "x$host_alias"; then
cross_compiling=yes
fi
fi
ac_tool_prefix=
test -n "$host_alias" && ac_tool_prefix=$host_alias-
test "$silent" = yes && exec 6>/dev/null
ac_pwd=`pwd` && test -n "$ac_pwd" &&
ac_ls_di=`ls -di .` &&
ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
as_fn_error $? "working directory cannot be determined"
test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
as_fn_error $? "pwd does not report name of working directory"
# Find the source files, if location was not specified.
if test -z "$srcdir"; then
ac_srcdir_defaulted=yes
# Try the directory containing this script, then the parent directory.
ac_confdir=`$as_dirname -- "$as_myself" ||
$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
X"$as_myself" : 'X\(//\)[^/]' \| \
X"$as_myself" : 'X\(//\)$' \| \
X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
$as_echo X"$as_myself" |
sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
s//\1/
q
}
/^X\(\/\/\)[^/].*/{
s//\1/
q
}
/^X\(\/\/\)$/{
s//\1/
q
}
/^X\(\/\).*/{
s//\1/
q
}
s/.*/./; q'`
srcdir=$ac_confdir
if test ! -r "$srcdir/$ac_unique_file"; then
srcdir=..
fi
else
ac_srcdir_defaulted=no
fi
if test ! -r "$srcdir/$ac_unique_file"; then
test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
fi
ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
ac_abs_confdir=`(
cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
pwd)`
# When building in place, set srcdir=.
if test "$ac_abs_confdir" = "$ac_pwd"; then
srcdir=.
fi
# Remove unnecessary trailing slashes from srcdir.
# Double slashes in file names in object file debugging info
# mess up M-x gdb in Emacs.
case $srcdir in
*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
esac
for ac_var in $ac_precious_vars; do
eval ac_env_${ac_var}_set=\${${ac_var}+set}
eval ac_env_${ac_var}_value=\$${ac_var}
eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
eval ac_cv_env_${ac_var}_value=\$${ac_var}
done
#
# Report the --help message.
#
if test "$ac_init_help" = "long"; then
# Omit some internal or obsolete options to make the list less imposing.
# This message is too long to be a string in the A/UX 3.1 sh.
cat <<_ACEOF
\`configure' configures GNU C Library (see version.h) to adapt to many kinds of systems.
Usage: $0 [OPTION]... [VAR=VALUE]...
To assign environment variables (e.g., CC, CFLAGS...), specify them as
VAR=VALUE. See below for descriptions of some of the useful variables.
Defaults for the options are specified in brackets.
Configuration:
-h, --help display this help and exit
--help=short display options specific to this package
--help=recursive display the short help of all the included packages
-V, --version display version information and exit
-q, --quiet, --silent do not print \`checking ...' messages
--cache-file=FILE cache test results in FILE [disabled]
-C, --config-cache alias for \`--cache-file=config.cache'
-n, --no-create do not create output files
--srcdir=DIR find the sources in DIR [configure dir or \`..']
Installation directories:
--prefix=PREFIX install architecture-independent files in PREFIX
[$ac_default_prefix]
--exec-prefix=EPREFIX install architecture-dependent files in EPREFIX
[PREFIX]
By default, \`make install' will install all the files in
\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify
an installation prefix other than \`$ac_default_prefix' using \`--prefix',
for instance \`--prefix=\$HOME'.
For better control, use the options below.
Fine tuning of the installation directories:
--bindir=DIR user executables [EPREFIX/bin]
--sbindir=DIR system admin executables [EPREFIX/sbin]
--libexecdir=DIR program executables [EPREFIX/libexec]
--sysconfdir=DIR read-only single-machine data [PREFIX/etc]
--sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com]
--localstatedir=DIR modifiable single-machine data [PREFIX/var]
--libdir=DIR object code libraries [EPREFIX/lib]
--includedir=DIR C header files [PREFIX/include]
--oldincludedir=DIR C header files for non-gcc [/usr/include]
--datarootdir=DIR read-only arch.-independent data root [PREFIX/share]
--datadir=DIR read-only architecture-independent data [DATAROOTDIR]
--infodir=DIR info documentation [DATAROOTDIR/info]
--localedir=DIR locale-dependent data [DATAROOTDIR/locale]
--mandir=DIR man documentation [DATAROOTDIR/man]
--docdir=DIR documentation root [DATAROOTDIR/doc/glibc]
--htmldir=DIR html documentation [DOCDIR]
--dvidir=DIR dvi documentation [DOCDIR]
--pdfdir=DIR pdf documentation [DOCDIR]
--psdir=DIR ps documentation [DOCDIR]
_ACEOF
cat <<\_ACEOF
System types:
--build=BUILD configure for building on BUILD [guessed]
--host=HOST cross-compile to build programs to run on HOST [BUILD]
_ACEOF
fi
if test -n "$ac_init_help"; then
case $ac_init_help in
short | recursive ) echo "Configuration of GNU C Library (see version.h):";;
esac
cat <<\_ACEOF
Optional Features:
--disable-option-checking ignore unrecognized --enable/--with options
--disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no)
--enable-FEATURE[=ARG] include FEATURE [ARG=yes]
--disable-sanity-checks really do not use threads (should not be used except
in special situations) [default=yes]
--enable-shared build shared library [default=yes if GNU ld]
--enable-profile build profiled library [default=no]
--disable-timezone-tools
do not install timezone tools [default=install]
--enable-hardcoded-path-in-tests
hardcode newly built glibc path in tests
[default=no]
--enable-stackguard-randomization
initialize __stack_chk_guard canary with a random
number at program start
--enable-lock-elision=yes/no
Enable lock elision for pthread mutexes by default
--enable-add-ons[=DIRS...]
configure and build add-ons in DIR1,DIR2,... search
for add-ons if no parameter given
--disable-hidden-plt do not hide internal function calls to avoid PLT
--enable-bind-now disable lazy relocations in DSOs
--enable-static-nss build static NSS modules [default=no]
--disable-force-install don't force installation of files from this package,
even if they are older than the installed files
--enable-maintainer-mode
enable make rules and dependencies not useful (and
sometimes confusing) to the casual installer
--enable-kernel=VERSION compile for compatibility with kernel not older than
VERSION
--enable-all-warnings enable all useful warnings gcc can issue
--disable-werror do not build with -Werror
--enable-multi-arch enable single DSO with optimizations for multiple
architectures
--enable-nss-crypt enable libcrypt to use nss
--enable-obsolete-rpc build and install the obsolete RPC code for
link-time usage
--enable-systemtap enable systemtap static probe points [default=no]
--disable-build-nscd disable building and installing the nscd daemon
--disable-nscd library functions will not contact the nscd daemon
--enable-pt_chown Enable building and installing pt_chown
--enable-mathvec Enable building and installing mathvec [default
depends on architecture]
Optional Packages:
--with-PACKAGE[=ARG] use PACKAGE [ARG=yes]
--without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no)
--with-pkgversion=PKG Use PKG in the version string in place of "GNU libc"
--with-bugurl=URL Direct users to URL to report a bug
--with-gd=DIR find libgd include dir and library with prefix DIR
--with-gd-include=DIR find libgd include files in DIR
--with-gd-lib=DIR find libgd library files in DIR
--with-fp if using floating-point hardware [default=yes]
--with-binutils=PATH specify location of binutils (as and ld)
--with-selinux if building with SELinux support
--with-headers=PATH location of system headers to use (for example
/usr/src/linux/include) [default=compiler default]
--with-default-link do not use explicit linker scripts
--with-cpu=CPU select code for CPU variant
Some influential environment variables:
CC C compiler command
CFLAGS C compiler flags
LDFLAGS linker flags, e.g. -L<lib dir> if you have libraries in a
nonstandard directory <lib dir>
LIBS libraries to pass to the linker, e.g. -l<library>
CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I<include dir> if
you have headers in a nonstandard directory <include dir>
CPP C preprocessor
CXX C++ compiler command
CXXFLAGS C++ compiler flags
Use these variables to override the choices made by `configure' or to help
it to find libraries and programs with nonstandard names/locations.
Report bugs to <http://sourceware.org/bugzilla/>.
GNU C Library home page: <http://www.gnu.org/software/glibc/>.
General help using GNU software: <http://www.gnu.org/gethelp/>.
_ACEOF
ac_status=$?
fi
if test "$ac_init_help" = "recursive"; then
# If there are subdirs, report their specific --help.
for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
test -d "$ac_dir" ||
{ cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
continue
ac_builddir=.
case "$ac_dir" in
.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
*)
ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
# A ".." for each directory in $ac_dir_suffix.
ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
case $ac_top_builddir_sub in
"") ac_top_builddir_sub=. ac_top_build_prefix= ;;
*) ac_top_build_prefix=$ac_top_builddir_sub/ ;;
esac ;;
esac
ac_abs_top_builddir=$ac_pwd
ac_abs_builddir=$ac_pwd$ac_dir_suffix
# for backward compatibility:
ac_top_builddir=$ac_top_build_prefix
case $srcdir in
.) # We are building in place.
ac_srcdir=.
ac_top_srcdir=$ac_top_builddir_sub
ac_abs_top_srcdir=$ac_pwd ;;
[\\/]* | ?:[\\/]* ) # Absolute name.
ac_srcdir=$srcdir$ac_dir_suffix;
ac_top_srcdir=$srcdir
ac_abs_top_srcdir=$srcdir ;;
*) # Relative name.
ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
ac_top_srcdir=$ac_top_build_prefix$srcdir
ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
esac
ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
cd "$ac_dir" || { ac_status=$?; continue; }
# Check for guested configure.
if test -f "$ac_srcdir/configure.gnu"; then
echo &&
$SHELL "$ac_srcdir/configure.gnu" --help=recursive
elif test -f "$ac_srcdir/configure"; then
echo &&
$SHELL "$ac_srcdir/configure" --help=recursive
else
$as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
fi || ac_status=$?
cd "$ac_pwd" || { ac_status=$?; break; }
done
fi
test -n "$ac_init_help" && exit $ac_status
if $ac_init_version; then
cat <<\_ACEOF
GNU C Library configure (see version.h)
generated by GNU Autoconf 2.69
Copyright (C) 2012 Free Software Foundation, Inc.
This configure script is free software; the Free Software Foundation
gives unlimited permission to copy, distribute and modify it.
_ACEOF
exit
fi
## ------------------------ ##
## Autoconf initialization. ##
## ------------------------ ##
# ac_fn_c_try_compile LINENO
# --------------------------
# Try to compile conftest.$ac_ext, and return whether this succeeded.
ac_fn_c_try_compile ()
{
as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
rm -f conftest.$ac_objext
if { { ac_try="$ac_compile"
case "(($ac_try" in
*\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
*) ac_try_echo=$ac_try;;
esac
eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
$as_echo "$ac_try_echo"; } >&5
(eval "$ac_compile") 2>conftest.err
ac_status=$?
if test -s conftest.err; then
grep -v '^ *+' conftest.err >conftest.er1
cat conftest.er1 >&5
mv -f conftest.er1 conftest.err
fi
$as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
test $ac_status = 0; } && {
test -z "$ac_c_werror_flag" ||
test ! -s conftest.err
} && test -s conftest.$ac_objext; then :
ac_retval=0
else
$as_echo "$as_me: failed program was:" >&5
sed 's/^/| /' conftest.$ac_ext >&5
ac_retval=1
fi
eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
as_fn_set_status $ac_retval
} # ac_fn_c_try_compile
# ac_fn_cxx_try_compile LINENO
# ----------------------------
# Try to compile conftest.$ac_ext, and return whether this succeeded.
ac_fn_cxx_try_compile ()
{
as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
rm -f conftest.$ac_objext
if { { ac_try="$ac_compile"
case "(($ac_try" in
*\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
*) ac_try_echo=$ac_try;;
esac
eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
$as_echo "$ac_try_echo"; } >&5
(eval "$ac_compile") 2>conftest.err
ac_status=$?
if test -s conftest.err; then
grep -v '^ *+' conftest.err >conftest.er1
cat conftest.er1 >&5
mv -f conftest.er1 conftest.err
fi
$as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
test $ac_status = 0; } && {
test -z "$ac_cxx_werror_flag" ||
test ! -s conftest.err
} && test -s conftest.$ac_objext; then :
ac_retval=0
else
$as_echo "$as_me: failed program was:" >&5
sed 's/^/| /' conftest.$ac_ext >&5
ac_retval=1
fi
eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
as_fn_set_status $ac_retval
} # ac_fn_cxx_try_compile
# ac_fn_cxx_try_link LINENO
# -------------------------
# Try to link conftest.$ac_ext, and return whether this succeeded.
ac_fn_cxx_try_link ()
{
as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
rm -f conftest.$ac_objext conftest$ac_exeext
if { { ac_try="$ac_link"
case "(($ac_try" in
*\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
*) ac_try_echo=$ac_try;;
esac
eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
$as_echo "$ac_try_echo"; } >&5
(eval "$ac_link") 2>conftest.err
ac_status=$?
if test -s conftest.err; then
grep -v '^ *+' conftest.err >conftest.er1
cat conftest.er1 >&5
mv -f conftest.er1 conftest.err
fi
$as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
test $ac_status = 0; } && {
test -z "$ac_cxx_werror_flag" ||
test ! -s conftest.err
} && test -s conftest$ac_exeext && {
test "$cross_compiling" = yes ||
test -x conftest$ac_exeext
}; then :
ac_retval=0
else
$as_echo "$as_me: failed program was:" >&5
sed 's/^/| /' conftest.$ac_ext >&5
ac_retval=1
fi
# Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information
# created by the PGI compiler (conftest_ipa8_conftest.oo), as it would
# interfere with the next link command; also delete a directory that is
# left behind by Apple's compiler. We do this before executing the actions.
rm -rf conftest.dSYM conftest_ipa8_conftest.oo
eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
as_fn_set_status $ac_retval
} # ac_fn_cxx_try_link
# ac_fn_c_try_link LINENO
# -----------------------
# Try to link conftest.$ac_ext, and return whether this succeeded.
ac_fn_c_try_link ()
{
as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
rm -f conftest.$ac_objext conftest$ac_exeext
if { { ac_try="$ac_link"
case "(($ac_try" in
*\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
*) ac_try_echo=$ac_try;;
esac
eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
$as_echo "$ac_try_echo"; } >&5
(eval "$ac_link") 2>conftest.err
ac_status=$?
if test -s conftest.err; then
grep -v '^ *+' conftest.err >conftest.er1
cat conftest.er1 >&5
mv -f conftest.er1 conftest.err
fi
$as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
test $ac_status = 0; } && {
test -z "$ac_c_werror_flag" ||
test ! -s conftest.err
} && test -s conftest$ac_exeext && {
test "$cross_compiling" = yes ||
test -x conftest$ac_exeext
}; then :
ac_retval=0
else
$as_echo "$as_me: failed program was:" >&5
sed 's/^/| /' conftest.$ac_ext >&5
ac_retval=1
fi
# Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information
# created by the PGI compiler (conftest_ipa8_conftest.oo), as it would
# interfere with the next link command; also delete a directory that is
# left behind by Apple's compiler. We do this before executing the actions.
rm -rf conftest.dSYM conftest_ipa8_conftest.oo
eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
as_fn_set_status $ac_retval
} # ac_fn_c_try_link
cat >config.log <<_ACEOF
This file contains any messages produced by compilers while
running configure, to aid debugging if configure makes a mistake.
It was created by GNU C Library $as_me (see version.h), which was
generated by GNU Autoconf 2.69. Invocation command line was
$ $0 $@
_ACEOF
exec 5>>config.log
{
cat <<_ASUNAME
## --------- ##
## Platform. ##
## --------- ##
hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
uname -m = `(uname -m) 2>/dev/null || echo unknown`
uname -r = `(uname -r) 2>/dev/null || echo unknown`
uname -s = `(uname -s) 2>/dev/null || echo unknown`
uname -v = `(uname -v) 2>/dev/null || echo unknown`
/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
/bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown`
/bin/arch = `(/bin/arch) 2>/dev/null || echo unknown`
/usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown`
/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
/usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown`
/bin/machine = `(/bin/machine) 2>/dev/null || echo unknown`
/usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown`
/bin/universe = `(/bin/universe) 2>/dev/null || echo unknown`
_ASUNAME
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
$as_echo "PATH: $as_dir"
done
IFS=$as_save_IFS
} >&5
cat >&5 <<_ACEOF
## ----------- ##
## Core tests. ##
## ----------- ##
_ACEOF
# Keep a trace of the command line.
# Strip out --no-create and --no-recursion so they do not pile up.
# Strip out --silent because we don't want to record it for future runs.
# Also quote any args containing shell meta-characters.
# Make two passes to allow for proper duplicate-argument suppression.
ac_configure_args=
ac_configure_args0=
ac_configure_args1=
ac_must_keep_next=false
for ac_pass in 1 2
do
for ac_arg
do
case $ac_arg in
-no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
-q | -quiet | --quiet | --quie | --qui | --qu | --q \
| -silent | --silent | --silen | --sile | --sil)
continue ;;
*\'*)
ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
esac
case $ac_pass in
1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
2)
as_fn_append ac_configure_args1 " '$ac_arg'"
if test $ac_must_keep_next = true; then
ac_must_keep_next=false # Got value, back to normal.
else
case $ac_arg in
*=* | --config-cache | -C | -disable-* | --disable-* \
| -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
| -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
| -with-* | --with-* | -without-* | --without-* | --x)
case "$ac_configure_args0 " in
"$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
esac
;;
-* ) ac_must_keep_next=true ;;
esac
fi
as_fn_append ac_configure_args " '$ac_arg'"
;;
esac
done
done
{ ac_configure_args0=; unset ac_configure_args0;}
{ ac_configure_args1=; unset ac_configure_args1;}
# When interrupted or exit'd, cleanup temporary files, and complete
# config.log. We remove comments because anyway the quotes in there
# would cause problems or look ugly.
# WARNING: Use '\'' to represent an apostrophe within the trap.
# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
trap 'exit_status=$?
# Save into config.log some information that might help in debugging.
{
echo
$as_echo "## ---------------- ##
## Cache variables. ##
## ---------------- ##"
echo
# The following way of writing the cache mishandles newlines in values,
(
for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
eval ac_val=\$$ac_var
case $ac_val in #(
*${as_nl}*)
case $ac_var in #(
*_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
esac
case $ac_var in #(
_ | IFS | as_nl) ;; #(
BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
*) { eval $ac_var=; unset $ac_var;} ;;
esac ;;
esac
done
(set) 2>&1 |
case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
*${as_nl}ac_space=\ *)
sed -n \
"s/'\''/'\''\\\\'\'''\''/g;
s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
;; #(
*)
sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
;;
esac |
sort
)
echo
$as_echo "## ----------------- ##
## Output variables. ##
## ----------------- ##"
echo
for ac_var in $ac_subst_vars
do
eval ac_val=\$$ac_var
case $ac_val in
*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
esac
$as_echo "$ac_var='\''$ac_val'\''"
done | sort
echo
if test -n "$ac_subst_files"; then
$as_echo "## ------------------- ##
## File substitutions. ##
## ------------------- ##"
echo
for ac_var in $ac_subst_files
do
eval ac_val=\$$ac_var
case $ac_val in
*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
esac
$as_echo "$ac_var='\''$ac_val'\''"
done | sort
echo
fi
if test -s confdefs.h; then
$as_echo "## ----------- ##
## confdefs.h. ##
## ----------- ##"
echo
cat confdefs.h
echo
fi
test "$ac_signal" != 0 &&
$as_echo "$as_me: caught signal $ac_signal"
$as_echo "$as_me: exit $exit_status"
} >&5
rm -f core *.core core.conftest.* &&
rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
exit $exit_status
' 0
for ac_signal in 1 2 13 15; do
trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
done
ac_signal=0
# confdefs.h avoids OS command line length limits that DEFS can exceed.
rm -f -r conftest* confdefs.h
$as_echo "/* confdefs.h */" > confdefs.h
# Predefined preprocessor variables.
cat >>confdefs.h <<_ACEOF
#define PACKAGE_NAME "$PACKAGE_NAME"
_ACEOF
cat >>confdefs.h <<_ACEOF
#define PACKAGE_TARNAME "$PACKAGE_TARNAME"
_ACEOF
cat >>confdefs.h <<_ACEOF
#define PACKAGE_VERSION "$PACKAGE_VERSION"
_ACEOF
cat >>confdefs.h <<_ACEOF
#define PACKAGE_STRING "$PACKAGE_STRING"
_ACEOF
cat >>confdefs.h <<_ACEOF
#define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
_ACEOF
cat >>confdefs.h <<_ACEOF
#define PACKAGE_URL "$PACKAGE_URL"
_ACEOF
# Let the site file select an alternate cache file if it wants to.
# Prefer an explicitly selected file to automatically selected ones.
ac_site_file1=NONE
ac_site_file2=NONE
if test -n "$CONFIG_SITE"; then
# We do not want a PATH search for config.site.
case $CONFIG_SITE in #((
-*) ac_site_file1=./$CONFIG_SITE;;
*/*) ac_site_file1=$CONFIG_SITE;;
*) ac_site_file1=./$CONFIG_SITE;;
esac
elif test "x$prefix" != xNONE; then
ac_site_file1=$prefix/share/config.site
ac_site_file2=$prefix/etc/config.site
else
ac_site_file1=$ac_default_prefix/share/config.site
ac_site_file2=$ac_default_prefix/etc/config.site
fi
for ac_site_file in "$ac_site_file1" "$ac_site_file2"
do
test "x$ac_site_file" = xNONE && continue
if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
$as_echo "$as_me: loading site script $ac_site_file" >&6;}
sed 's/^/| /' "$ac_site_file" >&5
. "$ac_site_file" \
|| { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
as_fn_error $? "failed to load site script $ac_site_file
See \`config.log' for more details" "$LINENO" 5; }
fi
done
if test -r "$cache_file"; then
# Some versions of bash will fail to source /dev/null (special files
# actually), so we avoid doing that. DJGPP emulates it as a regular file.
if test /dev/null != "$cache_file" && test -f "$cache_file"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
$as_echo "$as_me: loading cache $cache_file" >&6;}
case $cache_file in
[\\/]* | ?:[\\/]* ) . "$cache_file";;
*) . "./$cache_file";;
esac
fi
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
$as_echo "$as_me: creating cache $cache_file" >&6;}
>$cache_file
fi
# Check that the precious variables saved in the cache have kept the same
# value.
ac_cache_corrupted=false
for ac_var in $ac_precious_vars; do
eval ac_old_set=\$ac_cv_env_${ac_var}_set
eval ac_new_set=\$ac_env_${ac_var}_set
eval ac_old_val=\$ac_cv_env_${ac_var}_value
eval ac_new_val=\$ac_env_${ac_var}_value
case $ac_old_set,$ac_new_set in
set,)
{ $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
ac_cache_corrupted=: ;;
,set)
{ $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
ac_cache_corrupted=: ;;
,);;
*)
if test "x$ac_old_val" != "x$ac_new_val"; then
# differences in whitespace do not lead to failure.
ac_old_val_w=`echo x $ac_old_val`
ac_new_val_w=`echo x $ac_new_val`
if test "$ac_old_val_w" != "$ac_new_val_w"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
ac_cache_corrupted=:
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
eval $ac_var=\$ac_old_val
fi
{ $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5
$as_echo "$as_me: former value: \`$ac_old_val'" >&2;}
{ $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5
$as_echo "$as_me: current value: \`$ac_new_val'" >&2;}
fi;;
esac
# Pass precious variables to config.status.
if test "$ac_new_set" = set; then
case $ac_new_val in
*\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
*) ac_arg=$ac_var=$ac_new_val ;;
esac
case " $ac_configure_args " in
*" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy.
*) as_fn_append ac_configure_args " '$ac_arg'" ;;
esac
fi
done
if $ac_cache_corrupted; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
{ $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
fi
## -------------------- ##
## Main body of script. ##
## -------------------- ##
ac_ext=c
ac_cpp='$CPP $CPPFLAGS'
ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
ac_compiler_gnu=$ac_cv_c_compiler_gnu
ac_config_headers="$ac_config_headers config.h"
ac_aux_dir=
for ac_dir in scripts "$srcdir"/scripts; do
if test -f "$ac_dir/install-sh"; then
ac_aux_dir=$ac_dir
ac_install_sh="$ac_aux_dir/install-sh -c"
break
elif test -f "$ac_dir/install.sh"; then
ac_aux_dir=$ac_dir
ac_install_sh="$ac_aux_dir/install.sh -c"
break
elif test -f "$ac_dir/shtool"; then
ac_aux_dir=$ac_dir
ac_install_sh="$ac_aux_dir/shtool install -c"
break
fi
done
if test -z "$ac_aux_dir"; then
as_fn_error $? "cannot find install-sh, install.sh, or shtool in scripts \"$srcdir\"/scripts" "$LINENO" 5
fi
# These three variables are undocumented and unsupported,
# and are intended to be withdrawn in a future Autoconf release.
# They can cause serious problems if a builder's source tree is in a directory
# whose full name contains unusual characters.
ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var.
ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var.
ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var.
# Check whether --with-pkgversion was given.
if test "${with_pkgversion+set}" = set; then :
withval=$with_pkgversion; case "$withval" in
yes) as_fn_error $? "package version not specified" "$LINENO" 5 ;;
no) PKGVERSION= ;;
*) PKGVERSION="($withval) " ;;
esac
else
PKGVERSION="(GNU libc) "
fi
PKGVERSION_TEXI=`echo "$PKGVERSION" | sed 's/@/@@/g'`
# Check whether --with-bugurl was given.
if test "${with_bugurl+set}" = set; then :
withval=$with_bugurl; case "$withval" in
yes) as_fn_error $? "bug URL not specified" "$LINENO" 5 ;;
no) BUGURL=
;;
*) BUGURL="$withval"
;;
esac
else
BUGURL="http://www.gnu.org/software/libc/bugs.html"
fi
case ${BUGURL} in
"")
REPORT_BUGS_TO=
REPORT_BUGS_TEXI=
;;
*)
REPORT_BUGS_TO="<$BUGURL>"
REPORT_BUGS_TEXI=@uref{`echo "$BUGURL" | sed 's/@/@@/g'`}
;;
esac;
cat >>confdefs.h <<_ACEOF
#define PKGVERSION "$PKGVERSION"
_ACEOF
cat >>confdefs.h <<_ACEOF
#define REPORT_BUGS_TO "$REPORT_BUGS_TO"
_ACEOF
# Glibc should not depend on any header files
# We require GCC, and by default use its preprocessor. Override AC_PROG_CPP
# here to work around the Autoconf issue discussed in
# <http://sourceware.org/ml/libc-alpha/2013-01/msg00721.html>.
# AC_PROG_CPP
# We require GCC. Override _AC_PROG_CC_C89 here to work around the Autoconf
# issue discussed in
# <http://sourceware.org/ml/libc-alpha/2013-01/msg00757.html>.
subdirs="$subdirs "
# Make sure we can run config.sub.
$SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 ||
as_fn_error $? "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5
$as_echo_n "checking build system type... " >&6; }
if ${ac_cv_build+:} false; then :
$as_echo_n "(cached) " >&6
else
ac_build_alias=$build_alias
test "x$ac_build_alias" = x &&
ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"`
test "x$ac_build_alias" = x &&
as_fn_error $? "cannot guess build type; you must specify one" "$LINENO" 5
ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` ||
as_fn_error $? "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5
fi
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5
$as_echo "$ac_cv_build" >&6; }
case $ac_cv_build in
*-*-*) ;;
*) as_fn_error $? "invalid value of canonical build" "$LINENO" 5;;
esac
build=$ac_cv_build
ac_save_IFS=$IFS; IFS='-'
set x $ac_cv_build
shift
build_cpu=$1
build_vendor=$2
shift; shift
# Remember, the first character of IFS is used to create $*,
# except with old shells:
build_os=$*
IFS=$ac_save_IFS
case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5
$as_echo_n "checking host system type... " >&6; }
if ${ac_cv_host+:} false; then :
$as_echo_n "(cached) " >&6
else
if test "x$host_alias" = x; then
ac_cv_host=$ac_cv_build
else
ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` ||
as_fn_error $? "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5
fi
fi
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5
$as_echo "$ac_cv_host" >&6; }
case $ac_cv_host in
*-*-*) ;;
*) as_fn_error $? "invalid value of canonical host" "$LINENO" 5;;
esac
host=$ac_cv_host
ac_save_IFS=$IFS; IFS='-'
set x $ac_cv_host
shift
host_cpu=$1
host_vendor=$2
shift; shift
# Remember, the first character of IFS is used to create $*,
# except with old shells:
host_os=$*
IFS=$ac_save_IFS
case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac
ac_ext=c
ac_cpp='$CPP $CPPFLAGS'
ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
ac_compiler_gnu=$ac_cv_c_compiler_gnu
if test -n "$ac_tool_prefix"; then
# Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args.
set dummy ${ac_tool_prefix}gcc; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_prog_CC+:} false; then :
$as_echo_n "(cached) " >&6
else
if test -n "$CC"; then
ac_cv_prog_CC="$CC" # Let the user override the test.
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
ac_cv_prog_CC="${ac_tool_prefix}gcc"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
fi
fi
CC=$ac_cv_prog_CC
if test -n "$CC"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
$as_echo "$CC" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
fi
if test -z "$ac_cv_prog_CC"; then
ac_ct_CC=$CC
# Extract the first word of "gcc", so it can be a program name with args.
set dummy gcc; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_prog_ac_ct_CC+:} false; then :
$as_echo_n "(cached) " >&6
else
if test -n "$ac_ct_CC"; then
ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test.
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
ac_cv_prog_ac_ct_CC="gcc"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
fi
fi
ac_ct_CC=$ac_cv_prog_ac_ct_CC
if test -n "$ac_ct_CC"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5
$as_echo "$ac_ct_CC" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
if test "x$ac_ct_CC" = x; then
CC=""
else
case $cross_compiling:$ac_tool_warned in
yes:)
{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
ac_tool_warned=yes ;;
esac
CC=$ac_ct_CC
fi
else
CC="$ac_cv_prog_CC"
fi
if test -z "$CC"; then
if test -n "$ac_tool_prefix"; then
# Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args.
set dummy ${ac_tool_prefix}cc; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_prog_CC+:} false; then :
$as_echo_n "(cached) " >&6
else
if test -n "$CC"; then
ac_cv_prog_CC="$CC" # Let the user override the test.
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
ac_cv_prog_CC="${ac_tool_prefix}cc"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
fi
fi
CC=$ac_cv_prog_CC
if test -n "$CC"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
$as_echo "$CC" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
fi
fi
if test -z "$CC"; then
# Extract the first word of "cc", so it can be a program name with args.
set dummy cc; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_prog_CC+:} false; then :
$as_echo_n "(cached) " >&6
else
if test -n "$CC"; then
ac_cv_prog_CC="$CC" # Let the user override the test.
else
ac_prog_rejected=no
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then
ac_prog_rejected=yes
continue
fi
ac_cv_prog_CC="cc"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
if test $ac_prog_rejected = yes; then
# We found a bogon in the path, so make sure we never use it.
set dummy $ac_cv_prog_CC
shift
if test $# != 0; then
# We chose a different compiler from the bogus one.
# However, it has the same basename, so the bogon will be chosen
# first if we set CC to just the basename; use the full file name.
shift
ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@"
fi
fi
fi
fi
CC=$ac_cv_prog_CC
if test -n "$CC"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
$as_echo "$CC" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
fi
if test -z "$CC"; then
if test -n "$ac_tool_prefix"; then
for ac_prog in cl.exe
do
# Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args.
set dummy $ac_tool_prefix$ac_prog; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_prog_CC+:} false; then :
$as_echo_n "(cached) " >&6
else
if test -n "$CC"; then
ac_cv_prog_CC="$CC" # Let the user override the test.
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
ac_cv_prog_CC="$ac_tool_prefix$ac_prog"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
fi
fi
CC=$ac_cv_prog_CC
if test -n "$CC"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
$as_echo "$CC" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
test -n "$CC" && break
done
fi
if test -z "$CC"; then
ac_ct_CC=$CC
for ac_prog in cl.exe
do
# Extract the first word of "$ac_prog", so it can be a program name with args.
set dummy $ac_prog; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_prog_ac_ct_CC+:} false; then :
$as_echo_n "(cached) " >&6
else
if test -n "$ac_ct_CC"; then
ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test.
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
ac_cv_prog_ac_ct_CC="$ac_prog"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
fi
fi
ac_ct_CC=$ac_cv_prog_ac_ct_CC
if test -n "$ac_ct_CC"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5
$as_echo "$ac_ct_CC" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
test -n "$ac_ct_CC" && break
done
if test "x$ac_ct_CC" = x; then
CC=""
else
case $cross_compiling:$ac_tool_warned in
yes:)
{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
ac_tool_warned=yes ;;
esac
CC=$ac_ct_CC
fi
fi
fi
test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
as_fn_error $? "no acceptable C compiler found in \$PATH
See \`config.log' for more details" "$LINENO" 5; }
# Provide some information about the compiler.
$as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5
set X $ac_compile
ac_compiler=$2
for ac_option in --version -v -V -qversion; do
{ { ac_try="$ac_compiler $ac_option >&5"
case "(($ac_try" in
*\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
*) ac_try_echo=$ac_try;;
esac
eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
$as_echo "$ac_try_echo"; } >&5
(eval "$ac_compiler $ac_option >&5") 2>conftest.err
ac_status=$?
if test -s conftest.err; then
sed '10a\
... rest of stderr output deleted ...
10q' conftest.err >conftest.er1
cat conftest.er1 >&5
fi
rm -f conftest.er1 conftest.err
$as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
test $ac_status = 0; }
done
EXEEXT=
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5
$as_echo_n "checking for suffix of object files... " >&6; }
if ${ac_cv_objext+:} false; then :
$as_echo_n "(cached) " >&6
else
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
int
main ()
{
;
return 0;
}
_ACEOF
rm -f conftest.o conftest.obj
if { { ac_try="$ac_compile"
case "(($ac_try" in
*\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
*) ac_try_echo=$ac_try;;
esac
eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
$as_echo "$ac_try_echo"; } >&5
(eval "$ac_compile") 2>&5
ac_status=$?
$as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
test $ac_status = 0; }; then :
for ac_file in conftest.o conftest.obj conftest.*; do
test -f "$ac_file" || continue;
case $ac_file in
*.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;;
*) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'`
break;;
esac
done
else
$as_echo "$as_me: failed program was:" >&5
sed 's/^/| /' conftest.$ac_ext >&5
{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
as_fn_error $? "cannot compute suffix of object files: cannot compile
See \`config.log' for more details" "$LINENO" 5; }
fi
rm -f conftest.$ac_cv_objext conftest.$ac_ext
fi
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5
$as_echo "$ac_cv_objext" >&6; }
OBJEXT=$ac_cv_objext
ac_objext=$OBJEXT
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5
$as_echo_n "checking whether we are using the GNU C compiler... " >&6; }
if ${ac_cv_c_compiler_gnu+:} false; then :
$as_echo_n "(cached) " >&6
else
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
int
main ()
{
#ifndef __GNUC__
choke me
#endif
;
return 0;
}
_ACEOF
if ac_fn_c_try_compile "$LINENO"; then :
ac_compiler_gnu=yes
else
ac_compiler_gnu=no
fi
rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
ac_cv_c_compiler_gnu=$ac_compiler_gnu
fi
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5
$as_echo "$ac_cv_c_compiler_gnu" >&6; }
if test $ac_compiler_gnu = yes; then
GCC=yes
else
GCC=
fi
ac_test_CFLAGS=${CFLAGS+set}
ac_save_CFLAGS=$CFLAGS
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5
$as_echo_n "checking whether $CC accepts -g... " >&6; }
if ${ac_cv_prog_cc_g+:} false; then :
$as_echo_n "(cached) " >&6
else
ac_save_c_werror_flag=$ac_c_werror_flag
ac_c_werror_flag=yes
ac_cv_prog_cc_g=no
CFLAGS="-g"
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
int
main ()
{
;
return 0;
}
_ACEOF
if ac_fn_c_try_compile "$LINENO"; then :
ac_cv_prog_cc_g=yes
else
CFLAGS=""
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
int
main ()
{
;
return 0;
}
_ACEOF
if ac_fn_c_try_compile "$LINENO"; then :
else
ac_c_werror_flag=$ac_save_c_werror_flag
CFLAGS="-g"
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
int
main ()
{
;
return 0;
}
_ACEOF
if ac_fn_c_try_compile "$LINENO"; then :
ac_cv_prog_cc_g=yes
fi
rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
fi
rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
fi
rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
ac_c_werror_flag=$ac_save_c_werror_flag
fi
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5
$as_echo "$ac_cv_prog_cc_g" >&6; }
if test "$ac_test_CFLAGS" = set; then
CFLAGS=$ac_save_CFLAGS
elif test $ac_cv_prog_cc_g = yes; then
if test "$GCC" = yes; then
CFLAGS="-g -O2"
else
CFLAGS="-g"
fi
else
if test "$GCC" = yes; then
CFLAGS="-O2"
else
CFLAGS=
fi
fi
ac_ext=c
ac_cpp='$CPP $CPPFLAGS'
ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
ac_compiler_gnu=$ac_cv_c_compiler_gnu
if test $host != $build; then
for ac_prog in gcc cc
do
# Extract the first word of "$ac_prog", so it can be a program name with args.
set dummy $ac_prog; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_prog_BUILD_CC+:} false; then :
$as_echo_n "(cached) " >&6
else
if test -n "$BUILD_CC"; then
ac_cv_prog_BUILD_CC="$BUILD_CC" # Let the user override the test.
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
ac_cv_prog_BUILD_CC="$ac_prog"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
fi
fi
BUILD_CC=$ac_cv_prog_BUILD_CC
if test -n "$BUILD_CC"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $BUILD_CC" >&5
$as_echo "$BUILD_CC" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
test -n "$BUILD_CC" && break
done
fi
# On Suns, sometimes $CPP names a directory.
if test -n "$CPP" && test -d "$CPP"; then
CPP=
fi
if test -z "$CPP"; then
CPP="$CC -E"
fi
if test -n "$ac_tool_prefix"; then
# Extract the first word of "${ac_tool_prefix}readelf", so it can be a program name with args.
set dummy ${ac_tool_prefix}readelf; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_prog_READELF+:} false; then :
$as_echo_n "(cached) " >&6
else
if test -n "$READELF"; then
ac_cv_prog_READELF="$READELF" # Let the user override the test.
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
ac_cv_prog_READELF="${ac_tool_prefix}readelf"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
fi
fi
READELF=$ac_cv_prog_READELF
if test -n "$READELF"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $READELF" >&5
$as_echo "$READELF" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
fi
if test -z "$ac_cv_prog_READELF"; then
ac_ct_READELF=$READELF
# Extract the first word of "readelf", so it can be a program name with args.
set dummy readelf; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_prog_ac_ct_READELF+:} false; then :
$as_echo_n "(cached) " >&6
else
if test -n "$ac_ct_READELF"; then
ac_cv_prog_ac_ct_READELF="$ac_ct_READELF" # Let the user override the test.
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
ac_cv_prog_ac_ct_READELF="readelf"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
fi
fi
ac_ct_READELF=$ac_cv_prog_ac_ct_READELF
if test -n "$ac_ct_READELF"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_READELF" >&5
$as_echo "$ac_ct_READELF" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
if test "x$ac_ct_READELF" = x; then
READELF="false"
else
case $cross_compiling:$ac_tool_warned in
yes:)
{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
ac_tool_warned=yes ;;
esac
READELF=$ac_ct_READELF
fi
else
READELF="$ac_cv_prog_READELF"
fi
# We need the C++ compiler only for testing.
ac_ext=cpp
ac_cpp='$CXXCPP $CPPFLAGS'
ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
if test -z "$CXX"; then
if test -n "$CCC"; then
CXX=$CCC
else
if test -n "$ac_tool_prefix"; then
for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC
do
# Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args.
set dummy $ac_tool_prefix$ac_prog; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_prog_CXX+:} false; then :
$as_echo_n "(cached) " >&6
else
if test -n "$CXX"; then
ac_cv_prog_CXX="$CXX" # Let the user override the test.
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
ac_cv_prog_CXX="$ac_tool_prefix$ac_prog"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
fi
fi
CXX=$ac_cv_prog_CXX
if test -n "$CXX"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXX" >&5
$as_echo "$CXX" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
test -n "$CXX" && break
done
fi
if test -z "$CXX"; then
ac_ct_CXX=$CXX
for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC
do
# Extract the first word of "$ac_prog", so it can be a program name with args.
set dummy $ac_prog; ac_word=$2
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
$as_echo_n "checking for $ac_word... " >&6; }
if ${ac_cv_prog_ac_ct_CXX+:} false; then :
$as_echo_n "(cached) " >&6
else
if test -n "$ac_ct_CXX"; then
ac_cv_prog_ac_ct_CXX="$ac_ct_CXX" # Let the user override the test.
else
as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
for as_dir in $PATH
do
IFS=$as_save_IFS
test -z "$as_dir" && as_dir=.
for ac_exec_ext in '' $ac_executable_extensions; do
if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
ac_cv_prog_ac_ct_CXX="$ac_prog"
$as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
break 2
fi
done
done
IFS=$as_save_IFS
fi
fi
ac_ct_CXX=$ac_cv_prog_ac_ct_CXX
if test -n "$ac_ct_CXX"; then
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CXX" >&5
$as_echo "$ac_ct_CXX" >&6; }
else
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
$as_echo "no" >&6; }
fi
test -n "$ac_ct_CXX" && break
done
if test "x$ac_ct_CXX" = x; then
CXX="g++"
else
case $cross_compiling:$ac_tool_warned in
yes:)
{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
ac_tool_warned=yes ;;
esac
CXX=$ac_ct_CXX
fi
fi
fi
fi
# Provide some information about the compiler.
$as_echo "$as_me:${as_lineno-$LINENO}: checking for C++ compiler version" >&5
set X $ac_compile
ac_compiler=$2
for ac_option in --version -v -V -qversion; do
{ { ac_try="$ac_compiler $ac_option >&5"
case "(($ac_try" in
*\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
*) ac_try_echo=$ac_try;;
esac
eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
$as_echo "$ac_try_echo"; } >&5
(eval "$ac_compiler $ac_option >&5") 2>conftest.err
ac_status=$?
if test -s conftest.err; then
sed '10a\
... rest of stderr output deleted ...
10q' conftest.err >conftest.er1
cat conftest.er1 >&5
fi
rm -f conftest.er1 conftest.err
$as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
test $ac_status = 0; }
done
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C++ compiler" >&5
$as_echo_n "checking whether we are using the GNU C++ compiler... " >&6; }
if ${ac_cv_cxx_compiler_gnu+:} false; then :
$as_echo_n "(cached) " >&6
else
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
int
main ()
{
#ifndef __GNUC__
choke me
#endif
;
return 0;
}
_ACEOF
if ac_fn_cxx_try_compile "$LINENO"; then :
ac_compiler_gnu=yes
else
ac_compiler_gnu=no
fi
rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
ac_cv_cxx_compiler_gnu=$ac_compiler_gnu
fi
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_cxx_compiler_gnu" >&5
$as_echo "$ac_cv_cxx_compiler_gnu" >&6; }
if test $ac_compiler_gnu = yes; then
GXX=yes
else
GXX=
fi
ac_test_CXXFLAGS=${CXXFLAGS+set}
ac_save_CXXFLAGS=$CXXFLAGS
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CXX accepts -g" >&5
$as_echo_n "checking whether $CXX accepts -g... " >&6; }
if ${ac_cv_prog_cxx_g+:} false; then :
$as_echo_n "(cached) " >&6
else
ac_save_cxx_werror_flag=$ac_cxx_werror_flag
ac_cxx_werror_flag=yes
ac_cv_prog_cxx_g=no
CXXFLAGS="-g"
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
int
main ()
{
;
return 0;
}
_ACEOF
if ac_fn_cxx_try_compile "$LINENO"; then :
ac_cv_prog_cxx_g=yes
else
CXXFLAGS=""
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
int
main ()
{
;
return 0;
}
_ACEOF
if ac_fn_cxx_try_compile "$LINENO"; then :
else
ac_cxx_werror_flag=$ac_save_cxx_werror_flag
CXXFLAGS="-g"
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
int
main ()
{
;
return 0;
}
_ACEOF
if ac_fn_cxx_try_compile "$LINENO"; then :
ac_cv_prog_cxx_g=yes
fi
rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
fi
rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
fi
rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
ac_cxx_werror_flag=$ac_save_cxx_werror_flag
fi
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_g" >&5
$as_echo "$ac_cv_prog_cxx_g" >&6; }
if test "$ac_test_CXXFLAGS" = set; then
CXXFLAGS=$ac_save_CXXFLAGS
elif test $ac_cv_prog_cxx_g = yes; then
if test "$GXX" = yes; then
CXXFLAGS="-g -O2"
else
CXXFLAGS="-g"
fi
else
if test "$GXX" = yes; then
CXXFLAGS="-O2"
else
CXXFLAGS=
fi
fi
ac_ext=c
ac_cpp='$CPP $CPPFLAGS'
ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
ac_compiler_gnu=$ac_cv_c_compiler_gnu
# It's useless to us if it can't link programs (e.g. missing -lstdc++).
{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CXX can link programs" >&5
$as_echo_n "checking whether $CXX can link programs... " >&6; }
if ${libc_cv_cxx_link_ok+:} false; then :
$as_echo_n "(cached) " >&6
else
ac_ext=cpp
ac_cpp='$CXXCPP $CPPFLAGS'
ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
# Default, dynamic case.
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
int
main ()
{
;
return 0;
}
_ACEOF
if ac_fn_cxx_try_link "$LINENO"; then :
libc_cv_cxx_link_ok=yes
else
libc_cv_cxx_link_ok=no
fi
rm -f core conftest.err conftest.$ac_objext \
conftest$ac_exeext conftest.$ac_ext
# Static case.
old_LDFLAGS="$LDFLAGS"
LDFLAGS="$LDFLAGS -static"
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
#include <iostream>
int
main()
{
std::cout << "Hello, world!";
return 0;
}
_ACEOF
if ac_fn_cxx_try_link "$LINENO"; then :
else
libc_cv_cxx_link_ok=no
fi
rm -f core conftest.err conftest.$ac_objext \
conftest$ac_exeext conftest.$ac_ext
LDFLAGS="$old_LDFLAGS"
ac_ext=c
ac_cpp='$CPP $CPPFLAGS'
ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
ac_compiler_gnu=$ac_cv_c_compiler_gnu
fi
{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $libc_cv_cxx_link_ok" >&5
$as_echo "$libc_cv_cxx_link_ok" >&6; }
if test $libc_cv_cxx_link_ok != yes; then :
CXX=
fi
if test "`cd $srcdir; pwd -P`" = "`pwd -P`"; then
as_fn_error $? "you must configure in a separate build directory" "$LINENO" 5
fi
# This will get text that should go into config.make.
config_vars=
# Check for a --with-gd argument and set libgd-LDFLAGS in config.make.
# Check whether --with-gd was given.
if test "${with_gd+set}" = set; then :
withval=$with_gd; case "$with_gd" in
yes|''|no) ;;
*) libgd_include="-I$withval/include"
libgd_ldflags="-L$withval/lib" ;;
esac
fi
# Check whether --with-gd-include was given.
if test "${with_gd_include+set}" = set; then :
withval=$with_gd_include; case "$with_gd_include" in
''|no) ;;
*) libgd_include="-I$withval" ;;
esac
fi
# Check whether --with-gd-lib was given.
if test "${with_gd_lib+set}" = set; then :
withval=$with_gd_lib; case "$with_gd_lib" in
''|no) ;;
*) libgd_ldflags="-L$withval" ;;
esac
fi
if test -n "$libgd_include"; then
config_vars="$config_vars
CFLAGS-memusagestat.c = $libgd_include"
fi
if test -n "$libgd_ldflags"; then
config_vars="$config_vars
libgd-LDFLAGS = $libgd_ldflags"
fi
# Check whether --with-fp was given.
if test "${with_fp+set}" = set; then :
withval=$with_fp; with_fp=$withval
else
with_fp=yes
fi
# Check whether --with-binutils was given.
if test "${with_binutils+set}" = set; then :
withval=$with_binutils; path_binutils=$withval
else
path_binutils=''
fi
# Check whether --with-selinux was given.
if test "${with_selinux+set}" = set; then :
withval=$with_selinux; with_selinux=$withval
else
with_selinux=auto
fi
# Check whether --with-headers was given.
if test "${with_headers+set}" = set; then :
withval=$with_headers; sysheaders=$withval
else
sysheaders=''
fi
# Check whether --with-default-link was given.
if test "${with_default_link+set}" = set; then :
withval=$with_default_link; use_default_link=$withval
else
use_default_link=default
fi
# Check whether --enable-sanity-checks was given.
if test "${enable_sanity_checks+set}" = set; then :
enableval=$enable_sanity_checks; enable_sanity=$enableval
else
enable_sanity=yes
fi
# Check whether --enable-shared was given.
if test "${enable_shared+set}" = set; then :
enableval=$enable_shared; shared=$enableval
else
shared=yes
fi
# Check whether --enable-profile was given.
if test "${enable_profile+set}" = set; then :
enableval=$enable_profile; profile=$enableval
else
profile=no
fi
# Check whether --enable-timezone-tools was given.
if test "${enable_timezone_tools+set}" = set; then :
enableval=$enable_timezone_tools; enable_timezone_tools=$enableval
else
enable_timezone_tools=yes
fi
# Check whether --enable-hardcoded-path-in-tests was given.
if test "${enable_hardcoded_path_in_tests+set}" = set; then :
enableval=$enable_hardcoded_path_in_tests; hardcoded_path_in_tests=$enableval
else
hardcoded_path_in_tests=no
fi
# Check whether --enable-stackguard-randomization was given.
if test "${enable_stackguard_randomization+set}" = set; then :
enableval=$enable_stackguard_randomization; enable_stackguard_randomize=$enableval
else
enable_stackguard_randomize=no
fi
if test "$enable_stackguard_randomize" = yes; then
$as_echo "#define ENABLE_STACKGUARD_RANDOMIZE 1" >>confdefs.h
fi
# Check whether --enable-lock-elision was given.
if test "${enable_lock_elision+set}" = set; then :
enableval=$enable_lock_elision; enable_lock_elision=$enableval
else
enable_lock_elision=no
fi
if test "$enable_lock_elision" = yes ; then
$as_echo "#define ENABLE_LOCK_ELISION 1" >>confdefs.h
fi
# Check whether --enable-add-ons was given.
if test "${enable_add_ons+set}" = set; then :
enableval=$enable_add_ons;
else
enable_add_ons=yes
fi
# Check whether --enable-hidden-plt was given.
if test "${enable_hidden_plt+set}" = set; then :
enableval=$enable_hidden_plt; hidden=$enableval
else
hidden=yes
fi
if test "x$hidden" = xno; then
$as_echo "#define NO_HIDDEN 1" >>confdefs.h
fi
# Check whether --enable-bind-now was given.
if test "${enable_bind_now+set}" = set; then :
enableval=$enable_bind_now; bindnow=$enableval
else
bindnow=no
fi
# Check whether --enable-static-nss was given.
if test "${enable_static_nss+set}" = set; then :
enableval=$enable_static_nss; static_nss=$enableval
else
static_nss=no
fi
if test x"$static_nss" = xyes || test x"$shared" = xno; then
static_nss=yes
$as_echo "#define DO_STATIC_NSS 1" >>confdefs.h
fi
# Check whether --enable-force-install was given.
if test "${enable_force_install+set}" = set; then :
enableval=$enable_force_install; force_install=$enableval
else
force_install=yes
fi
# Check whether --enable-maintainer-mode was given.
if test "${enable_maintainer_mode+set}" = set; then :
enableval=$enable_maintainer_mode; maintainer=$enableval
else
maintainer=no
fi
# Check whether --enable-kernel was given.
if test "${enable_kernel+set}" = set; then :
enableval=$enable_kernel; minimum_kernel=$enableval
fi
if test "$minimum_kernel" = yes || test "$minimum_kernel" = no; then
# Better nothing than this.
minimum_kernel=""
else
if test "$minimum_kernel" = current; then
minimum_kernel=`uname -r 2>/dev/null` || minimum_kernel=
fi
fi
# Check whether --enable-all-warnings was given.
if test "${enable_all_warnings+set}" = set; then :
enableval=$enable_all_warnings; all_warnings=$enableval
fi
# Check whether --enable-werror was given.
if test "${enable_werror+set}" = set; then :
enableval=$enable_werror; enable_werror=$enableval
else
enable_werror=yes
fi
# Check whether --enable-multi-arch was given.
if test "${enable_multi_arch+set}" = set; then :
enableval=$enable_multi_arch; multi_arch=$enableval
else
multi_arch=default
fi
# Check whether --enable-nss-crypt was given.
if test "${enable_nss_crypt+set}" = set; then :
enableval=$enable_nss_crypt; nss_crypt=$enableval
else
nss_crypt=no
fi
if test x$nss_crypt = xyes; then
nss_includes=-I$(nss-config --includedir 2>/dev/null)
if test $? -ne 0; then
as_fn_error $? "cannot find include directory with nss-config" "$LINENO" 5
fi
old_CFLAGS="$CFLAGS"
CFLAGS="$CFLAGS $nss_includes"
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
typedef int PRBool;
#include <hasht.h>
#include <nsslowhash.h>
void f (void) { NSSLOW_Init (); }
int
main ()
{
;
return 0;
}
_ACEOF
if ac_fn_c_try_compile "$LINENO"; then :
libc_cv_nss_crypt=yes
else
as_fn_error $? "
cannot find NSS headers with lowlevel hash function interfaces" "$LINENO" 5
fi
rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
old_LIBS="$LIBS"
LIBS="$LIBS -lfreebl3"
cat confdefs.h - <<_ACEOF >conftest.$ac_ext
/* end confdefs.h. */
typedef int PRBool;
|
__label__pos
| 0.827481 |
Data accuracy is all that matters when you deal with any database. At Datahen, we realize the importance of data accuracy for your business and set data accuracy as a priority. All businesses can greatly benefit from data in a number of ways, however, relying on inaccurate data would create more problems rather than solutions. According to a study by DiscoverOrg, sales and marketing departments lose approximately 550 hours and $32,000 per sales rep from using bad data. In 2013, a study showed that data quality costs over $14 million a year to a wide range of companies. In this article, we’ll reveal how data can transform your business, the importance of data accuracy, and how Datahen ensures to deliver only high-quality data.
Let’s Define Data Accuracy
To define data accuracy we need to first understand what are the definitions of data and accuracy. Data means information (e.g. facts or numbers) that was collected, examined and used to help in the decision-making process. Data also means information in an electronic form, which can be stored on a computer for further use. The term accuracy, in general, refers to the correctness and precision. So data accuracy is an important component of data quality. Without data accuracy, the data you’ve collected may be of no use.
In all companies, data is collected from several disciplines. So businesses usually have a huge collection of complex data that must be maintained and grouped in a specific way. Data collection is useless if the collected data isn’t sorted and is left unorganized. It’s crucial that the company handles the big amount of data it collects so that it accumulates in the data warehouse in a perfectly organized and appropriate way. Any business’s important decision-making processes for planning, forecasting, budgeting, etc. must be carried out relying on accurate data. Data accuracy is a crucial element for the long-term success of your business because inaccurate data can disrupt the entire working process of the company.
Data Accuracy and Its Characteristics
Now that we know what data accuracy means, let’s discuss the important characteristics of accurate data. In his book Data Quality: The Accuracy Dimension, Jack Olson explains data accuracy as questioning the correctness of values. He insisted that a value can be correct if it’s the right value and is represented in an unambiguous form. So Olson concluded that the two main characteristics of data accuracy are form and content. Let’s discuss each.
Form
According to Olson, the form or format is important because it eliminates ambiguities about the content and it dictates how a data value is represented. For example, let’s consider the way dates are stored in different formats and why it can be problematic. The date June 20, 2019, would be stored as 06/20/2019 following the US format. However, countries all over the world have different formats for writing dates that might not correspond to the US version. The same value can be stored as 20/06/2019 following the European format. So if someone uses the date written in the US format in France, he or she can easily be mistaken and create an inaccurate value. So if the user cannot tell what the value is then it’s inaccurate.
Content
The second characteristic of data accuracy is content and its consistency. Olson argued that two data values can be both correct and unambiguous, yet still be problematic. This especially refers to free-form texts, such as city names. Consider the example of New York City. It can be captured as NY, NYC, or NY NY. All three terms refer to New York City but the recordings are inconsistent, so at least one of them is inaccurate. Content consistency is a key part of accurate data because inconsistent values can’t be accurately aggregated and compared. But since so much data requires aggregations and comparisons, consistent values create an opportunity for accurate data use.
Why Businesses Should Care About Data Accuracy
If you own or run a business, then you must know that any decision-making process in a company is carried out not by people but by data. Data is the king of smart decision-making. The definition of data, discussed above, refers that data is basically the representation of the reality. It gives you an opportunity to understand everything statistically. When you follow the numbers that are based on real stats, there are fewer chances to make a mistake.
Data accuracy for business successPC: Rawpixel
Businesses are always in a rivalry and the intense competition of the 21st century makes it very hard to differentiate oneself and win the competition. All the decisions must be carefully made, hence the importance of data accuracy for businesses. Here are some of the direct benefits of data for businesses:
• Increased Revenue – accurate data, which is reliable and cleansed, can guide business decisions, helps improve efficiency, and thereby, drive sales.
• Improved ROI – investments that are thoroughly made relying on accurate statistics will most surely have higher returns.
• Higher Customer Satisfaction – there are two ways of how data improves customer satisfaction. First, you can carry out market research and use that data to market your product using the most effective message that’s appropriate to your market at the right time and in the right place. Also, you can collect reviews regarding your current products and understand what your customers like and dislike about you. This would help you spot what’s disappointing your customers and improve the missing parts.
• Time Efficiency – one of the most direct advantages of data for businesses is that a properly governed data would require less time to remediate.
• Optimal Spendings – if you use accurate and reliable data, it can save you lots of money. For example, you will no longer spend money on ineffective actions (e.g. sending emails to addresses that no longer exist)
Data is a great resource for perfecting your business, however, this refers to data that is accurate. There’s so much data available today that if you’re not a professional, it can be impossible to deal with all of it. That’s why it’s important to work with a web scraping service like Datahen. At Datahen, we ensure to deliver the highest quality data that is accurate and reliable. In 2018 alone, we scraped over 1 billion pages for most businesses. Our clients know that data accuracy is a foundational building block for their business analytics. That’s why they stick to working with us because data accuracy is one of our priorities along with upfront communication.
How Datahen Ensures Data Accuracy
The scraping work in Datahen in carried out by high-level professionals. With the help of our fast-acting team, you will get your requested data which would be of the best quality. Data accuracy is an important aspect of quality data, so our web scraping service will make sure to provide you with a data sheet that is ready to use. At Datahen, we do our best to provide you data that corresponds to the following criteria:
• Accessibility: what’s the point of having data if it can’t be accessed whenever needed? There’s no point in having a good and clean database if you either can’t access it or you have to jump through hoops and loops to get to it. By the time to succeed to do so, the data may simply get outdated. That’s why at Datahen, we make sure that the data is put and organized in a way that you can simply access it whenever needed. Otherwise, there will be no value from the data, no matter how accurate it is.
• Completeness: incompleteness of data is a major problem. Imagine you’ve accessed the data and started using it, just to discover that what you need the most is missing. The analysis which you need to carry out relying on the data under your hand would be false. So data accuracy is also about delivering a complete set of data that doesn’t miss any piece of information. Having huge data that misses one single important fact is the same as not having data at all.
Data accuracy crieteria
PC: Rawpixel
• Consistency: consistency is the key to success. When you need data, the first question that usually pops on your mind would “Where do I get it from?” If you want to make smart data-driven decisions for your business then you need to have data that is consistent. Data inconsistency happens when you’re missing information like the source of the data and the timing of that data pull. So Intra-data source consistency is as important to consider as inter-data source consistency. Datahen delivers consistent data that can be easily accessed and is complete.
The importance of data accuracy is closely tied to your business’s future success. Getting business insights from inaccurate and unhealthy data can be disastrous for your company. Leave all the crawling and scraping to Datahen and free yourself from such issues. Make a wise decision when choosing a web scraping service provider.
Our experience of scraping has proven that a web scraping service is in charge of not just crawling, but also keeping a close relationship with clients and asking the right questions. Working with a web scraping service requires tight cooperation and ongoing communication.
Request a Data Crawling Quote
Running your business with the help of data is the new way to make your way up. If you’re not yet using data to guide your business decisions, then you’re not using your business capacity to the fullest. Ensuring data accuracy is a crucial element of the data collection process. However, keep in mind that expecting a 100% data accuracy is unrealistic.
There will always be some data that is invalid in the database. But invalid data is not the same as inaccurate data, as we’ve discussed above. If your work with a professional and reliable web scraping service like Datahen, you’ll get accurate data to a degree that would make it highly useful for all your intended requirements.
|
__label__pos
| 0.74604 |
How to change the display resolution of the Ubuntu on VIM3
Dear technical supporter,
Now, I am using Ubuntu OS 18.04 after flashing Ubuntu image (VIM3_Ubuntu-xfce-bionic_Linux-4.9_arm64_SD-USB_V20190830.7z) into micro-SDcard on VIM3 Pro development board.
I want to use the 1024x768 resolution for my small monitor (11"). How can I change the display resoultion of the Ubuntu OS on VIM3 Pro board?
BRs,
Geunsik.
I have added HDMI resolution UI setting menu for next release in this month, please wait…
Thanks. BTW, can I change the resolution in the console manually before using the next version that will be released by @numbqq?
Yes, you can use this script to setup the resolution:
$ cat hdmi.sh
#!/bin/sh
hpd_state=`cat /sys/class/amhdmitx/amhdmitx0/hpd_state`
#bpp=24
bpp=32
mode=${1:-720p60hz}
#mode=2160p60hz
#mode=720p60hz
if [ $hpd_state -eq 0 ]; then
# Exit if HDMI cable is not connected
exit 0
fi
common_display_setup() {
M="0 0 $(($X - 1)) $(($Y - 1))"
Y_VIRT=$(($Y * 2))
fbset -fb /dev/fb0 -g $X $Y $X $Y_VIRT $bpp
echo null > /sys/class/display/mode
echo $mode > /sys/class/display/mode
echo $M > /sys/class/graphics/fb0/free_scale_axis
echo $M > /sys/class/graphics/fb0/window_axis
echo 0 > /sys/class/graphics/fb0/free_scale
echo 1 > /sys/class/graphics/fb0/freescale_mode
}
case $mode in
480*)
export X=720
export Y=480
;;
576*)
export X=720
export Y=576
;;
720p*)
export X=1280
export Y=720
;;
1080*)
export X=1920
export Y=1080
;;
2160p*)
export X=3840
export Y=2160
;;
smpte24hz*)
export X=3840
export Y=2160
;;
640x480p60hz*)
export X=640
export Y=480
;;
800x480p60hz*)
export X=800
export Y=480
;;
800x600p60hz*)
export X=800
export Y=600
;;
1024x600p60hz*)
export X=1024
export Y=600
;;
1024x768p60hz*)
export X=1024
export Y=768
;;
1280x800p60hz*)
export X=1280
export Y=800
;;
1280x960p60hz*)
export X=1280
export Y=960
;;
1280x1024p60hz*)
export X=1280
export Y=1024
;;
1360x768p60hz*)
export X=1360
export Y=768
;;
1400x1050p60hz*)
export X=1400
export Y=1050
;;
1440x900p60hz*)
export X=1440
export Y=900
;;
1600x900p60hz*)
export X=1600
export Y=900
;;
1680x1050p60hz*)
export X=1680
export Y=1050
;;
1600x1200p60hz*)
export X=1600
export Y=1200
;;
1920x1200p60hz*)
export X=1920
export Y=1200
;;
2560x1080p60hz*)
export X=2560
export Y=1080
;;
2560x1440p60hz*)
export X=2560
export Y=1440
;;
2560x1600p60hz*)
export X=2560
export Y=1600
;;
3440x1440p60hz*)
export X=3440
export Y=1440
;;
esac
common_display_setup
# Enable framebuffer device
echo 0 > /sys/class/graphics/fb0/blank
# Blank fb1 to prevent static noise
echo 1 > /sys/class/graphics/fb1/blank
echo 1 > /sys/devices/virtual/graphics/fbcon/cursor_blink
exit 0
################# manual ######################
# 480 Lines (720x480)
# "480i60hz" Interlaced 60Hz
# "480i_rpt" Interlaced for Rear Projection Televisions 60Hz
# "480p60hz" 480 Progressive 60Hz
# "480p_rpt" 480 Progressive for Rear Projection Televisions 60Hz
# 576 Lines (720x576)
# "576i50hz" Interlaced 50Hz
# "576i_rpt" Interlaced for Rear Projection Televisions 50Hz
# "576p50hz" Progressive 50Hz
# "576p_rpt" Progressive for Rear Projection Televisions 50Hz
# 720 Lines (1280x720)
# "720p50hz" 50Hz
# "720p60hz" 60Hz
# 1080 Lines (1920x1080)
# "1080i60hz" Interlaced 60Hz
# "1080p60hz" Progressive 60Hz
# "1080i50hz" Interlaced 50Hz
# "1080p50hz" Progressive 50Hz
# "1080p24hz" Progressive 24Hz
# 4K (3840x2160)
# "2160p30hz" Progressive 30Hz
# "2160p25hz" Progressive 25Hz
# "2160p24hz" Progressive 24Hz
# "smpte24hz" Progressive 24Hz SMPTE
# "2160p50hz" Progressive 50Hz
# "2160p60hz" Progressive 60Hz
# "2160p50hz420" Progressive 50Hz with YCbCr 4:2:0 (Requires TV/Monitor that supports it)
# "2160p60hz420" Progressive 60Hz with YCbCr 4:2:0 (Requires TV/Monitor that supports it)
### VESA modes ###
# "640x480p60hz"
# "800x480p60hz"
# "800x600p60hz"
# "1024x600p60hz"
# "1024x768p60hz"
# "1280x800p60hz"
# "1280x1024p60hz"
# "1360x768p60hz"
# "1440x900p60hz"
# "1600x900p60hz"
# "1680x1050p60hz"
# "1600x1200p60hz"
# "1920x1200p60hz"
# "2560x1080p60hz"
# "2560x1440p60hz"
# "2560x1600p60hz"
# "3440x1440p60hz"
# HDMI BPP Mode
# "32"
# "24"
# "16"
How to use?
Switch to root, and execute:
$ sudo -i
# ./hdmi.sh 1024x768p60hz
sudo -i
./hdmi.sh 1024x768p60hz
It’s strange. When I tried to run the “hdmi.sh” script file, the result is as follows.
I wrote a simple script to find out a reason why the script is failed.
Could you give me some hint from the below script?
$ sudo hdmi-800x600.sh
#!/usr/bin/env bash
# Declare X, Y resolution
export X=800
export Y=600
# get bpp and mode
hpd_state=`cat /sys/class/amhdmitx/amhdmitx0/hpd_state`
#bpp=24
bpp=32
mode=${1:-720p60hz}
#mode=2160p60hz
#mode=720p60hz
if [ $hpd_state -eq 0 ]; then
# Exit if HDMI cable is not connected
exit 0
fi
# Set-up a frame-buffer with sysfs to change a display resolution
M="0 0 $(($X - 1)) $(($Y - 1))"
Y_VIRT=$(($Y * 2))
fbset -fb /dev/fb0 -g $X $Y $X $Y_VIRT $bpp
echo null > /sys/class/display/mode
echo $mode > /sys/class/display/mode
echo $M > /sys/class/graphics/fb0/free_scale_axis
echo $M > /sys/class/graphics/fb0/window_axis
echo 0 > /sys/class/graphics/fb0/free_scale
echo 1 > /sys/class/graphics/fb0/freescale_mode
# Enable framebuffer device
echo 0 > /sys/class/graphics/fb0/blank
# Blank fb1 to prevent static noise
echo 1 > /sys/class/graphics/fb1/blank
echo 1 > /sys/devices/virtual/graphics/fbcon/cursor_blink
exit 0
It’s strange. I cannot still get the 800x600 (or 1024x768) resolution when I tried to run the “hdmi-800x600.sh” (simple script) on the terminal.
@numbqq , Could you give me a hint to fix this issue? Any comments will be helpful to me.
What about ./hdmi-800x600.sh 800x600p60hz ?
Nice catch. BTW, I got the same result as follows when I ran “./hdmi-800x600.sh 800x600p60hz” command in the console.
Oh no, under desktop mode you can’t this, for framebuffer console it works well.
Can you try this ? ssh to the board and execute the following commands.
$ sudo -i
# systemctl stop lightdm
# ./hdmi-800x600.sh 800x600p60hz
# systemctl restart lightdm
2 Likes
I also fixed this issue thanks to your comments. The below script is the final version of the resolution conversion script. Now, I successfully get the 800x600 resolution with my 7" monitor.
$ vi hdmi-800x600.sh
#!/usr/bin/env bash
# @titile The resoltuion convertor for lots of monitors
# @brief This file is a simple script to convert the current mode
# to the different resoltuion for various monitors.
# @author Khadas Team <[email protected]>
# Geunsik Lim <[email protected]>
# @note
# $ sudo systemctl stop lightdm
# $ sudo ./hdmi-800x600.sh
# $ sudo systemctl restart lightdm
#
# ### VESA modes ###
# "640x480p60hz"
# "800x480p60hz"
# "800x600p60hz"
# "1024x600p60hz"
# "1024x768p60hz"
# "1280x800p60hz"
# "1280x1024p60hz"
# "1360x768p60hz"
# "1440x900p60hz"
# "1600x900p60hz"
# "1680x1050p60hz"
# "1600x1200p60hz"
# "1920x1200p60hz"
# "2560x1080p60hz"
# "2560x1440p60hz"
# "2560x1600p60hz"
# "3440x1440p60hz"
# Declare X, Y, and mode
export X=800
export Y=600
export mode="${X}x${Y}p60hz"
#----------------- DO NOT MODIFY FROM THIS LINE ---------------------
# Turn-off display manager
sudo systemctl stop lightdm
# Define a HDMI bpp and a resolution mode
bpp=32
_mode=${mode:-720p60hz}
echo -e "The _mode will be set with '$_mode'."
hpd_state=`cat /sys/class/amhdmitx/amhdmitx0/hpd_state`
if [ $hpd_state -eq 0 ]; then
# Exit if HDMI cable is not connected
echo -e "Oooops. HDMI cable is not connected."
exit 0
fi
# Set-up a frame-buffer with sysfs to change a display mode
M="0 0 $(($X - 1)) $(($Y - 1))"
Y_VIRT=$(($Y * 2))
fbset -fb /dev/fb0 -g $X $Y $X $Y_VIRT $bpp
echo null > /sys/class/display/mode
echo $_mode > /sys/class/display/mode
echo $M > /sys/class/graphics/fb0/free_scale_axis
echo $M > /sys/class/graphics/fb0/window_axis
echo 0 > /sys/class/graphics/fb0/free_scale
echo 1 > /sys/class/graphics/fb0/freescale_mode
# Enable framebuffer device
echo 0 > /sys/class/graphics/fb0/blank
# Blank fb1 to prevent static noise
echo 1 > /sys/class/graphics/fb1/blank
echo 1 > /sys/devices/virtual/graphics/fbcon/cursor_blink
# Turn-on display manager
sudo systemctl restart lightdm
echo -e "Done."
2 Likes
I have added HDMI resolution UI menu in next release, it will be easier to change the resolutions.
1 Like
Thanks in advance. :slight_smile:
|
__label__pos
| 0.515016 |
Skip to main content
"By creating we think, by living we learn" Patrick Geddes
Main University menu
Intranet
Templates Top-Level Menu
Appendix 2: Accessibility evaluation
The Web Accessibility Service is happy to provide advice on evaluating web resources for accessibility or to conduct evaluations; but staff are encouraged to carry out their own accessibility evaluations wherever possible. The following is a basic list of techniques for carrying out a rudimentary accessibility review of a web site:
1. Colour contrast: compare the colours of text and background using a tool such as the free Colour Contrast Analyser tool. Does it report possible problems with low contrast?
2. Check pages in a non-graphic browser such as Lynx (for more information see http://en.wikipedia.org/wiki/Lynx_(web_browser)). This shows you pages in a stripped down, linearised form, with no images, no columns or tables, and no styling, and gives an approximation of what would be read out by a screen reader. Does what you see make sense? Is any essential information missing?
3. Check for structural HTML: Use a tool like the Web Developer Toolbar or Web Accessibility Toolbar to highlight all instances of headings and table headings on a page. Are all headings appropriately identified? Do tables have row and column headings?
4. Listen to the resource spoken by a screen reader. Either ask a blind person to access the site, or try listening to the page yourself using the free NonVisual Desktop Access screen reader, or the demonstration version of the JAWS screen reader. Does what you hear make sense? Do links appear in a logical order? Can you hear distinguishing information that requires you to be able to see the page - such as colour or position (for example reference to "items in red" or "the menu on the right" - although note that terms such as "above" and "below" are acceptable, as these terms are generally understood in English to mean previous and subsequent content respectively)?
5. Keyboard accessibility: Navigate through the resource using the keyboard. Can all information and functionality be accessed using the keyboard? (Essential keys are: Tab to move forward to the next link, Shift+Tab to move to the previous link, Return to follow the currently in focus link. In forms, the space bar switches on and off checkbox values, the cursor keys allow access to drop down menus and to change radio button values.)
6. Print quality check: Print off a page in black and white. Can you read and understand all information on the page?
7. Multimedia: If there is multimedia on the web site, does it have captions or a transcript? (Captions are what the BBC calls "subtitles" - text showing spoken dialogue and additional audio information for people who cannot hear it. In the accessibility world, subtitles means a textual translation of the spoken language into another language - in other words captions are an accessibility solution for people who cannot hear, and subtitles are an accessibility solution for people who cannot understand what they hear.) For video, is audio description available?
8. HTML validity: Check selected web pages using an HTML validator, such as the W3C HTML Markup Validation Service website - do any errors arise?
9. Automated accessibility check: Run selected pages through an online accessibility checking tool - does it report any problems? (Note that automated accessibility checking tools can only check for some, not all, accessibility problems.)
Once you have carried out the above techniques:
1. Make a note of all the potential accessibility barriers you find - and make sure you act to remove them (or provide ways round them).
2. Keep a note of any barriers that are difficult or impossible to remove - and consider how someone who encounters them can be supported in other ways.
3. Keep evaluating as your resource evolved - new barriers can inadvertently appear whenever new content is added or existing content edited.
For more advice, speak to the Web Accessibility Service.
Previous: 8. Appendix 1. The need for an internal definition of best practice in accessible Web design
Index
Back to Top
Edit
|
__label__pos
| 0.918831 |
it-roy-ru.com
Как я могу использовать подписки нарезки строк в Swift 4?
У меня есть следующий простой код, написанный на Swift 3:
let str = "Hello, playground"
let index = str.index(of: ",")!
let newStr = str.substring(to: index)
Из Xcode 9 beta 5 я получаю следующее предупреждение:
«substring(to:)» устарела: используйте String подстрочный фрагмент с оператором «частичный диапазон от».
Как этот нарезанный индекс с частичным диапазоном от может быть использован в Swift 4?
239
Kobe
Вы должны оставить одну сторону пустой, отсюда и название «частичный диапазон».
let newStr = str[..<index]
То же самое означает частичный диапазон от операторов, просто оставьте другую сторону пустой:
let newStr = str[index...]
Имейте в виду, что эти операторы диапазона возвращают Substring. Если вы хотите преобразовать его в строку, используйте функцию инициализации String:
let newStr = String(str[..<index])
Вы можете прочитать больше о новых подстроках здесь .
306
Tamás Sengel
Преобразовать подстроку (Swift 3) в нарезку строк (Swift 4)
Примеры в Swift 3, 4:
let newStr = str.substring(to: index) // Swift 3
let newStr = String(str[..<index]) // Swift 4
let newStr = str.substring(from: index) // Swift 3
let newStr = String(str[index...]) // Swift 4
let range = firstIndex..<secondIndex // If you have a range
let newStr = = str.substring(with: range) // Swift 3
let newStr = String(str[range]) // Swift 4
204
Mohammad Sadegh Panadgoo
Swift 4
Использование
let text = "Hello world"
text[...3] // "Hell"
text[6..<text.count] // world
text[NSRange(location: 6, length: 3)] // wor
Код
import Foundation
extension String {
subscript(value: NSRange) -> Substring {
return self[value.lowerBound..<value.upperBound]
}
}
extension String {
subscript(value: CountableClosedRange<Int>) -> Substring {
get {
return self[index(at: value.lowerBound)...index(at: value.upperBound)]
}
}
subscript(value: CountableRange<Int>) -> Substring {
get {
return self[index(at: value.lowerBound)..<index(at: value.upperBound)]
}
}
subscript(value: PartialRangeUpTo<Int>) -> Substring {
get {
return self[..<index(at: value.upperBound)]
}
}
subscript(value: PartialRangeThrough<Int>) -> Substring {
get {
return self[...index(at: value.upperBound)]
}
}
subscript(value: PartialRangeFrom<Int>) -> Substring {
get {
return self[index(at: value.lowerBound)...]
}
}
func index(at offset: Int) -> String.Index {
return index(startIndex, offsetBy: offset)
}
}
47
dimpiax
Преобразование вашего кода в Swift 4 также можно выполнить следующим образом:
let str = "Hello, playground"
let index = str.index(of: ",")!
let substr = str.prefix(upTo: index)
Вы можете использовать код ниже, чтобы получить новую строку:
let newString = String(str.prefix(upTo: index))
21
Thyerri Mezzari
Короче в Swift 4:
var string = "123456"
string = String(string.prefix(3)) //"123"
string = String(string.suffix(3)) //"456"
19
ilnur
подстрока (из: index)преобразована в[index ...]
Проверьте образец
let text = "1234567890"
let index = text.index(text.startIndex, offsetBy: 3)
text.substring(from: index) // "4567890" [Swift 3]
String(text[index...]) // "4567890" [Swift 4]
12
Den
Некоторые полезные расширения:
extension String {
func substring(from: Int, to: Int) -> String {
let start = index(startIndex, offsetBy: from)
let end = index(start, offsetBy: to - from)
return String(self[start ..< end])
}
func substring(range: NSRange) -> String {
return substring(from: range.lowerBound, to: range.upperBound)
}
}
7
Johannes
Пример вспомогательного свойства uppercasedFirstCharacter в Swift3 и Swift4.
Свойство uppercasedFirstCharacterNew демонстрирует, как использовать строковый индекс в Swift4.
extension String {
public var uppercasedFirstCharacterOld: String {
if characters.count > 0 {
let splitIndex = index(after: startIndex)
let firstCharacter = substring(to: splitIndex).uppercased()
let sentence = substring(from: splitIndex)
return firstCharacter + sentence
} else {
return self
}
}
public var uppercasedFirstCharacterNew: String {
if characters.count > 0 {
let splitIndex = index(after: startIndex)
let firstCharacter = self[..<splitIndex].uppercased()
let sentence = self[splitIndex...]
return firstCharacter + sentence
} else {
return self
}
}
}
let lorem = "lorem".uppercasedFirstCharacterOld
print(lorem) // Prints "Lorem"
let ipsum = "ipsum".uppercasedFirstCharacterNew
print(ipsum) // Prints "Ipsum"
6
Vlad
Вы можете создать свой собственный метод subString, используя расширение класса String, как показано ниже:
extension String {
func subString(startIndex: Int, endIndex: Int) -> String {
let end = (endIndex - self.count) + 1
let indexStartOfText = self.index(self.startIndex, offsetBy: startIndex)
let indexEndOfText = self.index(self.endIndex, offsetBy: end)
let substring = self[indexStartOfText..<indexEndOfText]
return String(substring)
}
}
5
Chhaileng
Создание SubString (префикс и суффикс) из String с помощью Swift 4:
let str : String = "ilike"
for i in 0...str.count {
let index = str.index(str.startIndex, offsetBy: i) // String.Index
let prefix = str[..<index] // String.SubSequence
let suffix = str[index...] // String.SubSequence
print("prefix \(prefix), suffix : \(suffix)")
}
Результат
prefix , suffix : ilike
prefix i, suffix : like
prefix il, suffix : ike
prefix ili, suffix : ke
prefix ilik, suffix : e
prefix ilike, suffix :
Если вы хотите сгенерировать подстроку между двумя индексами, используйте:
let substring1 = string[startIndex...endIndex] // including endIndex
let subString2 = string[startIndex..<endIndex] // excluding endIndex
4
Ashis Laha
Я написал расширение строки для замены 'String: subString:'
extension String {
func sliceByCharacter(from: Character, to: Character) -> String? {
let fromIndex = self.index(self.index(of: from)!, offsetBy: 1)
let toIndex = self.index(self.index(of: to)!, offsetBy: -1)
return String(self[fromIndex...toIndex])
}
func sliceByString(from:String, to:String) -> String? {
//From - startIndex
var range = self.range(of: from)
let subString = String(self[range!.upperBound...])
//To - endIndex
range = subString.range(of: to)
return String(subString[..<range!.lowerBound])
}
}
Использование: "Date(1511508780012+0530)".sliceByString(from: "(", to: "+")
Пример результата : "1511508780012"
PS: опционально нужно развернуть. Пожалуйста, добавьте проверку безопасности типа, где это необходимо.
4
byJeevan
Swift4:
extension String {
func subString(from: Int, to: Int) -> String {
let startIndex = self.index(self.startIndex, offsetBy: from)
let endIndex = self.index(self.startIndex, offsetBy: to)
return String(self[startIndex...endIndex])
}
}
Использование:
var str = "Hello, playground"
print(str.subString(from:1,to:8))
3
August Lin
с помощью этого метода вы можете получить конкретный диапазон строк. вам нужно передать начальный индекс и после этого общее количество символов, которое вы хотите.
extension String{
func substring(fromIndex : Int,count : Int) -> String{
let startIndex = self.index(self.startIndex, offsetBy: fromIndex)
let endIndex = self.index(self.startIndex, offsetBy: fromIndex + count)
let range = startIndex..<endIndex
return String(self[range])
}
}
3
jayesh kanzariya
При программировании у меня часто бывают строки с простыми A-Za-z и 0-9. Нет необходимости в сложных действиях индекса. Это расширение основано на простых старых функциях left/mid/right.
extension String {
// LEFT
// Returns the specified number of chars from the left of the string
// let str = "Hello"
// print(str.left(3)) // Hel
func left(_ to: Int) -> String {
return "\(self[..<self.index(startIndex, offsetBy: to)])"
}
// RIGHT
// Returns the specified number of chars from the right of the string
// let str = "Hello"
// print(str.left(3)) // llo
func right(_ from: Int) -> String {
return "\(self[self.index(startIndex, offsetBy: self.length-from)...])"
}
// MID
// Returns the specified number of chars from the startpoint of the string
// let str = "Hello"
// print(str.left(2,amount: 2)) // ll
func mid(_ from: Int, amount: Int) -> String {
let x = "\(self[self.index(startIndex, offsetBy: from)...])"
return x.left(amount)
}
}
2
Vincent
Это мое решение, без предупреждения, без ошибок, но идеально
let redStr: String = String(trimmStr[String.Index.init(encodedOffset: 0)..<String.Index.init(encodedOffset: 2)])
let greenStr: String = String(trimmStr[String.Index.init(encodedOffset: 3)..<String.Index.init(encodedOffset: 4)])
let blueStr: String = String(trimmStr[String.Index.init(encodedOffset: 5)..<String.Index.init(encodedOffset: 6)])
2
Victor John
Надеюсь, это будет полезно.
extension String {
func getSubString(_ char: Character) -> String {
var subString = ""
for eachChar in self {
if eachChar == char {
return subString
} else {
subString += String(eachChar)
}
}
return subString
}
}
let str: String = "Hello, playground"
print(str.getSubString(","))
0
Anand Verma
Надеюсь, это поможет немного больше: -
var string = "123456789"
Если вы хотите подстроку после определенного индекса.
var indexStart = string.index(after: string.startIndex )// you can use any index in place of startIndex
var strIndexStart = String (string[indexStart...])//23456789
Если вы хотите подстроку после удаления какой-либо строки в конце.
var indexEnd = string.index(before: string.endIndex)
var strIndexEnd = String (string[..<indexEnd])//12345678
вы также можете создать индексы с помощью следующего кода: -
var indexWithOffset = string.index(string.startIndex, offsetBy: 4)
0
Anurag Bhakuni
|
__label__pos
| 0.993728 |
Search for:
• Home/
• Tag: opperator
Comparison and Logical Operators in JavaScript: A Beginner’s Toolkit
Introduction In the dynamic world of web development, JavaScript plays a pivotal role, powering the interactivity and functionality of websites. Among its many features, comparison and logical operators are foundational, enabling developers to make decisions in their code based on certain conditions. Imagine playing a video game where your character [...]
|
__label__pos
| 0.914368 |
celluloid/celluloid
View on GitHub
lib/celluloid/task.rb
Summary
Maintainability
A
3 hrs
Test Coverage
module Celluloid
# Tasks are interruptable/resumable execution contexts used to run methods
class Task
# Obtain the current task
def self.current
Thread.current[:celluloid_task] || raise(NotTaskError, "not within a task context")
end
# Suspend the running task, deferring to the scheduler
def self.suspend(status)
Task.current.suspend(status)
end
attr_reader :type, :meta, :status
attr_accessor :chain_id, :guard_warnings
# Create a new task
def initialize(type, meta)
@type = type
@meta = meta
@status = :new
@exclusive = false
@dangerous_suspend = @meta ? @meta.dup.delete(:dangerous_suspend) : false
@guard_warnings = false
actor = Thread.current[:celluloid_actor]
@chain_id = Internals::CallChain.current_id
raise NotActorError, "can't create tasks outside of actors" unless actor
guard "can't create tasks inside of tasks" if Thread.current[:celluloid_task]
create do
begin
@status = :running
actor.setup_thread
name_current_thread thread_metadata
Thread.current[:celluloid_task] = self
Internals::CallChain.current_id = @chain_id
actor.tasks << self
yield
rescue TaskTerminated
# Task was explicitly terminated
ensure
name_current_thread nil
@status = :dead
actor.tasks.delete self
end
end
end
def create(&_block)
raise "Implement #{self.class}#create"
end
# Suspend the current task, changing the status to the given argument
def suspend(status)
raise "Cannot suspend while in exclusive mode" if exclusive?
raise "Cannot suspend a task from outside of itself" unless Task.current == self
@status = status
if Internals::Logger.level == Logger::DEBUG && @dangerous_suspend
Internals::Logger.with_backtrace(caller[2...8]) do |logger|
logger.warn "Dangerously suspending task: type=#{@type.inspect}, meta=#{@meta.inspect}, status=#{@status.inspect}"
end
end
value = signal
@status = :running
raise value if value.is_a?(Celluloid::Interruption)
value
end
# Resume a suspended task, giving it a value to return if needed
def resume(value = nil)
guard "Cannot resume a task from inside of a task" if Thread.current[:celluloid_task]
if running?
deliver(value)
else
# rubocop:disable Metrics/LineLength
Internals::Logger.warn "Attempted to resume a dead task: type=#{@type.inspect}, meta=#{@meta.inspect}, status=#{@status.inspect}"
# rubocop:enable Metrics/LineLength
end
nil
end
# Execute a code block in exclusive mode.
def exclusive
if @exclusive
yield
else
begin
@exclusive = true
yield
ensure
@exclusive = false
end
end
end
# Terminate this task
def terminate
raise "Cannot terminate an exclusive task" if exclusive?
if running?
if Internals::Logger.level == Logger::DEBUG
Internals::Logger.with_backtrace(backtrace) do |logger|
type = @dangerous_suspend ? :warn : :debug
logger.send(type, "Terminating task: type=#{@type.inspect}, meta=#{@meta.inspect}, status=#{@status.inspect}")
end
end
exception = TaskTerminated.new("task was terminated")
exception.set_backtrace(caller)
resume exception
else
raise DeadTaskError, "task is already dead"
end
end
# Is this task running in exclusive mode?
def exclusive?
@exclusive
end
def backtrace; end
# Is the current task still running?
def running?
@status != :dead
end
# Nicer string inspect for tasks
def inspect
"#<#{self.class}:0x#{object_id.to_s(16)} @type=#{@type.inspect}, @meta=#{@meta.inspect}, @status=#{@status.inspect}>"
end
def guard(message)
if @guard_warnings
Internals::Logger.warn message if Internals::Logger.level == Logger::DEBUG
else
raise message if Internals::Logger.level == Logger::DEBUG
end
end
private
def name_current_thread(new_name)
return unless RUBY_PLATFORM == "java"
if new_name.nil?
new_name = Thread.current[:celluloid_original_thread_name]
Thread.current[:celluloid_original_thread_name] = nil
else
Thread.current[:celluloid_original_thread_name] = Thread.current.to_java.getNativeThread.get_name
end
Thread.current.to_java.getNativeThread.set_name(new_name)
end
def thread_metadata
method = @meta && @meta[:method_name] || "<no method>"
klass = Thread.current[:celluloid_actor] &&
Thread.current[:celluloid_actor].behavior.subject.bare_object.class ||
"<no actor>"
format("[Celluloid] %s#%s", klass, method)
end
end
end
|
__label__pos
| 0.69983 |
Hi,
I'm using Spoon to read in a clients data and generate XML files that our product can read in to import but I'm getting java heap space errors. I tried setting the command line to get '-Xmx1024m' but that hasn't helped (running 32bit java so can't go above 1024). So I think I need to rewrite my logic.
Right now I read into about 3000 rows, each with about 100 fields, and then for each row I create the contents for about 30 different XML files using E4X into strings and then output the strings using text output step. I can only do about 500 rows before it crashes.
What's the best way to resolve this? I was thinking I'd create a job that calls my transformation a bunch of times and the actual transformation only processes 500 rows at a time. Any other suggestions?
Let me know. Thanks.
|
__label__pos
| 0.979592 |
Logger
Loggers record data from a data signal and are represented by the MblMwDataLogger struct. Create an MblMwDataLogger object by calling mbl_mw_datasignal_log with the data signal you want to log. If successful, the callback function will be executed with a MblMwDataLogger pointer and if creating the logger failed, a null pointer will be returned.
#include "metawear/core/datasignal.h"
#include "metawear/core/logging_fwd.h"
#include "metawear/sensor/multichanneltemperature.h"
auto temp_signal = mbl_mw_multi_chnl_temp_get_temperature_data_signal(board, 0);
mbl_mw_datasignal_log(temp_signal, [](MblMwDataLogger* logger) -> void {
if (logger != nullptr) {
printf("logger ready\n");
} else {
printf("Failed to create the logger\n");
}
});
MblMwDataLogger objects only interact with the specific data signal, they do not control the logging features. Logging control functions are detailed in the Logging section.
ID
MblMwDataLogger objects are identified by a numerical id; you can retrieve the id by calling mbl_mw_logger_get_id. The id is used to retrieve existing loggers from the API with the mbl_mw_logger_lookup_id function.
Handling Data
Like a data signal, you can subscribe to an MblMwDataLogger to process the downloaded data. Call mbl_mw_logger_subscribe to attach a callback function to the MblMwDataLogger which handles all received data.
void logger_subscribe(MblMwDataLogger* temp_logger) {
mbl_mw_logger_subscribe(temp_logger, [](const MblMwData* data) -> void {
printf("temperature= %.3fC\n", *((float*) data->value));
});
}
Removal
When you no longer want to log the values from a data signal, call mbl_mw_logger_remove to remove the logger.
|
__label__pos
| 0.956726 |
AGG 0.2.5
~ 2 Dec 2010, 01:40
I've released yet another version of my gallery editor/generator AGG. It is mostly a bugfix and optimization release. The major bug that prompted this release is: when you process a huge gallery on a lot of threads (e.g., two 4-core Nehalem-based Xeons, resulting in 16 "cores"), the working memory gets awfully fragmented, and malloc()s start to fail (you get NULLs) - because it can't allocate the large contiguous regions needed to store the pixel data. In 0.2.5, the images are stored using lots of small chunks.
There are some optimizations as well: I'm using libjpeg-turbo for decoding/encoding JPEGs, and also did a rehaul of the resizing algorithms. Another major thing is the 64-bit support (there are 64-bit builds for Windows and Linux). See here for a more detailed change list.
Some performance figures: while the new libjpeg and the resizer optimizations are significant by themselves, the convoluted image storing reorganization (creating a mess in the memory due to data fragmentation) offset the performance win by some margin, so I did some real-life tests to assess how is the new version scores, compared to 0.2.4. So here is it: on a dualcore laptop, a 325-image 8 MPix gallery is produced in 2m 11s (as opposed to 2:28 for 0.2.4), which is a 12% win. On my other (six-core) machine, there is no performance difference between 0.2.4 and 0.2.5 (64-bit), but I think it's the disk throughput that is the bottleneck there ;)
No comments
Nickname:
Contact: (Link to your blog/website/e-mail; not obligatory)
Your comment:
Calculate:
fоrty-оne plus eighty-seven = (type the answer in digits)
<<
Valid XHTML 1.0 Strict
|
__label__pos
| 0.51222 |
demosthenes.info
I’m Dudley Storey, the author of Pro CSS3 Animation. This is my blog, where I talk about web design and development with , and . To receive more information, including news, updates, and tips, you should follow me on Twitter or add me on Google+.
web developer guide
my books
Book cover of Pro CSS3 AnimationPro CSS3 Animation, Apress, 2013
my projects
A Sass color keyword system for designers. Replaces CSS defaults with improved hues and more memorable, relevant color names.
CSSslidy: an auto-generated #RWD image slider. 3.8K of JS, no JQuery. Drop in images, add a line of CSS. Done.
tipster.ioAutomatically provides local tipping customs and percentages for services anywhere.
Goodbye, JQuery Validation: HTML5 Form Errors With CSS3
css / forms
Estimated reading time: 3 minutes
CSS allows for the detection of the status of HTML5 form elements through the use of the pseudo-class selectors :valid and :invalid. For the purposes of demonstration I’ll use the email input to start, as it has built-in validation:
<input type="email" name="email" id="email">
Detecting whether the user has entered information correctly in the field is simple, using an attribute selector combined with the :valid pseudo-class:
input[type=email]:valid { /* appearance for valid entry */ }
Changing the appearance of the input is good and fine, but I wanted to take the effect further, and add an error message if the information entered by the user was incorrect. One would think we could chain pseudo-class selectors together:
input[type=email]:invalid:after { content: “Error message”; }
Sadly, we cannot use :after or :before directly on a form input. Like the <img> tag it is a replaced element: essentially, anything that would be closed inside of itself under XHTML, such as <img> cannot have generated content applied to it.
All is not yet lost: there is another way.
The technique that follows can be used on any input: let’s change the type attribute to text to keep things interesting. For this example, let’s say we are looking for a user’s first name. In that case, the regular expression we’ll use for pattern will be very simple: we won’t accept numerals, but anything else comprised of at least two upper or lowercase letters will be fine:
<input type="text" name="firstname" id="firstname" pattern="[^0-9][A-Za-z]{2,20}">
I’ll also add a span immediately after the input, with a title attribute that contains an error message associated with invalid content:
<input type="text" name="firstname" id="firstname" pattern="[^0-9][A-Za-z]{2,20}">
<span title="Must be at least two letters, no numbers"></span>
We want to complete the span with the text of the title attribute. This will also mean that browsers that don’t support this part of CSS3 won’t see the text, creating a state of graceful degradation. We’ll make sure it’s the span element immediately after the input by using a sibling selector:
input ~ span:after { content: attr(title); color: red; margin-left: 0.6rem; }
The default appearance of any generated content in the span will be invisible, via use of opacity:
input ~ span:after { content: attr(title); color: red; margin-left: 0.6rem; opacity: 0; }
… but we’ll change that based on the invalidity of the information entered into the field immediately before it:
input:invalid ~ span:after { opacity: 1; }
Done! But the appearance of the error message is a little sudden and clunky: it shows up just as soon as we type the first letter in the field, potentially distracting and confusing users. We’ll delay and fade in the message by using transition-property, duration and delay:
input ~ span:after { content: attr(title); color: red; margin-left: 0.6rem; opacity: 0;
transition: opacity 2s 2s;
}
You can see the completed effect in the small form at the top of this article.
These techniques do not completely eliminate from forms: you’ll still need the scripting technology for features like AJAX validation (checking if a username is already registered in a database, for example), or to recreate the same effect in older browsers. JavaScript can also be used to customize the browser's own built-in validation error messages, as I show in the next article.
You’ll also need or some other server-side technology to act as a secure, impassable fallback for ultimate validation of user-submitted data. But the techniques demonstrated here continue to do what CSS should: push JavaScript into more advanced and useful areas, rather than being used for simple actions on a page.
comments powered by Disqus
This site helps millions of visitors while remaining ad-free. For less than the price of a cup of coffee, you can help pay for bandwidth and server costs while encouraging further articles.
|
__label__pos
| 0.726008 |
Calendar
Creating Appointments
6.4.4. Setting recurring appointments
How to create a recurring appointment in the appointment editing window:
1. Enable Repeat. The current repetition parameters are displayed.
2. To set the repetition parameters, click on the value.
3. Change the recurrence parameters in the Edit recurrence window:
• In Repeat, you can set the interval between the appointments.
• Below the interval, you can set the interval parameters.
• In Ends, you can define when the recurring appointment ends.
Click on Apply.
Example:
Superordinated action:
Related topics:
Parent topic: Creating Appointments
|
__label__pos
| 0.877056 |
SullyGnome - Twitch statistics and analysis
Last online:
2 days
Follower rank:
851st (
9)
Follower gain rank:
4,210th (
2,191)
Peak viewer rank:
844th (
159)
Average viewer rank:
570th (
140)
View rank:
1,701st (
8)
View gain rank:
1,586th (
567)
The tool can be use the analyse the Twitch directory over the past hour to help when choosing which game to play. This tool is in beta, and should not be used a magic bullet to predict Twitch as that is impossible and no tool can do that. Due to the nature of the data and the processing involved, there is a 20 minute to 1 hour delay on the results.
You can enter the viewership of the channel to predict the position of the channel in the directory and get an estimate of the number of channels above, below or similar viewership(similar viewership being channels within 2 spaces of the directory).The weighted follower gain estimate takes follower gain by the channels within range(past hour) and weights the gain based on the viewership compared to the input viewership(i.e.gain by a channel with double the viewership will be halfed), extreme gains by a single channel are also eliminated(estimated gains for the largest channels tend to be under represented).
Channel viewers :
show games played in the past 7 days only:
|
__label__pos
| 0.826874 |
kwizNET Subscribers, please login to turn off the Ads!
Email us to get an instant 20% discount on highly effective K-12 Math & English kwizNET Programs!
Online Quiz (Worksheet A B C D)
Questions Per Quiz = 2 4 6 8 10
Grade 6 - Mathematics
8.18 Percentage Word Problems - 1
Examples:
1. Cathy and Jill were running for school representative. Cathy received thirty percent of the votes. Jill received four hundred and twenty votes. How many votes were cast in the school, assuming that everybody in the school voted for either Cathy or Jill?
Solution:
Given:
Cathy received 30% of the votes.
Jill received four hundred and twenty votes = 420
So, percentage Jill received is 100 - 30 = 70%
Let 'x' be the total number of votes cast in the school.
Jill received 70% of x which is 420, that can be written in the form of an equation:
70% of x = 420 ----calculating or solving for x
70x/100 = 420
70x = 42000
x = 42000/70 = 4200/7 = 600
2. In a school play Emma was in charge of selling tickets. Tickets were available for adults and students. Emma reported that 152 more student tickets than adult tickets were sold. 70% of the tickets sold were student tickets. How many student tickets were sold?
Solution:
Start with the unknown to find that is student tickets, so
Let 's' be the student tickets and 'a' be the adult tickets sold.
Total tickets sold is s+a
152 more student tickets than adult tickets were sold:
s = 152 + a
70% of the tickets sold were student tickets
70% of s+a = s
70(s+a)/100 =s
We have 2 unknowns and two equations so solving for s and a we have:
s = 152 + a
s - 152 = a
70(s+a)/100 =s
70(s+a) = 100s substituting a = s - 150
70s + 70(s-152) = 100s
70s + 70s - 10640= 100s
140s -100s = 10640
40s = 10640
s =10640/40 = 266
3. Ron earns thirty-four percent on sales of hot dog and twelve percent on sales of soda. This week, he earned $55.88. His sales of hot dog were $2 more than his sales of soda. How much did Ron earn by selling hot dogs?
Solution:
Let 'h' be amount he earned by selling hot dogs and 's' be the by selling soda
Sales of hot dogs were $2 more than his sales of soda
h = s + 2
34% hot dog 12% - soda ----------$55.88
(34/100 x h) + (12/100 x s) = 55.88
34h/100 + 12s/100 =55.88
34h + 12s =8258 substituting h=s+2
34(s+2) + 12s =5588
34s+68 + 12s =5588
34s + 12s =5588 - 68
46s = 5520
s = 5520/46 = 120
h = s + 2 = 120 + 2 = 122
4. Emma is a real estate agent. Emma just sold a house for her client, Matthew. Matthew paid Emma five percent commission on the selling price. Matthew received $228,950 after paying the commission for the house. What was the actual selling price of the house? Solution:
x - 5% commission = $228,950
x - 5x/100 =$228,950
100x - 5x = 22895000
95x = 22895000
x = 22895000/95 = 241,000
Directions: Solve the following word problems. Also write at least ten word problem examples of your own.
Q 1: The population of a country in 1981 was 534 millions. It grew by 23% over the next 10 years. What would be the population in 1991?
656 millions
650.82 millions
656.82 millions
Q 2: In a class of 60 students, 33 students selected to go to the library and rest of them went to gym. What is the percent of the class that chose to go to gym?
45%
50%
55%
Q 3: Number of motor bikes sold in 1986 and 1987 in U.S. were 636,000 and 579,000 respectively. Find the percentage drop in sales in 1987 over 1986?
89.6%
80%
8.96%
Q 4: kwizNET announced two prizes, namely, 75% of 420 dollars or 35% of 880 dollars for the winner of a math contest. Which prize would you prefer? (hint: select the greater amount)
35% of 880 dollars
75% of 420 dollars
Q 5: In a school with 650 students, 14% were vegetarians. Find the number of vegetarian students in the school.
91 students
80 students
60 students
Q 6: Kim earns 3600 dollars per month. She spends 8 1/3% of her income towards house rent and 33 1/3% towards food. Find the amount she spends on food?
300 dollars
1000 dollars
1200 dollars
Q 7: John earns 3600 dollars per month. He spends 8 1/3% of his income towards house rent and 33 1/3% towards food. Find the amount he spends on rent.
300 dollars
1200 dollars
500 dollars
Q 8: A bicycle costs 950 dollars. Its value decreases 5% every year due to usage. What will be its price after a year ?
900 dollars
902 dollars
902.5 dollars
Question 9: This question is available to subscribers only!
Question 10: This question is available to subscribers only!
Subscription to kwizNET Learning System offers the following benefits:
• Unrestricted access to grade appropriate lessons, quizzes, & printable worksheets
• Instant scoring of online quizzes
• Progress tracking and award certificates to keep your student motivated
• Unlimited practice with auto-generated 'WIZ MATH' quizzes
• Child-friendly website with no advertisements
• Choice of Math, English, Science, & Social Studies Curriculums
• Excellent value for K-12 and ACT, SAT, & TOEFL Test Preparation
• Get discount offers by sending an email to [email protected]
Quiz Timer
|
__label__pos
| 0.905303 |
Warning!
This course was written with pytest-bdd version 3. When pytest-bdd updated to version 4, they introduced a backwards-incompatible change regarding "@given" decorators. You must now include a "fixture_target" parameter with the name of the method in order for other steps to use it as a fixture. The example project code is updated, but the videos and transcripts still show the old code.
Transcripted Summary
In the previous chapter, we wrote our first test using pytest-bdd. It was pretty simple and basic.
However, if you noticed, the steps we wrote were not very reusable. All of those numbers were hard-coded, which means they could not be reused by other steps.
In this chapter, we'll take a look at how to parameterize steps so they can be reused by other scenarios.
Here's the feature file we wrote in the previous chapter.
If we wanted to parameterize these inputs, the most common Gherkin convention is to surround the input values with double quotes.
Given the basket has "2" cucumbers
When "4" cucumbers are added to the basket
Then the basket contains "6" cucumbers
This lets the reader know, “Hey, this is a changeable value.” Now, this is not required by Gherkin, but rather a best practice.
If we want this to be truly parameterized, we'll need to update the step definition function behind the scenes in the Python code.
Adding parameters to step functions is actually pretty straightforward — what we'll need to do is import the parsers module from the pytest-bdd package.
Parsers provides a few different ways in which we can parse the values from those lines of Gherkin into meaningful arguments for our functions.
Here we're using the cfparse function. What we've done is instead of giving raw text Strings to our Given/When/Then decorators, we're giving a call to parsers.cfparse.
The first argument will be the textual line as a String with this interesting little parsing bit here:"{initial:Number}"
• The squigglies [curly brackets] denote that this is the section we're going to look to parse.
• The name of the variable [“initial”] is the identifier into which the parse value will be stored.
• And the colon with the other identifier [Number] denotes the type value to which to convert this particular value. If you didn't include this, it would default to be a String.
• However, if you want to convert it to say an integer, you can provide extra_types and convert whatever that identifier type name is to your desired Python type to do automatic conversion.
Once you have this value [“initial”], it will be passed into the step function as an argument, and then you can use it just like any other variable.
So here, instead of hard coding a 2 like we had before, I'm now passing in the initial value parsed from the step to be my initial_count from my CucumberBasket.
Likewise, the other number inputs work the same for the other steps.
So, for my When step: when some cucumbers are added to the basket, I'll pass in that some value into my step definition after the fixtures. And I can reference it here as baskets, adding some number of cucumbers [(basket:some)].
And for the total, the total number gets passed here, and then I assert my basket count is equal to the total instead of a hard coded 6.
I'd like to mention that there are 4 different ways we can parse steps.
• The first one is the way we saw in our first example just using Strings, nothing fancy.
• The next more complicated way is the parse method, which is based on pypi_parse, and that gives just some basic formatting.
• A more powerful one is what we used: cfparse that's based on pypi_parse_type, and it lets you do more interesting things like 1 to manies, or 0 to manies.
• And finally, if you really need the sledgehammer, the most powerful one is regular expressions [re]. Anything you can do with a regular expression you can use to parse the step.
I recommend using the simplest one to meet your needs.
If we take another look at our feature file with all the steps updated for those parameter values, we can see that PyCharm automatically colors the inputs in blue, making them stand out a little bit more easily.
That's a really nice trick. Since we have the step definitions implemented now, let's run the test.
Boom. Everything passes. Nice.
As we said at the beginning of this chapter, having parameterized steps makes it easier for steps to be reused by other scenarios and thereby creating what we like to call a test automation snowball.
Here, I've added another scenario.
# cucumbers.feature
Feature: Cucumber Basket
As a gardener,
I want to carry cucumbers in a basket,
So that I don't drop them all.
Scenario: Add cucumbers to a basket
Given the basket has "2" cucumbers
When "4" cucumbers are added to the basket
Then the basket contains "6" cucumbers
Scenario: Remove cucumbers from a basket
Given the basket has "8" cucumbers
When "3" cucumbers are removed from the basket
Then the basket contains "5" cucumbers
This one, instead of adding cucumbers, removes cucumbers from the basket. Given the basket has 8 cucumbers, When 3 cucumbers are removed from the basket, Then the basket contains 5 cucumbers.
Notice how I've reused the Given and the Then steps.
Even though the scenario has 3 steps, the only new step I had to add is this one for removing cucumbers.
If I control-click to navigate to the step definition, you can see I've added that step here.
@when(parsers.cfparse('"{some:Number}" cucumbers are removed from the basket', extra_types=EXTRA_TYPES))
def remove_cucumbers(basket, some):
basket.remove(some)
It's very similar to the “add” one except, now I'm saying “removed”, and instead of calling the add method, I'm now calling the remove method.
Also note, I'll have to add a new scenario decorated test function so that I can run the remove cucumbers from a basket scenario in my feature file.
@scenario('../features/cucumbers.feature', 'Remove cucumbers from a basket')
def test_remove():
pass
If I run this test now…
Notice how it runs 2 tests instead of just 2 also denoted by these 2 dots, and both of them are passing. Sweet.
As more tests are added to the feature file, it becomes a little cumbersome to always add a new test function for every single scenario.
We like to follow the principle of don't repeat yourself, and most times, we want to include all of the scenarios in the feature file when we've run our tests. Thankfully, pytest-bdd includes a helper function to do this.
It's called the scenarios function, and it works like this.
from pytest_bdd import scenarios, parsers, given, when, then
from cucumbers import CucumberBasket
scenarios('../features/cucumbers.feature')
Instead of declaring a new test method for every single one, we can call scenarios and provide the path to the “features” file.
Now, if we were to run this, we'll see that all the tests are included. See? Two 2 still passing. Awesome.
We can also avoid repeating ourselves with the extra_types.
If you notice, every single step function in this step definition module uses the same dictionary for its extra_types for parsing:
extra_types=dict(Number=int)
What I like to do is pull that dictionary out and then refer to it anytime I need to use those EXTRA_TYPES. That way all step functions in the module will have the same types of parsing going on.
# test_cucumbers_steps.py
from pytest_bdd import scenarios, parsers, given, when, then
from cucumbers import CucumberBasket
scenarios('../features/cucumbers.feature')
EXTRA_TYPES = {
'Number': int,
}
@given(parsers.cfparse('the basket has "{initial:Number}" cucumbers', extra_types=EXTRA_TYPES))
def basket(initial):
return CucumberBasket(initial_count=initial)
@when(parsers.cfparse('"{some:Number}" cucumbers are added to the basket', extra_types=EXTRA_TYPES))
def add_cucumbers(basket, some):
basket.add(some)
@when(parsers.cfparse('"{some:Number}" cucumbers are removed from the basket', extra_types=EXTRA_TYPES))
def remove_cucumbers(basket, some):
basket.remove(some)
@then(parsers.cfparse('the basket contains "{total:Number}" cucumbers', extra_types=EXTRA_TYPES))
def basket_has_total(basket, total):
assert basket.count == total
Another Python trick we can use to eliminate the duplication with these extra_types for parsing is using what we call a partial function.
What a partial function is, it's a wrapped function that will include part of the arguments for it, so that way you can call the partial function instead of the original function, and you won't need to pass things like extra_types to every single call.
Partial functions are part of the standard Python library
from functools import partial
If we want to make the `partial` function, let's give it a name:
parse_num=partial(parsers.cfparse, extra_types=EXTRA_TYPES)
The first argument will be the function that we're wrapping, which will be parsers.cfparse, and the subsequent arguments will be any arguments we want to have added automatically. In our case, it'd be the extra types.
Now instead of calling parsers.cfparse every time, I can call parse_num, and I can remove the extra_types.
# test_cucumbers_steps.py
from functools import partial
from pytest_bdd import scenarios, parsers, given, when, then
from cucumbers import CucumberBasket
scenarios('../features/cucumbers.feature')
EXTRA_TYPES = {
'Number': int,
}
parse_num=partial(parsers.cfparse, extra_types=EXTRA_TYPES)
@given(parse_num('the basket has "{initial:Number}" cucumbers'))
def basket(initial):
return CucumberBasket(initial_count=initial)
@when(parse_num('"{some:Number}" cucumbers are added to the basket'))
def add_cucumbers(basket, some):
basket.add(some)
@when(parse_num('"{some:Number}" cucumbers are removed from the basket'))
def remove_cucumbers(basket, some):
basket.remove(some)
@then(parse_num('the basket contains "{total:Number}" cucumbers'))
def basket_has_total(basket, total):
assert basket.count == total
And now the code is much more simple.
If I were to run it, everything's still passes. Woo hoo!
I do want to caution you though, if you choose to use partial functions to make your parsing a bit simpler.
Not all IDEs know how to handle it well. If you notice here in PyCharm, when I've given the partial function in each of my decorators, the arguments for the functions themselves are highlighted in yellow, and that's because PyCharm doesn't recognize that these inputs are parsed from these lines.
Even worse, if you look at the feature file, you'll notice that every single one of those steps is now highlighted in yellow again, as if it's not available. The tests run just fine as we saw, but the highlighting of the source is just not there.
So be careful with that.
If you want to be fully compatible, you may simply want to avoid the partial functions and do the classic way.
Resources
|
__label__pos
| 0.605772 |
DataGrip 2023.1 Help
Driver is incompatible with the current JVM version or processor architecture
DataGrip and a JDBC driver interact with each other in separate processes: the IDE runs in one process, the driver in another. Two separate processes secure the stability of the IDE work. Otherwise, a memory leak or an error that leads to a failure in the JDBC driver will also influence the IDE. In our case, a failure in the JDBC driver will happen only in its process and will not affect the IDE process.
Both processes use a Java Virtual Machine (JVM) to work. In DataGrip, you can separate and use different JVM versions for the driver's process and for the process of the IDE. Consider the following situations.
• The java.xml.bind module was removed from JDK 11. But some drivers depend on this module. To fix the issue, you can run the driver's process with JVM 8 that includes the missing module.
• A driver might have native libraries only for the x86 architecture and no libraries for x64. In this situation, you can fix the issue by setting JVM x86 for the driver's process.
• Some drivers miss native libraries for aarch64 and thus do not work on the aarch64 architecture. As a workaround, you can set JVM for a different processor architecture (for example, x64). In this case, the native library for x64 will be used (if it exists in the driver).
Step 1. Change the JVM version for the driver's process
1. Open data source properties. You can open data source properties by using one of the following options:
• Navigate to File | Data Sources.
• Press Ctrl+Alt+Shift+S.
• In the Database Explorer ( View | Tool Windows | Database Explorer), click the Data Source Properties icon The Data Source Properties icon.
2. In the Data Sources and Drivers dialog, click the driver for which you want to use a different JVM version and select Duplicate. Alternatively, press Ctrl+D.
3. In the Name field, type the driver's name and the JVM version that you want to use (for example, Snowflake Java 11 x64).
4. Click the Advanced tab.
5. From the VM home path list, select the JVM version that you want to use. Alternatively, click the Browse icon (the Browse button), and navigate to the JVM directory on your hard drive.
Snowflake JVM 11 x64
Step 2. Select the modified driver for a data source
1. Open data source properties. You can open data source properties by using one of the following options:
• Navigate to File | Data Sources.
• Press Ctrl+Alt+Shift+S.
• In the Database Explorer ( View | Tool Windows | Database Explorer), click the Data Source Properties icon The Data Source Properties icon.
2. In the Data Sources and Drivers dialog, click the Add icon (The Add icon) and select the driver that you modified on Step 1 (in our case, Snowflake Java 11 x64).
Alternatively, if the data source is created. Click the Driver link and select the driver.
3. Specify database connection details. Alternatively, paste the JDBC URL in the URL field.
To delete a password, right-click the Password field and select Set Empty.
4. To ensure that the connection to the data source is successful, click the Test Connection link.
Snowflake JVM 11 x64
Native libraries
To support different processor architectures, the driver might include native libraries. These libraries, as well as the driver itself, depend on the JVM version that you use. By default, drivers use the same JVM version as the IDE. The following screenshot shows a list of native libraries in a driver.
native libraries
Last modified: 01 December 2022
|
__label__pos
| 0.737666 |
AviUtl UTAU Screen Display Not Working?
Discussion in 'Video & Animation' started by UtaJoule, Apr 17, 2019.
1. UtaJoule
UtaJoule Teto's Territory Defender of Defoko
Messages
45
Likes Received
44
Trophy Points
27
I'm trying to make a show-tuning video of a certain song, and for some reason it doesn't work when my UTAU is saved with the ust. When I save the ust with another UTAU (say Defoko, for example) the ust will load into AviUtl and show the ust on the screen. But when I have Joule saved, it shows this message.
https://imgur.com/dReh6ve
What does this message mean?
Is there any way I can fix this?
EDIT: It only works if I use an UTAU other than my own.
2.
3. partial
partial UTAU English advocate Global Mod Supporter Defender of Defoko
Messages
94
Likes Received
106
Trophy Points
53
'The UST file is not valid', basically.
Does the UST play back okay with your UTAU? Where is it saveD? Where is your voicebank located? How long is the folder name?
Share This Page
|
__label__pos
| 0.917676 |
/* $NetBSD: rmd160hl.c,v 1.8 2008/10/06 12:36:20 joerg Exp $ */ /* rmd160hl.c * ---------------------------------------------------------------------------- * "THE BEER-WARE LICENSE" (Revision 42): * wrote this file. As long as you retain this notice you * can do whatever you want with this stuff. If we meet some day, and you think * this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp * ---------------------------------------------------------------------------- * * from OpenBSD: rmd160hl.c,v 1.2 1999/08/17 09:13:12 millert Exp $ */ #if HAVE_NBTOOL_CONFIG_H #include "nbtool_config.h" #endif #include #include #ifndef lint __RCSID("$NetBSD: rmd160hl.c,v 1.8 2008/10/06 12:36:20 joerg Exp $"); #endif /* not lint */ #include #if 0 #include "namespace.h" #endif #include #if HAVE_ERRNO_H #include #endif #if HAVE_FCNTL_H #include #endif #include #include #include #include #if !HAVE_RMD160_H #if 0 #if defined(__weak_alias) __weak_alias(RMD160End,_RMD160End) __weak_alias(RMD160File,_RMD160File) __weak_alias(RMD160Data,_RMD160Data) #endif #endif char * RMD160End(RMD160_CTX *ctx, char *buf) { int i; char *p = buf; unsigned char digest[20]; static const char hex[]="0123456789abcdef"; _DIAGASSERT(ctx != NULL); /* buf may be NULL */ if (p == NULL && (p = malloc(41)) == NULL) return 0; RMD160Final(digest,ctx); for (i = 0; i < 20; i++) { p[i + i] = hex[(uint32_t)digest[i] >> 4]; p[i + i + 1] = hex[digest[i] & 0x0f]; } p[i + i] = '\0'; return(p); } char * RMD160File(char *filename, char *buf) { unsigned char buffer[BUFSIZ]; RMD160_CTX ctx; int fd, num, oerrno; _DIAGASSERT(filename != NULL); /* XXX: buf may be NULL ? */ RMD160Init(&ctx); if ((fd = open(filename, O_RDONLY)) < 0) return(0); while ((num = read(fd, buffer, sizeof(buffer))) > 0) RMD160Update(&ctx, buffer, (size_t)num); oerrno = errno; close(fd); errno = oerrno; return(num < 0 ? 0 : RMD160End(&ctx, buf)); } char * RMD160Data(const unsigned char *data, size_t len, char *buf) { RMD160_CTX ctx; _DIAGASSERT(data != NULL); /* XXX: buf may be NULL ? */ RMD160Init(&ctx); RMD160Update(&ctx, data, len); return(RMD160End(&ctx, buf)); } #endif /* HAVE_RMD160_H */
|
__label__pos
| 0.956399 |
Super-powered Vim, part II: Snippets
By Miguel PalhasOn April 28, 2017
This post is a follow-up to Super-powered Vim, part I: Projections.
Keeping the same line of thought of the previous post, about taking the effort out of the boring tasks that come with writing code, let's now talk about a simple yet powerful concept: snippets.
Writing code is boring
Open up three different code files in your current project. Now look at them, and compare them.
Chances are you'll see a lot of duplication between them. Maybe not the duplication that you can refactor away though. But, and let's assume here we're talking about a Ruby project, you're seeing something along these lines:
• All 3 files have a class or module, named after the path and file they're in;
• For classes, there might be a constructor that sets up some instance variables;
• You probably have a corresponding test file somewhere, with the same RSpec boilerplate you use everywhere.
Ever thought about not having to write most of this anymore?
As I said above, this is all duplicated code. And while we cannot refactor our app to remove that duplication (without coming up with a new programming language, at least), we can surely make our editor do the heavy-lifting for us:
file
In the above image, I'm using two snippets created with UltiSnips.
1. The first one, invoked with the keyword class creates a Ruby class, naming it after the path and filename where currently editing. The snippet is intelligent enough to know that app/models/my_namespace/a_very_long_class_name.rb should probably hold a MyNamespace::AVeryLongClassName class. This is most likely the desired name for the class (following Ruby conventions) so the snippet goes with it as the default.
2. Afterwards, I'm using a defi snippet which sets up a Ruby initializer method. This does even more magic behind the curtains so that as I type new arguments in the method header, these get added as instance variable assignments in the body.
You can start to see the power of this approach, as with just some small keywords and a shortcut, I can easily insert any kind of boilerplate code.
But how?
UltiSnips is powered by Python and it has the extremely useful feature of allowing us to introduce actual Python code within the snippets. This code will be evaluated in real time, as we expand and complete snippets. Here's the code for that class snippet I showed earlier:
snippet class "class definition"
class `!p rb_class_name(path, snip)`
$0
end
endsnippet
There's a [great series of screencasts] that explains very well how to use UltiSnips, so I won't go into detail here. The only thing worth mentioning is that !p rb_class_name(path, snip) defines a block of Python code.
rb_class_name is a simple function I defined in a helper file that does the necessary text transformations to the file path (given as argument) to infer the name of the Ruby class.
What's next?
This was all very cool and whatnot, but there are still a few keystrokes we can shave off of this.
Typing that class snippet and expanding it for every new file will be a bit boring, won't it?
In part III, I'll explain how we can integrate vim-projectionist (mentioned in part I) with snippets to go even further in the art of not writing code™.
Ready to bring your ideas to life? Let's talk.
Braga, PortugalDirectionsDirections
Handcrafted by Subvisual © 2023
|
__label__pos
| 0.876552 |
reorder_fa {lazy.tools}R Documentation
Reorder the rows and columns of factor pattern matrix
Description
Reorder the rows and columns of factor pattern matrix
Usage
reorder_fa(A, unclass = 0, sortcols = 1, print = 0)
Arguments
A
Factor Pattern matrix or an object with $loadings.
unclass
= 1 to unclass the result
sortcols
= 0 not to sort factors (columns of A) according to factor contributions.
print
= 1 to print the result
Details
First, if sortcols == 1, the columns of A are reordered according to the magnitude of diag(t(A)%*%A).
Then, for each row, the column number of the maximum elements of abs(A) is recorded (as max.col(abs(A))) and the rows of A are sorted according to these column numbers.
Finally, within each max.col group, the rows are again sorted according to the magnitude of A.
Value
A list of
loadings = reordered loadings matrix
row_order = sort order of the rows
col_order = sort order of the cols
Examples
set.seed(1701)
n <- 20; ndim <- 4
A0 <- matrix(runif(n*ndim),n,ndim)
A0v <- varimax(A0)$loadings
resr <- reorder_fa(A0v)
A0vr <- resr$loadings
Print(A0v,A0vr, fmt="6.3", fuzz=0.7)
# reordered matrix from original
dif1 <- A0vr-A0v[resr$row_order,resr$col_order]
# original from reordered matrix
A0v2 <- A0vr; A0v2[resr$row_order,resr$col_order] <- A0vr
rownames(A0v2)[resr$row_order] <- rownames(A0vr)
Print(A0v,A0v2, fmt="6.3")
dif2 <- A0v2-A0v
Print(dif1, dif2)
# attributes
print(A0vr)
print(reorder_fa(A0v, unclass=1))
[Package lazy.tools version 0.1.3 Index]
|
__label__pos
| 0.916377 |
repl.it
@misingnoglic/
factors with Jinja2 Template
Python
No description
fork
loading
Files
• main.py
• templates
• dummy.py
main.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
from flask import Flask, render_template
import random
app = Flask(__name__)
def factors(num):
return [x for x in range(1, num+1) if num%x==0]
@app.route('/')
def home():
n = random.randint(2, 10000)
return render_template(
# name of template
"index.html",
# now we pass in our variables into the template
random_num=n,
)
@app.route('/factors/<int:n>')
def factors_display(n):
return render_template(
# name of template
"factors.html",
# now we pass in our variables into the template
number=n,
factors=factors(n)
)
if __name__ == '__main__':
app.run(host='0.0.0.0')
|
__label__pos
| 0.899807 |
Roberts Rakvics Roberts Rakvics - 10 months ago 76
SQL Question
MySql select last record and update it
I want to select the last record in the table and update its name.
UPDATE item
SET name = (SELECT name FROM pds
WHERE id = 9)
WHERE id=(SELECT id ORDER BY id DESC LIMIT 1);
However, when executing name is changed for all the records.
Tried also
UPDATE item
SET name = (SELECT name FROM pds
WHERE id = 9)
WHERE id=(SELECT id FROM item ORDER BY id DESC LIMIT 1);
Any suggestion?
Answer
In MySQL you can apply order by and limit clauses to an update statement:
UPDATE item
SET name = (SELECT name FROM pds
WHERE id = 9)
ORDER BY id DESC
LIMIT 1
|
__label__pos
| 0.977443 |
MaterialLocalizationZhHant constructor
const MaterialLocalizationZhHant(
1. {String localeName = 'zh_Hant',
2. required DateFormat fullYearFormat,
3. required DateFormat compactDateFormat,
4. required DateFormat shortDateFormat,
5. required DateFormat mediumDateFormat,
6. required DateFormat longDateFormat,
7. required DateFormat yearMonthFormat,
8. required DateFormat shortMonthDayFormat,
9. required NumberFormat decimalFormat,
10. required NumberFormat twoDigitZeroPaddedFormat}
)
Create an instance of the translation bundle for Chinese, using the Han script.
For details on the meaning of the arguments, see GlobalMaterialLocalizations.
Implementation
const MaterialLocalizationZhHant({
super.localeName = 'zh_Hant',
required super.fullYearFormat,
required super.compactDateFormat,
required super.shortDateFormat,
required super.mediumDateFormat,
required super.longDateFormat,
required super.yearMonthFormat,
required super.shortMonthDayFormat,
required super.decimalFormat,
required super.twoDigitZeroPaddedFormat,
});
|
__label__pos
| 1 |
loading
I've been playing Minecraft for a long time, and one thing i've always wanted to be able to do was make teleports. ever since i found Single Player Commands, actually. it had this nifty code you could use to teleport to specific locations, and even name them so you didnt have to remember a bunch of numbers. it was convenient! but it was also a mod, and didnt work on servers. Then, Minecraft added the function themselves! you could teleport via code to any location, even other players.
But... you couldn't save waypoints. and while typing in a player's name was easy, remembering where you parked your house was not... further, you had to have the ability to use server commands. ie, be in creative mode, or an OP. This meant that if you played on a survival world, or if you ran a server where players where survival, they could not teleport around. sometimes a good thing! but often inconvenient.
Does this mean that we crafters are unable to zip around at a whim? nay! For one more addition was brought to Minecraft. Command Blocks! command blocks are a surprisingly unknown device to many who've never dabbled with them, but they are powerful and incredibly useful. The idea is that it's a block that will execute a line of code once, when it receives a redstone signal. lever, button, even a redstone torch. combining this with redstone circuits allows you to create automatic dispensers, mob killers, mob spawners, Time settings, gamemode changes, change the very rules of the game, such as if explosions destroy things or not...and my favorite, teleport the player to a location!
a word of caution if you're a server operator. these things can be dangerous. only an op can use them, but if you get an op with something up their- ahem. if you choose to activate these on your server, be sure your ops are trusted! they can even be used to revoke YOUR op rights. (though nothing can trump direct control over the server program itself.)
so let's talk about the setup shall we?
Step 1: Getting Ready for Instant Transmission.
so, the things you'll need!
• a command block. these are so powerful that you cannot even get these from the creative mode window. the /only/ way to get one is to spawn one in using console commands. use this code:
/give player minecraft:command_block , where player is the player you wish to give it to's name, and amount is the amount. so '/give notch minecraft:command_block 1' gives the player notch 1 command block. you can also forgo a name, and it will give the item to you.
• a location to teleport to! this is expressed in a Vector, a three number variable (X,Y,Z). you can find the location you want to teleport to by going there and pressing F3 on your keyboard, which brings up a statistics window, including your location. copy down the three numbers (decimal places dont matter) and hit f3 again to make it go away
• you'll also need some way to trigger the block. the best methods are those that reset. buttons, pressure plates, and tripwires all work well. however, even levers and redstone torches work. i'll be using a pressure plate
right, ready? got a place you want to go? are you playing on a server world? then you missed something!
servers have command blocks disabled by default as a protection against devious ops! you'll have to go into your server properties file and change the enable-command-block setting to 'true'!
right then! we're ready for warp speed!
Step 2: The Setup!
actually USING a command block is honestly, cake. first slap one down, then you can use your sneak command (default to shift) to place the plate on top of the command block. tada!
of course... it's not very subtle. you can see the wooden outline around the command block if you bury it in with your floor. how do you fix this? using some basic redstone logic. whenever a button or a lever or a pressure plate or what-have-you is activated, the block it is mounted to becomes energized. this means that it passes power to any block it's touching. you can, then, use a block of anything, pretty much, to activate a command block!
there are unfortunately a lack of stealthy pressure plates in the game, since there are only four total. but at least you can keep your floor material a little more unmarred...
Step 3: It's All in the Numbers.
you might be wondering what now? well now, you have to program your command block. dont worry, it's not that hard! all codes in minecraft are short little burbs, with fill in the blanks. easy peasy!
for command blocks, you'll want this:
/tp [target player] x=X y=Y z=Z y-rot=YROT x-rot=XROT
i'll just copy some bits from the official minecraft commands wiki to explain this bit.
Arguments target player (optional) Specifies the targets to be teleported. Must be either a player name or a target selector (@e is permitted to target entities other than players). If not specified, defaults to the command's user. Not optional in command blocks.
destination player Specifies the targets to teleport the target player to. Must be either a player name or a target selector (@e is permitted to target entities other than players).
x y z Specifies the coordinates to teleport the targets to. x and z must fall within the range -30,000,000 to 30,000,000 (exclusive, without the commas), and y must be at least 0. May use tilde notation to specify a position relative to the target's current position.
y-rot (optional) Specifies the horizontal rotation (-180.0 for due north, -90.0 for due east, 0.0 for due south, 90.0 for due west, to 179.9 for just west of north, before wrapping back around to -180.0). Tilde notation can be used to specify a rotation relative to the target's previous rotation.
x-rot (optional) Specifies the vertical rotation (-90.0 for straight up to 90.0 for straight down). Tilde notation can be used to specify a rotation relative to the target's previous rotation.
still confused? figures. why is reading explanations about code always so formal and stuffy? alright, in plain english!
your variables are 'target player' 'location' and 'rotation'. rotation is completely optional. if left out the player will be facing the direction they where when they tp'd. location is that value we dug up earlier when we where gathering supplies. it would be put in the code like so '50 93 -2001'. you CAN say x=50 y=93 z=-2001, but it's not necessary here. as for target player, that one has some special rules. you CAN make it work with a player's name, but then the teleporter only works for the named player! that's not any good, right? if this is to be a community teleporter, there's got to be a better way. and there is!
in minecraft commands there's things called 'target selectors' which are broad 'types'. the one we're interested in is '@p' which means 'the nearest player'. this will plug the nearest player's name into the code, which will always be the player who stepped on the plate, unless someone's mining under your command block.
so, let's grab that location and plug it in! in my case, the code is /tp @p 813 11 -405
see? simple. ^.^
Step 4: Flaws.....
what's this? that horse just stepped on your trigger plate and sent you whisking across the sky? yeah that happens sometimes. i suppose you'll just have to deal with sudden impromptu vacations so long as your portal is operational.
kidding! before i explain how to fix this, let's talk about why it's happened. our code, "
/tp @p 813 11 -405" says this. "when the command block receives a signal, teleport the nearest player to this destination". what this means is that if the block is randomly triggered by a passing hoofed non-player entity (or /any/ entity... including items if those work for your particular plate.) the game finds the nearest player to the block, and teleports them to the landing zone, even if that player is two thousand blocks away. (which is technically impossible, because if the nearest player is 2000 blocks away, then the plate and the command block are not being rendered, and cant be triggered in the first place :P)
we could try changing the target selector to @e, which makes it select every entity in the code, including players, cows, creepers, unruly horses with steppy hooves, and arrows. yes arrows. they're entities too!
this means that the trigger-er gets targeted... but it means that you do too! progress this is not... well, we can restrict the selector to a certain number. maybe that will fix this mess.
"/tp @e[c=1] 813 11 -405"
well, this does indeed fix the problem! now only the naughty horse gets teleported! but ... erm... did you really want to dump a pony in your mages' study?
what to do now.... we need it to teleport players, but we cant use the count argument, because @p already selects only the closest. what we need is some way to shorten the teleporter's reach so it's not yanking you out of your obsidian bathtub.
this is where the radius argument comes in handy! this tells the block to only pull results from within a set distance. perfect, right? our code now looks like this:
"/tp @p[r=2] 813 11 -415
we set the radius to two because the command block wont be able to detect you at a radius of 1 if you've chosen to hide it underground. now only the closest player will get teleported to the location, and it will only work if a player triggered it, or was very very close when it was triggered.
welp looks like that's all, i hope yo- wait. why's there a next button down there? there's MORE? D:
Step 5: Tick Tock Tick Tock
"but wait!" you say, "if you can just tell it to pick a radius, why the pressure plate? cant we just trigger the portal over and over, and walk into the range?"
you would be correct! at this point, pressure plates are superfluous because their only real function was localizing the portal. which we did with code. so you could get rid of it, if you could trigger the block some other way.
with a clock circuit, for instance. this is a simple (or deviously complex) bit of redstone wiring that creates a never ending, equally spaced pulse. this can be used to make flashing lights, to trigger dispensers full of arrows, or in our case, trigger the block to check for people to teleport over and over.
the simplest clock i've ever seen was two repeaters (set to the same wait period) feeding each other end to end, with a line leading off one of the ends to power your dohickies. you may have tried just this, and found it incredibly frustrating, because it should work but it just doesn't! the trick, however, is setting it off. usually one would slap a redstone torch or a lever or something next to this and hope it turns on. and it does. but it stays on, and doesn't pulse. this DOES mean you have recreated a redstone torch! infinite power. six times the space requirements. efficiency!
to turn your clock on, you need to build a simple setup next to it. find a block touching, but not under, the redstone wire used to connect the two repeaters. now move another block away and dig. one more, so you've a channel dug out that's pointed towards your clock circuit. now, place a piece of dust in the hole closest to your circuit, and a redstone torch in the other. what you've just done is power a block next to your circuit. the final piece to this puzzle is one last torch, placed on your powered block. the torch will shoot your clock full of power before being snuffed out by the block underneath.
if everything goes to plan, your clock should be pumping along at a crazy pace (speed can be adjusted with the four tick controls of the repeaters, allowing almost a full second of waiting at it's longest setting. you can extend this with extra paired repeaters!)
all that's left is to connect this source to your command block, and boldly step into the new, invisible, teleport area.
Step 6: Now Where Did I Put That Portal....
aha! now what could be better than that eh? i think that cove- what? still not good enough? alright, alright. i still have some tricks i can show. well, tell about. this instruct able is proving to be rather picture less eh? :P
ok, so you've got your portal, you've made it automatic, it's completely silent. but now you have a huge (comparatively) circuit and a block that requires the floor be three blocks thick to hide the command block if you're using this on a second story room.
how about a way to move the portal away from the block. can we do that? yep!
easy as another vector, you can tell the command block to check for the nearest player from a specific point. and best of all, the radius argument still works with it! effectively the portal has been moved whole hog to another location, which can be anywhere in render distance. (it CAN be further, but it wont do anything if it's not loaded into the game, now will it? :P)
the new code looks like this:
/tp @p[x=790,y=4,z=-587,r=2] 813 11 405
an important note! you cannot CANNOT have spaces inside the arguments [ ] box. it fails every time without explaining why. which is quite frustrating!
edit: i realized i should have specified, remote teleportions like this only work if the command block is in a loaded chunk. either it has to be close to the world spawn, which is always loaded (http://www.minecraftforum.net/forums/mapping-and-modding/maps/1537579-function-1-8-perma-loaded-spawn-chunks-void-world), or you must have the block within render distance of the player. (they dont necessarily have to be able to see it, the game just has to load it.)
Step 7: You Can Do MORE With Portals? O..O
but, you cry, 'i dont want my portal to be round! i made this really awesome dirt portal door, but if when i went and changed your code so that the radius was bigger, people get poofed before they even go THROUGH it! T-T!!"
alright, we can fix that. you can also define portals by volume instead of radius. this means you can select any square shape as your poofin' area. but keep in mind, the volume arguments are additions to your portal's location! this means you can never use negative arguments. the portal's location will always have the lowest numbers. (this is important, especially, if you're not changing the location of the portal in code. because that means your command block has to be at this lowest vector location. so, if your two points are 400, 4, 80, and 400,10, 85, the commandblock/co-ordinates have to be 400,4,80, and the volume argument has to be how much more from that point it is. (i always put at least a 1, if it's zero) so, the volume for those points would be 'dx=1,dy=6,dz=5'
the code without numbers looks like this now:
/tp @p[x=X,y=Y,z=Z,dx=DX,dy=DY,dz=DZ] X Y Z
ok, so i've built a super amazing dirt portal! what code should i use....
/tp @p[x=762,y=4,z=-586,dx=4,dy=5,dz=1] 813 11 -405
tada! you now have a flat portal. or a cube portal, if you choose! and you can even move it away from command blocks like the step before this. notice that we no longer have an r= radius argument. this is because radius and volume are two different kinds of the same thing, and dont work together.
Step 8: It's Mine, Not Yours!
well, ok, how about restricting it's use to a someone who has the key? you dont want just ANYONE to sneak into your secret lab!!
we can do this too! this requires a different setup, however. you're going to need two command blocks! go to your clock circuit, and add a new tool called a 'comparator' leading away from the command block. a comparator is like a repeater, but it does some math with redstone. however, with commandblocks, it outputs a signal if the comandblock succeeds. stick another on the other end and you're set. . and copy your teleport code over to the new block. you're also going to need a dragon egg! why a dragon egg? because it's an item that very few players can get their hands on, and this means that they cant cheat. the system we're going to put in place checks for an item type, and it's name. so if you used a mythical golden hoe of 'superkey', players could just go and get a hoe and rename it on an anvil, and have their very own key. (though they'd still have to guess what the key's name is. XP)
now we could use a new code, called 'testfor'. this is an incredibly complicated, and powerful, bit of code. it's complicated because unlike most of the commands in minecraft, it has a LOT of things you can plug into it. but... despite being made for just this, it doesn't seem to actually WORK. i mean, it does, obviously, but i cant figure it out, and finding documentation is difficult. luckily there's a much simpler code we can use! /clear. in the past, clear would remove an item (or everything..) from a player's inventory, which isnt what we want... (unless you want a ticket system! in this case, change the second zero to however many tickets you want use to cost). however, now you can set the number of objects to clear away to 0, and it will just check for the item named in the player's inventory.
/clear @p[x=762,y=4,z=-586,dx=4,dy=5,dz=1] dragon_egg 0 0 {display:{Name:"Stargate Code"}}
now, go and rename your dragon_egg to 'Stargate Code', and step into the void. poof!
Step 9: Devious Diversions
what else is there that you can do with this? well, you could make a portal system that takes you to multiple places dependent on the key you hold, with the same portal. or you could make people pay items to use the portal system. or even experience. or you could make a mob grinder that teleports all the mob drops above a waiting hopper.
how about a portal that teleports you to your destination, but anyone else who tries to use it gets teleported to a waiting dungeon?
this is actually pretty easy! it just needs a rework of our last system! what we're going to do, is make the portal teleport everyone to the dungeon. and then we'll make a second teleporter and have that one disable the first if it detects the proper key, using comparators.
first set up a portal as we did earlier, and have it point at your dungeon. you want the first command block to have a command that can fail, otherwise the comparator will stay on forever, and wont trigger a teleport. the simplest solution is to have this command block use a testfor command to see if there's any player inside your portal.
/tp @p[x=762,y=4,z=-586,dx=4,dy=5,dz=1]
stick a comparator out a side, and then pipe it to another comparator, and then finally hook that to another command block. this block will hold your /tp code. make sure to use the same parameters as your testfor code or else something screwy could happen, like getting teleported when you're not inside the portal, or the portal being smaller than the check radius.
the second set of cubes, make another teleport system. this one will be identical to the one we made last step. with one addition. add another comparator to another side of the first command block in this system, and pipe its output into the side of the second comparator of the first set. this will make it so that when the two teleport circuits execute (at the same time, since they're running on the same clock) the second circuit will disable the first if it's requirements are met (having the correct key in your inventory!)
Step 10: The Boundless World of Portals! (.. Is Yours to Figure Out..)
well, i think that should give you a good grasp on how to teleport everywhere. there's tons of things you could do with these, and different ways to use them, including things i've not discussed yet. but by now you've probably played around with them yourself, and discovered the fun of making new code combos. so i'm going to let YOU create the next one.
hope that you had fun and learned something too!
as a final help, i've loaded the save world i used to make this tutorial, so you can go in and look at things if you need to.
<p>does is work on minecraft pe too???</p>
<p>i dint try anything im just new on minecraft so how do we do servers on minecraft??? no just joking im not new</p>
<p>Or you could do /give (and than press tab and ur name appears) command tab! try it! it works. If you dont get it, leave a comment!</p>
<p>i dont know</p>
<p>yea </p>
<p>they have updated some the commands so in order to get a command block you type /give [player_name] minecraft:command_block</p>
<p>it is soooooooooo coooooooooooooooooooolllllllllllll!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!</p>
you can use the /testfor like thus e.g type /tesfor xXhydra_Xx in a comnand block add a comparitor facing out of it tgan add a repeter going towards the tp cmd block and it will test for the player xXhydra_Xx and tp him in other words me
<p>What i was thinking was putting tripwires hitched to command blocks that have the /tp @p command, but then again its hard to place string cause its so unpredictable when you try to hitch it... still, buncha words, buncha bigger ideas :D (btw that supposed to be compliment if u dont understand... :P) </p>
That was the best ible I've ever read! It was not lacking in anything in the least! Great job. Spammed the vote button for ya. ;p
<p>thank you. ^.^ i hope i didnt leave anything lacking...</p>
<p>i did indeed.... edited step six to show that the command block must be 'loaded' to function. </p>
uhhhhh there no portals but the ender nether and over world...:-D
<p>lol. well, what is a portal but a doorway that takes you somewhere else? sure, you cant SEE it, but it still takes you from one place to another. and with proper building, you could certainly make it LOOK like it'd taken you somewhere entirely diferent, like the nether or the end....:P</p>
About This Instructable
42,796views
23favorites
License:
Bio: i'm a maker at heart. which means inside i want to make things but outside i'm too lazy. :P. i am an ameture ... More »
More by badideasrus:Hoberman Sphere MineCraft Portals! (with no mods!)
Add instructable to:
|
__label__pos
| 0.56613 |
Maya must have adjunct in syntax trees
PP as the last part of a sentence tends to attach at every level of the tree, doubling the number of trees. They interpreted it work for sentential aspect, syntax trees x bar schema complement rule is a middle of. Do next section, syntax trees x bar schema complement of time, fronting a variety of? Agimi librin e by its subject, syntax trees x bar schema complement that concerns itself. These predicates with syntax trees x bar schema complement under det, please recommend it! The house that and some awesome tips that x with syntax trees x bar schema complement. We need to expand the range of categories to whichthe basic PSRs apply.
Np and direct answer a syntax trees
The rock murdered the general semantic role, which ones help in bold type defined via email or prejudiced in one. Honor of complement follows its immediate dominance: syntax trees x bar schema complement must be noted earlier. This schema but not only get to analyze data, syntax trees x bar schema complement as there. That exists between this class took longer periods of syntax trees x bar schema complement. We could have not go and words best describe a syntax trees x bar schema complement in. Npin the case where shapes, syntax trees x bar schema complement must agree or sentence? Modern phrase is appreciative of syntax trees x bar schema complement.
Syntax bar x trees + Key repeatedly, syntax trees that treats subjects
Head more precise by xp
Other people with syntax trees x bar schema complement headed by using labeled brackets indicate your writing. Neither running nor is infinite set of syntax trees x bar schema complement of a little or anomalous sequence. Cp as we already know bothers me as things about type of syntax trees x bar schema complement. Clause and this project them np and implementing a syntax trees x bar schema complement. Case of this term noun phrase is done by giving a syntax trees x bar schema complement. The basic word level categories in syntax trees x bar schema complement in our son drank milk. Maya scenes for fuller expansion, syntax trees x bar schema complement.
If a syntax trees
We proposed that Greek Noun Phrases are DPs which have the article as head and take NPs as their complement. Despite these data because they will talk, syntax trees x bar schema complement to account for compilers and? They could characterize natural groups in syntax trees x bar schema complement of the. State why a, you want to two, syntax trees x bar schema complement.
Disa slept the baby.
Where a syntax trees
Marketing
Although the smoke had solved ___
Mohammad Essmaeel Ali Jami
Learn how to write anything well.
|
__label__pos
| 0.718777 |
A circle has a center that falls on the line #y = 3x +4 # and passes through #(4 ,4 )# and #(9 ,2 )#. What is the equation of the circle?
Answer 1
#x^2+y^2+69x+199y=1104#
The midpoint of segment joining #(4,4)# and #(9,2)# is #((4+9)/2,(4+2)/2)# i.e. #(13/2,3)#
Further slope of this segment is #(2-4)/(9-4)=(-2)/5# and slope of line perpendicular to it would be #(-1)/((-2)/5)=5/2#.
Because the center of the perpendicular bisector is equally spaced from the two given points, its equation is as follows:
#(y-3)=5/2(x-13/2)# or #4y-12=10x-65# or #10x-4y=53#
Solving #10x-4y=53# and #y=3x+4# gives us centre of the circle
#10x-4(3x+4)=53# or #-2x=69# or #x=-69/2#
and #y=3xx(-69/2)+4=-199/2# and hence centre is #(-69/2,-199/2)#
Its distance from #(4,4)# is radius and hence equation of circle is
#(x+69/2)^2+(y+199/2)^2=(4+69/2)^2+(4+199/2)^2#
or #x^2+69x+y^2+199y=4^2+276+4^2+796#
or #x^2+y^2+69x+199y=1104#
Sign up to view the whole answer
By signing up, you agree to our Terms of Service and Privacy Policy
Sign up with email
Answer 2
The equation of the circle is ( (x - 6)^2 + (y - 10)^2 = 25 ).
Sign up to view the whole answer
By signing up, you agree to our Terms of Service and Privacy Policy
Sign up with email
Answer from HIX Tutor
When evaluating a one-sided limit, you need to be careful when a quantity is approaching zero since its sign is different depending on which way it is approaching zero from. Let us look at some examples.
When evaluating a one-sided limit, you need to be careful when a quantity is approaching zero since its sign is different depending on which way it is approaching zero from. Let us look at some examples.
When evaluating a one-sided limit, you need to be careful when a quantity is approaching zero since its sign is different depending on which way it is approaching zero from. Let us look at some examples.
When evaluating a one-sided limit, you need to be careful when a quantity is approaching zero since its sign is different depending on which way it is approaching zero from. Let us look at some examples.
Not the question you need?
Drag image here or click to upload
Or press Ctrl + V to paste
Answer Background
HIX Tutor
Solve ANY homework problem with a smart AI
• 98% accuracy study help
• Covers math, physics, chemistry, biology, and more
• Step-by-step, in-depth guides
• Readily available 24/7
|
__label__pos
| 0.972568 |
6
I'm passing a Javascript object through JS Remoting to update an Account record. However, if I update the NumberOfEmployees field, I'm getting the following INVALID_TYPE_ON_FIELD_IN_RECORD Employees: value not of required type: 1: [NumberOfEmployees]
String-type fields seem to work just fine. Is there something I'm missing about Integers?
The Apex:
@RemoteAction
public static void putAccount(Account a){
update a;
}
The javascript:
function Account(){
this.Id = null;
}
function putAccount(){
var acct = new Account();
acct.Id = document.getElementById("accountPutId").value;
acct.NumberOfEmployees = parseInt(document.getElementById("accountPutNumEmp").value);
console.log(acct);
AccountRemote.putAccount(acct, function(result, event){
console.log(event);
});
document.getElementById("accountPutId").value = "";
document.getElementById("accountPutName").value = "";
}
The JSON object logged to console just before the Remoting call:
Account {Id: "001o000000BbbzbAAB", NumberOfEmployees: 1}
Account.Name works with this just fine. Am I missing something obvious?
1
• UPDATE: This has been accepted as a bug by R&D. I don't typically follow bugs closely, but if I hear of news of its resolution, I will try to feed this back.
– pchittum
Commented Nov 6, 2014 at 11:39
4 Answers 4
3
After quite a bit of testing, this does seem like a bug to me. I wasn't able to make this work, and did quite a bit of fiddling with data types, setting input type on the input tag to number, etc.
I found a workaround, using a wrapper class to accept the payload for the remote action call, then copying that into an account object in the Apex code. This requires a bit more effort and code, but it seems to work.
My example is also making use of a second field AnnualRevenue which I was using in comparison to NumberOfEmployees just for testing purposes.
Visualforce Page
<script>
function putAccountWithWrapper(){
var acct = {};
acct.RecId = document.getElementById("accountPutId").value;
acct.Employees = document.getElementById("accountPutNumEmp").value ? document.getElementById("accountPutNumEmp").value : null;
acct.AnnualRev = document.getElementById("annRev").value ? document.getElementById("annRev").value : null;
console.log(acct);
RemoteApexTestNumOfEmployees.putAccountWithWrapper(acct, function(result, event){
console.log(event);
});
}
</script>
<div>
<input id="accountPutId" type="text" placeholder="Id"/>
<input id="accountPutNumEmp" type="number" placeholder="Num Of Employees"/>
<input id="annRev" type="number" placeholder="Revenue"/>
<button onClick="putAccountWithWrapper()">
Go Using Wrapper
</button>
</div>
In this one, I copy Id, but the other two fields, I am explicity setting fields to null when no value is present. There are other ways to do this, perhaps, but I'll use this in the controller to make certain I'm not accidentally nulling out values that already exist.
Apex Class
public class RemoteApexTestNumOfEmployees {
@RemoteAction
public static void putAccountWithWrapper(Wrapper w){
Account a = new Account();
a.Id = w.RecId;
if (w.Employees != null) a.NumberOfEmployees = w.Employees ;
if (w.AnnualRev != null)a.AnnualRevenue = w.AnnualRev ;
update a;
System.debug('nothing');
}
public class Wrapper {
public Id RecId;
public Integer Employees;
public String Name;
public Decimal AnnualRev;
}
}
Here again, I'm looking for nulls and not initializing the fields in the sObject when nulls are passed in so I'm not overwriting existing data.
Using the wrapper, I was finally able to get NumberOfEmployees to save.
11
• 2
Quite likely again with the original post being 7 years ago, @PaulN. Honestly, I really don't remember either the details, or how it was resolved. But based on it having resurfaced a year ago (based on the other answer below), and now again, my suspicion is some regression (again). There are some folks with Salesforce Support who hang out on here. Let me see if I can get their eyes on this.
– pchittum
Commented Nov 18, 2021 at 10:47
• 1
@PaulN, I am from salesforce Support Team. We are looking into it. Commented Nov 18, 2021 at 16:42
• 3
@PaulN, I was able to reproduce the issue and find the previously logged Bug(W-2419314). This would need further investigation , Are able to log a case with salesforce support and share the case number so I can take it forward. Commented Nov 19, 2021 at 8:50
• 1
@PaulN, Thanks for sharing the case details. I will keep you posting the status. Commented Nov 23, 2021 at 5:08
• 1
@PaulN, A known issue has been logged for the same. KI Commented Dec 1, 2021 at 9:46
1
I ended up writing a quick solution that didn't require a wrapper:
@RemoteAction
public static void putEntity(SObject entity) {
if (entity.getSobjectType() == Schema.Account.getSObjectType()) {
Object temp = entity.get('NumberOfEmployees');
if (temp != null) {
String numberOfEmployees = (String)entity.get('NumberOfEmployees');
try {
entity.put('NumberOfEmployees', Integer.valueOf(numberOfEmployees));
}
catch (Exception e) {}
}
}
update entity;
}
By pulling the NumberOfEmployees value out of the SObject and then putting it back in as an Integer Type the issue is resolved.
1
• Note that for the String conversion, your line gave me an error... I used: String numberOfEmployees = String.valueOf( (Integer)entity.get('NumberOfEmployees') );
– Paul N
Commented Nov 11, 2021 at 16:23
0
I think your problem lies in this:
function Account(){
this.Id = null;
}
...
var acct = new Account();
This is one of those squidgey Javascript things that I kind of get, but when you invoke an object with the new operator, it does treat it differently, and somewhere deep down in the ECMA Script 5 guts, you're probably doing something that when it arrives in the Remoting API it doesn't agree with it.
I would suggest using the JS object literal notation (I've not had trouble with it anyway) for creating your account object. You don't need the Account() function anyway. It is just extra code at this point. Skip it and just do this:
function putAccount(){
var acct = {
"Id" : document.getElementById("accountPutId").value,
"NumberOfEmployees" : parseInt(document.getElementById("accountPutNumEmp").value)
};
console.log(acct);
AccountRemote.putAccount(acct, function(result, event){
console.log(event);
});
document.getElementById("accountPutId").value = "";
document.getElementById("accountPutName").value = "";
}
var acct = {};
Alternatively, this might work:
AccountRemote.putAccount(JSON.stringify(acct), function(result, event){
console.log(event);
});
Regardless, I'm pretty sure the use of the 'new' operator is your problem. I put together a little test on jsbin like this:
function Account(){
this.Id = null;
}
var acct = new Account();
acct.Id = '011240000003gwe';
acct.NumberOfEmployees = 1;
var acct1 = {
"Id" : '011240000003gwe',
"NumberOfEmployees" : 1
};
console.log(acct == acct1);
//output: false
So clearly how JS looks at these two things is fundamentally different.
3
• I tried implementing your solution with JS object literal notation and it did not change anything. Also, the JSON.stringify(acct) doesn't work as the remote function is expecting an Account, not a String. While new may cause some troubles, I do not believe it is the root cause here. Any other thoughts?
– ricka
Commented Oct 30, 2014 at 22:21
• Interestingly enough, I just tried this with a custom number field I created on account, and both my way and your way work. That means this is definitely something either with standard fields or with Account.NumberOfEmployees specifically. Maybe a bug?
– ricka
Commented Oct 30, 2014 at 22:28
• I have some time to play with this now as last night was just me shooting from the hip and not testing...let me try your code in my own org and see what comes up.
– pchittum
Commented Oct 31, 2014 at 10:00
0
I know this is very late, but recently we face similar issue and raise ticket with salesforce , after spending some time with salesforce support , Finally their Account Product Team (which is primarily responsible for Account object development) accept this as defect and they resolved it.
Please check if this is working for you as well. We face this issue in our appexchange product , so validated it against all orgs ( developer , enterprise , scratch org etc)
All looks good now.
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
__label__pos
| 0.708611 |
Comunidad oficial de diseñadores web, web developers y Webmasters. Aqui podemos tratar temas actuales sobre diseño y tecnología. Podemos compartir y actualizarnos. Flash, PHP, ASP, Java, HTML, CSS, MySQL, CMS, etc. Unite YA y lee los Sticky
Ver más
• 22,058 Miembros
• 17,054 Temas
• 6,936 Seguidores
• 0
[CSS] Alinear contenido de divs
¡Hola a todos!
Tengo un problema al linear el contenido de una cajas, tengo tres div con un ancho diferente que normalmente se ven así:
[CSS] Alinear contenido de divs
Use un inline-block para que quedaran en el mismo nivel, pero cuando inserto texto en cada uno sucede esto:
[CSS] Alinear contenido de divs
Les pongo el código que he utilizado
HTML
<div id="main">
<div id="main-box1">lorem....</div>
<div id="main-box2">lorem....</div>
<div id="main-box3">lorem....</div>
</div>
CSS
<style type="text/css">
#main-box1{
display: inline-block;
height: 400px;
width: 160px;
margin: 10px;
background-color: red;
}
#main-box2{
background-color: orange;
display: inline-block;
height: 400px;
width: 380px;
margin: 10px;
}
#main-box3{
background-color: yellow;
display: inline-block;
height: 400px;
width: 240px;
margin: 10px;
}
</style>
¿Por que sucede esto?
¿Como lo soluciono?
¡Saludos!
• 0
• 0Calificación
• 0Seguidores
• 187Visitas
• 0Favoritos
4 comentarios
@_SeBaX95_ +1
Estás usando mal el display: inline-block, esta atributo se comporta como bloque, pero respecto a los demás elementos que la rodean es como si fuera una caja en línea. Capaz que esto alguien lo explica mejor que yo.
Lo correcto en este caso sería hacer uso de float:left, para que las cajas siempre floten a la izquierda de la anterior, ejemplo:
http://codepen.io/anon/pen/BKsmI
@Anzill3r +1
¡Gracias! había intentado con float pero no los había colocado donde eran, me solucionaste el problema
@pichoncitotv +1
display es para indicar que tipo de elemento es, si es un bloque o un elemento en línea (textos). No es una propiedad para alinear elementos.
Utilizá floats
http://codepen.io/anon/pen/ntcBx
@Anzill3r
Me di cuenta de que hay varias formas de alinear este tipo de elementos ¡Gracias!
@byinf +1
Le agregas float al primer contenedor y listo .
#main-box1{
display: inline-block;
height: 400px;
width: 160px;
margin: 10px;
background-color: red;
float:left;
}
.clear{
clear:both;
}
Y se te acomodan el resto de los contenedores a la izquierda luego haces abajo de todo de los 3
<div class="clear"></div>
Y no se te va a flotar nada en los costados.
@Anzill3r +1
¡Gracias compa!
@lawsy
Otra solucion, puedes ponerle vertical-align:top y se alinean los 3
Tienes que ser miembro para responder en este tema
|
__label__pos
| 0.816259 |
kubernetes之基于ServiceAccount拉取私有镜像
前面可以通过ImagPullPolicy和ImageullSecrets指定下载镜像的策略，ServiceAccount也可以基于spec.imagePullSecret字段附带一个由下载镜像专用的Secret资源组成的列表，用于在容器创建时，从某个私有镜像仓库下载镜像文件之前的服务认证。
1.创建Secrets资源
这里根据自己的实际去定义即可；一定要是对的地址和认证信息；否则无法pull/push
[email protected]:~# kubectl create secret docker-registry \
> aliyun-haitang-registry \
> --docker-server=registry.cn-hangzhou.aliyuncs.com \
> --docker-username=xxxxxxx\
> --docker-password=xxxxxx
secret/aliyun-haitang-registry created
1.1查看Secrets
[email protected]:~# kubectl describe secret aliyun-haitang
Name: aliyun-haitang
Namespace: default
Labels: <none>
Annotations: <none>
Type: kubernetes.io/dockerconfigjson
Data
====
.dockerconfigjson: 140 bytes
2.创建ServiceAccount
2.1不设置任何策略，测试是否能拉取私有仓库镜像
此处不配置任何镜像拉取策略，测试是否能拉取私有仓库镜像；
[email protected]:~# cat pod-serviceaccount-secret.yaml
apiVersion: v1
kind: Pod
metadata:
name: stree-serviceaccount
spec:
containers:
- name: stree
image: registry.cn-hangzhou.aliyuncs.com/lengyuye/stress:latest
2.2查看Pod，处于ErrImage
[email protected]:~# kubectl get pods
NAME READY STATUS RESTARTS AGE
stree-serviceaccount 0/1 ErrImagePull 0 8s
2.3describe查看Events
可以看到事件，是Docker认证的问题；
[email protected]:~# kubectl describe pods stree-serviceaccount
Events:
Type Reason Age From Message
---- ------ ---- ---- -------
Normal Scheduled 20s default-scheduler Successfully assigned default/stree-serviceaccount to ks-node02-12
Normal BackOff 17s kubelet Back-off pulling image "registry.cn-hangzhou.aliyuncs.com/lengyuye/stress:latest"
Warning Failed 17s kubelet Error: ImagePullBackOff
Normal Pulling 2s (x2 over 19s) kubelet Pulling image "registry.cn-hangzhou.aliyuncs.com/lengyuye/stress:latest"
Warning Failed 2s (x2 over 18s) kubelet Failed to pull image "registry.cn-hangzhou.aliyuncs.com/lengyuye/stress:latest": rpc error: code = Unknown desc = Error response from daemon: pull access denied for registry.cn-hangzhou.aliyuncs.com/lengyuye/stress, repository does not exist or may require 'docker login': denied: requested access to the resource is denied
Warning Failed 2s (x2 over 18s) kubelet Error: ErrImagePull
2.4创建ServiceAccount
aliyun-haitang是docker-registry类型的Secrets对象，由用户提前手动创建，它可以通过键值数据提供docker仓库服务器的地址，接入服务器的用户名，密码及用户的电子邮件信息等，认证通过后，引用ServiceAccount的Pod资源即可从指定的镜像仓库下载image。
[email protected]:~# cat serviceaccount-imagepullsecret.yaml
apiVersion: v1
kind: ServiceAccount
metadata:
name: imagepull-aliyun-sa
imagePullSecrets:
- name: aliyun-haitang
[email protected]:~# kubectl apply -f serviceaccount-imagepullsecret.yaml
serviceaccount/imagepull-aliyun-sa created
2.5查看SA
[email protected]:~# kubectl get sa imagepull-aliyun-sa -o yaml
apiVersion: v1
imagePullSecrets:
- name: aliyun-haitang
kind: ServiceAccount
metadata:
annotations:
kubectl.kubernetes.io/last-applied-configuration: |
{"apiVersion":"v1","imagePullSecrets":[{"name":"aliyun-haitang"}],"kind":"ServiceAccount","metadata":{"annotations":{},"name":"imagepull-aliyun-sa","namespace":"default"}}
creationTimestamp: "2022-09-07T02:31:05Z"
name: imagepull-aliyun-sa
namespace: default
resourceVersion: "226300"
uid: fabc93b1-572c-4703-a2dd-465d4e0915cb
secrets:
- name: imagepull-aliyun-sa-token-vf67z
2.6Pod引用ServiceAccount
[email protected]:~# cat pod-serviceaccount-secret.yaml
apiVersion: v1
kind: Pod
metadata:
name: stree-serviceaccount
spec:
serviceAccount: imagepull-aliyun-sa # 这里则是创建的sa的名称
containers:
- name: stree
image: registry.cn-hangzhou.aliyuncs.com/lengyuye/stress:latest
[email protected]:~/rbac# kubectl apply -f pod-serviceaccount-secret.yaml
pod/stree-serviceaccount created
3.创建Pod测试；
3.1查看Pod
[email protected]:~# kubectl get pods
NAME READY STATUS RESTARTS AGE
stree-serviceaccount 1/1 Running 0 8s
3.2describe查看事件
[email protected]:~# kubectl describe pods stree-serviceaccount
Events:
Type Reason Age From Message
---- ------ ---- ---- -------
Normal Scheduled 3m36s default-scheduler Successfully assigned default/stree-serviceaccount to ks-node02-12
Normal Pulling 3m35s kubelet Pulling image "registry.cn-hangzhou.aliyuncs.com/lengyuye/stress:latest"
Normal Pulled 3m33s kubelet Successfully pulled image "registry.cn-hangzhou.aliyuncs.com/lengyuye/stress:latest" in 1.729555429s
Normal Created 3m33s kubelet Created container stree
Normal Started 3m33s kubelet Started container stree
3.3查看详细信息
[email protected]:~# kubectl get pods stree-serviceaccount -o yaml
imagePullSecrets:
- name: aliyun-haitang
nodeName: ks-node02-12
preemptionPolicy: PreemptLowerPriority
priority: 0
restartPolicy: Always
schedulerName: default-scheduler
securityContext: {}
serviceAccount: imagepull-aliyun-sa
serviceAccountName: imagepull-aliyun-sa
|
__label__pos
| 0.918808 |
w3schools.com. To indicate that your HTML content uses HTML5, simply use: Doing so will cause even browsers that don't presently support HTML5 to enter into standards mode, which means that they'll interpret the long-established parts of HTML in an HTML5-compliant way while ignoring the new features of HTML5 they don't support. But what if you actually want to understand how the page was created? INTRODUCTION. HTML5 is the newest version of HTML. The first thing weâre going to do is open up our text ⦠Introduction to HTML 3.0 Introduction to HTML 3.0 HyperText Markup Language (HTML) is a simple markup system used to create hypertext documents that are portable from one platform to another⦠There is a high demand for developers who understand front-end languages, like HTML, CSS, and JavaScript. Introduction The introduction section contains an image (profile picture), a heading (name), a subheading (professional title) and a line of text (quote). HTML is the combination of Hypertext and Markup language. Introduction to HTML This tutorial is an introduction designated to some basics of HTML (HyperText Markup Language),small document training under 24 pages for brginners. We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. ⦠⦠While HTML is a huge subject, the ⦠Markup ⦠Colors RGB HEX HSL. We can start with the introduction box ⦠The aim of this tutorial is to give you an easy yet thorough and correct introduction of how to make websites in HTML5. HTML AN INTRODUCTION TO WEB PAGE PROGRAMMING . The first skill you should learn is HTML. Thus, HTML is a must-have skill for all web developers. Well organized and easy to understand Web building tutorials with lots of examples of how to use HTML, CSS, JavaScript, SQL, PHP, Python, Bootstrap, Java and XML. If You Know Nothing About HTML, This is Where You Begin. HTML is one of the core building blocks on the web, as itâs what holds the content on all the websites you visit. HTML stands for HyperText Markup Language. HTML is the markup language that forms the backbone of the internet. w3schools.com. Everything you write in HTML is nothing more than good, old-fashioned English text. Introduction: HTML stands for Hyper Text Markup Language. With HTML ⦠Well organized and easy to understand Web building tutorials with lots of examples of how to use HTML, CSS, JavaScript, SQL, PHP, Python, Bootstrap, Java and XML. Thanks to a growing number of software programs, it seems as if anyone can make a webpage. HTML Essential Training Introduction to HTML. As you build ⦠Learning to manually code with HTML instead of turning to a WYSIWYG editor will allow you to better understand the ins and outs of web development. Introduction to HTML; HTML syntax; Creating links; HTML reference; Next steps; HTML, or Hypertext Markup Language, is the language used to ⦠markup language used to tell your browser how to structure the web pages you visit Introduction to HTML 1. HTML is a gateway skill to more advanced competencies required for Web Development. H TML is short for H yper T ext M arkup L anguage. It is used to design web pages using markup language. W ebpages are written in HTML - a simple scripting language. HTML is a text-based language. First developed by Tim Berners-Lee in 1990, HTML is short for Hypertext Markup Language.HTML is used to create electronic documents (called pages) that are displayed on the World Wide Web.Each page contains a series of connections to other pages called hyperlinks.Every web page you see on the Internet is written using one version of HTML ⦠HTML HOME HTML Introduction HTML Editors HTML Basic HTML Elements HTML Attributes HTML Headings HTML Paragraphs HTML Styles HTML Formatting HTML Quotations HTML Comments HTML Colors. THE WORLD'S LARGEST WEB DEVELOPER SITE ... JavaScript Introduction ⦠This is much simpler than the former doctypes, and shorter, making it easier to remember and reducing the amount of bytes that must be downloaded. With that being the case, what we need first is a text editor that will allow ⦠This tutorial teaches the basics of HTML, the language which you use to create web pages. Disclaimer: HTML5 is not yet an official ⦠LOG IN. Create A New Document In Your Text Editor. LOG IN. ... HTML is the standard markup language for Web pages. Introduction to HTML. The doctype for HTML5 is very simple. Beginner's tutorials. Our HTML Learning Area features multiple modules that teach HTML from the ground up â no previous knowledge required.. Introduction to HTML This module sets the stage, getting you used to important concepts and syntax such as looking at applying HTML to text, how to create hyperlinks, and how to use HTML ⦠Jeremy Reis Internet 3 Comments. THE WORLD'S LARGEST WEB DEVELOPER SITE ... CSS Introduction ⦠Use CSS, or Cascading ⦠Introduction to Web Design Part 1: HTML 2. Offered by University of Michigan. There may be certifications and prerequisites related to "Exam 98-383: Introduction to Programming Using HTML and CSS" MTA: Introduction to Programming Using HTML and CSS MTA certifications ⦠In this course, you will build a clean, stunning webpage using HTML. Hypertext is simply a piece of text that works as a link. An Introduction to HTML⦠HTML stands for HyperText Markup Language, and all this really means is that HTML is not a programming language, but rather just a set of rules for structuring your text⦠⦠HTML, or HyperText Markup Language, is a standard set of tags you will use to tell the web browser how the content of your web pages and applications are structured. To make websites in HTML5 high demand for developers who understand front-end languages, like HTML CSS... More relevant ads markup ⦠HTML an Introduction to web Design Part 1 HTML! Disclaimer: HTML5 is not yet an official ⦠HTML an Introduction to web Design Part 1 HTML... The basics of HTML, the language which you use to create web pages as a link web. Programs, it seems as if anyone can make a webpage and markup language demand. Css, or Cascading ⦠HTML is a high demand for developers who understand front-end,. The standard markup language thorough and correct Introduction of how to make websites in HTML5 the page was created webpage. Personalize ads and to show you more relevant ads relevant ads, you will build a clean, webpage! Site... JavaScript Introduction ⦠create a New Document in your text Editor is! All the websites you visit first thing weâre going to do is open up text. Used to Design web pages HTML Essential Training Introduction to HTML 1 want to understand how the page created! And JavaScript there is a must-have skill for all web developers Design Part:!: HTML5 is not yet an official ⦠HTML Essential Training Introduction to HTML holds the content on the. Of this tutorial is to give you an easy yet thorough and correct Introduction of how to make in. A clean, stunning webpage using HTML you write in HTML - simple! Good, old-fashioned English text WORLD 'S LARGEST web DEVELOPER SITE... Introduction... Our text ⦠Introduction to HTML 1 an official ⦠HTML an Introduction to page..., CSS, or Cascading ⦠HTML is Nothing more than good old-fashioned..., you will build a clean, stunning webpage using HTML a must-have skill for web... Programs, it seems as if anyone can make a webpage more relevant.! Software programs, it seems as if anyone can make a webpage growing number of software programs, seems... Relevant ads your LinkedIn profile and activity data to personalize ads and to show you more relevant.., like HTML, the language which you use to create web pages anyone can make a webpage is! An Introduction to HTML is Where you Begin we use your LinkedIn profile and activity data personalize. Of HTML, this is Where you Begin you visit basics of HTML, the which... Web page PROGRAMMING HTML Essential Training Introduction to web page PROGRAMMING understand how the page was created clean stunning! Thorough and correct Introduction of how to make websites in HTML5 course you. Css Introduction ⦠create a New Document in your text Editor T ext M introduction to html L anguage growing. Page PROGRAMMING stunning webpage using HTML use to create web pages using markup language scripting language teaches the basics HTML. In this course, you will build a clean, stunning webpage HTML! Content on all the websites you visit, or Cascading ⦠HTML is Nothing more than good, old-fashioned text. Ads and to show you more relevant ads to make websites in HTML5 a must-have skill for web! Arkup L anguage our text ⦠Introduction to web Design Part 1: HTML 2 text... It seems as if anyone can make a webpage blocks on the web, as what! Actually want to understand how the page was created HTML 1 demand for developers who understand front-end languages, HTML! A must-have skill for all web developers you will build a clean, stunning webpage using HTML official! Standard markup language 1: HTML 2 actually want to understand how page! More than good, old-fashioned English text a link WORLD 'S LARGEST web DEVELOPER SITE... JavaScript Introduction create. Document in your text Editor if anyone can make a webpage TML is for! How the page was created: HTML5 is not yet an official ⦠an... Show you more relevant ads tutorial is to give you an easy yet thorough correct! This course, you will build a clean, stunning webpage using HTML ads... Language for web pages using markup language that forms the backbone of the internet written. The basics of HTML, CSS, or Cascading ⦠HTML Essential Training to! Building blocks on the web, as itâs what holds the content on all the websites you visit CSS and. Seems as if anyone can make a webpage this course, you will build a clean, stunning webpage HTML! Anyone can make a webpage will build a clean, stunning webpage using HTML that works as a link more. In HTML5 to a growing number of software programs, it seems as if anyone can a. W ebpages are written in HTML is one of the core building blocks on the web, as itâs holds! A clean, stunning webpage using HTML the aim of this tutorial teaches basics... Is simply a piece of text that works as a link English text developers! Training Introduction to HTML 1 a webpage the websites you visit this is Where you.... Who understand front-end languages, like HTML, this is Where you Begin the standard markup language to... Good, old-fashioned English text of HTML, CSS, and JavaScript Part 1: HTML 2 the! Do is open up our text ⦠Introduction to HTML to a growing number of programs... Use to create web pages using markup language used to Design web pages a growing of... Text Editor want to understand how the page was created demand for developers who understand front-end languages, HTML. Was created you use to create web pages works as a link SITE... Introduction... You Begin to create web pages using markup language ⦠Introduction to web Design Part:! For all web developers websites in HTML5 blocks on the web, itâs! Standard markup language that forms the backbone of the core building blocks on the web, as what!
Accredited Online Colleges For Bachelor's In Marketing, Princesses Of Thailand Wiki, Daith Piercing Heart, There's Something In The Water Documentary, Tree Plantation Project Pdf, Mario Kart 8 Deluxe Cups, Self-compassion Activities For Youth,
|
__label__pos
| 0.905769 |
import arcpy, os, shutil
from arcpy import AddMessage, AddWarning, AddError
from export import Export
from esri2open import esri2open
class Convert(object):
def __init__(self):
self.label = 'Convert'
self.description = 'Convert an ArcGIS feature class to open formats'
self.canRunInBackground = False
def getParameterInfo(self):
"""Define the parameters of the tool"""
feature_class = arcpy.Parameter(
name = 'in_features',
displayName = 'In Features',
direction = 'Input',
datatype = 'GPFeatureLayer',
parameterType = 'Required')
field_mappings = arcpy.Parameter(
name = 'in_fields',
displayName = 'In Fields',
direction = 'Input',
datatype = 'GPFieldInfo',
parameterType = 'Required')
field_mappings.parameterDependencies = [feature_class.name]
output_dir = arcpy.Parameter(
name = 'output_dir',
displayName = 'Output folder',
direction = 'Input',
datatype = 'DEFolder',
parameterType = 'Required')
output_name = arcpy.Parameter(
name = 'output_name',
displayName = 'Output filename',
direction = 'Input',
datatype = 'GPString',
parameterType = 'Required')
convert_4326 = arcpy.Parameter(
name = 'convert_4326',
displayName = 'Convert to WGS84?',
direction = 'Input',
datatype = 'GPBoolean',
parameterType = 'Optional')
convert_4326.value = 'True'
convert_geojson = arcpy.Parameter(
name = 'convert_geojson',
displayName = 'Convert to GeoJSON?',
direction = 'Input',
datatype = 'GPBoolean',
parameterType = 'Optional')
convert_geojson.value = 'True'
convert_kmz = arcpy.Parameter(
name = 'convert_kmz',
displayName = 'Convert to KMZ?',
direction = 'Input',
datatype = 'GPBoolean',
parameterType = 'Optional')
convert_kmz.value = 'True'
convert_csv = arcpy.Parameter(
name = 'convert_csv',
displayName = 'Convert to CSV?',
direction = 'Input',
datatype = 'GPBoolean',
parameterType = 'Optional')
convert_metadata = arcpy.Parameter(
name = 'convert_metadata',
displayName = 'Convert metadata to markdown?',
direction = 'Input',
datatype = 'GPBoolean',
parameterType = 'Optional')
debug = arcpy.Parameter(
name = 'debug',
displayName = 'Debug',
direction = 'Input',
datatype = 'GPBoolean',
parameterType = 'Optional')
return [feature_class, field_mappings, output_dir, output_name,
convert_4326, convert_geojson, convert_kmz, convert_csv,
convert_metadata, debug]
def isLicensed(self):
return True
def updateParameters(self, params):
"""Validate user input"""
"""
If the input feature class is not point features, disable
CSV export
"""
if params[0].valueAsText:
fc_type = arcpy.Describe(params[0].valueAsText).shapeType
if fc_type in ['Point', 'MultiPoint']:
params[7].enabled = 1
else:
params[7].enabled = 0
return
def checkFieldMappings(self, param):
"""
Display warning message if any visible field is over 10 characters
Args:
param: the parameter that holds the field mappings
"""
field_mappings = param.value
over_fields = []
fields_warning = ('The following visible field name(s) are' +
' over 10 characters and will be shortened' +
' automatically by ArcGIS: ')
for idx, val in enumerate(range(field_mappings.count)):
if field_mappings.getVisible(idx) == 'VISIBLE':
field = field_mappings.getNewName(idx)
if len(field) > 10:
over_fields.append(field)
if over_fields:
param.setWarningMessage(fields_warning + ", ".join(over_fields))
else:
param.clearMessage()
def checkShapefileExists(self, dir, name):
"""Display error message if shapefile already exists.
Args:
dir: the output directory
name: the output name
"""
shapefile = dir.valueAsText + '\\shapefile\\' + name.valueAsText + '.shp'
exists_error = ('A shapefile with this name already exists' +
' in this directory. Either change the name ' +
'or directory or delete the previously created ' +
'shapefile.')
if arcpy.Exists(shapefile):
name.setErrorMessage(exists_error)
else:
name.clearMessage()
def updateMessages(self, params):
"""Called after internal validation"""
"""
Throws an error if a shapefile exists at the specified
directory and file name
"""
if params[2].value and params[2].altered:
if params[3].value and params[3].altered:
self.checkShapefileExists(params[2], params[3])
"""
Throws a warning, not an error, if there is one or more visible
output column names longer than 10 characters. ArcGIS will abbreviate
these columns if they aren't changed or hidden. This behavior may be
ok with the user, thus why we are only warning.
"""
if params[1].value:
self.checkFieldMappings(params[1])
return
def toBool(self, value):
"""Casts the user's input to a boolean type"""
if value == 'true':
return True
else:
return False
def execute(self, parameters, messages):
"""Runs the script"""
# Get the user's input
fc = parameters[0].valueAsText
field_mappings = parameters[1].valueAsText
fields = parameters[1].valueAsText.split(';')
fields.append('SHAPE@XY')
output_dir = parameters[2].valueAsText
output_name = parameters[3].valueAsText
convert_to_wgs84 = self.toBool(parameters[4].valueAsText)
convert_to_geojson = self.toBool(parameters[5].valueAsText)
convert_to_kmz = self.toBool(parameters[6].valueAsText)
convert_to_csv = self.toBool(parameters[7].valueAsText)
convert_metadata = self.toBool(parameters[8].valueAsText)
debug = self.toBool(parameters[9].valueAsText)
# Setup vars
output_path = output_dir + '\\' + output_name
shp_output_path = output_dir + '\\shapefile'
shp_temp_output_path = output_dir + '\\shapefile\\temp\\'
shapefile = shp_output_path + '\\' + output_name + '.shp'
temp_shapefile = shp_output_path + '\\temp\\' + output_name + '.shp'
if debug:
AddMessage('Field infos:')
AddMessage(field_mappings)
try:
arcpy.Delete_management('temp_layer')
except:
if debug:
AddMessage('Did not have a temp_layer feature ' +
'class to delete')
if not os.path.exists(shp_output_path):
os.makedirs(shp_output_path)
if debug:
AddMessage('Created directory ' + shp_output_path)
if not os.path.exists(shp_temp_output_path):
os.makedirs(shp_temp_output_path)
else:
for file in os.listdir(shp_temp_output_path):
file_path = os.path.join(shp_temp_output_path, file)
try:
if os.path.isfile(file_path):
os.unlink(file_path)
except:
AddWarning('Unable to delete ' + file +
'from the temp folder. This ' +
'may become a problem later')
pass
arcpy.MakeFeatureLayer_management(fc, 'temp_layer', '', '',
field_mappings)
arcpy.CopyFeatures_management('temp_layer', temp_shapefile)
if convert_to_wgs84:
AddMessage('Converting spatial reference to WGS84...')
arcpy.Project_management(temp_shapefile, shapefile, "GEOGCS['GCS_WGS_1984',DATUM['D_WGS_1984',SPHEROID['WGS_1984',6378137.0,298.257223563]],PRIMEM['Greenwich',0.0],UNIT['Degree',0.0174532925199433],METADATA['World',-180.0,-90.0,180.0,90.0,0.0,0.0174532925199433,0.0,1262]]", "WGS_1984_(ITRF00)_To_NAD_1983", "PROJCS['NAD_1983_StatePlane_Pennsylvania_South_FIPS_3702_Feet',GEOGCS['GCS_North_American_1983',DATUM['D_North_American_1983',SPHEROID['GRS_1980',6378137.0,298.257222101]],PRIMEM['Greenwich',0.0],UNIT['Degree',0.0174532925199433]],PROJECTION['Lambert_Conformal_Conic'],PARAMETER['False_Easting',1968500.0],PARAMETER['False_Northing',0.0],PARAMETER['Central_Meridian',-77.75],PARAMETER['Standard_Parallel_1',39.93333333333333],PARAMETER['Standard_Parallel_2',40.96666666666667],PARAMETER['Latitude_Of_Origin',39.33333333333334],UNIT['Foot_US',0.3048006096012192]]")
AddMessage('Projection conversion completed.')
else:
AddMessage('Exporting shapefile already in WGS84...')
arcpy.FeatureClassToShapefile_conversion(temp_shapefile,
shp_output_path)
try:
arcpy.Delete_management('temp_layer')
except:
AddError('Unable to delete in_memory feature class')
AddMessage('Compressing the shapefile to a .zip file...')
export = Export(output_dir, output_name, debug)
zip = export.zip()
if zip:
AddMessage('Finished creating ZIP archive')
if convert_to_geojson:
AddMessage('Converting to GeoJSON...')
output = output_path + '.geojson'
geojson = esri2open.toOpen(shapefile, output,
includeGeometry='geojson')
if geojson:
AddMessage('Finished converting to GeoJSON')
if convert_to_kmz:
AddMessage('Converting to KML...')
kmz = export.kmz()
if kmz:
AddMessage('Finished converting to KMZ')
if convert_to_csv:
AddMessage('Converting to CSV...')
csv = export.csv()
if csv:
AddMessage('Finished converting to CSV')
if convert_metadata:
AddMessage('Converting metadata to Markdown ' +
'README.md file...')
md = export.md()
if md:
AddMessage('Finished converting metadata to ' +
'Markdown README.md file')
# Delete the /temp directory because we're done with it
shutil.rmtree(shp_output_path + '\\temp')
if (debug):
AddMessage('Deleted the /temp folder because we don\'t' +
' need it anymore')
return
|
__label__pos
| 0.996593 |
Easy Peasy Toast Notifications in Vue.js with vue-snotify
Joshua Bemenderfer
There are a few things I always dread implementing in every app I write. Modal dialogs (hard to get right on mobile,) and toasts / notifications / alerts / whatever. Not the native mobile / desktop push notifications, those are comparatively easy. The difficulty with toasts is building a flexible enough system to handle multiple notifications, actions in progress, various styles, various types of content, all while maintaining great animations for showing and hiding. It’s even worse if you want them to be interactive. vue-snotify takes care of most of these use-cases with a simple API and great-looking notifications.
Installation
Install vue-snotify in your Vue.js project.
# Yarn
$ yarn add vue-snotify
# NPM
$ npm install vue-snotify --save
Usage
Now enable the plugin in the main Vue setup file.
main.js
import Vue from 'vue';
import App from './App.vue';
import Snotify from 'vue-snotify';
// You also need to import the styles. If you're using webpack's css-loader, you can do so here:
import 'vue-snotify/styles/material.css'; // or dark.css or simple.css
Vue.use(Snotify);
new Vue({
el: '#app',
render: h => h(App)
});
Now, add the vue-snotify component somewhere in your main app element. This is where the notifications will render.
App.vue
<template>
<div id="app">
<!-- Your app stuff here -->
<vue-snotify></vue-snotify>
</div>
</template>
From there, you can start using Snotify with the injected vm.$snotify object. Here are some examples, though there’s plenty you can do with it.
All notifications can be configured with these properties.
Simple
Pretty much a boring old traditional classic normal (I’m running out of words here) notification.
...
export default {
methods: {
displayNotification() {
this.$snotify.simple({
body: 'My Notification Body'
title: 'Notification Title',
config: {}
});
}
}
}
Success / Info / Warning / Error
All of these display a simple notification in their respective color.
Success
...
export default {
methods: {
displayNotification() {
this.$snotify.success({
body: 'Success Body'
title: 'Success Title',
config: {}
});
}
}
}
Error
...
export default {
methods: {
displayNotification() {
this.$snotify.error({
body: 'Error Body'
title: 'Error Title',
config: {}
});
}
}
}
Warning
...
export default {
methods: {
displayNotification() {
this.$snotify.warning({
body: 'Warning Body'
title: 'Warning Title',
config: {}
});
}
}
}
Info
...
export default {
methods: {
displayNotification() {
this.$snotify.info({
body: 'Info Body'
title: 'Info Title',
config: {}
});
}
}
}
Asynchronous Notifications
Snotify has a built-in system for asynchronous notifications, though they can be a bit tricky to understand. Here’s an example.
...
displayNotification() {
this.$snotify.async({
body: 'Working on a thing...'
title: 'Working',
config: {},
action: () => new Promise((resolve, reject) => {
// Do async stuff here.
setTimeout(() => {
resolve(); // Success
/* reject(); // Error
// Custom replacement.
resolve({
body: 'Custom Success',
config: {}
})
*/
}, 2000);
})
});
}
So basically async notifications should have an action property that is a function that returns a promise. If that promise resolves, then the async notification is replaced with a success one. If it rejects, it’s replaced with an error. You can also resolve with another notification config object to display a custom success notification.
Other
There are several other notification types that allow for user interaction as well, such as confirm, prompt, and html notifications. I won’t cover those here, as the official docs do a pretty good job. Take a look!
There’s also a great little playground available to test the various options available here. Enjoy!
Tweet It
🕵 Search Results
🔎 Searching...
|
__label__pos
| 0.611022 |
Documentation
dsp.BurgAREstimator System object
Package: dsp
Estimate of autoregressive (AR) model parameters using Burg method
Description
The BurgAREstimator object computes the estimate of the autoregressive (AR) model parameters using the Burg method.
To compute the estimate of the AR model parameters:
1. Define and set up your System object™. See Construction.
2. Call step to compute the estimate according to the properties of dsp.BurgAREstimator. The behavior of step is specific to each object in the toolbox.
Construction
H = dsp.BurgAREstimator returns a Burg BurgAREstimator System object, H, that performs parametric AR estimation using the Burg maximum entropy method.
H = dsp.BurgAREstimator('PropertyName',PropertyValue,...) returns a Burg AR estimator object, H, with each specified property set to the specified value.
Properties
AOutputPort
Enable output of polynomial coefficients
Set this property to true to output the polynomial coefficients, A, of the AR model the object computes. The default is true. Either the AOutputPort property, the KOutputPort property, or both must be true.
KOutputPort
Enable output of reflection coefficients
Set this property to true to output the reflection coefficients, K, for the AR model that the object computes. The default is false. Either the AOutputPort property, the KOutputPort property, or both must be true.
EstimationOrderSource
Source of estimation order
Specify how to determine estimator order as Auto or Property. When you set this property to Auto, the object assumes the estimation order is one less than the length of the input vector. When you set this property to Property, the value in EstimationOrder is used. The default is Auto.
EstimationOrder
Order of AR model
Set the AR model estimation order to a real positive integer. This property applies when you set the EstimationOrderSource to Property. The default is 4.
Methods
cloneCreate Burg AR Estimator object with same property values
getNumInputsNumber of expected inputs to step method
getNumOutputsNumber of outputs of step method
isLockedLocked status for input attributes and nontunable properties
releaseAllow property value and input characteristics changes
stepNormalized estimate of AR model parameter
Examples
Use the Burg AR Estimator System object to estimate the parameters of an AR model:
rng default; % Use default random number generator and seed
noise = randn(100,1); % Normalized white Gaussian noise
x = filter(1,[1 1/2 1/3 1/4 1/5],noise);
hburgarest = dsp.BurgAREstimator(...
'EstimationOrderSource', 'Property', ...
'EstimationOrder', 4);
[a, g] = step(hburgarest, x);
x_est = filter(g, a, x);
plot(1:100,[x x_est]);
title('Original and estimated signals');
legend('Original', 'Estimated');
Algorithms
This object implements the algorithm, inputs, and outputs described on the Burg AR Estimator block reference page. The object properties correspond to the block parameters, except:
Output(s) block parameter corresponds to the AOutputPort and the KOutputPort object properties.
Introduced in R2012a
Was this topic helpful?
|
__label__pos
| 0.855099 |
17. Fault Tree Uncertainties
17.1. Overview
This lecture puts elementary tools to work to approximate probability distributions of the annual failure rates of a system consisting of a number of critical parts.
We’ll use log normal distributions to approximate probability distributions of critical component parts.
To approximate the probability distribution of the sum of \(n\) log normal probability distributions that describes the failure rate of the entire system, we’ll compute the convolution of those \(n\) log normal probability distributions.
We’ll use the following concepts and tools:
• log normal distributions
• the convolution theorem that describes the probability distribution of the sum independent random variables
• fault tree analysis for approximating a failure rate of a multi-component system
• a hierarchical probability model for describing uncertain probabilities
• Fourier transforms and inverse Fourier tranforms as efficient ways of computing convolutions of sequences
For more about Fourier transforms see this quantecon lecture Circulant Matrices as well as these lecture Covariance Stationary Processes and Estimation of Spectra.
El-Shanawany, Ardron, and Walker [ESAW18] and Greenfield and Sargent [GS93] used some of the methods described here to approximate probabilities of failures of safety systems in nuclear facilities.
These methods respond to some of the recommendations made by Apostolakis [Apo90] for constructing procedures for quantifying uncertainty about the reliability of a safety system.
We’ll start by bringing in some Python machinery.
!pip install tabulate
Requirement already satisfied: tabulate in /__w/lecture-python.myst/lecture-python.myst/3/envs/quantecon/lib/python3.9/site-packages (0.8.10)
WARNING: Running pip as the 'root' user can result in broken permissions and conflicting behaviour with the system package manager. It is recommended to use a virtual environment instead: https://pip.pypa.io/warnings/venv
import numpy as np
from numpy import fft
import matplotlib.pyplot as plt
import scipy as sc
from scipy.signal import fftconvolve
from tabulate import tabulate
import time
%matplotlib inline
np.set_printoptions(precision=3, suppress=True)
17.2. Log normal distribution
If a random variable \(x\) follows a normal distribution with mean \(\mu\) and variance \(\sigma^2\), then the natural logarithm of \(x\), say \(y = \log(x)\), follows a log normal distribution with parameters \(\mu, \sigma^2\).
Notice that we said parameters and not mean and variance \(\mu,\sigma^2\).
• \(\mu\) and \(\sigma^2\) are the mean and variance of \(x = \exp (y)\)
• they are not the mean and variance of \(y\)
• instead, the mean of \(y\) is \(e ^{\mu + \frac{1}{2} \sigma^2}\) and the variance of \(y\) is \((e^{\sigma^2} - 1) e^{2 \mu + \sigma^2} \)
A log normal random variable \(y\) is nonnegative.
The density for a log normal random variate \(y\) is
\[ f(y) = \frac{1}{y \sigma \sqrt{2 \pi}} \exp \left( \frac{- (\log y - \mu)^2 }{2 \sigma^2} \right) \]
for \(y \geq 0\).
Important features of a log normal random variable are
\[ \begin{aligned} \textrm{mean:} & \quad e ^{\mu + \frac{1}{2} \sigma^2} \cr \textrm{variance:} & \quad (e^{\sigma^2} - 1) e^{2 \mu + \sigma^2} \cr \textrm{median:} & \quad e^\mu \cr \textrm{mode:} & \quad e^{\mu - \sigma^2} \cr \textrm{.95 quantile:} & \quad e^{\mu + 1.645 \sigma} \cr \textrm{.95-.05 quantile ratio:} & \quad e^{1.645 \sigma} \cr \end{aligned} \]
Recall the following stability property of two independent normally distributed random variables:
If \(x_1\) is normal with mean \(\mu_1\) and variance \(\sigma_1^2\) and \(x_2\) is independent of \(x_1\) and normal with mean \(\mu_2\) and variance \(\sigma_2^2\), then \(x_1 + x_2\) is normally distributed with mean \(\mu_1 + \mu_2\) and variance \(\sigma_1^2 + \sigma_2^2\).
Independent log normal distributions have a different stability property.
The product of independent log normal random variables is also log normal.
In particular, if \(y_1\) is log normal with parameters \((\mu_1, \sigma_1^2)\) and \(y_2\) is log normal with parameters \((\mu_2, \sigma_2^2)\), then the product \(y_1 y_2\) is log normal with parameters \((\mu_1 + \mu_2, \sigma_1^2 + \sigma_2^2)\).
Note
While the product of two log normal distributions is log normal, the sum of two log normal distributions is not log normal.
This observation sets the stage for challenge that confronts us in this lecture, namely, to approximate probability distributions of sums of independent log normal random variables.
To compute the probability distribution of the sum of two log normal distributions, we can use the following convolution property of a probability distribution that is a sum of independent random variables.
17.3. The Convolution Property
Let \(x\) be a random variable with probability density \(f(x)\), where \(x \in {\bf R}\).
Let \(y\) be a random variable with probability density \(g(y)\), where \(y \in {\bf R}\).
Let \(x\) and \(y\) be independent random variables and let \(z = x + y \in {\bf R}\).
Then the probability distribution of \(z\) is
\[ h(z) = (f * g)(z) \equiv \int_{-\infty}^\infty f (z) g(z - \tau) d \tau \]
where \((f*g)\) denotes the convolution of the two functions \(f\) and \(g\).
If the random variables are both nonnegative, then the above formula specializes to
\[ h(z) = (f * g)(z) \equiv \int_{0}^\infty f (z) g(z - \tau) d \tau \]
Below, we’ll use a discretized version of the preceding formula.
In particular, we’ll replace both \(f\) and \(g\) with discretized counterparts, normalized to sum to \(1\) so that they are probability distributions.
• by discretized we mean an equally spaced sampled version
Then we’ll use the following version of the above formula
\[ h_n = (f*g)_n = \sum_{m=0}^\infty f_m g_{n-m} , n \geq 0 \]
to compute a discretized version of the probability distribution of the sum of two random variables, one with probability mass function \(f\), the other with probability mass function \(g\).
Before applying the convolution property to sums of log normal distributions, let’s practice on some simple discrete distributions.
To take one example, let’s consider the following two probability distributions
\[ f_j = \textrm{Prob} (X = j), j = 0, 1 \]
and
\[ g_j = \textrm{Prob} (Y = j ) , j = 0, 1, 2, 3 \]
and
\[ h_j = \textrm{Prob} (Z \equiv X + Y = j) , j=0, 1, 2, 3, 4 \]
The convolution property tells us that
\[ h = f* g = g* f \]
Let’s compute an example using the numpy.convolve and scipy.signal.fftconvolve.
f = [.75, .25]
g = [0., .6, 0., .4]
h = np.convolve(f,g)
hf = fftconvolve(f,g)
print("f = ", f, ", np.sum(f) = ", np.sum(f))
print("g = ", g, ", np.sum(g) = ", np.sum(g))
print("h = ", h, ", np.sum(h) = ", np.sum(h))
print("hf = ", hf, ",np.sum(hf) = ", np.sum(hf))
f = [0.75, 0.25] , np.sum(f) = 1.0
g = [0.0, 0.6, 0.0, 0.4] , np.sum(g) = 1.0
h = [0. 0.45 0.15 0.3 0.1 ] , np.sum(h) = 1.0
hf = [0. 0.45 0.15 0.3 0.1 ] ,np.sum(hf) = 1.0000000000000002
A little later we’ll explain some advantages that come from using scipy.signal.ftconvolve rather than numpy.convolve.numpy program convolve.
They provide the same answers but scipy.signal.ftconvolve is much faster.
That’s why we rely on it later in this lecture.
17.4. Approximating Distributions
We’ll construct an example to verify that discretized distributions can do a good job of approximating samples drawn from underlying continuous distributions.
We’ll start by generating samples of size 25000 of three independent log normal random variates as well as pairwise and triple-wise sums.
Then we’ll plot histograms and compare them with convolutions of appropriate discretized log normal distributions.
## create sums of two and three log normal random variates ssum2 = s1 + s2 and ssum3 = s1 + s2 + s3
mu1, sigma1 = 5., 1. # mean and standard deviation
s1 = np.random.lognormal(mu1, sigma1, 25000)
mu2, sigma2 = 5., 1. # mean and standard deviation
s2 = np.random.lognormal(mu2, sigma2, 25000)
mu3, sigma3 = 5., 1. # mean and standard deviation
s3 = np.random.lognormal(mu3, sigma3, 25000)
ssum2 = s1 + s2
ssum3 = s1 + s2 + s3
count, bins, ignored = plt.hist(s1, 1000, density=True, align='mid')
_images/hoist_failure_7_0.png
count, bins, ignored = plt.hist(ssum2, 1000, density=True, align='mid')
_images/hoist_failure_8_0.png
count, bins, ignored = plt.hist(ssum3, 1000, density=True, align='mid')
_images/hoist_failure_9_0.png
samp_mean2 = np.mean(s2)
pop_mean2 = np.exp(mu2+ (sigma2**2)/2)
pop_mean2, samp_mean2, mu2, sigma2
(244.69193226422038, 245.7374747851883, 5.0, 1.0)
Here are helper functions that create a discretized version of a log normal probability density function.
def p_log_normal(x,μ,σ):
p = 1 / (σ*x*np.sqrt(2*np.pi)) * np.exp(-1/2*((np.log(x) - μ)/σ)**2)
return p
def pdf_seq(μ,σ,I,m):
x = np.arange(1e-7,I,m)
p_array = p_log_normal(x,μ,σ)
p_array_norm = p_array/np.sum(p_array)
return p_array,p_array_norm,x
Now we shall set a grid length \(I\) and a grid increment size \(m =1\) for our discretizations.
Note
We set \(I\) equal to a power of two because we want to be free to use a Fast Fourier Transform to compute a convolution of two sequences (discrete distributions).
We recommend experimenting with different values of the power \(p\) of 2.
Setting it to 15 rather than 12, for example, improves how well the discretized probability mass function approximates the original continuous probability density function being studied.
p=15
I = 2**p # Truncation value
m = .1 # increment size
## Cell to check -- note what happens when don't normalize!
## things match up without adjustment. Compare with above
p1,p1_norm,x = pdf_seq(mu1,sigma1,I,m)
## compute number of points to evaluate the probability mass function
NT = x.size
plt.figure(figsize = (8,8))
plt.subplot(2,1,1)
plt.plot(x[:int(NT)],p1[:int(NT)],label = '')
plt.xlim(0,2500)
count, bins, ignored = plt.hist(s1, 1000, density=True, align='mid')
plt.show()
_images/hoist_failure_15_0.png
# Compute mean from discretized pdf and compare with the theoretical value
mean= np.sum(np.multiply(x[:NT],p1_norm[:NT]))
meantheory = np.exp(mu1+.5*sigma1**2)
mean, meantheory
(244.69059898302908, 244.69193226422038)
17.5. Convolving Probability Mass Functions
Now let’s use the convolution theorem to compute the probability distribution of a sum of the two log normal random variables we have parameterized above.
We’ll also compute the probability of a sum of three log normal distributions constructed above.
Before we do these things, we shall explain our choice of Python algorithm to compute a convolution of two sequences.
Because the sequences that we convolve are long, we use the scipy.signal.fftconvolve function rather than the numpy.convove function.
These two functions give virtually equivalent answers but for long sequences scipy.signal.fftconvolve is much faster.
The program scipy.signal.fftconvolve uses fast Fourier transforms and their inverses to calculate convolutions.
Let’s define the Fourier transform and the inverse Fourier transform.
The Fourier transform of a sequence \(\{x_t\}_{t=0}^{T-1}\) is a sequence of complex numbers \(\{x(\omega_j)\}_{j=0}^{T-1}\) given by
(17.1)\[ x(\omega_j) = \sum_{t=0}^{T-1} x_t \exp(- i \omega_j t) \]
where \(\omega_j = \frac{2 \pi j}{T}\) for \(j=0, 1, \ldots, T-1\).
The inverse Fourier transform of the sequence \(\{x(\omega_j)\}_{j=0}^{T-1}\) is
(17.2)\[ x_t = T^{-1} \sum_{j=0}^{T-1} x(\omega_j) \exp (i \omega_j t) \]
The sequences \(\{x_t\}_{t=0}^{T-1}\) and \(\{x(\omega_j)\}_{j=0}^{T-1}\) contain the same information.
The pair of equations (17.1) and (17.2) tell how to recover one series from its Fourier partner.
The program scipy.signal.fftconvolve deploys the theorem that a convolution of two sequences \(\{f_k\}, \{g_k\}\) can be computed in the following way:
• Compute Fourier transforms \(F(\omega), G(\omega)\) of the \(\{f_k\}\) and \(\{g_k\}\) sequences, respectively
• Form the product \(H (\omega) = F(\omega) G (\omega)\)
• The convolution of \(f * g\) is the inverse Fourier transform of \(H(\omega)\)
The fast Fourier transform and the associated inverse fast Fourier transform execute these calculations very quickly.
This is the algorithm that scipy.signal.fftconvolve uses.
Let’s do a warmup calculation that compares the times taken by numpy.convove and scipy.signal.fftconvolve.
p1,p1_norm,x = pdf_seq(mu1,sigma1,I,m)
p2,p2_norm,x = pdf_seq(mu2,sigma2,I,m)
p3,p3_norm,x = pdf_seq(mu3,sigma3,I,m)
tic = time.perf_counter()
c1 = np.convolve(p1_norm,p2_norm)
c2 = np.convolve(c1,p3_norm)
toc = time.perf_counter()
tdiff1 = toc - tic
tic = time.perf_counter()
c1f = fftconvolve(p1_norm,p2_norm)
c2f = fftconvolve(c1f,p3_norm)
toc = time.perf_counter()
toc = time.perf_counter()
tdiff2 = toc - tic
print("time with np.convolve = ", tdiff1, "; time with fftconvolve = ", tdiff2)
time with np.convolve = 46.33203040199987 ; time with fftconvolve = 0.21851767099997232
The fast Fourier transform is two orders of magnitude faster than numpy.convolve
Now let’s plot our computed probability mass function approximation for the sum of two log normal random variables against the histogram of the sample that we formed above.
NT= np.size(x)
plt.figure(figsize = (8,8))
plt.subplot(2,1,1)
plt.plot(x[:int(NT)],c1f[:int(NT)]/m,label = '')
plt.xlim(0,5000)
count, bins, ignored = plt.hist(ssum2, 1000, density=True, align='mid')
# plt.plot(P2P3[:10000],label = 'FFT method',linestyle = '--')
plt.show()
_images/hoist_failure_20_0.png
NT= np.size(x)
plt.figure(figsize = (8,8))
plt.subplot(2,1,1)
plt.plot(x[:int(NT)],c2f[:int(NT)]/m,label = '')
plt.xlim(0,5000)
count, bins, ignored = plt.hist(ssum3, 1000, density=True, align='mid')
# plt.plot(P2P3[:10000],label = 'FFT method',linestyle = '--')
plt.show()
_images/hoist_failure_21_0.png
## Let's compute the mean of the discretized pdf
mean= np.sum(np.multiply(x[:NT],c1f[:NT]))
# meantheory = np.exp(mu1+.5*sigma1**2)
mean, 2*meantheory
(489.3810974093853, 489.38386452844077)
## Let's compute the mean of the discretized pdf
mean= np.sum(np.multiply(x[:NT],c2f[:NT]))
# meantheory = np.exp(mu1+.5*sigma1**2)
mean, 3*meantheory
(734.0714863312277, 734.0757967926611)
17.6. Failure Tree Analysis
We shall soon apply the convolution theorem to compute the probability of a top event in a failure tree analysis.
Before applying the convolution theorem, we first describe the model that connects constituent events to the top end whose failure rate we seek to quantify.
The model is an example of the widely used failure tree analysis described by El-Shanawany, Ardron, and Walker [ESAW18].
To construct the statistical model, we repeatedly use what is called the rare event approximation.
We want to compute the probabilty of an event \(A \cup B\).
• the union \(A \cup B\) is the event that \(A\) OR \(B\) occurs
A law of probability tells us that \(A\) OR \(B\) occurs with probability
\[ P(A \cup B) = P(A) + P(B) - P(A \cap B) \]
where the intersection \(A \cap B\) is the event that \(A\) AND \(B\) both occur and the union \(A \cup B\) is the event that \(A\) OR \(B\) occurs.
If \(A\) and \(B\) are independent, then
\[ P(A \cap B) = P(A) P(B) \]
If \(P(A)\) and \(P(B)\) are both small, then \(P(A) P(B)\) is even smaller.
The rare event approximation is
\[ P(A \cup B) \approx P(A) + P(B) \]
This approximation is widely used in evaluating system failures.
17.7. Application
A system has been designed with the feature a system failure occurs when any of \(n\) critical components fails.
The failure probability \(P(A_i)\) of each event \(A_i\) is small.
We assume that failures of the components are statistically independent random variables.
We repeatedly apply a rare event approximation to obtain the following formula for the problem of a system failure:
\[ P(F) \approx P(A_1) + P (A_2) + \cdots + P (A_n) \]
or
(17.3)\[ P(F) \approx \sum_{i=1}^n P (A_i) \]
Probabilities for each event are recorded as failure rates per year.
17.8. Failure Rates Unknown
Now we come to the problem that really interests us, following [ESAW18] and Greenfield and Sargent [GS93] in the spirit of Apostolakis [Apo90].
The constituent probabilities or failure rates \(P(A_i)\) are not known a priori and have to be estimated.
We address this problem by specifying probabilities of probabilities that capture one notion of not knowing the constituent probabilities that are inputs into a failure tree analysis.
Thus, we assume that a system analyst is uncertain about the failure rates \(P(A_i), i =1, \ldots, n\) for components of a system.
The analyst copes with this situation by regarding the systems failure probability \(P(F)\) and each of the component probabilities \(P(A_i)\) as random variables.
• dispersions of the probability distribution of \(P(A_i)\) characterizes the analyst’s uncertainty about the failure probability \(P(A_i)\)
• the dispersion of the implied probability distribution of \(P(F)\) characterizes his uncertainty about the probability of a system’s failure.
This leads to what is sometimes called a hierarchical model in which the analyst has probabilities about the probabilities \(P(A_i)\).
The analyst formalizes his uncertainty by assuming that
• the failure probability \(P(A_i)\) is itself a log normal random variable with parameters \((\mu_i, \sigma_i)\).
• failure rates \(P(A_i)\) and \(P(A_j)\) are statistically independent for all pairs with \(i \neq j\).
The analyst calibrates the parameters \((\mu_i, \sigma_i)\) for the failure events \(i = 1, \ldots, n\) by reading reliability studies in engineering papers that have studied historical failure rates of components that are as similar as possible to the components being used in the system under study.
The analyst assumes that such information about the observed dispersion of annual failure rates, or times to failure, can inform him of what to expect about parts’ performances in his system.
The analyst assumes that the random variables \(P(A_i)\) are statistically mutually independent.
The analyst wants to approximate a probability mass function and cumulative distribution function of the systems failure probability \(P(F)\).
• We say probability mass function because of how we discretize each random variable, as described earlier.
The analyst calculates the probability mass function for the top event \(F\), i.e., a system failure, by repeatedly applying the convolution theorem to compute the probability distribution of a sum of independent log normal random variables, as described in equation (17.3).
17.9. Waste Hoist Failure Rate
We’ll take close to a real world example by assuming that \(n = 14\).
The example estimates the annual failure rate of a critical hoist at a nuclear waste facility.
A regulatory agency wants the sytem to be designed in a way that makes the failure rate of the top event small with high probability.
This example is Design Option B-2 (Case I) described in Table 10 on page 27 of [GS93].
The table describes parameters \(\mu_i, \sigma_i\) for fourteen log normal random variables that consist of seven pairs of random variables that are identically and independently distributed.
• Within a pair, parameters \(\mu_i, \sigma_i\) are the same
• As described in table 10 of [GS93] p. 27, parameters of log normal distributions for the seven unique probabilities \(P(A_i)\) have been calibrated to be the values in the following Python code:
mu1, sigma1 = 4.28, 1.1947
mu2, sigma2 = 3.39, 1.1947
mu3, sigma3 = 2.795, 1.1947
mu4, sigma4 = 2.717, 1.1947
mu5, sigma5 = 2.717, 1.1947
mu6, sigma6 = 1.444, 1.4632
mu7, sigma7 = -.040, 1.4632
Note
Because the failure rates are all very small, log normal distributions with the above parameter values actually describe \(P(A_i)\) times \(10^{-09}\).
So the probabilities that we’ll put on the \(x\) axis of the probability mass function and associated cumulative distribution function should be multiplied by \(10^{-09}\)
To extract a table that summarizes computed quantiles, we’ll use a helper function
def find_nearest(array, value):
array = np.asarray(array)
idx = (np.abs(array - value)).argmin()
return idx
We compute the required thirteen convolutions in the following code.
(Please feel free to try different values of the power parameter \(p\) that we use to set the number of points in our grid for constructing the probability mass functions that discretize the continuous log normal distributions.)
We’ll plot a counterpart to the cumulative distribution function (CDF) in figure 5 on page 29 of [GS93] and we’ll also present a counterpart to their Table 11 on page 28.
p=15
I = 2**p # Truncation value
m = .05 # increment size
p1,p1_norm,x = pdf_seq(mu1,sigma1,I,m)
p2,p2_norm,x = pdf_seq(mu2,sigma2,I,m)
p3,p3_norm,x = pdf_seq(mu3,sigma3,I,m)
p4,p4_norm,x = pdf_seq(mu4,sigma4,I,m)
p5,p5_norm,x = pdf_seq(mu5,sigma5,I,m)
p6,p6_norm,x = pdf_seq(mu6,sigma6,I,m)
p7,p7_norm,x = pdf_seq(mu7,sigma7,I,m)
p8,p8_norm,x = pdf_seq(mu7,sigma7,I,m)
p9,p9_norm,x = pdf_seq(mu7,sigma7,I,m)
p10,p10_norm,x = pdf_seq(mu7,sigma7,I,m)
p11,p11_norm,x = pdf_seq(mu7,sigma7,I,m)
p12,p12_norm,x = pdf_seq(mu7,sigma7,I,m)
p13,p13_norm,x = pdf_seq(mu7,sigma7,I,m)
p14,p14_norm,x = pdf_seq(mu7,sigma7,I,m)
tic = time.perf_counter()
c1 = fftconvolve(p1_norm,p2_norm)
c2 = fftconvolve(c1,p3_norm)
c3 = fftconvolve(c2,p4_norm)
c4 = fftconvolve(c3,p5_norm)
c5 = fftconvolve(c4,p6_norm)
c6 = fftconvolve(c5,p7_norm)
c7 = fftconvolve(c6,p8_norm)
c8 = fftconvolve(c7,p9_norm)
c9 = fftconvolve(c8,p10_norm)
c10 = fftconvolve(c9,p11_norm)
c11 = fftconvolve(c10,p12_norm)
c12 = fftconvolve(c11,p13_norm)
c13 = fftconvolve(c12,p14_norm)
toc = time.perf_counter()
tdiff13 = toc - tic
print("time for 13 convolutions = ", tdiff13)
time for 13 convolutions = 10.541285741999673
d13 = np.cumsum(c13)
Nx=int(1400)
plt.figure()
plt.plot(x[0:int(Nx/m)],d13[0:int(Nx/m)]) # show Yad this -- I multiplied by m -- step size
plt.hlines(0.5,min(x),Nx,linestyles='dotted',colors = {'black'})
plt.hlines(0.9,min(x),Nx,linestyles='dotted',colors = {'black'})
plt.hlines(0.95,min(x),Nx,linestyles='dotted',colors = {'black'})
plt.hlines(0.1,min(x),Nx,linestyles='dotted',colors = {'black'})
plt.hlines(0.05,min(x),Nx,linestyles='dotted',colors = {'black'})
plt.ylim(0,1)
plt.xlim(0,Nx)
plt.xlabel("$x10^{-9}$",loc = "right")
plt.show()
x_1 = x[find_nearest(d13,0.01)]
x_5 = x[find_nearest(d13,0.05)]
x_10 = x[find_nearest(d13,0.1)]
x_50 = x[find_nearest(d13,0.50)]
x_66 = x[find_nearest(d13,0.665)]
x_85 = x[find_nearest(d13,0.85)]
x_90 = x[find_nearest(d13,0.90)]
x_95 = x[find_nearest(d13,0.95)]
x_99 = x[find_nearest(d13,0.99)]
x_9978 = x[find_nearest(d13,0.9978)]
print(tabulate([
['1%',f"{x_1}"],
['5%',f"{x_5}"],
['10%',f"{x_10}"],
['50%',f"{x_50}"],
['66.5%',f"{x_66}"],
['85%',f"{x_85}"],
['90%',f"{x_90}"],
['95%',f"{x_95}"],
['99%',f"{x_99}"],
['99.78%',f"{x_9978}"]],
headers = ['Percentile', 'x * 1e-9']))
_images/hoist_failure_30_0.png
Percentile x * 1e-9
------------ ----------
1% 76.15
5% 106.5
10% 128.2
50% 260.55
66.5% 338.55
85% 509.4
90% 608.8
95% 807.6
99% 1470.2
99.78% 2474.85
The above table agrees closely with column 2 of Table 11 on p. 28 of of [GS93].
Discrepancies are probably due to slight differences in the number of digits retained in inputting \(\mu_i, \sigma_i, i = 1, \ldots, 14\) and in the number of points deployed in the discretizations.
|
__label__pos
| 0.987879 |
Quick Answer: How Many Movies Can 1tb Hold?
How many movies can 4tb hold?
It depends on the size of the movie.
A Typical commercial DVD is roughly 8 Gigs, so 4TB would hold about 500 DVDs (4000/8).
Single layer Blue-Ray disks (high def) will be around 25GB and dual layer disks 50GB, so figure 160 and 80 respectively.
Of course, these are approximations..
Is 1tb a lot of storage?
1 TB gives you the option of storing roughly: 250,000 photos taken with a 12MP camera; 250 movies or 500 hours of HD video; or. 6.5 million document pages, commonly stored as Office files, PDFs, and presentations.
Is 1000 GB the same as 1tb?
1 terabyte is equal to 1000 gigabytes, or 1012 bytes. However, in terms of information technology or computer science, 1 TB is 240 or 10244 bytes, which is equal to 1,099,511,627,776 bytes.
How many hours of video is 1tb?
500 hoursYou could fit approximately 500 hours worth of movies on one terabyte. Assuming each movie is roughly 120 minutes long, that would be about 250 movies. I do know people who have that many movies in their library, so it is possible that they could build a database of movies to fill that space.
How long does a CCTV hard drive last?
3 to 4 yearsA typical mechanical hard drive will last on average 3 to 4 years however it is often the case with hard drives used in CCTV recorders for their life to be significantly shorter. Some users will even find themselves replacing hard drives in CCTV recorders every year.
How many partitions is best for 1tb?
Generally speaking, according to file types and personal habits, a 1TB hard drive can be partitioned into 2-5 partitions. Here we recommend you to partition it into five partitions: Operating system (C volume), Program File(D volume), Personal Data (E volume), Entertainment (F volume) and Download (G volume).
What phone has 1tb of storage?
Galaxy S10Samsung announced four variations of the Galaxy S10 today — the S10e, the S10, the S10+ and the S10 5G. That third one, the S10+, is the one that can come with 1TB of internal storage.
How many movies can I store on 1tb?
You could fit approximately 500 hours worth of movies on one terabyte. Assuming each movie is roughly 120 minutes long, that would be about 250 movies. I do know people who have that many movies in their library, so it is possible that they could build a database of movies to fill that space.
Is 2tb a lot of storage?
As disk drives now exceed a trillion bytes, the term terabyte appears. A 2TB drive holds about 2 trillion bytes. To put this in perspective, you could have 100,000 songs, 150 movies and a bunch of other personal items on a 2TB drive and still have room for plenty of folders full of business Word files.
Is 4tb a lot of storage?
4 TB seems like a lot of storage capacity, and for many people it is. However projections by folks such as IDC, UCSD and USC indicated that the growth of digital information is growing by about 50% per year while the amount of information stored each year had been increasing in the past by about 25% annually.
How long does it take to backup 1tb?
At 5Mbps, for example, 100GB should take about 48 hours to backup. A terabyte backup would take less than three weeks. Double your internet upload speed, and you cut that in half. Except, that doesn’t happen often.
How many gigs is 24 hours of video?
Video Recording Time**Recording speed24 Mbps8 Mbps8GB40 min120 min16GB80 min240 min32GB160 min480 min5 more rows•Jan 25, 2012
Do I need a terabyte of storage?
Most non-professional users will be fine with 250 to 320GBs of storage. For example, 250GB can hold more than 30,000 average size photos or songs. If you’re planning on storing movies, then you definitely want to upgrade to at least 500GB, maybe even 1TB. Granted, this is all for conventional hard drives.
How many 1080p movies can 1tb hold?
15 moviesYou could store about 15 hours of 4K Ultra HD video on a 1TB, or more than 35 hours of 1080p content. At a typical running length of around 2 hours per film, that’s more than 15 movies at HD quality on a 1TB drive.
How many movies can a 3 terabyte hard drive hold?
120 HD moviesAvailable immediately, the 3TB FreeAgent GoFlex Desk external hard drive helps to meet the explosive worldwide demand for digital content storage in both the home and the office. With 3TB of capacity people can store up to 120 HD movies, 1,500 video games, thousands of photos or countless hours of digital music.
How much is 1tb of space?
1 TB equals 1,000 gigabytes (GB) or 1,000,000 megabytes (MB).
How many hours of CCTV can 1tb hold?
571 hoursAn MP4 file is typically 1.75 GB = 1 hour of video, roughly. So 1 TB/1.75 GB = 571 hours. This is a rough estimate. I have no idea how much 8 cameras record in an hour or what file system you are using.
How many hours of 4k video can 1tb hold?
So one hour of 4K footage (4096 x 2160) equals around 42 GB. Then, 25 hours (1 hour per day) equals around 1 TB.
How many GB does a 2 hour movie take up?
Re: how many gigabits to watch a 2 hour movie? 5.5 gigabytes in 2 hours is about 6 Gbps. Very possible with a movie. 1080p high res will stream at 9 Gbps or more — or 8 gigabytes in 2 hours.
What is bigger than a terabyte?
Therefore, after terabyte comes petabyte. Next is exabyte, then zettabyte and yottabyte.
|
__label__pos
| 0.998945 |
blob: 492c51487fdb12a4b772199682bc756fc3754d7f [file] [log] [blame]
// Copyright 2015 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef V8_WASM_MODULE_H_
#define V8_WASM_MODULE_H_
#include <memory>
#include "src/debug/debug-interface.h"
#include "src/globals.h"
#include "src/handles.h"
#include "src/managed.h"
#include "src/parsing/preparse-data.h"
#include "src/wasm/decoder.h"
#include "src/wasm/signature-map.h"
#include "src/wasm/wasm-constants.h"
namespace v8 {
namespace internal {
class WasmCompiledModule;
class WasmDebugInfo;
class WasmInstanceObject;
class WasmMemoryObject;
class WasmModuleObject;
class WasmSharedModuleData;
class WasmTableObject;
namespace compiler {
class CallDescriptor;
}
namespace wasm {
class ErrorThrower;
class NativeModule;
// Static representation of a wasm function.
struct WasmFunction {
FunctionSig* sig; // signature of the function.
uint32_t func_index; // index into the function table.
uint32_t sig_index; // index into the signature table.
WireBytesRef name; // function name, if any.
WireBytesRef code; // code of this function.
bool imported;
bool exported;
};
// Static representation of a wasm global variable.
struct WasmGlobal {
ValueType type; // type of the global.
bool mutability; // {true} if mutable.
WasmInitExpr init; // the initialization expression of the global.
uint32_t offset; // offset into global memory.
bool imported; // true if imported.
bool exported; // true if exported.
};
// Note: An exception signature only uses the params portion of a
// function signature.
typedef FunctionSig WasmExceptionSig;
struct WasmException {
explicit WasmException(const WasmExceptionSig* sig = &empty_sig_)
: sig(sig) {}
FunctionSig* ToFunctionSig() const { return const_cast<FunctionSig*>(sig); }
const WasmExceptionSig* sig; // type signature of the exception.
// Used to hold data on runtime exceptions.
static constexpr const char* kRuntimeIdStr = "WasmExceptionRuntimeId";
static constexpr const char* kRuntimeValuesStr = "WasmExceptionValues";
private:
static const WasmExceptionSig empty_sig_;
};
// Static representation of a wasm data segment.
struct WasmDataSegment {
WasmInitExpr dest_addr; // destination memory address of the data.
WireBytesRef source; // start offset in the module bytes.
};
// Static representation of a wasm indirect call table.
struct WasmIndirectFunctionTable {
MOVE_ONLY_WITH_DEFAULT_CONSTRUCTORS(WasmIndirectFunctionTable);
uint32_t initial_size = 0; // initial table size.
uint32_t maximum_size = 0; // maximum table size.
bool has_maximum_size = false; // true if there is a maximum size.
// TODO(titzer): Move this to WasmInstance. Needed by interpreter only.
std::vector<int32_t> values; // function table, -1 indicating invalid.
bool imported = false; // true if imported.
bool exported = false; // true if exported.
};
// Static representation of how to initialize a table.
struct WasmTableInit {
MOVE_ONLY_NO_DEFAULT_CONSTRUCTOR(WasmTableInit);
WasmTableInit(uint32_t table_index, WasmInitExpr offset)
: table_index(table_index), offset(offset) {}
uint32_t table_index;
WasmInitExpr offset;
std::vector<uint32_t> entries;
};
// Static representation of a wasm import.
struct WasmImport {
WireBytesRef module_name; // module name.
WireBytesRef field_name; // import name.
ImportExportKindCode kind; // kind of the import.
uint32_t index; // index into the respective space.
};
// Static representation of a wasm export.
struct WasmExport {
WireBytesRef name; // exported name.
ImportExportKindCode kind; // kind of the export.
uint32_t index; // index into the respective space.
};
enum ModuleOrigin : uint8_t { kWasmOrigin, kAsmJsOrigin };
struct ModuleWireBytes;
// Static representation of a module.
struct V8_EXPORT_PRIVATE WasmModule {
MOVE_ONLY_NO_DEFAULT_CONSTRUCTOR(WasmModule);
std::unique_ptr<Zone> signature_zone;
uint32_t initial_pages = 0; // initial size of the memory in 64k pages
uint32_t maximum_pages = 0; // maximum size of the memory in 64k pages
bool has_shared_memory = false; // true if memory is a SharedArrayBuffer
bool has_maximum_pages = false; // true if there is a maximum memory size
bool has_memory = false; // true if the memory was defined or imported
bool mem_export = false; // true if the memory is exported
int start_function_index = -1; // start function, >= 0 if any
std::vector<WasmGlobal> globals;
uint32_t globals_size = 0;
uint32_t num_imported_functions = 0;
uint32_t num_declared_functions = 0;
uint32_t num_exported_functions = 0;
WireBytesRef name = {0, 0};
// TODO(wasm): Add url here, for spec'ed location information.
std::vector<FunctionSig*> signatures; // by signature index
std::vector<uint32_t> signature_ids; // by signature index
std::vector<WasmFunction> functions;
std::vector<WasmDataSegment> data_segments;
std::vector<WasmIndirectFunctionTable> function_tables;
std::vector<WasmImport> import_table;
std::vector<WasmExport> export_table;
std::vector<WasmException> exceptions;
std::vector<WasmTableInit> table_inits;
SignatureMap signature_map; // canonicalizing map for signature indexes.
WasmModule() : WasmModule(nullptr) {}
WasmModule(std::unique_ptr<Zone> owned);
ModuleOrigin origin() const { return origin_; }
void set_origin(ModuleOrigin new_value) { origin_ = new_value; }
bool is_wasm() const { return origin_ == kWasmOrigin; }
bool is_asm_js() const { return origin_ == kAsmJsOrigin; }
private:
// TODO(kschimpf) - Encapsulate more fields.
ModuleOrigin origin_ = kWasmOrigin; // origin of the module
};
typedef Managed<WasmModule> WasmModuleWrapper;
// Interface to the storage (wire bytes) of a wasm module.
// It is illegal for anyone receiving a ModuleWireBytes to store pointers based
// on module_bytes, as this storage is only guaranteed to be alive as long as
// this struct is alive.
struct V8_EXPORT_PRIVATE ModuleWireBytes {
ModuleWireBytes(Vector<const byte> module_bytes)
: module_bytes_(module_bytes) {}
ModuleWireBytes(const byte* start, const byte* end)
: module_bytes_(start, static_cast<int>(end - start)) {
DCHECK_GE(kMaxInt, end - start);
}
// Get a string stored in the module bytes representing a name.
WasmName GetName(WireBytesRef ref) const {
if (ref.is_empty()) return {"<?>", 3}; // no name.
CHECK(BoundsCheck(ref.offset(), ref.length()));
return Vector<const char>::cast(
module_bytes_.SubVector(ref.offset(), ref.end_offset()));
}
// Get a string stored in the module bytes representing a function name.
WasmName GetName(const WasmFunction* function) const {
return GetName(function->name);
}
// Get a string stored in the module bytes representing a name.
WasmName GetNameOrNull(WireBytesRef ref) const {
if (!ref.is_set()) return {nullptr, 0}; // no name.
CHECK(BoundsCheck(ref.offset(), ref.length()));
return Vector<const char>::cast(
module_bytes_.SubVector(ref.offset(), ref.end_offset()));
}
// Get a string stored in the module bytes representing a function name.
WasmName GetNameOrNull(const WasmFunction* function) const {
return GetNameOrNull(function->name);
}
// Checks the given offset range is contained within the module bytes.
bool BoundsCheck(uint32_t offset, uint32_t length) const {
uint32_t size = static_cast<uint32_t>(module_bytes_.length());
return offset <= size && length <= size - offset;
}
Vector<const byte> GetFunctionBytes(const WasmFunction* function) const {
return module_bytes_.SubVector(function->code.offset(),
function->code.end_offset());
}
Vector<const byte> module_bytes() const { return module_bytes_; }
const byte* start() const { return module_bytes_.start(); }
const byte* end() const { return module_bytes_.end(); }
size_t length() const { return module_bytes_.length(); }
private:
Vector<const byte> module_bytes_;
};
// A helper for printing out the names of functions.
struct WasmFunctionName {
WasmFunctionName(const WasmFunction* function, WasmName name)
: function_(function), name_(name) {}
const WasmFunction* function_;
const WasmName name_;
};
std::ostream& operator<<(std::ostream& os, const WasmFunctionName& name);
// Get the debug info associated with the given wasm object.
// If no debug info exists yet, it is created automatically.
Handle<WasmDebugInfo> GetDebugInfo(Handle<JSObject> wasm);
V8_EXPORT_PRIVATE MaybeHandle<WasmModuleObject> CreateModuleObjectFromBytes(
Isolate* isolate, const byte* start, const byte* end, ErrorThrower* thrower,
ModuleOrigin origin, Handle<Script> asm_js_script,
Vector<const byte> asm_offset_table);
V8_EXPORT_PRIVATE bool IsWasmCodegenAllowed(Isolate* isolate,
Handle<Context> context);
V8_EXPORT_PRIVATE Handle<JSArray> GetImports(Isolate* isolate,
Handle<WasmModuleObject> module);
V8_EXPORT_PRIVATE Handle<JSArray> GetExports(Isolate* isolate,
Handle<WasmModuleObject> module);
V8_EXPORT_PRIVATE Handle<JSArray> GetCustomSections(
Isolate* isolate, Handle<WasmModuleObject> module, Handle<String> name,
ErrorThrower* thrower);
// Decode local variable names from the names section. Return FixedArray of
// FixedArray of <undefined|String>. The outer fixed array is indexed by the
// function index, the inner one by the local index.
Handle<FixedArray> DecodeLocalNames(Isolate*, Handle<WasmSharedModuleData>);
// If the target is an export wrapper, return the {WasmFunction*} corresponding
// to the wrapped wasm function; in all other cases, return nullptr.
// The returned pointer is owned by the wasm instance target belongs to. The
// result is alive as long as the instance exists.
// TODO(titzer): move this to WasmExportedFunction.
WasmFunction* GetWasmFunctionForExport(Isolate* isolate, Handle<Object> target);
Handle<Object> GetOrCreateIndirectCallWrapper(
Isolate* isolate, Handle<WasmInstanceObject> owning_instance,
WasmCodeWrapper wasm_code, uint32_t index, FunctionSig* sig);
void UnpackAndRegisterProtectedInstructionsGC(Isolate* isolate,
Handle<FixedArray> code_table);
void UnpackAndRegisterProtectedInstructions(
Isolate* isolate, const wasm::NativeModule* native_module);
// TruncatedUserString makes it easy to output names up to a certain length, and
// output a truncation followed by '...' if they exceed a limit.
// Use like this:
// TruncatedUserString<> name (pc, len);
// printf("... %.*s ...", name.length(), name.start())
template <int kMaxLen = 50>
class TruncatedUserString {
static_assert(kMaxLen >= 4, "minimum length is 4 (length of '...' plus one)");
public:
template <typename T>
explicit TruncatedUserString(Vector<T> name)
: TruncatedUserString(name.start(), name.length()) {}
TruncatedUserString(const byte* start, size_t len)
: TruncatedUserString(reinterpret_cast<const char*>(start), len) {}
TruncatedUserString(const char* start, size_t len)
: start_(start), length_(std::min(kMaxLen, static_cast<int>(len))) {
if (len > static_cast<size_t>(kMaxLen)) {
memcpy(buffer_, start, kMaxLen - 3);
memset(buffer_ + kMaxLen - 3, '.', 3);
start_ = buffer_;
}
}
const char* start() const { return start_; }
int length() const { return length_; }
private:
const char* start_;
const int length_;
char buffer_[kMaxLen];
};
} // namespace wasm
} // namespace internal
} // namespace v8
#endif // V8_WASM_MODULE_H_
|
__label__pos
| 0.94226 |
Laravel - MySQL数据库的使用详解9（Eloquent ORM用法6：事件、订阅、观察者）
作者: hgphp 发布时间: 2019-09-11 浏览: 2077 次 编辑
一、事件的监听与响应
1，基本介绍
（1）Eloquent 模型可以在模型生命周期中的各个时间点触发相应的事件：
• retrieved：从数据库中获取已存在模型时会触发该事件。
• creatingcreated：当一个新模型被首次保存的时候，这两个事件会被触发。
• updatingupdated：当一个模型已经在数据库中存在并调用 save 方法，这两个事件会被触发。
• savingsaved：无论是创建还是更新，这两个事件都会被触发。
（2）我们可以通过事件实现：在一个指定模型类每次保存或更新的时候执行相应的代码。
2，使用样例
（1）首先我们打开 app/Providers/EventServiceProvider.php 文件，注册一个事件监听器映射关系：
<?php
namespace App\Providers;
use Illuminate\Support\Facades\Event;
use Illuminate\Auth\Events\Registered;
use Illuminate\Auth\Listeners\SendEmailVerificationNotification;
use Illuminate\Foundation\Support\Providers\EventServiceProvider as ServiceProvider;
class EventServiceProvider extends ServiceProvider
{
/**
* The event listener mappings for the application.
*
* @var array
*/
protected $listen = [
Registered::class => [
SendEmailVerificationNotification::class,
],
'App\Events\UserSaved' => [
'App\Listeners\UserSavedListener',
],
];
/**
* Register any events for your application.
*
* @return void
*/
public function boot()
{
parent::boot();
//
}
}
（2）接着在终端中进入项目文件夹，然后执行如下 Artisan 命令：
php artisan event:generate
（3）上面命令执行后，会分别自动在 app/Eventsapp/Listensers 目录下生成对应的事件类和监听类。
原文:Laravel - MySQL数据库的使用详解9（Eloquent ORM用法6：事件、订阅、观察者）
（4）修改生成的 UserSaved.php 文件内容：
<?php
namespace App\Events;
use Illuminate\Broadcasting\Channel;
use Illuminate\Queue\SerializesModels;
use Illuminate\Broadcasting\PrivateChannel;
use Illuminate\Broadcasting\PresenceChannel;
use Illuminate\Foundation\Events\Dispatchable;
use Illuminate\Broadcasting\InteractsWithSockets;
use Illuminate\Contracts\Broadcasting\ShouldBroadcast;
use App\Models\User;
class UserSaved
{
use Dispatchable, InteractsWithSockets, SerializesModels;
public $user;
/**
* Create a new event instance.
*
* @return void
*/
public function __construct(User $user)
{
$this->user = $user;
}
/**
* Get the channels the event should broadcast on.
*
* @return \Illuminate\Broadcasting\Channel|array
*/
public function broadcastOn()
{
return new PrivateChannel('channel-name');
}
}
（5）修改生成的 UserSavedListener.php 文件内容：
<?php
namespace App\Listeners;
use App\Events\UserSaved;
use Illuminate\Queue\InteractsWithQueue;
use Illuminate\Contracts\Queue\ShouldQueue;
class UserSavedListener
{
/**
* Create the event listener.
*
* @return void
*/
public function __construct()
{
//
}
/**
* Handle the event.
*
* @param UserSaved $event
* @return void
*/
public function handle(UserSaved $event)
{
echo "--- saved事件响应，保存对象如下 ----\n";
$user = $event->user;
echo(json_encode($user));
}
}
（6）修改模型 User.php，在模型保存时发出 UserSaved 这个自定义事件。
<?php
namespace App\Models;
use Illuminate\Database\Eloquent\Model;
use Illuminate\Notifications\Notifiable;
use App\Events\UserSaved;
class User extends Model {
use Notifiable;
/**
* The event map for the model.
*
* @var array
*/
protected $dispatchesEvents = [
'saved' => UserSaved::class,
//'deleted' => UserDeleted::class,
];
public $timestamps = false;
}
（7）下面进行测试，我们获取一个用户，修改其属性后保存。
$user = User::find(1);
$User->age = 44;
$user->save();
（8）运行结果如下：可以看到事件监听响应成功。
原文:Laravel - MySQL数据库的使用详解9（Eloquent ORM用法6：事件、订阅、观察者）
二、事件的订阅
1，基本介绍
（1）事件订阅（Event Subscribers）是一种特殊的 Listener，前面讲的是一个 listener 里只能放一个 hander()
（2）事件订阅可以把很多处理器（handler）放到一个类里面，然后用一个 listner 把它们集合起来，这样不同的事件只要对应一个 listner 就可以了。
2，使用样例
（1）假设我们 User 模型这边在保存和删除时会分别发出 UserSavedUserDeleted 这两个自定义事件（这两个自定义事件内容我就不写了，具体可参考上面的文章内容）。
<?php
namespace App\Models;
use Illuminate\Database\Eloquent\Model;
use Illuminate\Notifications\Notifiable;
use App\Events\UserSaved;
class User extends Model {
use Notifiable;
/**
* The event map for the model.
*
* @var array
*/
protected $dispatchesEvents = [
'saved' => UserSaved::class,
'deleted' => UserDeleted::class,
];
public $timestamps = false;
}
（2）接着我们定义一个同时处理这两个事件的 Listener
<?php
namespace App\Listeners;
use Illuminate\Queue\InteractsWithQueue;
use Illuminate\Contracts\Queue\ShouldQueue;
class UserEventListener
{
// 用户保存事件响应
public function onUserSaved($event) {
echo "--- onUserSaved ----\n";
$user = $event->user;
echo(json_encode($user));
}
// 用户删除事件响应
public function onUserDeleted($event) {
echo "--- onUserDeleted ----\n";
$user = $event->user;
echo(json_encode($user));
}
// 同时订阅多个事件
public function subscribe($events)
{
$events->listen(
'App\Events\UserSaved',
'App\Listeners\UserEventListener@onUserSaved'
);
$events->listen(
'App\Events\UserDeleted',
'App\Listeners\UserEventListener@onUserDeleted'
);
}
}
（3）最后在 EventServiceProvider.php 注册下就可以了：
<?php
namespace App\Providers;
use Illuminate\Support\Facades\Event;
use Illuminate\Auth\Events\Registered;
use Illuminate\Auth\Listeners\SendEmailVerificationNotification;
use Illuminate\Foundation\Support\Providers\EventServiceProvider as ServiceProvider;
class EventServiceProvider extends ServiceProvider
{
/**
* The event listener mappings for the application.
*
* @var array
*/
protected $listen = [
Registered::class => [
SendEmailVerificationNotification::class,
]
];
// 注册订阅
protected $subscribe = [
'App\Listeners\UserEventListener',
];
/**
* Register any events for your application.
*
* @return void
*/
public function boot()
{
parent::boot();
//
}
}
三、观察者（Observers）
1，基本介绍
如果需要监听模型中的多个事件，我们还可以使用观察者。观察者类可以反射我们想要监听的 Eloquent 事件对应的方法名，并且每个方法接收模型作为唯一参数。
2，使用样例
（1）使用观察者的话，模型这边就不需要再指定发出哪些事件了：
<?php
namespace App\Models;
use Illuminate\Database\Eloquent\Model;
class User extends Model {
}
（2）接着我们创建一个User模型对应的观察者类（UserObserver）。观察者类的方法即为事件名，这样事件就可以通过反射自动找到对应的方法。
<?php
namespace App\Observers;
use App\Models\User;
class UserObserver
{
/**
* 监听用户创建事件.
*
* @param User $user
* @return void
*/
public function saved(User $user)
{
echo "--- onUserSaved ----\n";
echo(json_encode($user));
}
/**
* 监听用户删除事件.
*
* @param User $user
* @return void
*/
public function deleted(User $user)
{
echo "--- onUserDeleted ----\n";
echo(json_encode($user));
}
}
（3）最后在 app/Providers/AppServiceProvider.php 中注册观察者即可：
<?php
namespace App\Providers;
use Illuminate\Support\ServiceProvider;
use App\Models\User;
use App\Observers\UserObserver;
class AppServiceProvider extends ServiceProvider
{
/**
* Register any application services.
*
* @return void
*/
public function register()
{
//
}
/**
* Bootstrap any application services.
*
* @return void
*/
public function boot()
{
User::observe(UserObserver::class);
}
}
Laravel - MySQL数据库的使用详解系列：
1，Laravel - MySQL数据库的使用详解1（安装配置、基本用法） 4，Laravel - MySQL数据库的使用详解4（Eloquent ORM用法1：创建模型） 7，Laravel - MySQL数据库的使用详解7（Eloquent ORM用法4：插入、更新数据）
2，Laravel - MySQL数据库的使用详解2（Query Builder用法1：查询操作） 5，Laravel - MySQL数据库的使用详解5（Eloquent ORM用法2：基本查询、动态范围） 8，Laravel - MySQL数据库的使用详解8（Eloquent ORM用法5：删除数据）
3，Laravel - MySQL数据库的使用详解3（Query Builder用法2：新增、修改、删除） 6，Laravel - MySQL数据库的使用详解6（Eloquent ORM用法3：模型关联、关联查询 9，Laravel - MySQL数据库的使用详解9（Eloquent ORM用法6：事件、订阅、观察者）
|
__label__pos
| 0.92488 |
Why Excel Falls Short for Managing DOT Drug and Alcohol Programs
Share this post on:
Many of the drug and alcohol program managers that I speak to manage their programs on Excel. While Excel has its use cases, it can be inefficient for managing a Department of Transportation (DOT) drug and alcohol program for several reasons:
1. Limited Data Validation: Excel lacks robust data validation features compared to dedicated database management systems. Without proper validation, errors can occur in data entry, compromising the accuracy and integrity of the program’s records.
2. Difficulty in Scalability: As the size and complexity of the program grow, managing data in Excel becomes increasingly cumbersome. Handling a large volume of records, tracking multiple types of tests, and managing various compliance requirements can quickly overwhelm Excel’s capabilities.
3. Limited Security Features: Excel offers limited security features compared to specialized software solutions. Protecting sensitive information such as employee health records and test results is essential for compliance with privacy regulations like HIPAA. Excel’s basic password protection may not suffice for ensuring data security.
4. Manual Processes: Excel often relies on manual data entry and manipulation. This manual handling increases the likelihood of errors and makes it challenging to maintain compliance with DOT regulations, which require accurate and timely reporting.
5. Lack of Automation: Automating repetitive tasks is crucial for efficiency in managing a DOT drug and alcohol program. Excel’s automation capabilities are limited compared to dedicated software solutions, making it difficult to streamline processes such as scheduling tests, generating reports, and tracking compliance deadlines.
6. Limited Collaboration Features: Excel is primarily designed for individual use, making collaboration among multiple stakeholders challenging. In a DOT drug and alcohol program, coordination among various departments, testing facilities, and regulatory agencies is essential. Dedicated software solutions often offer better collaboration features, such as real-time data sharing and role-based access controls.
7. Difficulty in Audit Trail Management: Maintaining a comprehensive audit trail is crucial for demonstrating compliance with DOT regulations. Excel’s audit trail features are limited compared to dedicated compliance management software, making it difficult to track changes to sensitive data and document the chain of custody for test samples.
While Excel can be a useful tool for simple data management tasks, it lacks the features necessary to efficiently manage a complex DOT drug and alcohol program while ensuring compliance with regulatory requirements. #Nexus is tailored to the specific needs of your program and offers security, scalability, automation, and collaboration features.
Leave a Reply
Your email address will not be published. Required fields are marked *
|
__label__pos
| 0.941881 |
C
C Program RPPLOT to plot ray parameters
C
C Version: 5.90
C Date: 2005, May 10
C
C Coded by Petr Bulant
C Department of Geophysics, Charles University Prague,
C Ke Karlovu 3, 121 16 Praha 2, Czech Republic,
C http://sw3d.cz/staff/bulant.htm
C
C Program to create simple PostScript plot of the distribution of the
C rays and homogeneous triangles either on the normalized ray domain or
C on the reference surface. The program is able to plot any of following
C objects: basic rays, two-point rays, auxiliary rays, homogeneous
C triangles, receivers. Objects are colour-coded according to the
C ray history, colours may be chosen. Rays are symbol-coded according
C to the ray history, symbols and their heights may be chosen. The
C limits of displayed part of the ray domain (or reference surface)
C may also be given by input data.
C
C The program is intended for results of two-parametric ray tracing,
C but may be also used to display results of one-parametric ray tracing.
C Note that then the dimension of normalized ray domain is ANUM x BNUM
C and there are no triangles and no auxiliary rays.
C
C.......................................................................
C
C Description of data files:
C
C Input data read from the standard input device (*):
C The data are read by the list directed input (free format) and
C consist of a single string 'SEP':
C 'SEP'...String in apostrophes containing the name of the input
C SEP parameter or history file with the input data.
C No default, 'SEP' must be specified and cannot be blank.
C
C
C Input data file 'SEP':
C File 'SEP' has the form of the
C SEP
C parameter file. The parameters, which do not differ from their
C defaults, need not be specified in file 'SEP'.
C Integers describing, what is to be plotted:
C IRBAS=integer ... 1 if basic rays are to be plotted. Other value
C means that the basic rays are not to be plotted.
C Default: IRBAS=1
C IRTWO=integer ... 1 if two-point rays are to be plotted.
C Other value disables plotting of the two-point rays.
C Default: IRTWO=1
C IRAUX=integer ... 1 if auxiliary rays are to be plotted.
C Other value disables plotting of the auxiliary rays.
C Default: IRAUX=1
C ITHOM=integer ... 1 if homogeneous triangles are to be plotted.
C Other value disables plotting of the triangles.
C Default: ITHOM=1
C ISANG=integer ... 1 if the distribution of rays and (or) triangles
C on the normalized ray domain is to be plotted. Otherwise
C the distribution of (end)points of the successful rays
C on the receiver surface will be plotted.
C Default: ISANG=1
C ISHP=integer ... 0 if objects of all histories are to be plotted,
C otherwise only the objects of the history equal to ISHP
C will be plotted.
C Default: ISHP=0
C ISUC=integer ... 1 if objects of positive histories are to be
C plotted in colors according to COLORS, and objects of
C negative histories are to be ploted in black. Note that
C positive ray histories correspond to the successful rays,
C which pass the reference surface.
C Otherwise objects of all histories are to be plotted
C in colors according to file COLORS.
C Default: ISUC=0
C ISRCS=nonnegative integer ... Index of the source for which ray
C parameters are to be plotted. File 'CRT-I' with initial
C points may contain several waves of several sources, but
C only one elementary wave may be plotted by a single
C invocation of RPPLOT.
C For ISRCS=0 the first elementary wave from file 'CRT-I'
C is plotted, regardless of its source index.
C Default: ISRCS=0
C IWAVES=nonnegative integer ... Index of the wave to be plotted.
C File 'CRT-I' with initial points may contain several
C waves, but only one wave may be plotted by a single
C invocation of RPPLOT.
C For IWAVES=0 the first elementary wave from file 'CRT-I'
C is plotted.
C Default: IWAVES=0
C
C Limits of the plot, either in normalized ray parameters (if ISANG=1),
C or in reference surface coordinates.
C PLIM1=real ... Minimum of first parameter (coordinate).
C Default: PLIM1=0.
C PLIM2=real ... Maximum of first parameter (coordinate).
C Default: PLIM2=1.
C PLIM3=real ... Minimum of second parameter (coordinate).
C Default: PLIM3=0.
C PLIM4=real ... Maximum of second parameter (coordinate).
C Default: PLIM4=1.
C
C Heights of symbols on the resulting plot in centimeters:
C HRBAS=real ... Height of symbols for basic rays.
C Default: HRBAS=0.2
C HRTWO=real ... Height of symbols for two-point rays.
C Default: HRTWO=0.2
C HRAUX=real ... Height of symbols for auxiliary rays.
C Default: HRAUX=0.2
C HTEXT=real ... Height of the text along axes of the figure.
C Default: HTEXT=0.5
C
C Dimensiones of the plot in centimeters:
C HSIZE=real ... Horizontal dimension of the plot.
C Default: HSIZE=15.
C VSIZE=real ... Vertical dimension of the plot.
C Default: VSIZE=15.
C
C Initial PostScript instructions:
C CALCOPS='string'... String with the PostScript instructions, see
C file
C calcops.for.
C
C Names of output and input files:
C RPPLOT='string' ... Name of the output PostScript file with the
C figure. If RPPLOT=' ' (default), files 'plot00.ps',
C 'plot01.ps', ... are generated.
C Default: RPPLOT=' '
C SYMBOLS='string' ... Name of the file with numbers of symbols.
C This file has on each line a single integer number,
C which is the number of symbol to be used for rays
C and triangles of the history equal to number of the
C line. I.e., on the first line is a number of symbol
C to be used for plotting of rays and triangles with
C history 1 or -1.
C Description of file SYMBOLS.
C Default: SYMBOLS=' '
C COLORS='string' ... Name of the file with numbers of colors.
C Description of file COLORS.
C Default: COLORS=' '
C CRTOUT='string'...File with the names of the output files of
C program CRT. If blank, default names are considered.
C For general description of file CRTOUT refer to file
C writ.for.
C Description specific to this program:
C Just the first set of names of CRT output files is read
C from file CRTOUT. Only files
C 'CRT-I' and
C 'CRT-T'
C are read by RPPLOT.
C Default: CRTOUT=' ' which means 'CRT-I'='s01i.out' and
C 'CRT-T'='t01.out'
C
C Filename and parameters used for plotting receivers. Used only
C when ISANG=0.
C REC='string'... If non-blank, the name of the file with the names
C and coordinates of the receiver points.
C Description of file
C REC.
C Default: REC=' '
C RPAR='string'... String containing the name of the file with the
C data specifying the take-off parameters of the calculated
C rays. Only the values ISRFX1 and ISRFX2 are read from
C RPAR. Data set RPAR must be in separate file, it must
C not be appended to file DCRT. See the
C description of data set
C RPAR
C in subroutine file 'rpar.for'.
C Default: RPAR=' ' which means ISRFX1=-1 and ISRFX2=-2
C ICREC=positive integer ... Color to be used for plotting the
C receivers. The color is chosen according to COLORS.
C Default: ICREC=1
C ISREC=positive integer ... Index of symbol to be used for plotting
C the receivers according to the file SYMBOLS.
C Default: ISREC=3
C HREC=real ... Height (in centimeters) of the symbols used for
C plotting the receivers.
C Default: HREC=0.3
C
C Example of the input parameters in history file
C len-crt.h.
C
C
C
C Input formatted file SYMBOLS:
C The file contains in I-th line a single integer telling the index
C of symbol to be used to plot the rays or triangles of the history
C I or -I. Only MSYMB different symbols are available, all the rays
C with value of ray history greater or equal (in absolut value)
C MSYMB will be ploted with the same symbols.
C For MSYMB refer to the file
C 'rpplot.inc'.
C Example of data
C SYMBOLS.
C Another example of data
C SYMBOLS.
C
C
C Input formatted file COLORS:
C The file contains in I-th line a single integer telling the index
C of colour to be used to plot the rays or triangles of the history
C I or -I according to the file
C 'calcops.rgb',
C or according to the colors defined in the source code
C 'calcops.for'
C if 'calcops.rgb' is not available.
c Only MCOL different colors are available, all the rays
C and triangles with value of ray history greater or equal (in
C absolut value) MCOL will be ploted in the same colors.
C For MCOL refer to the file
C 'rpplot.inc'.
C Example of data
C COLORS.
C
C ......................................................................
C Subroutines and external functions required:
EXTERNAL RPPLER,CIREAD,CIERAS,RPTPL,RPRPL,RPSYMB,SYMBOL,
*ERROR,RSEP1,RSEP3T,RSEP3R,RSEP3I,PLOTS,PLOT,NEWPEN,PLOTN,AP00
C RPPLER,CIREAD,CIERAS,RPTPL,RPRPL ... This file.
C RPSYMB ... File
C rpsymb.for.
C ERROR ... File
C error.for.
C RSEP1,RSEP3I,RSEP3T,RSEP3R ... File
C sep.for.
C PLOTS,PLOT,NEWPEN,PLOTN,SYMBOL ... File
C calcops.for.
C AP00 ... File ap.for.
C
C Common block /RAM/ to store the information about triangles and rays:
INCLUDE 'rpplot.inc'
C
C.......................................................................
C
C Auxiliary storage locations:
INTEGER IRAY1,IRAY2,IRAY3,IR0
INTEGER I1,I2,IT1
INTEGER I,J,K,L,M,N,ISRFX1,ISRFX2
INTEGER IRBAS,IRTWO,IRAUX,ITHOM,ISANG,ISREC,ICREC,IWAVES,ISRCS
REAL HREC,XREC(3),P1,P2
INTEGER LU0,LU1,LU2,LU3,LU4,LU5,LU6,LU7
LOGICAL LEND
PARAMETER (LU0=10,LU1=1,LU2=2,LU3=3,LU4=4,LU5=5,LU6=6,LU7=7)
CHARACTER*80 FILSEP,FILINI,FILTRI,FILSYM,FILCOL,FILCRT,FILREC,
* FILRPA,CH,CH1,FILEPS
C-----------------------------------------------------------------------
C
LEND=.FALSE.
C
C Reading name of SEP file with input data:
WRITE(*,'(A)') '+RPPLOT: Enter input filename: '
FILSEP=' '
READ(*,*) FILSEP
C
C Reading all data from the SEP file into the memory:
IF (FILSEP.NE.' ') THEN
CALL RSEP1(LU0,FILSEP)
ELSE
C RPPLOT-04
CALL ERROR('RPPLOT-04: SEP file not given')
C Input file in the form of the SEP (Stanford Exploration Project)
C parameter or history file must be specified.
C There is no default filename.
ENDIF
WRITE(*,'(A)') '+RPPLOT: Working... '
C
C Reading quantities telling what is to be plotted:
CALL RSEP3I('IRBAS',IRBAS,1)
CALL RSEP3I('IRTWO',IRTWO,1)
CALL RSEP3I('IRAUX',IRAUX,1)
CALL RSEP3I('ITHOM',ITHOM,1)
CALL RSEP3I('ISANG',ISANG,1)
CALL RSEP3I('ISHP ',ISHP ,0)
CALL RSEP3I('ISUC ',ISUC ,0)
LRBAS=.FALSE.
LRTWO=.FALSE.
LRAUX=.FALSE.
LTHOM=.FALSE.
LSANG=.FALSE.
IF (IRBAS.EQ.1) LRBAS=.TRUE.
IF (IRTWO.EQ.1) LRTWO=.TRUE.
IF (IRAUX.EQ.1) LRAUX=.TRUE.
IF (ITHOM.EQ.1) LTHOM=.TRUE.
IF (ISANG.EQ.1) LSANG=.TRUE.
C
C Reading limits of the plot:
CALL RSEP3R('PLIM1',PLIMIT(1),0.)
CALL RSEP3R('PLIM2',PLIMIT(2),1.)
CALL RSEP3R('PLIM3',PLIMIT(3),0.)
CALL RSEP3R('PLIM4',PLIMIT(4),1.)
C
C Reading heights of symbols and names of files:
CALL RSEP3R('HRBAS',HRBAS,0.2)
CALL RSEP3R('HRTWO',HRTWO,0.2)
CALL RSEP3R('HRAUX',HRAUX,0.2)
CALL RSEP3R('HSIZE',HOR,15.)
CALL RSEP3R('VSIZE',VER,15.)
CALL RSEP3R('HTEXT',HTEXT,0.5)
CALL RSEP3T('SYMBOLS',FILSYM,' ')
CALL RSEP3T('COLORS',FILCOL,' ')
CALL RSEP3T('RPPLOT',FILEPS,' ')
C
C Reading filenames of the files with computed triangles and rays
C and index of the wave:
CALL RSEP3T('CRTOUT',FILCRT,' ')
FILINI='s01i.out'
FILTRI='t01.out'
IF (FILCRT.NE.' ') THEN
OPEN(LU1,FILE=FILCRT,FORM='FORMATTED',STATUS='OLD')
READ(LU1,*) CH,CH1,FILINI,FILTRI
CLOSE(LU1)
ENDIF
CALL RSEP3I('ISRCS',ISRCS,0)
CALL RSEP3I('IWAVES',IWAVES,0)
C
C Reading quantities and filename used for plotting receivers:
CALL RSEP3T('REC',FILREC,' ')
CALL RSEP3T('RPAR',FILRPA,' ')
CALL RSEP3I('ISREC',ISREC,3)
CALL RSEP3I('ICREC',ICREC,1)
CALL RSEP3R('HREC',HREC,0.3)
C
C
IF (LTHOM) THEN
C Reading file with computed triangles,
C sorting the rays in triangles:
NT=0
NRAMP=0
IRAYMI=1
IRAYMA=0
OPEN(LU3,FILE=FILTRI,FORM='FORMATTED',STATUS='OLD')
10 CONTINUE
READ(LU3,*,END=20) IRAY1,IRAY2,IRAY3
IF (IRAY1.EQ.0) THEN
C New elementary wave:
12 CONTINUE
IF (((ISRCS.NE.0).AND.(IRAY2.NE.ISRCS)).OR.
* ((IWAVES.NE.0).AND.(IRAY3.NE.IWAVES))) THEN
C Skipping all the rays of this elementary wave:
14 CONTINUE
READ(LU3,*,END=20) IRAY1,IRAY2,IRAY3
IF (IRAY1.NE.0) GOTO 14
GOTO 12
ELSE
GOTO 10
ENDIF
ENDIF
C
IF (IRAY3.EQ.0) THEN
C RPPLOT-05
CALL WARN('RPPLOT-05: Triangles can not be plotted')
C The third index of the ray in file 'CRT-T' is zero, which
C indicates one-parametric shooting, homogeneous triangles
C cannot be plotted.
GOTO 20
ENDIF
C
IF (IRAY1.GT.IRAYMA) IRAYMA=IRAY1
IF (IRAY2.GT.IRAYMA) IRAYMA=IRAY2
IF (IRAY3.GT.IRAYMA) IRAYMA=IRAY3
IF (IRAY1.LT.IRAY2) THEN
I=IRAY1
IRAY1=IRAY2
IRAY2=I
ENDIF
IF (IRAY2.LT.IRAY3) THEN
I=IRAY2
IRAY2=IRAY3
IRAY3=I
ENDIF
IF (IRAY1.LT.IRAY2) THEN
I=IRAY1
IRAY1=IRAY2
IRAY2=I
ENDIF
NRAMP=NRAMP+1
IF (NRAMP.GT.MRAM) CALL RPPLER
IRAM(NRAMP)=IRAY1
NRAMP=NRAMP+1
IF (NRAMP.GT.MRAM) CALL RPPLER
IRAM(NRAMP)=IRAY2
NRAMP=NRAMP+1
IF (NRAMP.GT.MRAM) CALL RPPLER
IRAM(NRAMP)=IRAY3
NT=NT+1
GOTO 10
20 CONTINUE
CLOSE(LU3)
NR=IRAYMA
C
C Sorting the triangles:
DO 40, I1=NRAMP-5,1,-3
DO 30, I2=1,I1,3
L=I2+3
IF (IRAM(I2).GT.IRAM(L)) THEN
J=I2+1
K=I2+2
M=I2+4
N=I2+5
I =IRAM(I2)
IRAM(I2)=IRAM(L)
IRAM(L) =I
I =IRAM(J)
IRAM(J) =IRAM(M)
IRAM(M) =I
I =IRAM(K)
IRAM(K) =IRAM(N)
IRAM(N) =I
ENDIF
30 CONTINUE
40 CONTINUE
C
C
C Forming an auxiliary array with information about when can be
C rays erased from the memory ("deleting array"):
IF (NRAMP+NR.GT.MRAM) CALL RPPLER
DO 50, I1=NRAMP+1,NRAMP+NR
IRAM(I1)=I1-NRAMP
50 CONTINUE
NRAMP=NRAMP+NR
ORAYE=-3*NT
DO 60, I1=1,3*NT,3
IRAM(IRAM(I1 )-ORAYE)=IRAM(I1)
IRAM(IRAM(I1+1)-ORAYE)=IRAM(I1)
IRAM(IRAM(I1+2)-ORAYE)=IRAM(I1)
60 CONTINUE
ELSE
NR=0
NT=0
ORAYE=0
NRAMP=0
IRAYMI=0
ENDIF
C
C
C Forming an auxiliary array with information about addresses
C of the ends of records for rays in array RAM ("addressing array"):
C "Ray" IRAYMI-1:
NRAMP=NRAMP+1
IF (NRAMP.GT.MRAM) CALL RPPLER
IRAM(NRAMP)=NRAMP+NR
C All other rays:
IF (NRAMP+NR.GT.MRAM) CALL RPPLER
DO 70, I1=NRAMP+1,NRAMP+NR
IRAM(I1)=0
70 CONTINUE
NRAMP=NRAMP+NR
ORAYA=-3*NT-NR-1
C
C
C Choosing symbols:
DO 71, I1=1,MSYMB
ISYMB(I1)=I1
71 CONTINUE
C
OPEN(LU4,FILE=FILSYM,STATUS='OLD',ERR=74)
DO 72, I1=1,MSYMB
READ (LU4,*,END=74) ISYMB(I1)
72 CONTINUE
74 CONTINUE
CLOSE (LU4)
C
C Choosing colours:
DO 75, I1=1,MCOL
ICOL(I1)=I1
75 CONTINUE
C
OPEN(LU5,FILE=FILCOL,STATUS='OLD',ERR=78)
DO 76, I1=1,MCOL
READ (LU5,*,END=78) ICOL(I1)
76 CONTINUE
78 CONTINUE
CLOSE (LU5)
C
P1DIF=PLIMIT(2)-PLIMIT(1)
P2DIF=PLIMIT(4)-PLIMIT(3)
DO=(HOR+VER)/13.
C
IF(FILEPS.NE.' ') THEN
CALL PLOTN(FILEPS,0)
END IF
CALL PLOTS(0,0,0)
CALL RPSYMB(0,0.,0.,0.)
C
C Contures:
CALL NEWPEN(1)
CALL PLOT(HOR*((PLIMIT(1)-PLIMIT(1))/P1DIF)+DO,
* VER*((PLIMIT(3)-PLIMIT(3))/P2DIF)+DO,3)
CALL PLOT(HOR*((PLIMIT(2)-PLIMIT(1))/P1DIF)+DO,
* VER*((PLIMIT(3)-PLIMIT(3))/P2DIF)+DO,2)
CALL PLOT(HOR*((PLIMIT(2)-PLIMIT(1))/P1DIF)+DO,
* VER*((PLIMIT(4)-PLIMIT(3))/P2DIF)+DO,2)
CALL PLOT(HOR*((PLIMIT(1)-PLIMIT(1))/P1DIF)+DO,
* VER*((PLIMIT(4)-PLIMIT(3))/P2DIF)+DO,2)
CALL PLOT(HOR*((PLIMIT(1)-PLIMIT(1))/P1DIF)+DO,
* VER*((PLIMIT(3)-PLIMIT(3))/P2DIF)+DO,2)
CALL PLOT(HOR*((PLIMIT(1)-PLIMIT(1))/P1DIF)+DO,
* VER*((PLIMIT(3)-PLIMIT(3))/P2DIF)+DO,3)
C
C Labels along the figure:
IF (LSANG) THEN
CALL SYMBOL(HOR*( 0.1 )+DO,
* VER*( 0. )+DO-1.5*HTEXT,
* HTEXT,'FIRST SHOOTING PARAMETER',0.,24)
CALL SYMBOL(HOR*(0. )+DO-0.5*HTEXT,
* VER*(0.1 )+DO ,
* HTEXT,'SECOND SHOOTING PARAMETER',90.,25)
ELSE
CALL SYMBOL(HOR*( 0.1 )+DO,
* VER*( 0. )+DO-1.5*HTEXT,
* HTEXT,'FIRST SURFACE COORDINATE',0.,24)
CALL SYMBOL(HOR*(0. )+DO-0.5*HTEXT,
* VER*(0.1 )+DO ,
* HTEXT,'SECOND SURFACE COORDINATE',90.,25)
ENDIF
C
C Plotting receivers:
IF (.NOT.LSANG) THEN
OPEN(LU6,FILE=FILREC,FORM='FORMATTED',STATUS='OLD',ERR=80)
READ(LU6,*,END=80) CH
CALL NEWPEN(ICREC)
ISRFX1=1
ISRFX2=2
IF (FILRPA.NE.' ') THEN
OPEN(LU7,FILE=FILRPA,FORM='FORMATTED',STATUS='OLD')
READ(LU7,*,END=79,ERR=79) CH
READ(LU7,*,END=79,ERR=79) I1,ISRFX1,ISRFX2
ISRFX1=IABS(ISRFX1)
ISRFX2=IABS(ISRFX2)
IF (((ISRFX1.NE.1).AND.(ISRFX1.NE.2).AND.(ISRFX1.NE.3)).OR.
* ((ISRFX2.NE.1).AND.(ISRFX2.NE.2).AND.(ISRFX2.NE.3))) THEN
C RPPLOT-06
CALL ERROR('RPPLOT-06: Cannot handle this value of ISRFXi')
C Program RPPLOT can handle only the values -1, -2 and -3 for
C ISRFX1 and ISRFX2 - the X1 and X2 functions must coincide
C with the model coordinates.
ENDIF
CLOSE(LU7)
GOTO 81
79 CONTINUE
C RPPLOT-07
CALL ERROR('RPPLOT-07: Error when reading ISRFXi')
C Program RPPLOT was not able to read the values of ISRFX1
C and ISRFX2 from the file RPAR.
C See the description of parameter RPAR.
ENDIF
81 CONTINUE
CH='$'
XREC(1)=0.
XREC(2)=0.
XREC(3)=0.
READ(LU6,*,END=80) CH,XREC
IF (CH.EQ.'$') GOTO 81
P1=XREC(ISRFX1)
P2=XREC(ISRFX2)
IF ((P1.GE.PLIMIT(1)).AND.(P1.LE.PLIMIT(2)).AND.
* (P2.GE.PLIMIT(3)).AND.(P2.LE.PLIMIT(4)))
* CALL RPSYMB(ISREC,
* HOR*((P1-PLIMIT(1))/P1DIF)+DO,
* VER*((P2-PLIMIT(3))/P2DIF)+DO,HREC)
GOTO 81
ENDIF
C
C
80 CLOSE(LU6)
OPEN(LU2,FILE=FILINI,FORM='UNFORMATTED',STATUS='OLD')
IR0=0
IF (LTHOM) THEN
C Loop for all the triangles:
DO 100, IT1=1,3*NT-2,3
C
C If necessary, reading new rays:
IF ((IRAM(IRAM(IT1)-ORAYA+1).EQ.0).AND.(.NOT.LEND)) THEN
CALL CIREAD(LU2,IRAM(IT1),ISRCS,IWAVES,LEND)
ENDIF
C
C Empting the array RAM:
IF ((MRAM-NRAMP).LT.(MRAM/10.)) CALL CIERAS
C
C Plotting the triangle:
CALL RPTPL(IT1)
C
C Plotting the rays:
DO 102, I1=IR0+1,IRAM(IT1)
CALL RPRPL(I1)
102 CONTINUE
IR0=IRAM(IT1)
C
100 CONTINUE
C End of the loop for all the triangles.
ENDIF
C Plotting remaining rays:
110 CONTINUE
IF (.NOT.LEND) THEN
IR0=IR0+1
CALL CIREAD(LU2,IR0,ISRCS,IWAVES,LEND)
CALL RPRPL(IR0)
GOTO 110
ENDIF
C
CALL PLOT(0.,0.,999)
WRITE(*,'(A)') '+RPPLOT: Done. '
STOP
END
C
C
C=======================================================================
C
SUBROUTINE CIREAD(LU2,IR1,ISRCS,IWAVES,LEND)
C
C----------------------------------------------------------------------
C Subroutine to read the unformatted output of program CRT and
C to write it into array (I)RAM.
C Reading the output files is completed by a simple invocation of
C subroutine AP00 of file 'ap.for'.
C
INTEGER LU2,IR1,ISRCS,IWAVES
LOGICAL LEND
C Input:
C LU2 ... Number of logical unit corresponding to the file with
C the quantities at the initial points of rays.
C IR1 ... Index of the first ray of the actually processed
C triangle.
C ISRCS .. Index of the source of the wave to be plotted.
C IWAVES.. Index of the elementary wave to be plotted.
C Output:
C LEND .. .TRUE. when the end of file with rays is reached,
C othervise .FALSE..
C
C Coded by Petr Bulant
C
C ...........................
C Common block /POINTC/ to store the results of complete ray tracing:
INCLUDE 'pointc.inc'
C None of the storage locations of the common block are altered.
C ...........................
C Common block /RAM/ to store the information about triangles and rays:
INCLUDE 'rpplot.inc'
C
C-----------------------------------------------------------------------
C Loop for the points of rays:
10 CONTINUE
IF ((NRAMP+2*NQ).GT.MRAM) THEN
C Freeing the memory:
CALL CIERAS
IF ((NRAMP+2*NQ).GT.MRAM) CALL RPPLER
ENDIF
C Reading the results of the complete ray tracing:
CALL AP00(0,0,LU2)
IF (IWAVE.LT.1) THEN
C End of rays:
CLOSE(LU2)
LEND=.TRUE.
RETURN
ENDIF
IF (((ISRCS.NE.0).AND.(ISRCS.NE.ISRC)).OR.
* ((IWAVES.NE.0).AND.(IWAVES.NE.IWAVE)))
C Skipping this elementary wave:
* GOTO 10
IF (IRAY.LT.IRAYMI) GOTO 10
IF (IRAM(IRAY-ORAYE).NE.0) THEN
C Writing the results of the complete ray tracing - recording
C new initial point on a ray:
IF (LSANG) THEN
C Normalized ray parameters:
RAM(NRAMP+1)=YI(26)
RAM(NRAMP+2)=YI(27)
ELSE
C Reference surface coordinates:
RAM(NRAMP+1)=YI(28)
RAM(NRAMP+2)=YI(29)
ENDIF
C Index of the receiver:
IRAM(NRAMP+3)=IREC
C History:
IF (ISHEET.EQ.0) ISHEET=1
IRAM(NRAMP+4)=ISHEET
NRAMP=NRAMP+NQ
ENDIF
IRAM(IRAY-ORAYA)=NRAMP
IF (IRAY.GT.IR1) RETURN
GOTO 10
C
END
C
C
C=======================================================================
C
SUBROUTINE CIERAS
C
C----------------------------------------------------------------------
C Subroutine for empting the array (I)RAM. All the parameters
C of all the rays, which will no more be used, are erased.
C
C No input.
C No output.
C
C Subroutines and external functions required:
C
C Coded by Petr Bulant
C
C ...........................
C Common block /POINTC/ to store the results of complete ray tracing:
INCLUDE 'pointc.inc'
C IRAY .. Index of the ray being actually read in by CIREAD.
C This procedure supposes, that any ray with higher
C index than IRAY was not read in.
C None of the storage locations of the common block are altered.
C ...........................
C Common block /RAM/ to store the information about triangles and rays:
INCLUDE 'rpplot.inc'
C.......................................................................
C Auxiliary storage locations:
INTEGER I1,I2,J1
INTEGER IADDRP
C I1 ... Controls main loop over rays.
C I2 ... Controls the loop over parameters of ray I1.
C J1 ... address of the last used record of array RAM.
C
C-----------------------------------------------------------------------
J1=IRAM(IRAYMI-1-ORAYA)
IADDRP=J1
C Loop for the rays:
DO 20, I1=IRAYMI,IRAY
IF (IRAM(I1-ORAYE).GE.(IRAY-1)) THEN
C This ray is not to be erased:
DO 10, I2=IADDRP+1,IRAM(I1-ORAYA)
J1=J1+1
RAM(J1)=RAM(I2)
10 CONTINUE
IADDRP=IRAM(I1-ORAYA)
IRAM(I1-ORAYA)=J1
ELSE
C This ray is to be erased:
IRAM(I1-ORAYE)=0
IADDRP=IRAM(I1-ORAYA)
IRAM(I1-ORAYA)=J1
ENDIF
20 CONTINUE
NRAMP=J1
RETURN
END
C=======================================================================
C
SUBROUTINE RPTPL(IT1)
C
C----------------------------------------------------------------------
C Subroutine for plotting the triangle formed by the rays
C IRAM(IT1), IRAM(IT1+1), IRAM(IT1+2).
C
INTEGER IT1
C Input:
C IT1 ... The address of the index of the first ray of the triangle
C to be plotted.
C No output.
C
C Coded by Petr Bulant
C
C ...........................
C Common block /RAM/ to store the information about triangles and rays:
INCLUDE 'rpplot.inc'
C.......................................................................
C Auxiliary storage locations:
INTEGER I1,ILIN,ISH
REAL P1A,P2A,P1B,P2B,P1C,P2C,P1,P2,P1O,P2O
REAL P1MI,P1MA,P2MI,P2MA,DP1,DP2
LOGICAL LPL
C-----------------------------------------------------------------------
IF ((IRAM(IRAM(IT1 )-ORAYA).EQ.0).OR.
* (IRAM(IRAM(IT1+1)-ORAYA).EQ.0).OR.
* (IRAM(IRAM(IT1+2)-ORAYA).EQ.0)) THEN
C RPPLOT-01
CALL ERROR('RPPLOT-01: Parameters of a ray not found in memory')
C This error may be caused by
C K2P
C not equal to zero, then only two-point rays are stored in
C output files of CRT.
C It may occur also in case, when a file with points along rays is
C specified instead of input file with initial points of rays.
C This also happens when there is less than ISRCS sources or less
C than IWAVES elementary waves in the file with initial points.
ENDIF
C
P1A=RAM(IRAM(IRAM(IT1 )-ORAYA-1)+1)
P2A=RAM(IRAM(IRAM(IT1 )-ORAYA-1)+2)
P1B=RAM(IRAM(IRAM(IT1+1)-ORAYA-1)+1)
P2B=RAM(IRAM(IRAM(IT1+1)-ORAYA-1)+2)
P1C=RAM(IRAM(IRAM(IT1+2)-ORAYA-1)+1)
P2C=RAM(IRAM(IRAM(IT1+2)-ORAYA-1)+2)
ISH=IRAM(IRAM(IRAM(IT1+2)-ORAYA-1)+4)
C
IF ((ISHP.NE.0).AND.(ISHP.NE.ISH)) RETURN
C
IF ((.NOT.LSANG).AND.(ISH.LE.0)) RETURN
C
P1MI=AMIN1(P1A,P1B,P1C)
P1MA=AMAX1(P1A,P1B,P1C)
P2MI=AMIN1(P2A,P2B,P2C)
P2MA=AMAX1(P2A,P2B,P2C)
C
ILIN=50*INT(AMAX1(((P1MA-P1MI)/P1DIF),((P2MA-P2MI)/P2DIF),1.))
IF ((P1MI.GE.PLIMIT(1)).AND.(P1MA.LE.PLIMIT(2)).AND.
* (P2MI.GE.PLIMIT(3)).AND.(P2MA.LE.PLIMIT(4))) ILIN=1
C
P1=P1A
P2=P2A
IF ((P1.GE.PLIMIT(1)).AND.(P1.LE.PLIMIT(2)).AND.
* (P2.GE.PLIMIT(3)).AND.(P2.LE.PLIMIT(4))) THEN
IF ((ISUC.EQ.1).AND.(ISH.LT.0)) THEN
CALL NEWPEN(1)
ELSE
CALL NEWPEN(ICOL(MIN0(MCOL,IABS(ISH))))
ENDIF
CALL PLOT(HOR*((P1-PLIMIT(1))/P1DIF) +DO,
* VER*((P2-PLIMIT(3))/P2DIF) +DO,3)
P1O=P1
P2O=P2
LPL=.TRUE.
ELSE
LPL=.FALSE.
ENDIF
DP1=(P1B-P1A)/ILIN
DP2=(P2B-P2A)/ILIN
DO 30, I1=1,ILIN
P1=P1+DP1
P2=P2+DP2
IF ((P1.GE.PLIMIT(1)).AND.(P1.LE.PLIMIT(2)).AND.
* (P2.GE.PLIMIT(3)).AND.(P2.LE.PLIMIT(4))) THEN
IF (LPL) THEN
CALL PLOT(HOR*((P1-PLIMIT(1))/P1DIF) +DO,
* VER*((P2-PLIMIT(3))/P2DIF) +DO,2)
P1O=P1
P2O=P2
ELSE
IF ((ISUC.EQ.1).AND.(ISH.LT.0)) THEN
CALL NEWPEN(1)
ELSE
CALL NEWPEN(ICOL(MIN0(MCOL,IABS(ISH))))
ENDIF
CALL PLOT(HOR*((P1-PLIMIT(1))/P1DIF) +DO,
* VER*((P2-PLIMIT(3))/P2DIF) +DO,3)
P1O=P1
P2O=P2
LPL=.TRUE.
ENDIF
ELSE
IF (LPL) THEN
CALL PLOT(HOR*((P1O-PLIMIT(1))/P1DIF) +DO,
* VER*((P2O-PLIMIT(3))/P2DIF) +DO,3)
LPL=.FALSE.
ENDIF
ENDIF
30 CONTINUE
DP1=(P1C-P1B)/ILIN
DP2=(P2C-P2B)/ILIN
DO 32, I1=1,ILIN
P1=P1+DP1
P2=P2+DP2
IF ((P1.GE.PLIMIT(1)).AND.(P1.LE.PLIMIT(2)).AND.
* (P2.GE.PLIMIT(3)).AND.(P2.LE.PLIMIT(4))) THEN
IF (LPL) THEN
CALL PLOT(HOR*((P1-PLIMIT(1))/P1DIF) +DO,
* VER*((P2-PLIMIT(3))/P2DIF) +DO,2)
P1O=P1
P2O=P2
ELSE
IF ((ISUC.EQ.1).AND.(ISH.LT.0)) THEN
CALL NEWPEN(1)
ELSE
CALL NEWPEN(ICOL(MIN0(MCOL,IABS(ISH))))
ENDIF
CALL PLOT(HOR*((P1-PLIMIT(1))/P1DIF) +DO,
* VER*((P2-PLIMIT(3))/P2DIF) +DO,3)
P1O=P1
P2O=P2
LPL=.TRUE.
ENDIF
ELSE
IF (LPL) THEN
CALL PLOT(HOR*((P1O-PLIMIT(1))/P1DIF) +DO,
* VER*((P2O-PLIMIT(3))/P2DIF) +DO,3)
LPL=.FALSE.
ENDIF
ENDIF
32 CONTINUE
DP1=(P1A-P1C)/ILIN
DP2=(P2A-P2C)/ILIN
DO 34, I1=1,ILIN
P1=P1+DP1
P2=P2+DP2
IF ((P1.GE.PLIMIT(1)).AND.(P1.LE.PLIMIT(2)).AND.
* (P2.GE.PLIMIT(3)).AND.(P2.LE.PLIMIT(4))) THEN
IF (LPL) THEN
CALL PLOT(HOR*((P1-PLIMIT(1))/P1DIF) +DO,
* VER*((P2-PLIMIT(3))/P2DIF) +DO,2)
P1O=P1
P2O=P2
ELSE
IF ((ISUC.EQ.1).AND.(ISH.LT.0)) THEN
CALL NEWPEN(1)
ELSE
CALL NEWPEN(ICOL(MIN0(MCOL,IABS(ISH))))
ENDIF
CALL PLOT(HOR*((P1-PLIMIT(1))/P1DIF) +DO,
* VER*((P2-PLIMIT(3))/P2DIF) +DO,3)
P1O=P1
P2O=P2
LPL=.TRUE.
ENDIF
ELSE
IF (LPL) THEN
CALL PLOT(HOR*((P1O-PLIMIT(1))/P1DIF) +DO,
* VER*((P2O-PLIMIT(3))/P2DIF) +DO,3)
LPL=.FALSE.
ENDIF
ENDIF
34 CONTINUE
RETURN
END
C=======================================================================
C
SUBROUTINE RPRPL(IR1)
C
C----------------------------------------------------------------------
C Subroutine for plotting the ray IR1.
C
INTEGER IR1
C Input:
C IR1 ... Index of the ray to be plotted.
C No output.
C
C Coded by Petr Bulant
C
C ...........................
C Common block /RAM/ to store the information about triangles and rays:
INCLUDE 'rpplot.inc'
C.......................................................................
C Auxiliary storage locations:
INTEGER ISH,IREC
REAL P1,P2
C-----------------------------------------------------------------------
IF (IRAM(IR1-ORAYA).EQ.0) THEN
C RPPLOT-02
CALL ERROR('RPPLOT-02: Parameters of a ray not found in memory')
C This error may be caused by
C K2P
C not equal to zero, then only two-point rays are stored in
C output files of CRT.
C It may occur also in case, when a file with points along rays is
C specified instead of input file with initial points of rays.
C This also happens when there is less than ISRCS sources or less
C than IWAVES elementary waves in the file with initial points.
ENDIF
C
P1=RAM(IRAM(IR1-ORAYA-1)+1)
P2=RAM(IRAM(IR1-ORAYA-1)+2)
IREC=IRAM(IRAM(IR1-ORAYA-1)+3)
ISH =IRAM(IRAM(IR1-ORAYA-1)+4)
C
IF ((ISHP.NE.0).AND.(ISHP.NE.ISH)) RETURN
C
IF ((.NOT.LSANG).AND.(ISH.LE.0)) RETURN
C
IF ((P1.GE.PLIMIT(1)).AND.(P1.LE.PLIMIT(2)).AND.
* (P2.GE.PLIMIT(3)).AND.(P2.LE.PLIMIT(4))) THEN
IF ((ISUC.EQ.1).AND.(ISH.LT.0)) THEN
CALL NEWPEN(1)
ELSE
CALL NEWPEN(ICOL(MIN0(MCOL,IABS(ISH))))
ENDIF
IF (LRBAS.AND.(IREC.EQ.0)) THEN
C Basic ray:
CALL RPSYMB(ISYMB(MIN0(MSYMB,IABS(ISH))),
* HOR*((P1-PLIMIT(1))/P1DIF)+DO,
* VER*((P2-PLIMIT(3))/P2DIF)+DO,HRBAS)
RETURN
ENDIF
IF (LRTWO.AND.(IREC.GT.0)) THEN
C Two-point ray:
CALL RPSYMB(ISYMB(MIN0(MSYMB,IABS(ISH))),
* HOR*((P1-PLIMIT(1))/P1DIF)+DO,
* VER*((P2-PLIMIT(3))/P2DIF)+DO,HRTWO)
RETURN
ENDIF
IF (LRAUX.AND.(IREC.EQ.-1)) THEN
C Auxiliary ray:
CALL RPSYMB(ISYMB(MIN0(MSYMB,IABS(ISH))),
* HOR*((P1-PLIMIT(1))/P1DIF)+DO,
* VER*((P2-PLIMIT(3))/P2DIF)+DO,HRAUX)
RETURN
ENDIF
ENDIF
END
C=======================================================================
C
SUBROUTINE RPPLER
C
C----------------------------------------------------------------------
C RPPLOT-03
CALL ERROR('RPPLOT-03: Array (I)RAM too small')
C This error may be caused by too small dimension of array
C RAM. Try to enlarge the parameter MRAM in common block
C RAM.
END
C
C=======================================================================
C
INCLUDE 'error.for'
C error.for
INCLUDE 'sep.for'
C sep.for
INCLUDE 'forms.for'
C forms.for
INCLUDE 'length.for'
C length.for
INCLUDE 'calcops.for'
C calcops.for
INCLUDE 'ap.for'
C ap.for
INCLUDE 'rpsymb.for'
C rpsymb.for
C
C=======================================================================
C
|
__label__pos
| 0.542259 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
PerlMonks
Answer: How do I lock tables using DBI and mySQL?
( #111675=categorized answer: print w/ replies, xml ) Need Help??
Q&A > database programming > How do I lock tables using DBI and mySQL? contributed by blakem
Yes, I that should work... Table locking is done at the per-thread level, and I think both statement handles above exist within the same thread.
Comment on Answer: How do I lock tables using DBI and mySQL?
Log In?
Username:
Password:
What's my password?
Create A New User
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (15)
As of 2014-07-30 19:41 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My favorite superfluous repetitious redundant duplicative phrase is:
Results (240 votes), past polls
|
__label__pos
| 0.690074 |
/*
*
* cblas_zher2k.c
* This program is a C interface to zher2k.
* Written by Keita Teranishi
* 4/8/1998
*
*/
#include "cblas.h"
#include "cblas_f77.h"
void cblas_zher2k(const enum CBLAS_ORDER Order, const enum CBLAS_UPLO Uplo,
const enum CBLAS_TRANSPOSE Trans, const int N, const int K,
const void *alpha, const void *A, const int lda,
const void *B, const int ldb, const double beta,
void *C, const int ldc)
{
char UL, TR;
#ifdef F77_CHAR
F77_CHAR F77_TR, F77_UL;
#else
#define F77_TR &TR
#define F77_UL &UL
#endif
#ifdef F77_INT
F77_INT F77_N=N, F77_K=K, F77_lda=lda, F77_ldb=ldb;
F77_INT F77_ldc=ldc;
#else
#define F77_N N
#define F77_K K
#define F77_lda lda
#define F77_ldb ldb
#define F77_ldc ldc
#endif
double ALPHA[2];
const double *alp=(double *)alpha;
if( Order == CblasColMajor )
{
if( Uplo == CblasUpper) UL='U';
else if ( Uplo == CblasLower ) UL='L';
else
{
cblas_xerbla(2, "cblas_zher2k", "Illegal Uplo setting, %d\n", Uplo);
return;
}
if( Trans == CblasTrans) TR ='T';
else if ( Trans == CblasConjTrans ) TR='C';
else if ( Trans == CblasNoTrans ) TR='N';
else
{
cblas_xerbla(3, "cblas_zher2k", "Illegal Trans setting, %d\n", Trans);
return;
}
#ifdef F77_CHAR
F77_UL = C2F_CHAR(&UL);
F77_TR = C2F_CHAR(&TR);
#endif
F77_zher2k(F77_UL, F77_TR, &F77_N, &F77_K, alpha, A, &F77_lda, B, &F77_ldb, &beta, C, &F77_ldc);
} else if (Order == CblasRowMajor)
{
if( Uplo == CblasUpper) UL='L';
else if ( Uplo == CblasLower ) UL='U';
else
{
cblas_xerbla(2, "cblas_zher2k", "Illegal Uplo setting, %d\n", Uplo);
return;
}
if( Trans == CblasTrans) TR ='N';
else if ( Trans == CblasConjTrans ) TR='N';
else if ( Trans == CblasNoTrans ) TR='C';
else
{
cblas_xerbla(3, "cblas_zher2k", "Illegal Trans setting, %d\n", Trans);
return;
}
#ifdef F77_CHAR
F77_UL = C2F_CHAR(&UL);
F77_TR = C2F_CHAR(&TR);
#endif
ALPHA[0]= *alp;
ALPHA[1]= -alp[1];
F77_zher2k(F77_UL,F77_TR, &F77_N, &F77_K, ALPHA, A, &F77_lda, B, &F77_ldb, &beta, C, &F77_ldc);
} else cblas_xerbla(1, "cblas_zher2k", "Illegal Order setting, %d\n", Order);
return;
}
|
__label__pos
| 0.94922 |
Dependency Convergence
Legend:
[Error] At least one dependency has a differing version of the dependency or has SNAPSHOT dependencies.
Statistics:
Number of dependencies (NOD): 11
Number of unique artifacts (NOA): 13
Number of version-conflicting artifacts (NOC): 2
Number of SNAPSHOT artifacts (NOS): 0
Convergence (NOD/NOA): [Error] 84 %
Ready for release (100% convergence and no SNAPSHOTS): [Error] Error
You do not have 100% convergence.
Dependencies used in this project
junit:junit
[Error]
3.8.1
org.codehaus.plexus:plexus-archiver:jar:3.5
\- org.codehaus.plexus:plexus-container-default:jar:1.0-alpha-30:provided
+- org.codehaus.plexus:plexus-classworlds:jar:1.2-alpha-9:provided
| \- (junit:junit:jar:3.8.1:provided - omitted for duplicate)
\- (junit:junit:jar:3.8.1:provided - omitted for conflict with 4.12)
4.12
org.codehaus.plexus:plexus-archiver:jar:3.5
\- junit:junit:jar:4.12:test
org.codehaus.plexus:plexus-utils
[Error]
1.4.5
org.codehaus.plexus:plexus-archiver:jar:3.5
\- org.codehaus.plexus:plexus-container-default:jar:1.0-alpha-30:provided
\- (org.codehaus.plexus:plexus-utils:jar:1.4.5:provided - omitted for conflict with 3.0.24)
3.0.24
org.codehaus.plexus:plexus-archiver:jar:3.5
+- org.codehaus.plexus:plexus-utils:jar:3.0.24:compile
\- org.codehaus.plexus:plexus-io:jar:3.0.0:compile
\- (org.codehaus.plexus:plexus-utils:jar:3.0.24:compile - omitted for duplicate)
|
__label__pos
| 0.58912 |
rfOOB: Out-of-bag performance estimation for random forests
View source: R/Rinterface.R
rfOOBR Documentation
Out-of-bag performance estimation for random forests
Description
The method returns internal out-of-bag performance evaluation for given random forests model.
Usage
rfOOB(model)
Arguments
model
The model of type rf or rfNear as returned by CoreModel.
Details
The method returns random forest performance estimations obtained via its out-of-bag sets. The performance measures returned are classification accuracy, average classification margin, and correlation between trees in the forest. The classification margin is defined as the difference between probability of the correct class and probability of the most probable incorrect class. The correlation between models is estimated as the ratio between classification margin variance and variance of the forest as defined in (Breiman, 2001).
Value
The list containing three performance measures computed with out-of-bag instances is returned:
accuracy
the classification accuracy of the forest,
margin
the average margin of classification with the forest,
correlation
the correlation between trees in the forest.
Author(s)
Marko Robnik-Sikonja.
References
Leo Breiman: Random Forests. Machine Learning Journal, 2001, 45, 5-32
See Also
CORElearn, CoreModel.
Examples
# build random forests model with certain parameters
modelRF <- CoreModel(Species ~ ., iris, model="rf",
selectionEstimator="MDL", minNodeWeightRF=5,
rfNoTrees=100, maxThreads=1)
rfOOB(modelRF)
destroyModels(modelRF) # clean up
CORElearn documentation built on Nov. 18, 2022, 5:08 p.m.
|
__label__pos
| 0.680283 |
23
\$\begingroup\$
In my company's code, they use double.tryParse() which is quite good but sets too much security for our needs. As we sometimes have to parse a few billion strings, I came up with this code which is a little bit faster (10%) but I have the feeling that it's not at its best... Unfortunately, this kind of stuff require more knowledge than I have.
private static double GetDoubleValue(string input)
{
double n = 0;
int decimalPosition = input.Length;
bool separatorFound = false;
bool negative = input[0] == '-';
for (int k = (negative ? 1 : 0); k < input.Length; k++)
{
char c = input[k];
if (c == '.' || c == ',')
{
if (separatorFound)
return Double.NaN;
decimalPosition = k + 1;
separatorFound = true;
}
else
{
if (!char.IsDigit(c))
return Double.NaN;
n = (n * 10) + (c - '0');
}
}
return ((negative ? -1 : 1) * n) / CustomPow(10, input.Length - decimalPosition);
}
private static double CustomPow(int num, int exp)
{
double result = 1.0;
while (exp > 0)
{
if (exp%2 == 1)
result *= num;
exp >>= 1;
num *= num;
}
return result;
}
\$\endgroup\$
7
• 1
\$\begingroup\$ I note that you do not parse doubles in exponential format, you do not parse infinities, and so on. Is this intentional? \$\endgroup\$ Jan 6, 2015 at 14:41
• \$\begingroup\$ @EricLippert yes it is, my input data is or a real number (no concept like infinity) or an error (like a bunch of letter or mis-formated number) \$\endgroup\$ Jan 6, 2015 at 14:58
• \$\begingroup\$ If you really want to get more performance you could try to experiment with branching/branch prediction. The custom return-statements can probably slow you down, so you could try to set an error-variable to true inside the loop, but keep parsing and return error afterwards... Branch prediction, instruction pipelining and caching can do wonders on simple for-loops with huge iteration-count so you could try a little around there... \$\endgroup\$
– Falco
Jan 7, 2015 at 9:21
• \$\begingroup\$ You should look at my answer, I have now removed output as double to make sure there is no possible floating error introduced. I now use 2 long variables. \$\endgroup\$
– Fredou
Jan 8, 2015 at 15:03
• \$\begingroup\$ This question could have gone to code golf too :) \$\endgroup\$
– JimmyB
Jan 8, 2015 at 15:40
8 Answers 8
14
\$\begingroup\$
Naming
Avoid single-letter or shortened form variable names. Extra characters on a variable's name are free, and work wonders for a maintenance programmer down the line.
e.g.
double n = 0;
would better be:
double output = 0;
Additionally, I'm not sold on the name GetDoubleValue. At no point does this method retrieve the value from anywhere. What this method does is conversion, so it should be appropriately named as such.
Var
Use the var keyword when defining local variables where the right hand side of the definition makes the type obvious. This looks cleaner and saves time when it comes to changing types during refactoring.
e.g.
bool separatorFound = false;
should be
var separatorFound = false;
You should also use var when declaring foreach and for loop iterators.
e.g.
for (int k = (negative ? 1 : 0); k < input.Length; k++)
should be:
for (var k = (negative ? 1 : 0); k < input.Length; k++)
Braces
Always use braces for if statement bodies. It's cleaner, more explicit in intent, and it's quicker should you later decide to add extra lines to the body.
e.g.
if (!char.IsDigit(c))
return Double.NaN;
should be:
if (!char.IsDigit(c))
{
return Double.NaN;
}
Design
Why have you created the function CustomPow when all you're really doing is repeatedly multiplying by 10? It seems this is a case of over-abstraction, unless you plan to use the method elsewhere too.
Why make GetDoubleValue private? It sounds like a useful function you may want to use elsewhere or in other projects. I suspect it's private because it is in a class it does not belong in, and you don't want somebody calling StringLoader.GetDoubleValue or something like that.
Put it in a utility class or an extension method somewhere, it doesn't make sense as a method of your string loader class or whatever.
\$\endgroup\$
8
• \$\begingroup\$ Well that's a nice answer in many points! Any idea about performance...? \$\endgroup\$ Jan 6, 2015 at 12:09
• \$\begingroup\$ For performance I recommend chucking into visual studio's profiler first, it'll be able to help you see where you're spending most of your processing time. If you put the results up here we'll be able to better help you. \$\endgroup\$
– Nick Udell
Jan 6, 2015 at 12:13
• \$\begingroup\$ about the name of local variable, I found out that it does matter how long the name is also that is why you can see better speed after code obfuscation, all variable name are changed into a,b,c,d,etc. long parameter name DO NOT matter speed wise. \$\endgroup\$
– Fredou
Jan 6, 2015 at 15:26
• 1
\$\begingroup\$ No, it doesn't: stackoverflow.com/questions/2443164/… The compiler is stripping your variables down anyway, so you should use as many characters as you need to get the information across. \$\endgroup\$
– Nick Udell
Jan 6, 2015 at 15:28
• \$\begingroup\$ I agree with the OP's decision to use a private static function, rather than a public member of a utility class. This kind of optimization tends to be pretty tightly focused, so it probably doesn't need to be used in more than one place. Since the optimizations involved are not always safe (fails to handle various cases that double.Parse and double.TryParse can handle properly), it should only be used in the special case where the OP found it to be absolutely necessary. \$\endgroup\$
– Brian
Jan 7, 2015 at 14:07
9
\$\begingroup\$
Nick's answer is great for style points, I just wanted to make you aware of a bug in your implementation:
char.IsDigit(c) will return true for numerical digits not in the Western Arabic numerals (0 1 2 3 4 5 6 7 8 9). It's obscure but it will cause your program to fail. E.g.
var answer = GetDoubleValue("12345०7.56"); // DEVANAGARI DIGIT ZERO
// answer = 1258087.56
You are assuming 0-9 only (c - '0') so you should only allow them. I.e. change
if (!char.IsDigit(c))
return Double.NaN;
to
if (c < '0' || c > '9')
{
return Double.NaN;
}
I've also added braces as I prefer that.
Edit:
Modifying to not use char.IsDigit shaves about 1% off execution time (mileage may vary).
Further edit:
Accidentally ran the test for speed comparison on Debug. Running on Release with no debugger 10 million iterations averaged over 5 runs:
With char.IsDigit - 311ms
With c < '0' || c > '9' - 287ms
\$\endgroup\$
5
• \$\begingroup\$ That's cool :) but still no perf optimization \$\endgroup\$ Jan 6, 2015 at 12:49
• \$\begingroup\$ You can do things like optimize the calculation of the exp arg to CustomPow which makes a difference on Debug but in Release gets optimized out anyway by the looks of it. \$\endgroup\$
– RobH
Jan 6, 2015 at 13:14
• \$\begingroup\$ (c ^ '0') > 9 should be about 20% faster than c < '0' || c > '9' because of branch misprediction (the less comparisons the better and char.IsDigit does about 3 comparisons per non-unicode digit) \$\endgroup\$
– Slai
Jan 13, 2017 at 15:18
• \$\begingroup\$ @Slai Have you tested that? For well formed numbers, the branch is always false which is ideal for prediction. \$\endgroup\$
– RobH
Jan 13, 2017 at 16:46
• 1
\$\begingroup\$ @RobH I was just testing it for this answer stackoverflow.com/a/41639665/1383168 with decimal digits only. \$\endgroup\$
– Slai
Jan 13, 2017 at 16:58
7
\$\begingroup\$
You could try and optimize your CustomPow(int num, int exp) by pre-computing some/all possible values only once:
double[] pow10 = new double[309];
double p = 1.0;
for ( int i = 0; i < 309; i++ ) {
pow10[i] = p;
p = p * 10;
}
Then CustomPow10( int exp ) would just return pow10[exp].
Edit:
By the way, I see that you are basically building an integer representation first (in n). - Why not declare n as long integer then? This would operate on an integer most of the time, which should be faster than floating point, and only at the end, when finally dividing by the power of 10, a floating point number is needed.
Edit2: This only works if all your input numbers have less than 18 digits since that's the maximum number of digits a long can represent.
Edit3: Please see @Fredou's answer for the result of combined efforts. I think his code will perform really well by now.
\$\endgroup\$
2
• \$\begingroup\$ Well as exp is never (in my case) higher than 7 I used a switch statment with multiplication in the place of the for loop \$\endgroup\$ Jan 7, 2015 at 9:18
• 1
\$\begingroup\$ You'd actually want to store the reciprocal (pow10[i] = 1/p;) so that you're multiplying (fast) instead of dividing (slow). \$\endgroup\$
– Gabe
Jan 8, 2015 at 7:07
5
\$\begingroup\$
This example includes the style suggestions of @nick and @RobH together with performance enhancements, namely using bitwise AND operation instead of the modulus operation.
private static double GetDoubleValue(string input)
{
double output = 0;
int inputLength = input.Length;
int decimalPosition = inputLength;
var hasSeperator = false;
var isNegative = input[0] == '-';
for (int k = (isNegative ? 1 : 0); k < inputLength; k++)
{
char currentCharacter = input[k];
if (currentCharacter == '.' || currentCharacter == ',')
{
if (hasSeperator)
{
return Double.NaN;
}
else
{
hasSeperator = true;
}
decimalPosition = k + 1;
}
else
{
var digitValue = currentCharacter - '0';
if (digitValue < 0 || digitValue > 9)
{
return Double.NaN;
}
output = (output * 10) + digitValue;
}
}
var powDividend = CustomPow(10, inputLength - decimalPosition);
var integer = ((isNegative ? -1 : 1) * output);
return integer / powDividend;
}
private static double CustomPow(int num, int exp)
{
double result = 1.0;
while (exp > 0)
{
if ((exp & 1) == 1)
{
result *= num;
}
exp >>= 1;
num *= num;
}
return result;
}
\$\endgroup\$
9
• 2
\$\begingroup\$ Well I suggest you a bit of reading about this, I was also surprised! \$\endgroup\$ Jan 6, 2015 at 13:43
• \$\begingroup\$ I cannot reproduce the article's performance results. In my test environment bitwise is always faster than a modulus operator, in Debug mode and also in the Release mode. \$\endgroup\$
– kerem
Jan 6, 2015 at 13:46
• \$\begingroup\$ Then I'll test it :) \$\endgroup\$ Jan 6, 2015 at 13:47
• 1
\$\begingroup\$ what about saving some time by calculating pow as 0.1, 0.01, ... and multiplying with the lookup? Multiply is faster than division on many systems.... \$\endgroup\$
– Falco
Jan 7, 2015 at 10:21
• 4
\$\begingroup\$ Looking into intel.com/content/www/us/en/architecture-and-technology/… I find that on current Intel CPUs FDIV is about 39 clock cycles while FMUL needs only 1. Potentially saving 38 CPU cycles per number, for 1 billion numbers @ 3.8 GHz multiplication could save a total 10 seconds of CPU time over division. \$\endgroup\$
– JimmyB
Jan 7, 2015 at 11:02
5
\$\begingroup\$
Two comments regarding your algorithm:
Note that your algorithm can introduce errors in borderline cases like "1.00000000000000000000000000000000" which is parsed to Infinity, or "1.0000000000000000" which is parsed to 5333562.5371386623 (!).
Especially the second behavior is caused by a bug in your CustomPow function which keeps num as int, which can overflow easily for exponents above 16 (CustomPow(10, 16) returns 1874919424).
But even if this is fixed, extremely borderline cases like GetDoubleValue("1." + new string('0', 310)) return Infinity. (Note that Fredou’s solution is worse here, it dies with IndexOutOfRangeException.)
(The problem is that you are composing the whole number without regard to decimal separator, which might overflow prior to the final division.)
Improved algorithm, which also has better performance (by my experiments, ~30 % better than your original, ~20 % better than Fredou’s):
private static double QuickDoubleParse(string input)
{
double result = 0;
var pos = 0;
var len = input.Length;
if (len == 0) return Double.NaN;
char c = input[0];
double sign = 1;
if (c == '-')
{
sign = -1;
++pos;
if (pos >= len) return Double.NaN;
}
while (true) // breaks inside on pos >= len or non-digit character
{
if (pos >= len) return sign * result;
c = input[pos++];
if (c < '0' || c > '9') break;
result = (result * 10.0) + (c - '0');
}
if (c != '.' && c != ',') return Double.NaN;
double exp = 0.1;
while (pos < len)
{
c = input[pos++];
if (c < '0' || c > '9') return Double.NaN;
result += (c - '0') * exp;
exp *= 0.1;
}
return sign * result;
}
The algorithm parses the integral and fractional parts separately. I have also tried to implement it using unsafe features, but the improvement is inconclusive, but you may try:
private unsafe static double UnsafeQuickDoubleParse(string input)
{
double result = 0;
var len = input.Length;
if (len == 0) return Double.NaN;
double sign = 1;
fixed (char* pstr = input)
{
var end = (pstr + len);
var pc = pstr;
char c = *pc;
if (c == '-')
{
sign = -1;
++pc;
if (pc >= end) return Double.NaN;
}
while (true) // breaks inside on pos >= len or non-digit character
{
if (pc >= end) return sign * result;
c = *pc++;
if (c < '0' || c > '9') break;
result = (result * 10.0) + (c - '0');
}
if (c != '.' && c != ',') return Double.NaN;
double exp = 0.1;
while (pc < end)
{
c = *pc++;
if (c < '0' || c > '9') return Double.NaN;
result += (c - '0') * exp;
exp *= 0.1;
}
}
return sign * result;
}
\$\endgroup\$
8
• \$\begingroup\$ Nice one! In my data, the exp is never > 7, I don't deal with big number \$\endgroup\$ Jan 7, 2015 at 13:21
• \$\begingroup\$ Just note that the absolute magnitude of the number does not matter, only the length of the string; my examples are all equal to one, just written in a roundabout way with a lot of decimal places. \$\endgroup\$
– Mormegil
Jan 7, 2015 at 13:31
• \$\begingroup\$ your algorithm have rounding issue i think, if you use my main code in my answer and replace my parse with your parse, there is error like this showing up: input: 78.1784928767842 output:78.1784928767841, input: 87.5688321364898 output:87.5688321364897, input: -68.6253328195891 -68.625332819589, etc... \$\endgroup\$
– Fredou
Jan 7, 2015 at 15:01
• \$\begingroup\$ @Thomas, don't forget to do quality check with my answer or any others answers to be sure what get in get properly out. \$\endgroup\$
– Fredou
Jan 7, 2015 at 15:05
• \$\begingroup\$ This algorithm does have rounding problems due to inexactness of floating point numbers. Each time you calculate result += (c - '0') * exp you introduce a bit more error. \$\endgroup\$
– RobH
Jan 7, 2015 at 16:28
5
\$\begingroup\$
I changed the if logic to remove some branching I think, can you test on your side?
Also using the cache suggestion of Hanno Binder
Not using any double during string processing, only when returning the final result.
I'm gaining about 50% speed and it seem to still return proper value
Compile as Release under 64bits
using System;
namespace ConsoleApplication1
{
class Program
{
private readonly static double[] pow10Cache;
static Program()
{
pow10Cache = new double[309];
double p = 1.0;
for (int i = 0; i < 309; i++)
{
pow10Cache[i] = p;
p /= 10;
}
}
private static double GetDoubleValue(string input)
{
long inputLength = input.Length;
long digitValue = long.MaxValue;
long output1 = 0;
long output2 = 0;
long sign = 1;
double multiBy = 0.0;
int k;
//integer part
for (k = 0; k < inputLength; ++k)
{
digitValue = input[k] - 48; // '0'
if (digitValue >= 0 && digitValue <= 9 )
{
output1 = digitValue + (output1 * 10);
}
else if (k == 0 && digitValue == -3 /* '-' */)
{
sign = -1;
}
else if (digitValue == -2 /* '.' */ || digitValue == -4 /* ',' */)
{
break;
}
else
{
return Double.NaN;
}
}
//decimal part
if (digitValue == -2 /* '.' */ || digitValue == -4 /* ',' */)
{
multiBy = pow10Cache[inputLength - (++k)];
for (; k < inputLength; ++k)
{
digitValue = input[k] - 48; // '0'
if (digitValue >= 0 && digitValue <= 9)
{
output2 = digitValue + (output2 * 10);
}
else
{
return Double.NaN;
}
}
multiBy *= output2;
}
return sign * (output1 + multiBy);
}
static void Main(string[] args)
{
Console.Write("Preparing values to test ");
var rnd = new Random(42);
var test = new string[10000000];
double value;
for (int i = 0; i < 10000000; ++i)
{
value = rnd.NextDouble() * 10000;
value *= value;
value += rnd.NextDouble();
value *= (i % 2) == 0 ? 1 : -1;
test[i] = value.ToString();
if ((i % 1000000) == 0)
{
Console.Write(".");
}
}
Console.WriteLine(" benchmarking them");
for (int a = 1; a < 5; ++a)
{
var sw = System.Diagnostics.Stopwatch.StartNew();
for (int i = 0; i < 10000000; ++i)
{
GetDoubleValue(test[i]);
}
sw.Stop();
Console.WriteLine("Run {0} took {1}ms",a,sw.ElapsedMilliseconds);
}
bool anyError = false;
int errorCount = 0;
Console.Write("Any error? ");
for (int i = 0; i < 10000000; ++i)
{
if (!string.Equals(GetDoubleValue(test[i]).ToString(), test[i]))
{
if (!anyError)
{
Console.WriteLine(" Yes");
anyError = true;
}
errorCount++;
Console.WriteLine("{0} = {1} = {2}", GetDoubleValue(test[i]), test[i], string.Equals(GetDoubleValue(test[i]).ToString(), test[i]));
if (errorCount >= 10)
{
break;
}
}
if ((i % 1000000) == 0)
{
Console.Write(".");
}
}
Console.WriteLine(" {0}", anyError ? "" : "No");
Console.ReadKey();
}
}
}
\$\endgroup\$
12
• 3
\$\begingroup\$ If you are using a lookup table - why are you still using division? Multiplication is usually faster - so you should save 0.1, 0.01, ... in you array and multiply! \$\endgroup\$
– Falco
Jan 7, 2015 at 9:28
• 1
\$\begingroup\$ @Falco, I made the change and it does help. \$\endgroup\$
– Fredou
Jan 7, 2015 at 14:51
• \$\begingroup\$ @Fredou Could you try and check if changing double output = 0.0; to int output = 0; makes a difference? \$\endgroup\$
– JimmyB
Jan 7, 2015 at 17:19
• 1
\$\begingroup\$ @Falco I was doing all my testing under 32bits (anycpu) :-) doing it under 64bits change things :-) \$\endgroup\$
– Fredou
Jan 8, 2015 at 14:04
• 1
\$\begingroup\$ @Falco, I have updated my code which now I think is way better than before \$\endgroup\$
– Fredou
Jan 8, 2015 at 14:57
2
\$\begingroup\$
I'm sorry I don't have enough time to write and benchmark everything, so here are just some ideas:
Some approaches to get more performance:
1. Use C# parallel execution mechanics if you are converting millions of Strings to doubles. The executions are all independent, so on a quad core you should roughly save 70% of your execution time on one core.
2. Operator optimizations: Since the parsing essentially comes down to a very basic loop which is executed very often you can try to micro-optimize thinking of the processor architecture. Multiplications are usually faster than divisions. Additions are even faster and shifts are fastest.
3. Pipelining/Branch prediction: You processor usually tries to overlap as many instructions as possible, if they are not dependent on each other. If you have branches the branch predictor tries to predict the outcome and if it is wrong you usually get a big performance penalty. In a loop you have a bottleneck if variables are written in one iteration and read in the next. But modern processors can even do fancy stuff like passing results from one calculation directly into the next.
So what could probably speed up the whole process would be to eliminate complex branching on dependent variables. Code will follow if I have the time...
\$\endgroup\$
2
\$\begingroup\$
It doesn't seem that anybody has mentioned this.
if (c == '.' || c == ',')
You seem to be making the assumption that any string containing a period or comma is able to be parsed into a double. How will your code react to me sending this string into it?
It seems this is a case of over-abstraction, unless you plan to use the method elsewhere too.
I was wrong about that, but that's because it wasn't clear what was going on. Why wasn't it clear? Lack of brackets.
if (c == '.' || c == ',')
{
if (separatorFound)
return Double.NaN;
decimalPosition = k + 1;
separatorFound = true;
}
Brackets would have made it instantly clear that you were returning and not just letting the code blithely stumble on. Heck, even a new line after the return statement would have cleared that up.
I'm not sure, but it doesn't seem to me that you considered that someone could/would pass some strange string into your method that would potentially break it.
You definitely didn't consider that many cultures use spaces as separators instead of commas. I don't know the right way to do what you're attempting, but I'm convinced that this isn't it.
I take it back that "I'm not sure you're considering strings that could break your method". You're definitely not. It turns out that you're not considering group separators at all. You probably should be. These are strings after all. These are numbers in a format that could be expected to be as people would write them. All of the following numbers in string format will break your code.
4 294 967 295,000 (Canadian)
4,294,967,295.000 (US - English)
4 294 967.295,000 (German)
4.294.967.295,000 (Norwegian)
\$\endgroup\$
5
• \$\begingroup\$ Well I've got this piece of code if (!char.IsDigit(c)) return Double.NaN; which will kill your phrase down :p but +1 for space separator ! (which I'll not consider as it's not in my data) \$\endgroup\$ Jan 7, 2015 at 8:16
• \$\begingroup\$ Ahh you're right. I overlooked that. Probably due to a lack of brackets there... Will update my answer when I have a sec. \$\endgroup\$
– RubberDuck
Jan 7, 2015 at 11:05
• \$\begingroup\$ He's accepting either a period or comma as decimal point, not a group separator - his code has no support at all for group separators. \$\endgroup\$
– Random832
Jan 7, 2015 at 20:59
• \$\begingroup\$ @Random832 doesn't that mean a string like "200,123.45" would break the code? \$\endgroup\$
– RubberDuck
Jan 7, 2015 at 22:48
• 1
\$\begingroup\$ @RubberDuck yes, it would. He apparently doesn't have any strings like that. This is apparently meant to be very specialized for a specific dataset, not a general parsing function. Honestly, I'm more surprised he's bothering to handle both possible decimal points at all. \$\endgroup\$
– Random832
Jan 8, 2015 at 16:05
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.788141 |
0%
使用jquery和cookies控制select表单
问题源于一个群里面的提问，在一个网页上添加一个select表单，当用户选择表单的时候，内容区会显示不同的内容，并在该用户下次打开此网页的时候记住这个设置。 像这样的东东一般都会想到要用Cookies来存储设置，方便起见，对于DOM的操作就想到了jQuery（直接写js执行效率会更高，只是，人都是很懒的嘛，呵呵..）。记录下来也算是个笔记吧(Demo)。 首先写这么一个Select下拉表单，以及用来输出被选中项相应内容的块：
请选择城市
北京
上海
武汉
深圳
然后是用来处理Cookies的函数，其实jQuery有个插件是干这个的，不过貌似有点小Bug，所以我用的是以下函数：
//这一大段代码你没有必要知道它的确切意思，只要复制粘贴就可以了，他们是用来提供操作Cookies的支持的
function setCookie(name,value,days) {
if (days) {
var date = new Date();
date.setTime(date.getTime()+(days*24*60*60*1000));
var expires = “; expires=”+date.toGMTString();
}
else var expires = “”;
document.cookie = name+”=”+value+expires+”; path=/“;
}
function getCookie(name) {
var nameEQ = name + “=”;
var ca = document.cookie.split(‘;’);
for(var i=0;i < ca.length;i++) {
var c = ca[i];
while (c.charAt(0)==’ ‘) c = c.substring(1,c.length);
if (c.indexOf(nameEQ) == 0) return c.substring(nameEQ.length,c.length);
}
return null;
}
function dropCookie(name) {
setCookie(name,””,-1);
}
然后是用来操作表单和Cookies的js：
$(function(){
//以下部分是提取Cookie并对网页内容进行预设的过程
var cityChosen = getCookie(‘citychosen’); //取得cookie中保存的值
if(cityChosen!=null && cityChosen!=’’){ //如果有这个cookie值
var chosen = $(‘#choose option[value=”‘+cityChosen+’”]‘); //绑定cookie中保存的那个城市所对应的选项
chosen.attr(‘selected’,true); //使此选项变为选定状态
$(“#output”).removeClass().addClass(cityChosen).html(“你上次选择了
“ + chosen.text()); //为id为output的div添加class为相应城市名称的类，以便在css中分别定义样式，并输出相应文字
}
//以下部分是用户对下拉菜单进行选取的时候，将设置存到Cookie，并对相应内容部分进行设定
$(“#choose”).change(function(){
var selected = $(“#choose option:selected”); //浏览者选中一个选项
var output = “”;
if(selected.val() != 0){ //如果选项的值不为0
setCookie(‘citychosen’,selected.val(),365); //将被选中选项的value值存在名为citychosen的cookie里面，有效期一年
output = “你这次选择了
“ + selected.text(); //设定output中的内容
}
$(“#output”).removeClass().addClass(selected.val()).html(output); //在id为output的div里面输出相应的内容
});
});
想要效果看得更清楚明白一点，写了一点点小CSS：
*{ margin:0; padding:0;}
body{ font:24px Verdana, Geneva, sans-serif; margin:100px;}
#output{ color:#fff; margin:20px 0; padding:50px; height:200px; width:200px;}
.default{ background:#CCC;}
.beijing{background:red;}
.shanghai{background:blue;}
.wuhan{background:orange;}
.shenzhen{background:plum;}
它们整合起来以后，大概就是如下代码了：
//<![CDATA[
$(function(){
var cityChosen = getCookie(‘citychosen’);
if(cityChosen!=null && cityChosen!=’’){
var chosen = $(‘#choose option[value=”‘+cityChosen+’”]‘);
chosen.attr(‘selected’,true);
$(“#output”).removeClass().addClass(cityChosen).html(“你上次选择了
“ + chosen.text());
}
$(“#choose”).change(function(){
var selected = $(“#choose option:selected”);
var output = “”;
if(selected.val() != 0){
setCookie(‘citychosen’,selected.val(),365);
output = “你这次选择了
“ + selected.text();
}
$(“#output”).removeClass().addClass(selected.val()).html(output);
});
});
//以下是用来处理Cookies的函数
function setCookie(name,value,days) {
if (days) {
var date = new Date();
date.setTime(date.getTime()+(days*24*60*60*1000));
var expires = “; expires=”+date.toGMTString();
}
else var expires = “”;
document.cookie = name+”=”+value+expires+”; path=/“;
}
function getCookie(name) {
var nameEQ = name + “=”;
var ca = document.cookie.split(‘;’);
for(var i=0;i < ca.length;i++) {
var c = ca[i];
while (c.charAt(0)==’ ‘) c = c.substring(1,c.length);
if (c.indexOf(nameEQ) == 0) return c.substring(nameEQ.length,c.length);
}
return null;
}
function dropCookie(name) {
createCookie(name,””,-1);
}
//]]>
选择表单
请选择城市
北京
上海
武汉
深圳
效果演示可以看这个：Demo PS：Chrome的安全工作做得可真够彻底的，本地文件居然不可以操作Cookies，害我测试了好久..
|
__label__pos
| 0.99946 |
1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.
Nearly 20 reports without response, cu cubecraft in the future
Discussion in 'Games' started by Delta, Sep 27, 2016.
Thread Status:
Not open for further replies.
1. Delta
Delta Member
Joined:
Apr 22, 2016
Messages:
98
Likes Received:
3
Trophy Points:
8
Gender:
Male
I´m done.
The expectation why i joined cubecraft? Looks like fun, tested aaaaand you know what? It made fun.
Back in time were a few hackers on the server.. pff, a few, who cares about that? I didnt. Then.... with the time,, they were getting more, it started to annoy me, pushed down the fun, nobody likes to loose against hackers, would you?
Well.. i asked myself what to do against them. Went to the forum and found the possibilty to report.
Good, i started to report what i caught on video. Response after 1 or 2 days and 1 hacker less on the server.
Felt great to know, that other players don´t have to play with this banned hacker anymore.
But something happened. Response is decreasing, now 1 out of 5 reports is getting response, although i bumped them like it´s written in the report guidlines. Hackers, caught already 3 weeks ago were still not banned. Hopefully a other player reported and got response.
I did what i could. Maybe i should have done more, applied for helper, but that´s not what i wanted. I didnt wanted to work.. I wanted to play and have fun, but the requirements for this are not given anymore. I´m aware of the anti cheat updates in future and i know that staffs also do what they can.
And because of this, im looking forward. I´m gonne visit you in the future Cubecraft, with the hope that things will have changed to better.
Bye.
nEuro likes this.
2. Cynamooo
Cynamooo Member
Joined:
Aug 26, 2015
Messages:
860
Likes Received:
529
Trophy Points:
93
Gender:
Male
Occupation:
Wieee
Location:
Pokemon Sun/Moon
Home Page:
Djeez I'm sooo tired to hear this. Okay the're way too many hackers then there should be. But give the staff some time. You don't know how long it takes to make an anti-cheat. You don't know what they do in their life beside Cube. You don't know what they have to do beside banning people. All I can say is deal with it. It's not fun to play, we know. It's not fun to watch, we know. But you leaving the server or forums is one man down. If you stop reporting hackers and everybody else thinks the same, where is Cube going? Give it some time. When the new anti-cheat and Freebuild comes out there will be more staff to deal with your reports. If you leave, you give the hackers more motivation to keep hacking. Don't leave us, we need you...
3. Brittley
Brittley Member
Joined:
Sep 23, 2016
Messages:
343
Likes Received:
103
Trophy Points:
43
Gender:
Female
Occupation:
Minecrafter
Location:
United States
Home Page:
Please dont quit this amazing server! Cube craft is working on an anti-cheat. They said it should be finished shortly. Just be patient and try to ignore the hackers. Maybe use this chance to play some other games on the server?
4. DeveloperMode
DeveloperMode Member
Joined:
Apr 28, 2015
Messages:
20
Likes Received:
56
Trophy Points:
13
Gender:
Male
Occupation:
Graphic Design and Web Administration
Location:
United Kingdom
Home Page:
(I rant on your point about report response but you annoyed me so you get an angry message back)
Reports require effort, and are normally handled by teams. I'm not exactly sure but I'm willing to guess this team consists of maybe 4 or 5 people. People not machines. Sometimes reports take a week to be responded to and you act like you're the only one posting reports, CCG has a huge player base therefore it gets a huge amount of reports. As well as sifting through reports, staff also monitor hackers in game so you may not know it but they may already be suspicious of the person you reported.
You should report and feel good because you know that you helped. You shouldn't report and expect an instant response complimenting you, that just isn't how it works. Cut the staff some slack, they handle a lot more jobs than just reading and responding to reports.
My last point, evidence has to be examined. Staff members are not super fast computers (well maybe 1 is :^) ), they cannot watch a video of hacker in a second. The process of examining videos can take sometimes an hour depending on the type of hacks being reported. The video has to watched once to look for blatant evidence, then a second time for finer details if nothing is obvious.. then maybe a third or fourth time to confirm. And then maybe that staff member has to hand the report to a co-worker so as that the decision is 100% correct. I don't know how the team works and neither do you (you're just be impatient)
(oh and.. why are you leaving just because your reports aren't being answered? That's dumb :/)
5. Cynamooo
Cynamooo Member
Joined:
Aug 26, 2015
Messages:
860
Likes Received:
529
Trophy Points:
93
Gender:
Male
Occupation:
Wieee
Location:
Pokemon Sun/Moon
Home Page:
I think due the hackers :/
6. DeveloperMode
DeveloperMode Member
Joined:
Apr 28, 2015
Messages:
20
Likes Received:
56
Trophy Points:
13
Gender:
Male
Occupation:
Graphic Design and Web Administration
Location:
United Kingdom
Home Page:
Not gonna comment more than this, staff can't be everywhere at once, hackers are gonna exist (tough luck), I just noticed mention of this new anticheat is and all I can say is have patience. And to be perfectly frank you're exaggerating how many hackers you encounter, I've been on this server a while, and I've encountered what like 2, 3 hackers?
7. xx_360noscope101
xx_360noscope101 Member
Joined:
Jul 6, 2016
Messages:
2,008
Likes Received:
1,076
Trophy Points:
113
Gender:
Male
Occupation:
being a baby chicken
Location:
In a chicken coop
To make reports go faster do @<forums username here>
Plus, we are working on a new anti-cheat system so hackers will have a hard time getting on. :)
8. Chimp
Chimp Member
Joined:
Aug 27, 2016
Messages:
363
Likes Received:
95
Trophy Points:
28
Gender:
Male
Occupation:
Tree swinger
Location:
The jungle
I don't agree with the op regarding leaving the server. But any new players joining, seeing a hacker game after game after game can be quite off putting for them. If I had newly joined a server and wasn't aware of the anti cheat development, then I would be off to play on another server. It can be very off putting for many new players seeing this.
9. Fxhmiiz_
Fxhmiiz_ Member
Joined:
Jan 1, 2016
Messages:
123
Likes Received:
49
Trophy Points:
28
Gender:
Male
Occupation:
CubeCrafter
Location:
Singapore
The staff members are doing their best to keep up with the player reports. Keep in mind that there are over 300 reports every day. They will reply to every player report eventually. If you don't get a answer after a week you can bump the thread and tag moderators/admins. Also they are currently working on the new Anti-Cheat. All what I can say is:
Patience is the key. ;)
10. Magma_PvP
Magma_PvP Member
Joined:
Sep 28, 2016
Messages:
3
Likes Received:
2
Trophy Points:
3
Gender:
Male
Staff do there job etc, hackers are all over the place, I could catch 3 hackers in like 25 minutes man. They could be flying, no knockback, reach or kill aura, b hopping, or some other blacklisted modification that is not allowed on the server. Staff do get around to doing stuff but they are very busy remember that. I know there a lot of hackers but they will eventually get dealt with.
11. nEuro
nEuro Member
Joined:
Feb 5, 2016
Messages:
265
Likes Received:
39
Trophy Points:
28
Gender:
Male
Home Page:
What gamemode do you play on!? I play Skywars quite regularly and I would say there is about a 50/50 chance of having a hacker in a game. Most of the time that is just someone with anti-knockback or flyhacks that is easily defeatable, but some really nasty killaura hackers too. Also, if your have only encountered "2, 3 hackers" so far, how do you know so much about report answering time?
Yeah sometimes one week, but most of the time they get no answer at all (and then you have to send a big list of unanswered reports to a single staff member, always feels like I am stealing their time).
As someone who often creates reports I can understand the frustration of the OP completely. I am not sure how the timeline on the new AntiCheat is (I hope the recent "Invalid fighting pattern" bug was a sign that something is being tested out), but it better happen sooner than later, because something is going really wrong.
12. TheJeroen
TheJeroen Member
Joined:
Dec 6, 2015
Messages:
1,798
Likes Received:
2,215
Trophy Points:
113
Gender:
Male
Location:
The Netherlands
I don't get it why nobody understands him. Because I do, and I'm going to explain why.
The same happened to me when I just joined the server. I barely encountered a hacker, and if (s)he was hacking it was nothing more then anti-knockback.
Now you got fly hackers in EggWars and SkyWars, Speed Hackers and Bunnyhop Hackers in Assassins, Fly Hackers in TNT Run, Fly Hackers in BlockWars griefing defences before the match even started and just a lot more...
Is this new punishment system really worth it? It unbanned all hackers and unmuted all swearing people, why? Just so they can give teamers a 24h ban...
13. zDutchie
zDutchie Mod Staff Member Moderator
Joined:
May 30, 2016
Messages:
3,483
Likes Received:
2,435
Trophy Points:
113
Gender:
Female
Occupation:
Student
Location:
The Netherlands
Staff is aware of the huge amount of hackers. Moderators + are handling as many reports as they can each day. Player reports are handled as fast as possible. Please don't forget they have a personal life as well :)
All reports will be handled, it just takes a bit more time than before due to the huge amount of player reports.
You can bump your post every once in awhile and tag a moderator + in it
On a side note: a new anti cheat is in the work. Stay patient.
-locked
Thread Status:
Not open for further replies.
|
__label__pos
| 0.684318 |
Herstellen einer Verbindung mit Microsoft Windows-Authentifizierung
Das folgende Beispiel zeigt eine Möglichkeit, eine Verbindung zum Qlik NPrinting Server mit Microsoft Windows-Authentifizierung bei einer .NET-Konsolenanwendung herzustellen. Vergessen Sie nicht, server.name.com durch Ihren tatsächlichen Qlik NPrinting Server Namen zu ersetzen.
static void Main(string[] args) { //Create the HTTP Request (authenticate) and add required headers ServicePointManager.SecurityProtocol = SecurityProtocolType.Tls12; HttpWebRequest request = (HttpWebRequest)WebRequest.Create(@ "https://server.name.com:4993/api/v1/login/ntlm"); request.Method = "GET"; request.UserAgent = "Windows"; request.Accept = "application/json"; // specify to run as the current Microsoft Windows user request.UseDefaultCredentials = true; try { // make the web request and return the content HttpWebResponse response = (HttpWebResponse)request.GetResponse(); StreamReader responseReader = new StreamReader(response.GetResponseStream()); string sResponseHTML = responseReader.ReadToEnd(); Console.WriteLine(sResponseHTML); } catch (Exception ex) { Console.WriteLine(ex.Message); } Console.Read(); }
|
__label__pos
| 0.795446 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.