|
MeterLogger
|
Go to the source code of this file.
lwIP Options Configuration
Definition in file lwipopts.h.
| #define API_LIB_DEBUG LWIP_DBG_OFF |
API_LIB_DEBUG: Enable debugging in api_lib.c.
Definition at line 1882 of file lwipopts.h.
| #define API_MSG_DEBUG LWIP_DBG_OFF |
API_MSG_DEBUG: Enable debugging in api_msg.c.
Definition at line 1889 of file lwipopts.h.
| #define ARP_QUEUEING 1 |
ARP_QUEUEING==1: Multiple outgoing packets are queued during hardware address resolution. By default, only the most recent packet is queued per IP address. This is sufficient for most protocols and mainly reduces TCP connection startup time. Set this to 1 if you know your application sends more than one packet in a row to an IP address that is not in the ARP cache.
Definition at line 436 of file lwipopts.h.
| #define ARP_TABLE_SIZE 10 |
ARP_TABLE_SIZE: Number of active MAC-IP address pairs cached.
Definition at line 425 of file lwipopts.h.
| #define AUTOIP_DEBUG LWIP_DBG_OFF |
AUTOIP_DEBUG: Enable debugging in autoip.c.
Definition at line 2072 of file lwipopts.h.
| #define CHECKSUM_CHECK_IP 1 |
CHECKSUM_CHECK_IP==1: Check checksums in software for incoming IP packets.
Definition at line 1809 of file lwipopts.h.
| #define CHECKSUM_CHECK_TCP 1 |
CHECKSUM_CHECK_TCP==1: Check checksums in software for incoming TCP packets.
Definition at line 1823 of file lwipopts.h.
| #define CHECKSUM_CHECK_UDP 1 |
CHECKSUM_CHECK_UDP==1: Check checksums in software for incoming UDP packets.
Definition at line 1816 of file lwipopts.h.
| #define CHECKSUM_GEN_IP 1 |
CHECKSUM_GEN_IP==1: Generate checksums in software for outgoing IP packets.
Definition at line 1788 of file lwipopts.h.
| #define CHECKSUM_GEN_TCP 1 |
CHECKSUM_GEN_TCP==1: Generate checksums in software for outgoing TCP packets.
Definition at line 1802 of file lwipopts.h.
| #define CHECKSUM_GEN_UDP 1 |
CHECKSUM_GEN_UDP==1: Generate checksums in software for outgoing UDP packets.
Definition at line 1795 of file lwipopts.h.
| #define DEFAULT_ACCEPTMBOX_SIZE 0 |
DEFAULT_ACCEPTMBOX_SIZE: The mailbox size for the incoming connections. The queue size value itself is platform-dependent, but is passed to sys_mbox_new() when the acceptmbox is created.
Definition at line 1385 of file lwipopts.h.
| #define DEFAULT_RAW_RECVMBOX_SIZE 0 |
DEFAULT_RAW_RECVMBOX_SIZE: The mailbox size for the incoming packets on a NETCONN_RAW. The queue size value itself is platform-dependent, but is passed to sys_mbox_new() when the recvmbox is created.
Definition at line 1358 of file lwipopts.h.
| #define DEFAULT_TCP_RECVMBOX_SIZE 0 |
DEFAULT_TCP_RECVMBOX_SIZE: The mailbox size for the incoming packets on a NETCONN_TCP. The queue size value itself is platform-dependent, but is passed to sys_mbox_new() when the recvmbox is created.
Definition at line 1376 of file lwipopts.h.
| #define DEFAULT_THREAD_NAME "lwIP" |
DEFAULT_THREAD_NAME: The name assigned to any other lwIP thread.
Definition at line 1331 of file lwipopts.h.
| #define DEFAULT_THREAD_PRIO 1 |
DEFAULT_THREAD_PRIO: The priority assigned to any other lwIP thread. The priority value itself is platform-dependent, but is passed to sys_thread_new() when the thread is created.
Definition at line 1349 of file lwipopts.h.
| #define DEFAULT_THREAD_STACKSIZE 0 |
DEFAULT_THREAD_STACKSIZE: The stack size used by any other lwIP thread. The stack size value itself is platform-dependent, but is passed to sys_thread_new() when the thread is created.
Definition at line 1340 of file lwipopts.h.
| #define DEFAULT_UDP_RECVMBOX_SIZE 0 |
DEFAULT_UDP_RECVMBOX_SIZE: The mailbox size for the incoming packets on a NETCONN_UDP. The queue size value itself is platform-dependent, but is passed to sys_mbox_new() when the recvmbox is created.
Definition at line 1367 of file lwipopts.h.
| #define DHCP_DEBUG LWIP_DBG_OFF |
DHCP_DEBUG: Enable debugging in dhcp.c.
Definition at line 2065 of file lwipopts.h.
| #define DHCP_DOES_ARP_CHECK 0 |
DHCP_DOES_ARP_CHECK==1: Do an ARP check on the offered address.
Definition at line 677 of file lwipopts.h.
| #define DHCP_MAXRTX (*(volatile uint32*)0x600011E0) |
DHCP_MAXRTX: Maximum number of retries of current request.
Definition at line 684 of file lwipopts.h.
| #define DNS_DEBUG LWIP_DBG_OFF |
DNS_DEBUG: Enable debugging for DNS.
Definition at line 2093 of file lwipopts.h.
| #define DNS_DOES_NAME_CHECK 1 |
DNS do a name checking between the query and the response.
Definition at line 841 of file lwipopts.h.
| #define DNS_LOCAL_HOSTLIST 0 |
DNS_LOCAL_HOSTLIST: Implements a local host-to-address list. If enabled, you have to define #define DNS_LOCAL_HOSTLIST_INIT {{"host1", 0x123}, {"host2", 0x234}} (an array of structs name/address, where address is an u32_t in network byte order).
Instead, you can also use an external function: #define DNS_LOOKUP_LOCAL_EXTERN(x) extern u32_t my_lookup_function(const char *name) that returns the IP address or INADDR_NONE if not found.
Definition at line 864 of file lwipopts.h.
| #define DNS_LOCAL_HOSTLIST_IS_DYNAMIC 0 |
If this is turned on, the local host-list can be dynamically changed at runtime.
Definition at line 870 of file lwipopts.h.
| #define DNS_MAX_NAME_LENGTH 256 |
DNS maximum host name length supported in the name table.
Definition at line 831 of file lwipopts.h.
| #define DNS_MAX_RETRIES 4 |
DNS maximum number of retries when asking for a name, before "timeout".
Definition at line 851 of file lwipopts.h.
| #define DNS_MAX_SERVERS 2 |
The maximum of DNS servers
Definition at line 836 of file lwipopts.h.
| #define DNS_MSG_SIZE 512 |
DNS message max. size. Default value is RFC compliant.
Definition at line 846 of file lwipopts.h.
| #define DNS_TABLE_SIZE 4 |
DNS maximum number of entries to maintain locally.
Definition at line 826 of file lwipopts.h.
| #define ETH_PAD_SIZE 0 |
ETH_PAD_SIZE: number of bytes added before the ethernet header to ensure alignment of payload after that header. Since the header is 14 bytes long, without this padding e.g. addresses in the IP header will not be aligned on a 32-bit boundary, so setting this to 2 can speed up 32-bit-platforms.
Definition at line 476 of file lwipopts.h.
| #define ETHARP_DEBUG LWIP_DBG_OFF |
ETHARP_DEBUG: Enable debugging in etharp.c.
Definition at line 1861 of file lwipopts.h.
| #define ETHARP_STATS 0 |
Definition at line 1600 of file lwipopts.h.
| #define ETHARP_SUPPORT_STATIC_ENTRIES 0 |
ETHARP_SUPPORT_STATIC_ENTRIES==1: enable code to support static ARP table entries (using etharp_add_static_entry/etharp_remove_static_entry).
Definition at line 483 of file lwipopts.h.
| #define ETHARP_SUPPORT_VLAN 0 |
ETHARP_SUPPORT_VLAN==1: support receiving ethernet packets with VLAN header. Additionally, you can define ETHARP_VLAN_CHECK to an u16_t VLAN ID to check. If ETHARP_VLAN_CHECK is defined, only VLAN-traffic for this VLAN is accepted. If ETHARP_VLAN_CHECK is not defined, all traffic is accepted.
Definition at line 460 of file lwipopts.h.
| #define ETHARP_TRUST_IP_MAC 0 |
ETHARP_TRUST_IP_MAC==1: Incoming IP packets cause the ARP table to be updated with the source MAC and IP addresses supplied in the packet. You may want to disable this if you do not trust LAN peers to have the correct addresses, or as a limited approach to attempt to handle spoofing. If disabled, lwIP will need to make a new ARP request if the peer is not already in the ARP table, adding a little latency. The peer is in the ARP table if it requested our address before. Also notice that this slows down input processing of every IP packet!
Definition at line 450 of file lwipopts.h.
| #define ICMP_DEBUG LWIP_DBG_OFF |
ICMP_DEBUG: Enable debugging in icmp.c.
Definition at line 1903 of file lwipopts.h.
| #define ICMP_STATS 0 |
Definition at line 1604 of file lwipopts.h.
| #define ICMP_TTL (IP_DEFAULT_TTL) |
ICMP_TTL: Default value for Time-To-Live used by ICMP packets.
Definition at line 623 of file lwipopts.h.
| #define IGMP_DEBUG LWIP_DBG_OFF |
IGMP_DEBUG: Enable debugging in igmp.c.
Definition at line 1910 of file lwipopts.h.
| #define IGMP_STATS 0 |
Definition at line 1605 of file lwipopts.h.
| #define INET_DEBUG LWIP_DBG_OFF |
INET_DEBUG: Enable debugging in inet.c.
Definition at line 1917 of file lwipopts.h.
| #define IP_DEBUG LWIP_DBG_OFF |
IP_DEBUG: Enable debugging for IP.
Definition at line 1924 of file lwipopts.h.
| #define IP_DEFAULT_TTL 255 |
IP_DEFAULT_TTL: Default value for Time-To-Live used by transport layers.
Definition at line 586 of file lwipopts.h.
| #define IP_FORWARD 1 |
IP_FORWARD==1: Enables the ability to forward IP packets across network interfaces. If you are going to run lwIP on a device with only one network interface, define this to 0.
Definition at line 498 of file lwipopts.h.
| #define IP_FRAG 0 |
IP_FRAG==1: Fragment outgoing IP packets if their size exceeds MTU. Note that this option does not affect incoming packet sizes, which can be controlled via IP_REASSEMBLY.
Definition at line 541 of file lwipopts.h.
| #define IP_FRAG_MAX_MTU 1500 |
IP_FRAG_MAX_MTU: Assumed max MTU on any interface for IP frag buffer (requires IP_FRAG_USES_STATIC_BUF==1)
Definition at line 579 of file lwipopts.h.
Referenced by espconn_udp_sendto(), and espconn_udp_sent().
| #define IP_FRAG_USES_STATIC_BUF 1 |
IP_FRAG_USES_STATIC_BUF==1: Use a static MTU-sized buffer for IP fragmentation. Otherwise pbufs are allocated and reference the original packet data to be fragmented (or with LWIP_NETIF_TX_SINGLE_PBUF==1, new PBUF_RAM pbufs are used for fragments). ATTENTION: IP_FRAG_USES_STATIC_BUF==1 may not be used for DMA-enabled MACs!
Definition at line 571 of file lwipopts.h.
| #define IP_NAPT 1 |
IP_NAPT==1: Enables the ability to do Network Address Port Translation (NAPT) on forwarded packets. This only makes sense with IP_FORWARD==1.
Definition at line 506 of file lwipopts.h.
| #define IP_NAPT_DYNAMIC 0 |
IP_NAPT_DYNAMIC==1: Saves the memory for the NAPT tables if not required. If NAPT is used, ip_napt_init() has to be called explicitly once.
Definition at line 514 of file lwipopts.h.
| #define IP_OPTIONS_ALLOWED 1 |
IP_OPTIONS_ALLOWED: Defines the behavior for IP options. IP_OPTIONS_ALLOWED==0: All packets with IP options are dropped. IP_OPTIONS_ALLOWED==1: IP options are allowed (but not parsed).
Definition at line 523 of file lwipopts.h.
| #define IP_REASS_DEBUG LWIP_DBG_OFF |
IP_REASS_DEBUG: Enable debugging in ip_frag.c for both frag & reass.
Definition at line 1931 of file lwipopts.h.
| #define IP_REASS_MAX_PBUFS 10 |
IP_REASS_MAX_PBUFS: Total maximum amount of pbufs waiting to be reassembled. Since the received pbufs are enqueued, be sure to configure PBUF_POOL_SIZE > IP_REASS_MAX_PBUFS so that the stack is still able to receive packets even if the maximum amount of fragments is enqueued for reassembly!
Definition at line 560 of file lwipopts.h.
| #define IP_REASS_MAXAGE 3 |
IP_REASS_MAXAGE: Maximum time (in multiples of IP_TMR_INTERVAL - so seconds, normally) a fragmented IP packet waits for all fragments to arrive. If not all fragments arrived in this time, the whole packet is discarded.
Definition at line 550 of file lwipopts.h.
| #define IP_REASSEMBLY 0 |
IP_REASSEMBLY==1: Reassemble incoming fragmented IP packets. Note that this option does not affect outgoing packet sizes, which can be controlled via IP_FRAG.
Definition at line 532 of file lwipopts.h.
| #define IP_SOF_BROADCAST 0 |
IP_SOF_BROADCAST=1: Use the SOF_BROADCAST field to enable broadcast filter per pcb on udp and raw send operations. To enable broadcast filter on recv operations, you also have to set IP_SOF_BROADCAST_RECV=1.
Definition at line 595 of file lwipopts.h.
| #define IP_SOF_BROADCAST_RECV 0 |
IP_SOF_BROADCAST_RECV (requires IP_SOF_BROADCAST=1) enable the broadcast filter on recv operations.
Definition at line 603 of file lwipopts.h.
| #define IP_STATS 0 |
Definition at line 1602 of file lwipopts.h.
| #define IPFRAG_STATS 0 |
Definition at line 1603 of file lwipopts.h.
| #define LINK_STATS 0 |
Definition at line 1601 of file lwipopts.h.
| #define LWIP_ALLOW_MEM_FREE_FROM_OTHER_CONTEXT 0 |
Set this to 1 if you want to free PBUF_RAM pbufs (or call mem_free()) from interrupt context (or another context that doesn't allow waiting for a semaphore). If set to 1, mem_malloc will be protected by a semaphore and SYS_ARCH_PROTECT, while mem_free will only use SYS_ARCH_PROTECT. mem_malloc SYS_ARCH_UNPROTECTs with each loop so that mem_free can run.
ATTENTION: As you can see from the above description, this leads to dis-/ enabling interrupts often, which can be slow! Also, on low memory, mem_malloc can need longer.
If you don't want that, at least for NO_SYS=0, you can still use the following functions to enqueue a deallocation call which then runs in the tcpip_thread context:
Definition at line 206 of file lwipopts.h.
| #define LWIP_ARP 1 |
LWIP_ARP==1: Enable ARP functionality.
Definition at line 418 of file lwipopts.h.
| #define LWIP_AUTOIP 0 |
LWIP_AUTOIP==1: Enable AUTOIP module.
Definition at line 696 of file lwipopts.h.
| #define LWIP_BROADCAST_PING 0 |
LWIP_BROADCAST_PING==1: respond to broadcast pings (default is unicast only)
Definition at line 630 of file lwipopts.h.
| #define LWIP_CALLBACK_API 1 |
Definition at line 1091 of file lwipopts.h.
| #define LWIP_CHECKSUM_ON_COPY 0 |
LWIP_CHECKSUM_ON_COPY==1: Calculate checksum when copying data from application buffers to pbufs.
Definition at line 1831 of file lwipopts.h.
| #define LWIP_COMPAT_SOCKETS 0 |
LWIP_COMPAT_SOCKETS==1: Enable BSD-style sockets functions names. (only used if you use sockets.c)
Definition at line 1440 of file lwipopts.h.
| #define LWIP_DBG_MIN_LEVEL LWIP_DBG_LEVEL_ALL |
LWIP_DBG_MIN_LEVEL: After masking, the value of the debug is compared against this value. If it is smaller, then debugging messages are written.
Definition at line 1846 of file lwipopts.h.
| #define LWIP_DBG_TYPES_ON LWIP_DBG_OFF |
LWIP_DBG_TYPES_ON: A mask that can be used to globally enable/disable debug messages of certain types.
Definition at line 1854 of file lwipopts.h.
| #define LWIP_DHCP 1 |
LWIP_DHCP==1: Enable DHCP module.
Definition at line 668 of file lwipopts.h.
| #define LWIP_DHCP_AUTOIP_COOP 0 |
LWIP_DHCP_AUTOIP_COOP==1: Allow DHCP and AUTOIP to be both enabled on the same interface at the same time.
Definition at line 704 of file lwipopts.h.
| #define LWIP_DHCP_AUTOIP_COOP_TRIES 9 |
LWIP_DHCP_AUTOIP_COOP_TRIES: Set to the number of DHCP DISCOVER probes that should be sent before falling back on AUTOIP. This can be set as low as 1 to get an AutoIP address very quickly, but you should be prepared to handle a changing IP address when DHCP overrides AutoIP.
Definition at line 715 of file lwipopts.h.
| #define LWIP_DNS 1 |
LWIP_DNS==1: Turn on DNS module. UDP must be available for DNS transport.
Definition at line 821 of file lwipopts.h.
| #define LWIP_ETHERNET (LWIP_ARP || PPPOE_SUPPORT) |
LWIP_ETHERNET==1: enable ethernet support for PPPoE even though ARP might be disabled
Definition at line 467 of file lwipopts.h.
| #define LWIP_EVENT_API 0 |
LWIP_EVENT_API and LWIP_CALLBACK_API: Only one of these should be set to 1. LWIP_EVENT_API==1: The user defines lwip_tcp_event() to receive all events (accept, sent, etc) that happen in the system. LWIP_CALLBACK_API==1: The PCB callback function is called directly for the event.
Definition at line 1090 of file lwipopts.h.
| #define LWIP_HAVE_LOOPIF 1 |
LWIP_HAVE_LOOPIF==1: Support loop interface (<IP_ADDRESS>) and loopif.c
Definition at line 1223 of file lwipopts.h.
| #define LWIP_HAVE_SLIPIF 1 |
LWIP_HAVE_SLIPIF==1: Support slip interface and slipif.c
Definition at line 1235 of file lwipopts.h.
| #define LWIP_ICMP 1 |
LWIP_ICMP==1: Enable ICMP module inside the IP stack. Be careful, disable that make your product non-compliant to RFC1122
Definition at line 616 of file lwipopts.h.
| #define LWIP_IGMP 1 |
LWIP_IGMP==1: Turn on IGMP module.
Definition at line 797 of file lwipopts.h.
| #define LWIP_LOOPBACK_MAX_PBUFS 0 |
LWIP_LOOPBACK_MAX_PBUFS: Maximum number of pbufs on queue for loopback sending for each netif (0 = disabled)
Definition at line 1181 of file lwipopts.h.
| #define LWIP_MDNS 1 |
LWIP_MDNS==1: Turn on MDNS module.
Definition at line 808 of file lwipopts.h.
| #define LWIP_MULTICAST_PING 0 |
LWIP_MULTICAST_PING==1: respond to multicast pings (default is unicast only)
Definition at line 637 of file lwipopts.h.
| #define LWIP_NETBUF_RECVINFO 0 |
LWIP_NETBUF_RECVINFO==1: append destination addr and port to every netbuf.
Definition at line 903 of file lwipopts.h.
| #define LWIP_NETCONN 0 |
LWIP_NETCONN==1: Enable Netconn API (require to use api_lib.c)
Definition at line 1413 of file lwipopts.h.
| #define LWIP_NETIF_API 0 |
LWIP_NETIF_API==1: Support netif api (in netifapi.c)
Definition at line 1138 of file lwipopts.h.
| #define LWIP_NETIF_HOSTNAME 1 |
LWIP_NETIF_HOSTNAME==1: use DHCP_OPTION_HOSTNAME with netif's hostname field.
Definition at line 1131 of file lwipopts.h.
| #define LWIP_NETIF_HWADDRHINT 0 |
LWIP_NETIF_HWADDRHINT==1: Cache link-layer-address hints (e.g. table indices) in struct netif. TCP and UDP can make use of this to prevent scanning the ARP table for every sent packet. While this is faster for big ARP tables or many concurrent connections, it might be counterproductive if you have a tiny ARP table or if there never are concurrent connections.
Definition at line 1165 of file lwipopts.h.
| #define LWIP_NETIF_LINK_CALLBACK 0 |
LWIP_NETIF_LINK_CALLBACK==1: Support a callback function from an interface whenever the link changes (i.e., link down)
Definition at line 1154 of file lwipopts.h.
| #define LWIP_NETIF_LOOPBACK 0 |
LWIP_NETIF_LOOPBACK==1: Support sending packets with a destination IP address equal to the netif IP address, looping them back up the stack.
Definition at line 1173 of file lwipopts.h.
| #define LWIP_NETIF_LOOPBACK_MULTITHREADING (!NO_SYS) |
LWIP_NETIF_LOOPBACK_MULTITHREADING: Indicates whether threading is enabled in the system, as netifs must change how they behave depending on this setting for the LWIP_NETIF_LOOPBACK option to work. Setting this is needed to avoid reentering non-reentrant functions like tcp_input(). LWIP_NETIF_LOOPBACK_MULTITHREADING==1: Indicates that the user is using a multithreaded environment like tcpip.c. In this case, netif->input() is called directly. LWIP_NETIF_LOOPBACK_MULTITHREADING==0: Indicates a polling (or NO_SYS) setup. The packets are put on a list and netif_poll() must be called in the main application loop.
Definition at line 1198 of file lwipopts.h.
| #define LWIP_NETIF_STATUS_CALLBACK 0 |
LWIP_NETIF_STATUS_CALLBACK==1: Support a callback function whenever an interface changes its up/down status (i.e., due to DHCP IP acquistion)
Definition at line 1146 of file lwipopts.h.
| #define LWIP_NETIF_TX_SINGLE_PBUF 1 |
LWIP_NETIF_TX_SINGLE_PBUF: if this is set to 1, lwIP tries to put all data to be sent into one single pbuf. This is for compatibility with DMA-enabled MACs that do not support scatter-gather. Beware that this might involve CPU-memcpy before transmitting that would not be needed without this flag! Use this only if you need to!
Definition at line 1211 of file lwipopts.h.
| #define LWIP_POSIX_SOCKETS_IO_NAMES 0 |
LWIP_POSIX_SOCKETS_IO_NAMES==1: Enable POSIX-style sockets functions names. Disable this option if you use a POSIX operating system that uses the same names (read, write & close). (only used if you use sockets.c)
Definition at line 1449 of file lwipopts.h.
| #define LWIP_RAW 1 |
LWIP_RAW==1: Enable application layer to hook into the IP layer itself.
Definition at line 649 of file lwipopts.h.
| #define LWIP_SNMP 0 |
LWIP_SNMP==1: Turn on SNMP module. UDP must be available for SNMP transport.
Definition at line 728 of file lwipopts.h.
| #define LWIP_SO_RCVBUF 0 |
LWIP_SO_RCVBUF==1: Enable SO_RCVBUF processing.
Definition at line 1472 of file lwipopts.h.
| #define LWIP_SO_RCVTIMEO 0 |
LWIP_SO_RCVTIMEO==1: Enable SO_RCVTIMEO processing.
Definition at line 1465 of file lwipopts.h.
| #define LWIP_SOCKET 0 |
LWIP_SOCKET==1: Enable Socket API (require to use sockets.c)
Definition at line 1432 of file lwipopts.h.
| #define LWIP_STATS 0 |
LWIP_STATS==1: Enable statistics collection in lwip_stats.
Definition at line 1507 of file lwipopts.h.
| #define LWIP_STATS_DISPLAY 0 |
Definition at line 1611 of file lwipopts.h.
| #define LWIP_TCP 1 |
LWIP_TCP==1: Turn on TCP.
Definition at line 915 of file lwipopts.h.
| #define LWIP_TCP_KEEPALIVE 1 |
LWIP_TCP_KEEPALIVE==1: Enable TCP_KEEPIDLE, TCP_KEEPINTVL and TCP_KEEPCNT options processing. Note that TCP_KEEPIDLE and TCP_KEEPINTVL have to be set in seconds. (does not require sockets.c, and will affect tcp.c)
Definition at line 1458 of file lwipopts.h.
| #define LWIP_TCP_TIMESTAMPS 0 |
LWIP_TCP_TIMESTAMPS==1: support the TCP timestamp option.
Definition at line 1066 of file lwipopts.h.
| #define LWIP_TCPIP_CORE_LOCKING 0 |
LWIP_TCPIP_CORE_LOCKING: (EXPERIMENTAL!) Don't use it if you're not an active lwIP project member
Definition at line 1398 of file lwipopts.h.
| #define LWIP_TCPIP_CORE_LOCKING_INPUT 0 |
LWIP_TCPIP_CORE_LOCKING_INPUT: (EXPERIMENTAL!) Don't use it if you're not an active lwIP project member
Definition at line 1406 of file lwipopts.h.
| #define LWIP_TCPIP_TIMEOUT 1 |
LWIP_TCPIP_TIMEOUT==1: Enable tcpip_timeout/tcpip_untimeout tod create timers running in tcpip_thread from another thread.
Definition at line 1420 of file lwipopts.h.
| #define LWIP_UDP 1 |
LWIP_UDP==1: Turn on UDP.
Definition at line 882 of file lwipopts.h.
| #define LWIP_UDPLITE 0 |
LWIP_UDPLITE==1: Turn on UDP-Lite. (Requires LWIP_UDP)
Definition at line 889 of file lwipopts.h.
| #define MEM_ALIGNMENT 4 |
MEM_ALIGNMENT: should be set to the alignment of the CPU 4 byte alignment -> #define MEM_ALIGNMENT 4 2 byte alignment -> #define MEM_ALIGNMENT 2
Definition at line 118 of file lwipopts.h.
| #define MEM_DEBUG LWIP_DBG_OFF |
MEM_DEBUG: Enable debugging in mem.c.
Definition at line 1945 of file lwipopts.h.
| #define MEM_LIBC_MALLOC 1 |
MEM_LIBC_MALLOC==1: Use malloc/free/realloc provided by your C-library instead of the lwip internal allocator. Can save code size if you already use it.
Definition at line 100 of file lwipopts.h.
| #define MEM_SIZE 16000 |
MEM_SIZE: the size of the heap memory. If the application will send a lot of data that needs to be copied, this should be set high.
Definition at line 126 of file lwipopts.h.
| #define MEM_STATS 0 |
Definition at line 1608 of file lwipopts.h.
| #define MEM_USE_POOLS 0 |
MEM_USE_POOLS==1: Use an alternative to malloc() by allocating from a set of memory pools of various sizes. When mem_malloc is called, an element of the smallest pool that can provide the length needed is returned. To use this, MEMP_USE_CUSTOM_POOLS also has to be enabled.
Definition at line 166 of file lwipopts.h.
| #define MEM_USE_POOLS_TRY_BIGGER_POOL 0 |
MEM_USE_POOLS_TRY_BIGGER_POOL==1: if one malloc-pool is empty, try the next bigger pool - WARNING: THIS MIGHT WASTE MEMORY but it can make a system more reliable.
Definition at line 174 of file lwipopts.h.
| #define MEMCPY | ( | dst, | |
| src, | |||
| len | |||
| ) | os_memcpy(dst,src,len) |
MEMCPY: override this if you have a faster implementation at hand than the one included in your C library
Definition at line 78 of file lwipopts.h.
| #define MEMP_DEBUG LWIP_DBG_OFF |
MEMP_DEBUG: Enable debugging in memp.c.
Definition at line 1952 of file lwipopts.h.
| #define MEMP_MEM_MALLOC 1 |
MEMP_MEM_MALLOC==1: Use mem_malloc/mem_free instead of the lwip pool allocator. Especially useful with MEM_LIBC_MALLOC but handle with care regarding execution speed and usage from interrupts!
Definition at line 109 of file lwipopts.h.
| #define MEMP_NUM_ARP_QUEUE 10 |
MEMP_NUM_ARP_QUEUE: the number of simulateously queued outgoing packets (pbufs) that are waiting for an ARP request (to resolve their destination address) to finish. (requires the ARP_QUEUEING option)
Definition at line 290 of file lwipopts.h.
| #define MEMP_NUM_FRAG_PBUF 0 |
MEMP_NUM_FRAG_PBUF: the number of IP fragments simultaneously sent (fragments, not whole packets!). This is only used with IP_FRAG_USES_STATIC_BUF==0 and LWIP_NETIF_TX_SINGLE_PBUF==0 and only has to be > 1 with DMA-enabled MACs where the packet is not yet sent when netif->output returns.
Definition at line 280 of file lwipopts.h.
| #define MEMP_NUM_IGMP_GROUP 8 |
MEMP_NUM_IGMP_GROUP: The number of multicast groups whose network interfaces can be members et the same time (one per netif - allsystems group -, plus one per netif membership). (requires the LWIP_IGMP option)
Definition at line 300 of file lwipopts.h.
| #define MEMP_NUM_LOCALHOSTLIST 0 |
MEMP_NUM_LOCALHOSTLIST: the number of host entries in the local host list if DNS_LOCAL_HOSTLIST_IS_DYNAMIC==1.
Definition at line 391 of file lwipopts.h.
| #define MEMP_NUM_NETBUF 0 |
MEMP_NUM_NETBUF: the number of struct netbufs. (only needed if you use the sequential API, like api_lib.c)
Definition at line 316 of file lwipopts.h.
| #define MEMP_NUM_NETCONN 0 |
MEMP_NUM_NETCONN: the number of struct netconns. (only needed if you use the sequential API, like api_lib.c)
Definition at line 324 of file lwipopts.h.
| #define MEMP_NUM_NETDB 0 |
MEMP_NUM_NETDB: the number of concurrently running lwip_addrinfo() calls (before freeing the corresponding memory using lwip_freeaddrinfo()).
Definition at line 383 of file lwipopts.h.
| #define MEMP_NUM_PBUF 10 |
MEMP_NUM_PBUF: the number of memp struct pbufs (used for PBUF_ROM and PBUF_REF). If the application sends a lot of data out of ROM (or other static memory), this should be set high.
Definition at line 220 of file lwipopts.h.
| #define MEMP_NUM_PPPOE_INTERFACES 0 |
MEMP_NUM_PPPOE_INTERFACES: the number of concurrently active PPPoE interfaces (only used with PPPOE_SUPPORT==1)
Definition at line 399 of file lwipopts.h.
| #define MEMP_NUM_RAW_PCB 4 |
MEMP_NUM_RAW_PCB: Number of raw connection PCBs (requires the LWIP_RAW option)
Definition at line 228 of file lwipopts.h.
| #define MEMP_NUM_REASSDATA 0 |
MEMP_NUM_REASSDATA: the number of simultaneously IP packets queued for reassembly (whole packets, not fragments!)
Definition at line 269 of file lwipopts.h.
| #define MEMP_NUM_SNMP_NODE 0 |
MEMP_NUM_SNMP_NODE: the number of leafs in the SNMP tree.
Definition at line 349 of file lwipopts.h.
| #define MEMP_NUM_SNMP_ROOTNODE 0 |
MEMP_NUM_SNMP_ROOTNODE: the number of branches in the SNMP tree. Every branch has one leaf (MEMP_NUM_SNMP_NODE) at least!
Definition at line 357 of file lwipopts.h.
| #define MEMP_NUM_SNMP_VALUE 0 |
MEMP_NUM_SNMP_VALUE: the number of OID or values concurrently used (does not have to be changed normally) - 3 of these are used per request (1 for the value read and 2 for OIDs - input and output)
Definition at line 375 of file lwipopts.h.
| #define MEMP_NUM_SNMP_VARBIND 0 |
MEMP_NUM_SNMP_VARBIND: the number of concurrent requests (does not have to be changed normally) - 2 of these are used per request (1 for input, 1 for output)
Definition at line 366 of file lwipopts.h.
| #define MEMP_NUM_SYS_TIMEOUT 8 |
MEMP_NUM_SYS_TIMEOUT: the number of simulateously active timeouts. (requires NO_SYS==0)
Definition at line 308 of file lwipopts.h.
| #define MEMP_NUM_TCP_PCB (*(volatile uint32*)0x600011FC) |
MEMP_NUM_TCP_PCB: the number of simulatenously active TCP connections. (requires the LWIP_TCP option)
Definition at line 245 of file lwipopts.h.
| #define MEMP_NUM_TCP_PCB_LISTEN 2 |
MEMP_NUM_TCP_PCB_LISTEN: the number of listening TCP connections. (requires the LWIP_TCP option)
Definition at line 253 of file lwipopts.h.
| #define MEMP_NUM_TCP_SEG 16 |
MEMP_NUM_TCP_SEG: the number of simultaneously queued TCP segments. (requires the LWIP_TCP option)
Definition at line 261 of file lwipopts.h.
| #define MEMP_NUM_TCPIP_MSG_API 4 |
MEMP_NUM_TCPIP_MSG_API: the number of struct tcpip_msg, which are used for callback/timeout API communication. (only needed if you use tcpip.c)
Definition at line 333 of file lwipopts.h.
| #define MEMP_NUM_TCPIP_MSG_INPKT 4 |
MEMP_NUM_TCPIP_MSG_INPKT: the number of struct tcpip_msg, which are used for incoming packets. (only needed if you use tcpip.c)
Definition at line 342 of file lwipopts.h.
| #define MEMP_NUM_UDP_PCB 4 |
MEMP_NUM_UDP_PCB: the number of UDP protocol control blocks. One per active UDP "connection". (requires the LWIP_UDP option)
Definition at line 237 of file lwipopts.h.
| #define MEMP_OVERFLOW_CHECK 0 |
MEMP_OVERFLOW_CHECK: memp overflow protection reserves a configurable amount of bytes before and after each memp element in every pool and fills it with a prominent default value. MEMP_OVERFLOW_CHECK == 0 no checking MEMP_OVERFLOW_CHECK == 1 checks each element when it is freed MEMP_OVERFLOW_CHECK >= 2 checks each element in every pool every time memp_malloc() or memp_free() is called (useful but slow!)
Definition at line 148 of file lwipopts.h.
| #define MEMP_SANITY_CHECK 1 |
MEMP_SANITY_CHECK==1: run a sanity check after each memp_free() to make sure that there are no cycles in the linked lists.
Definition at line 156 of file lwipopts.h.
| #define MEMP_SEPARATE_POOLS 1 |
MEMP_SEPARATE_POOLS: if defined to 1, each pool is placed in its own array. This can be used to individually change the location of each pool. Default is one big array for all pools
Definition at line 135 of file lwipopts.h.
| #define MEMP_STATS 0 |
Definition at line 1609 of file lwipopts.h.
| #define MEMP_USE_CUSTOM_POOLS 0 |
MEMP_USE_CUSTOM_POOLS==1: whether to include a user file lwippools.h that defines additional pools beyond the "standard" ones required by lwIP. If you set this to 1, you must have lwippools.h in your inlude path somewhere.
Definition at line 184 of file lwipopts.h.
| #define NAPT_DEBUG LWIP_DBG_OFF |
NAPT_DEBUG: Enable debugging for NAPT.
Definition at line 2100 of file lwipopts.h.
| #define NETIF_DEBUG LWIP_DBG_OFF |
NETIF_DEBUG: Enable debugging in netif.c.
Definition at line 1868 of file lwipopts.h.
| #define NO_SYS 1 |
NO_SYS==1: Provides VERY minimal functionality. Otherwise, use lwIP facilities.
Definition at line 62 of file lwipopts.h.
| #define NO_SYS_NO_TIMERS 0 |
NO_SYS_NO_TIMERS==1: Drop support for sys_timeout when NO_SYS==1 Mainly for compatibility to old versions.
Definition at line 70 of file lwipopts.h.
| #define PBUF_DEBUG LWIP_DBG_OFF |
PBUF_DEBUG: Enable debugging in pbuf.c.
Definition at line 1875 of file lwipopts.h.
| #define PBUF_LINK_HLEN (14 + ETH_PAD_SIZE) |
PBUF_LINK_HLEN: the number of bytes that should be allocated for a link level header. The default is 14, the standard value for Ethernet.
Definition at line 1109 of file lwipopts.h.
| #define PBUF_POOL_BUFSIZE LWIP_MEM_ALIGN_SIZE(TCP_MSS+40+PBUF_LINK_HLEN) |
PBUF_POOL_BUFSIZE: the size of each pbuf in the pbuf pool. The default is designed to accomodate single full size TCP frame in one pbuf, including TCP_MSS, IP header, and link header.
Definition at line 1118 of file lwipopts.h.
| #define PBUF_POOL_SIZE 10 |
PBUF_POOL_SIZE: the number of buffers in the pbuf pool.
Definition at line 406 of file lwipopts.h.
| #define PPP_DEBUG LWIP_DBG_OFF |
PPP_DEBUG: Enable debugging for PPP.
Definition at line 2051 of file lwipopts.h.
| #define PPP_SUPPORT 0 |
PPP_SUPPORT==1: Enable PPP.
Definition at line 1624 of file lwipopts.h.
| #define PPP_THREAD_NAME "pppInputThread" |
PPP_THREAD_NAME: The name assigned to the pppInputThread.
Definition at line 1306 of file lwipopts.h.
| #define PPP_THREAD_PRIO 1 |
PPP_THREAD_PRIO: The priority assigned to the pppInputThread. The priority value itself is platform-dependent, but is passed to sys_thread_new() when the thread is created.
Definition at line 1324 of file lwipopts.h.
| #define PPP_THREAD_STACKSIZE 0 |
PPP_THREAD_STACKSIZE: The stack size used by the pppInputThread. The stack size value itself is platform-dependent, but is passed to sys_thread_new() when the thread is created.
Definition at line 1315 of file lwipopts.h.
| #define PPPOE_SUPPORT 0 |
PPPOE_SUPPORT==1: Enable PPP Over Ethernet
Definition at line 1631 of file lwipopts.h.
| #define PPPOS_SUPPORT PPP_SUPPORT |
PPPOS_SUPPORT==1: Enable PPP Over Serial
Definition at line 1638 of file lwipopts.h.
| #define RAW_DEBUG LWIP_DBG_OFF |
RAW_DEBUG: Enable debugging in raw.c.
Definition at line 1938 of file lwipopts.h.
| #define RAW_TTL (IP_DEFAULT_TTL) |
LWIP_RAW==1: Enable application layer to hook into the IP layer itself.
Definition at line 656 of file lwipopts.h.
| #define RECV_BUFSIZE_DEFAULT INT_MAX |
If LWIP_SO_RCVBUF is used, this is the default value for recv_bufsize.
Definition at line 1479 of file lwipopts.h.
| #define SLIP_DEBUG LWIP_DBG_OFF |
SLIP_DEBUG: Enable debugging in slipif.c.
Definition at line 2058 of file lwipopts.h.
| #define SLIPIF_THREAD_NAME "slipif_loop" |
SLIPIF_THREAD_NAME: The name assigned to the slipif_loop thread.
Definition at line 1281 of file lwipopts.h.
| #define SLIPIF_THREAD_PRIO 1 |
SLIPIF_THREAD_PRIO: The priority assigned to the slipif_loop thread. The priority value itself is platform-dependent, but is passed to sys_thread_new() when the thread is created.
Definition at line 1299 of file lwipopts.h.
| #define SLIPIF_THREAD_STACKSIZE 0 |
SLIP_THREAD_STACKSIZE: The stack size used by the slipif_loop thread. The stack size value itself is platform-dependent, but is passed to sys_thread_new() when the thread is created.
Definition at line 1290 of file lwipopts.h.
| #define SMEMCPY | ( | dst, | |
| src, | |||
| len | |||
| ) | os_memcpy(dst,src,len) |
SMEMCPY: override this with care! Some compilers (e.g. gcc) can inline a call to memcpy() if the length is known at compile time and is small.
Definition at line 86 of file lwipopts.h.
| #define SNMP_CONCURRENT_REQUESTS 0 |
SNMP_CONCURRENT_REQUESTS: Number of concurrent requests the module will allow. At least one request buffer is required.
Definition at line 736 of file lwipopts.h.
| #define SNMP_MAX_OCTET_STRING_LEN 127 |
The maximum length of strings used. This affects the size of MEMP_SNMP_VALUE elements.
Definition at line 768 of file lwipopts.h.
| #define SNMP_MAX_TREE_DEPTH 15 |
The maximum depth of the SNMP tree. With private MIBs enabled, this depends on your MIB! This affects the size of MEMP_SNMP_VALUE elements.
Definition at line 777 of file lwipopts.h.
| #define SNMP_MAX_VALUE_SIZE LWIP_MAX((SNMP_MAX_OCTET_STRING_LEN)+1, sizeof(s32_t)*(SNMP_MAX_TREE_DEPTH)) |
The size of the MEMP_SNMP_VALUE elements, normally calculated from SNMP_MAX_OCTET_STRING_LEN and SNMP_MAX_TREE_DEPTH.
Definition at line 785 of file lwipopts.h.
| #define SNMP_MIB_DEBUG LWIP_DBG_OFF |
SNMP_MIB_DEBUG: Enable debugging for SNMP MIBs.
Definition at line 2086 of file lwipopts.h.
| #define SNMP_MSG_DEBUG LWIP_DBG_OFF |
SNMP_MSG_DEBUG: Enable debugging for SNMP messages.
Definition at line 2079 of file lwipopts.h.
| #define SNMP_PRIVATE_MIB 0 |
SNMP_PRIVATE_MIB:
Definition at line 751 of file lwipopts.h.
| #define SNMP_SAFE_REQUESTS 0 |
Only allow SNMP write actions that are 'safe' (e.g. disabeling netifs is not a safe action and disabled when SNMP_SAFE_REQUESTS = 1). Unsafe requests are disabled by default!
Definition at line 760 of file lwipopts.h.
| #define SNMP_TRAP_DESTINATIONS 0 |
SNMP_TRAP_DESTINATIONS: Number of trap destinations. At least one trap destination is required
Definition at line 744 of file lwipopts.h.
| #define SO_REUSE 1 |
SO_REUSE==1: Enable SO_REUSEADDR option.
Definition at line 1486 of file lwipopts.h.
| #define SO_REUSE_RXTOALL 0 |
SO_REUSE_RXTOALL==1: Pass a copy of incoming broadcast/multicast packets to all local matches if SO_REUSEADDR is turned on. WARNING: Adds a memcpy for every packet if passing to more than one pcb!
Definition at line 1495 of file lwipopts.h.
| #define SOCKETS_DEBUG LWIP_DBG_OFF |
SOCKETS_DEBUG: Enable debugging in sockets.c.
Definition at line 1896 of file lwipopts.h.
| #define SYS_DEBUG LWIP_DBG_OFF |
SYS_DEBUG: Enable debugging in sys.c.
Definition at line 1959 of file lwipopts.h.
| #define SYS_LIGHTWEIGHT_PROT 0 |
SYS_LIGHTWEIGHT_PROT==1: if you want inter-task protection for certain critical regions during buffer allocation, deallocation and memory allocation and deallocation.
Definition at line 54 of file lwipopts.h.
| #define SYS_STATS 0 |
Definition at line 1610 of file lwipopts.h.
| #define TCP_CALCULATE_EFF_SEND_MSS 1 |
TCP_CALCULATE_EFF_SEND_MSS: "The maximum size of a segment that TCP really sends, the 'effective send MSS,' MUST be the smaller of the send MSS (which reflects the available reassembly buffer size at the remote host) and the largest size permitted by the IP layer" (RFC 1122) Setting this to 1 enables code that checks TCP_MSS against the MTU of the netif used for a connection and limits the MSS if it would be too big otherwise.
Definition at line 991 of file lwipopts.h.
| #define TCP_CWND_DEBUG LWIP_DBG_OFF |
TCP_CWND_DEBUG: Enable debugging for TCP congestion window.
Definition at line 2002 of file lwipopts.h.
| #define TCP_DEBUG LWIP_DBG_OFF |
TCP_DEBUG: Enable debugging for TCP.
Definition at line 1973 of file lwipopts.h.
| #define TCP_DEFAULT_LISTEN_BACKLOG 0xff |
The maximum allowed backlog for TCP listen netconns. This backlog is used unless another is explicitly specified. 0xff is the maximum (u8_t).
Definition at line 1041 of file lwipopts.h.
| #define TCP_FR_DEBUG LWIP_DBG_OFF |
TCP_FR_DEBUG: Enable debugging in tcp_in.c for fast retransmit.
Definition at line 1987 of file lwipopts.h.
| #define TCP_INPUT_DEBUG LWIP_DBG_OFF |
TCP_INPUT_DEBUG: Enable debugging in tcp_in.c for incoming debug.
Definition at line 1980 of file lwipopts.h.
| #define TCP_LISTEN_BACKLOG 0 |
TCP_LISTEN_BACKLOG: Enable the backlog option for tcp listen pcb.
Definition at line 1032 of file lwipopts.h.
| #define TCP_MAXRTO 10 |
TCP_MAXRTO: Maximum retransmission timeout of data segments.
Definition at line 951 of file lwipopts.h.
| #define TCP_MAXRTX (*(volatile uint32*)0x600011E8) |
TCP_MAXRTX: Maximum number of retransmissions of data segments.
Definition at line 937 of file lwipopts.h.
| #define TCP_MINRTO 2 |
TCP_MINRTO: Minimum retransmission timeout of data segments.
Definition at line 958 of file lwipopts.h.
| #define TCP_MSL 2500UL |
2 * TCP_MSL defines duration of socket TIME-WAIT state in ms.
Definition at line 1080 of file lwipopts.h.
| #define TCP_MSS 536 |
TCP_MSS: TCP Maximum segment size. (default is 536, a conservative default, you might want to increase this.) For the receive side, this MSS is advertised to the remote side when opening a connection. For the transmit size, this MSS sets an upper limit on the MSS advertised by the remote host.
Definition at line 978 of file lwipopts.h.
| #define TCP_OUTPUT_DEBUG LWIP_DBG_OFF |
TCP_OUTPUT_DEBUG: Enable debugging in tcp_out.c output functions.
Definition at line 2016 of file lwipopts.h.
| #define TCP_OVERSIZE TCP_MSS |
TCP_OVERSIZE: The maximum number of bytes that tcp_write may allocate ahead of time in an attempt to create shorter pbuf chains for transmission. The meaningful range is 0 to TCP_MSS. Some suggested values are:
0: Disable oversized allocation. Each tcp_write() allocates a new pbuf (old behaviour). 1: Allocate size-aligned pbufs with minimal excess. Use this if your scatter-gather DMA requires aligned fragments. 128: Limit the pbuf/memory overhead to 20%. TCP_MSS: Try to create unfragmented TCP packets. TCP_MSS/4: Try to create 4 fragments or less per TCP packet.
Definition at line 1059 of file lwipopts.h.
| #define TCP_QLEN_DEBUG LWIP_DBG_OFF |
TCP_QLEN_DEBUG: Enable debugging for TCP queue lengths.
Definition at line 2030 of file lwipopts.h.
| #define TCP_QUEUE_OOSEQ 1 |
TCP_QUEUE_OOSEQ==1: TCP will queue segments that arrive out of order. Define to 0 if your device is low on memory.
Definition at line 966 of file lwipopts.h.
| #define TCP_RST_DEBUG LWIP_DBG_OFF |
TCP_RST_DEBUG: Enable debugging for TCP with the RST message.
Definition at line 2023 of file lwipopts.h.
| #define TCP_RTO_DEBUG LWIP_DBG_OFF |
TCP_RTO_DEBUG: Enable debugging in TCP for retransmit timeout.
Definition at line 1995 of file lwipopts.h.
| #define TCP_SND_BUF (2 * TCP_MSS) |
TCP_SND_BUF: TCP sender buffer space (bytes).
Definition at line 999 of file lwipopts.h.
| #define TCP_SND_QUEUELEN ((4 * (TCP_SND_BUF) + (TCP_MSS - 1))/(TCP_MSS)) |
TCP_SND_QUEUELEN: TCP sender buffer space (pbufs). This must be at least as much as (2 * TCP_SND_BUF/TCP_MSS) for things to work.
Definition at line 1007 of file lwipopts.h.
| #define TCP_SNDLOWAT ((TCP_SND_BUF)/2) |
TCP_SNDLOWAT: TCP writable space (bytes). This must be less than TCP_SND_BUF. It is the amount of space which must be available in the TCP snd_buf for select to return writable (combined with TCP_SNDQUEUELOWAT).
Definition at line 1016 of file lwipopts.h.
| #define TCP_SNDQUEUELOWAT LWIP_MAX(((TCP_SND_QUEUELEN)/2), 5) |
TCP_SNDQUEUELOWAT: TCP writable bufs (pbuf count). This must be grater than TCP_SND_QUEUELEN. If the number of pbufs queued on a pcb drops below this number, select returns writable (combined with TCP_SNDLOWAT).
Definition at line 1025 of file lwipopts.h.
| #define TCP_STATS 0 |
Definition at line 1607 of file lwipopts.h.
| #define TCP_SYNMAXRTX (*(volatile uint32*)0x600011E4) |
TCP_SYNMAXRTX: Maximum number of retransmissions of SYN segments.
Definition at line 944 of file lwipopts.h.
| #define TCP_TTL (IP_DEFAULT_TTL) |
TCP_TTL: Default Time-To-Live value.
Definition at line 922 of file lwipopts.h.
| #define TCP_WND (*(volatile uint32*)0x600011F0) |
TCP_WND: The size of a TCP window. This must be at least (2 * TCP_MSS) for things to work well
Definition at line 930 of file lwipopts.h.
| #define TCP_WND_DEBUG LWIP_DBG_OFF |
TCP_WND_DEBUG: Enable debugging in tcp_in.c for window updating.
Definition at line 2009 of file lwipopts.h.
| #define TCP_WND_UPDATE_THRESHOLD (TCP_WND / 4) |
TCP_WND_UPDATE_THRESHOLD: difference in window to trigger an explicit window update
Definition at line 1074 of file lwipopts.h.
| #define TCPIP_DEBUG LWIP_DBG_OFF |
TCPIP_DEBUG: Enable debugging in tcpip.c.
Definition at line 2044 of file lwipopts.h.
| #define TCPIP_MBOX_SIZE 0 |
TCPIP_MBOX_SIZE: The mailbox size for the tcpip thread messages The queue size value itself is platform-dependent, but is passed to sys_mbox_new() when tcpip_init is called.
Definition at line 1274 of file lwipopts.h.
| #define TCPIP_THREAD_NAME "tcpip_thread" |
TCPIP_THREAD_NAME: The name assigned to the main tcpip thread.
Definition at line 1247 of file lwipopts.h.
| #define TCPIP_THREAD_PRIO 1 |
TCPIP_THREAD_PRIO: The priority assigned to the main tcpip thread. The priority value itself is platform-dependent, but is passed to sys_thread_new() when the thread is created.
Definition at line 1265 of file lwipopts.h.
| #define TCPIP_THREAD_STACKSIZE 0 |
TCPIP_THREAD_STACKSIZE: The stack size used by the main tcpip thread. The stack size value itself is platform-dependent, but is passed to sys_thread_new() when the thread is created.
Definition at line 1256 of file lwipopts.h.
| #define TIMERS_DEBUG LWIP_DBG_OFF |
TIMERS_DEBUG: Enable debugging in timers.c.
Definition at line 1966 of file lwipopts.h.
| #define UDP_DEBUG LWIP_DBG_OFF |
UDP_DEBUG: Enable debugging in UDP.
Definition at line 2037 of file lwipopts.h.
| #define UDP_STATS 0 |
Definition at line 1606 of file lwipopts.h.
| #define UDP_TTL (IP_DEFAULT_TTL) |
UDP_TTL: Default Time-To-Live value.
Definition at line 896 of file lwipopts.h.


| Class | Description |
|---|---|
| ABYSSRunner |
This class is the main program used to configure and run AbYSS, a
multiobjective scatter search metaheuristics, which is described in:
A.J.
|
| CellDERunner |
Class to configure and run the MOCell algorithm
|
| DMOPSOMeasuresRunner |
Class for configuring and running the DMOPSO algorithm
|
| DMOPSORunner |
Class for configuring and running the DMOPSO algorithm
|
| GDE3BigDataRunner |
Class for configuring and running the GDE3 algorithm for solving a problem of the Big Optimization
competition at CEC2015
|
| GDE3Runner |
Class for configuring and running the GDE3 algorithm
|
| GWASGFARunner | |
| IBEARunner |
Class for configuring and running the IBEA algorithm
|
| MOCellHVRunner |
Class to configure and run the MOCell algorithm
|
| MOCellRunner |
Class to configure and run the MOCell algorithm
|
| MOCHC45Runner |
This class executes the algorithm described in:
A.J.
|
| MOCHCRunner |
This class executes the algorithm described in:
A.J.
|
| MOEADDRunner |
Class for configuring and running the MOEA/DD algorithm
|
| MOEADRunner |
Class for configuring and running the MOEA/D algorithm
|
| MOEADSTMRunner |
Class for configuring and running the MOEA/D algorithm
|
| MOMBI2Runner |
Class to configure and run the MOMBI2 algorithm
|
| MOMBIRunner |
Class to configure and run the MOMBI algorithm
|
| NSGAII45Runner |
Class to configure and run the implementation of the NSGA-II algorithm included
in
NSGAII45 |
| NSGAIIBigDataRunner |
Class for configuring and running the NSGA-II algorithm to solve a problem of the CEC 2015
Big Optimization competition
|
| NSGAIIBinaryRunner |
Class for configuring and running the NSGA-II algorithm (binary encoding)
|
| NSGAIIEbesRunner |
Class to configure and run the NSGA-II algorithm to solve the Ebes problem
|
| NSGAIIIntegerRunner |
Class for configuring and running the NSGA-II algorithm (integer encoding)
|
| NSGAIIIRunner |
Class to configure and run the NSGA-III algorithm
|
| NSGAIIMeasuresRunner |
Class to configure and run the NSGA-II algorithm (variant with measures)
|
| NSGAIIMeasuresWithChartsRunner |
Class to configure and run the NSGA-II algorithm (variant with measures)
|
| NSGAIIMeasuresWithHypervolumeRunner |
Class to configure and run the NSGA-II algorithm (variant with measures)
|
| NSGAIIRunner |
Class to configure and run the NSGA-II algorithm
|
| NSGAIIStoppingByTimeRunner |
Class to configure and run the NSGA-II algorithm (version NSGAIIStoppingByTime)
|
| NSGAIITSPRunner |
Class for configuring and running the NSGA-II algorithm to solve the bi-objective TSP
|
| OMOPSORunner |
Class for configuring and running the OMOPSO algorithm
|
| PAESRunner |
Class for configuring and running the PAES algorithm
|
| ParallelGDE3Runner |
Class for configuring and running the GDE3 algorithm (parallel version)
|
| ParallelNSGAIIRunner |
Class for configuring and running the NSGA-II algorithm (parallel version)
|
| ParallelPESA2Runner |
Class for configuring and running the PESA2 algorithm (parallel version)
|
| ParallelSMPSORunner |
Class for configuring and running the SMPSO algorithm (parallel version)
|
| ParallelSPEA2Runner |
/**
Class for configuring and running the SPEA2 algorithm
|
| PESA2Runner |
Class for configuring and running the PESA2 algorithm
|
| RandomSearchRunner |
Class for configuring and running the random search algorithm
|
| RNSGAIIConstraintRunner |
Class to configure and run the R-NSGA-II algorithm
|
| RNSGAIIRunner |
Class to configure and run the R-NSGA-II algorithm
|
| SMPSOBigDataRunner |
Class for configuring and running the SMPSO algorithm to solve a problem of the CEC2015
Big Optimization competition
|
| SMPSOHv2Runner |
Class for configuring and running the SMPSO algorithm using an HypervolumeArchive, i.e, the
SMPSOhv algorithm described in:
A.J Nebro, J.J.
|
| SMPSOHvRunner |
Class for configuring and running the SMPSO algorithm using an HypervolumeArchive, i.e, the
SMPSOhv algorithm described in:
A.J Nebro, J.J.
|
| SMPSOMeasuresRunner |
Class to configure and run the NSGA-II algorithm (variant with measures)
|
| SMPSORunner |
Class for configuring and running the SMPSO algorithm
|
| SMSEMOARunner |
Class to configure and run the SMSEMOA algorithm
|
| SPEA2BinaryRunner |
Class for configuring and running the SPEA2 algorithm (binary encoding)
|
| SPEA2Runner |
Class for configuring and running the SPEA2 algorithm
|
| SteadyStateNSGAIIRunner |
Class to configure and run the NSGA-II (steady state version) algorithm
|
| WASFGABinaryRunner | |
| WASFGAMeasuresRunner | |
| WASFGAMeasuresRunner3D | |
| WASFGARunner |
Copyright © 2018. All rights reserved.


OpenSSH is OpenBSD's rework of the last free version of SSH, bringing it
up to date in terms of security and features, as well as removing all
patented algorithms to separate libraries (OpenSSL).
This package includes the clients necessary to make encrypted connections
to SSH servers.
-rw-r--r-- 1 root root 1555 Mar 3 1995 /etc/ssh/ssh_config -rwxr-xr-x 1 root root 216931 Mar 3 1995 /usr/bin/sftp ?rwxrwxrwx 1 root root 5 Mar 3 1995 /usr/bin/slogin -rwsr-xr-x 1 root root 1574157 Mar 3 1995 /usr/bin/ssh -rwxr-xr-x 1 root root 1265220 Mar 3 1995 /usr/bin/ssh-add -rwxr-xr-x 1 root root 1245461 Mar 3 1995 /usr/bin/ssh-agent -rw-r--r-- 1 root root 4702 Mar 3 1995 /usr/share/man/man1/sftp.1.gz ?rwxrwxrwx 1 root root 8 Mar 3 1995 /usr/share/man/man1/slogin.1.gz -rw-r--r-- 1 root root 2709 Mar 3 1995 /usr/share/man/man1/ssh-add.1.gz -rw-r--r-- 1 root root 3016 Mar 3 1995 /usr/share/man/man1/ssh-agent.1.gz -rw-r--r-- 1 root root 13603 Mar 3 1995 /usr/share/man/man1/ssh.1.gz


|
EEP 520 Final Project
Random maze generator for final project
|
Generates Random Maze. More...
#include <mazegenerator.h>
Public Member Functions | |
| void | generate_maze (std::pair< double, double > location) |
| Generates a random maze. More... | |
| const std::vector< std::pair< double, double > > | get_walls () |
| Generates vector of coordinates for walls to generate. More... | |
| const std::pair< double, double > | get_finish () |
| Gets finish line coordinate. More... | |
Generates Random Maze.
Maze generator randomly generates a random maze within a defined rectangle.
Note that at the moment, the size is static and implementation is crude.
To-do: Dynamically scale maze, add param for maze size, optimize finish line,
| void MazeGenerator::generate_maze | ( | std::pair< double, double > | location | ) |
Generates a random maze.
generate_maze returns coordinates for the walls of a randomly generated maze. Its input is the starting location for the generator.
| const std::pair< double, double > MazeGenerator::get_finish | ( | ) |
Gets finish line coordinate.
Get finish checks the corners of the map for an open cell to place the finish line, which is just a custom agent.
To-do: Make smarter and randomize, incorporate scaling and dynamic map size
| const std::vector< std::pair< double, double > > MazeGenerator::get_walls | ( | ) |
Generates vector of coordinates for walls to generate.
get_walls generates coordinates for walls by removing the visited coordinates from all possible coordinates.


CosTime_TIO
Module
Module Summary
Description
To get access to the record definitions for the structures use:
-include_lib("cosTime/include/*.hrl").
Exports
'_get_time_interval'(TIO) -> TimeInterval
Types
This operation returns the interval associated with the target object.
Types
This operation returns a OverlapType depending on how the interval in the target object and the timerange represented by the UTO object overlap. If the OverlapType is 'OTNoOverlap' the out parameter represents the gap between the two intervals. If OverlapType is one of the others, the out parameter represents the overlap interval. The definitions of the OverlapType's are:
- 'OTContainer' - target objects lower and upper limits are, respectively, less or equal to and greater or equal to given object's.
- 'OTContained' - target objects lower and upper limits are, respectively, greater or equal to and less or equal to given object's.
- 'OTOverlap' - target objects interval overlap given object's.
- 'OTNoOverlap' - target objects interval do not overlap given object's.
overlaps(TIO, OtherTIO) -> Reply
Types
This operation returns a OverlapType depending on how the interval in the target object and the timerange represented by the TIO object overlap. The OverlapType's are described under spans/2.
Types
This operation returns a UTO in which the interval equals the time interval in the target object and time value is the midpoint of the interval.


Our Poker Room does not close. You can find a game any time, day or night! Our full menu is available for players only during dining hours.
We offer a variety of games, both for tournament play and cash games:
There is a $10 entrance fee for the Poker room. This fee is waived with the purchase of any entree!
Check out or other poker room at this location.


$_true-context (list) [private]
$_true-context: ();
Stores the current module/test/assertion context stack
Used By
@mixin _true-context() [private]
@mixin _true-context-pop() [private]
@function _true-context() [private]
@function _true-context-all() [private]
@mixin _true-context() [private]
Update the current context for a given scope
Parameters
$scope: (string)
Either module
, test
or assert
$name: (string)
Name or description of the current scope
Requires
$_true-context (list) [private]
Used By
@mixin assert()
@mixin assert-true()
@mixin assert-false()
@mixin assert-equal()
@mixin assert-unequal()
@mixin _true-module-start() [private]
@mixin _true-test-start() [private]
@mixin _true-context-pop() [private]
Remove the deepest context layer from $_true-context
Requires
$_true-context (list) [private]
Used By
@mixin assert()
@mixin _true-assert-results() [private]
@mixin _true-module-stop() [private]
@mixin _true-test-stop() [private]
$_true-output-context (list) [private]
$_true-output-context: ();
Make sure every output test
includes an assert
, output
, and expect
/contains
Used By
@mixin _true-output-context() [private]
@mixin _true-output-context() [private]
Add assert
, output
, expect
, or contains
context to an output test,
or check to make sure they all exist before resetting the context.
Parameters
$new: ('assert' | 'output' | 'expect' | 'contains' | null)
Add a new assert
, output
, expect
, or contains
layer
to the context of an output-test,
or use null
to check that all context is properly formed
and then reset it at the end of a test
$context: $_true-output-context (list)
The current output context
@function _true-validate-output-context() [private]
Validate the new context, and return an updated context value
Parameters & Return
$new: ('assert' | 'output' | 'expect' | 'contains' | null)
Add a new assert
, output
, expect
, or contains
layer
to the context of an output-test,
or use null
to check that all context is properly formed
and then reset it at the end of a test
$context: $_true-output-context (list)
The current output context
@return (list)
Updated output context
@error
When adding unknown context
@error
When trying to add context that already exists
@error
When assert()
is missing before expect
, output
, or contains
@error
When context is missing before a reset
Requires
@function _true-error() [private]
Used By
@mixin _true-output-context() [private]
@function _true-context() [private]
Get information on current context for a given scope
Parameters & Return
$scope: (string)
@return (string)
Requires
$_true-context (list) [private]
Used By
@mixin assert()
@mixin assert-true()
@mixin assert-false()
@mixin assert-equal()
@mixin assert-unequal()
@mixin _true-pass-details() [private]
@mixin _true-fail-details() [private]
@function _true-context-all() [private]
Get list of context names for a given scope
Parameters & Return
$scope: (string)
@return (list)
Requires
$_true-context (list) [private]
Used By
@mixin _true-module-start() [private]
@function _true-get-result() [private]
Compare two values, and return a pass
or fail
result.
Parameters & Return
$assert: (*)
Value to consider
$expected: (*)
Expected match
$unequal: false (bool)
Set to true
if the comparison is expected to fail
@return ('pass' | 'fail')
Used By
@mixin _true-assert-results() [private]
$_true-results (Map) [private]
$_true-results: (
'run': 0,
'pass': 0,
'fail': 0,
'output-to-css': 0,
);
Global test-results map
Used By
@mixin _true-update() [private]
@mixin _true-update() [private]
Update global results data
Parameters
$result: ('pass' | 'fail' | 'output-to-css')
Requires
@function _true-map-increment() [private]
$_true-results (Map) [private]
$_true-test-result (String) [private]
Used By
@mixin _true-test-stop() [private]
$_true-test-result (String) [private]
$_true-test-result: null;
Used By
@mixin _true-update() [private]
@mixin _true-update-test() [private]
@mixin _true-test-stop() [private]
@mixin _true-update-test() [private]
Update test result flag with new data
Parameters
$result: ('pass' | 'fail' | 'output-to-css')
Requires
$_true-test-result (String) [private]
$_true-stats (Map<String: Number>) [private]
$_true-stats: (
'modules': 0,
'tests': 0,
'assertions': 0
);
Global stats count of how many modules, tests, and assertions are found
Used By
@mixin _true-update-stats-count() [private]
@mixin _true-update-stats-count() [private]
Add to a stats count type count by 1
Parameters
$type: (String)
The stats type to add to


| Created: | 9/18/2012 1:40:55 PM |
| Modified: | 5/14/2013 11:53:16 AM |
| Project: | |
| Advanced: |
| Operation | ||||
|
Public Debug( message: String, |
||||
|
Details:
Sequential
|
||||
|
Public Debug( message: String, |
||||
|
Details:
Sequential
|
||||
|
Public Debug( exception: Exception, |
||||
|
Details:
Sequential
|
||||
|
Public Debug( exception: Exception, |
||||
|
Details:
Sequential
|
||||
|
Public Error( exception: Exception, |
||||
|
Details:
Sequential
|
||||
|
Public Error( exception: Exception, |
||||
|
Details:
Sequential
|
||||
|
Public Info( Info: String, |
||||
|
Details:
Sequential
|
||||
|
Public Info( Info: String, |
||||
|
Details:
Sequential
|
||||
|
Public Info( exception: Exception, |
||||
|
Details:
Sequential
|
||||
|
Public Info( exception: Exception, |
||||
|
Details:
Sequential
|
||||
|
Public Init():void |
||||
|
Details:
Sequential
|
||||
|
Public Init():void |
||||
|
Details:
Sequential
|
||||
|
Public Warn( message: String, |
||||
|
Details:
Sequential
|
||||
|
Public Warn( message: String, |
||||
|
Details:
Sequential
|
||||
|
Public Warn( exception: Exception, |
||||
|
Details:
Sequential
|
||||
|
Public Warn( exception: Exception, |
||||
|
Details:
Sequential
|
| Element | Source Role | Target Role |
|
LoggerWcfServer Class |
Name: |
Name: |
|
Details:
|
| Object | Type | Connection | Notes |
| «interface» ILoggerExtension | Interface | Realization | |
| «interface» ILoggerService | Interface | Realization |


Before Change
def training_series(cursor_r, cursor_c, mix, increment_fraction=0.05):
Given two end-cursors and a mix of games, produce a series of bounds.
while (cursor_r - mix.games_r) >= 0 and (cursor_c - mix.games_c) >= 0:
yield (cursor_r - mix.games_r), cursor_r, (cursor_c - mix.games_c), cursor_c
cursor_r -= math.ceil(mix.games_r * increment_fraction)
cursor_c -= math.ceil(mix.games_c * increment_fraction)
def _export_training_set(args):
spec, start_r, start_c, mix, batch_size, output_url = args
gq_r = bigtable_input.GameQueue(spec.project, spec.instance, spec.table)
gq_c = bigtable_input.GameQueue(spec.project, spec.instance, spec.table + "-nr")
After Change
// number of intervals
stride_c = math.ceil(cursor_c / intervals)
print("stride_c was {}, now {}".format(mix.games_c * increment_fraction, stride_c))
print("stride_r: {} stride_c: {}".format(stride_r, stride_c))
for b_r, b_c in zip(range(0, cursor_r, stride_r), range(0, cursor_c, stride_c)):
last_r, last_c = b_r + stride_r, b_c + stride_c
yield (b_r, last_r, b_c, last_c)


Effective date: May 23, 2018
Pachatary ("us", "we", or "our") operates the website and the Pachatary mobile application (the "Service").
This page informs you of our policies regarding the collection, use, and disclosure of personal data when you use our Service and the choices you have associated with that data. This Privacy Policy for Pachatary is powered by TermsFeed.
We use your data to provide and improve the Service. By using the Service, you agree to the collection and use of information in accordance with this policy. Unless otherwise defined in this Privacy Policy, terms used in this Privacy Policy have the same meanings as in our Terms and Conditions.
Information Collection And UseWe collect several different types of information for various purposes to provide and improve our Service to you.
While using our Service, we may ask you to provide us with certain personally identifiable information that can be used to contact or identify you ("Personal Data"). Personally identifiable information may include, but is not limited to:
Usage Data is used to improve the System.
Location Data is only used to accurate the searches made to show you the content near you.
Email is private and we use it to send mails to complete email confirmation and login processes.
This Usage Data may include information such as your computer's Internet Protocol address (e.g. IP address), browser type, browser version, the pages of our Service that you visit, the time and date of your visit, the time spent on those pages, unique device identifiers and other diagnostic data.
When you access the Service by or through a mobile device, this Usage Data may include information such as the type of mobile device you use, your mobile device unique ID, the IP address of your mobile device, your mobile operating system, the type of mobile Internet browser you use, unique device identifiers and other diagnostic data.
We use tracking technologies to track the activity on our Service and hold certain information.
Pachatary uses the collected data for various purposes:
We send you mails to execute mail confirmation and login processes.
We use location to accurate the content searches.
We use location data to maintain and improve the Service.
Your information, including Personal Data, may be transferred to — and maintained on — computers located outside of your state, province, country or other governmental jurisdiction where the data protection laws may differ than those from your jurisdiction.
Your consent to this Privacy Policy followed by your submission of such information represents your agreement to that transfer.
Pachatary will take all steps reasonably necessary to ensure that your data is treated securely and in accordance with this Privacy Policy and no transfer of your Personal Data will take place to an organization or a country unless there are adequate controls in place including the security of your data and other personal information.
Pachatary may disclose your Personal Data in the good faith belief that such action is necessary to:
To comply with a legal obligation
To protect and defend the rights or property of Pachatary
To prevent or investigate possible wrongdoing in connection with the Service
To protect the personal safety of users of the Service or the public
To protect against legal liability
The security of your data is important to us, but remember that no method of transmission over the Internet, or method of electronic storage is 100% secure. While we strive to use commercially acceptable means to protect your Personal Data, we cannot guarantee its absolute security.
We may employ third party companies and individuals to facilitate our Service ("Service Providers"), to provide the Service on our behalf, to perform Service-related services or to assist us in analyzing how our Service is used.
These third parties have access to your Personal Data only to perform these tasks on our behalf and are obligated not to disclose or use it for any other purpose.
We may use third-party Service Providers to monitor and analyze the use of our Service.
Our Service may contain links to other sites that are not operated by us. If you click on a third party link, you will be directed to that third party's site. We strongly advise you to review the Privacy Policy of every site you visit.
We have no control over and assume no responsibility for the content, privacy policies or practices of any third party sites or services.
Our Service does not address anyone under the age of 18 ("Children").
We do not knowingly collect personally identifiable information from anyone under the age of 18. If you are a parent or guardian and you are aware that your Children has provided us with Personal Data, please contact us. If we become aware that we have collected Personal Data from children without verification of parental consent, we take steps to remove that information from our servers.
We may update our Privacy Policy from time to time. We will notify you of any changes by posting the new Privacy Policy on this page.
We will let you know via email and/or a prominent notice on our Service, prior to the change becoming effective and update the "effective date" at the top of this Privacy Policy.
You are advised to review this Privacy Policy periodically for any changes. Changes to this Privacy Policy are effective when they are posted on this page.
If you have any questions about this Privacy Policy, please contact us:
By email: hello@pachatary.com


Map out your main life activities. These are task classifications under which you do most of your daily activities


## serge bouchardon
digital literature exists in the wake of things like: - combinatorial lit (oulipo) - constraint lit (idem) - fragment lit (?) - audio/visual lit
literary experiments (-> which implies that the experiment is the first intent, no? could it be that art flourishes on the margin, like the hacker code of paloque berges?)
literary expression: writing, narrative, position of the reader
what has source code writing to offer when it comes to literary creation? (and vice-versa)
the digital only refers to itself (yes, but the digital is inseparable from the act of writing, which then involves a human and therefore necessarily (?) a relationship to other worlds- > goodman). but also the very first thing is hardware
form and meaning are closely linked (cf. j. rousset, forme et signification, 1966)
the bizarre love triangle of media studies: - technically - semiotically - socially
source code could be a particular modality/mode of text (now i need to define which one!)
“possesses aesthetic properties everything which sets in motion, which makes do (fait faire)” (materialized abstraction)
what is the relationship between literature and communication?? (text as an object to think through)
“the interrogative stance can not only stand in what has been done, but also in what can be anticipated, through conception and creation” (epistemological constructivism, hacking, 1983). “the creative moment sets up the conditions to observe a phenomenon”
halfway between the concrete object that belong in the observation field and the scientific object which has alread-established explanations of the real
the digital lit object is complex: need to explicit these webs of relationships (historical, geographical, means vs. ends, broadcasting techniques); it stands at the frontier of a lot of domains.
in the poetic dimension of technical objects, there is this idea that, as we realize a technical object, new ideas appear and transform the initial project. it is a literature OF the technical apparatus.
is there really a tension between the imperative formal semantics of programming and the cultural forms of writing? writing is an apparatus of externalizing memory and thought, while the program is “a means to certify the future, to eliminate uncertainty and the unlikely in order to bring it back under control, mastery”. (while i don’t see this as a tension), the author says that out of this initial seemingly-impossibility. (closeness of the program, openness of the language)
question of the architectural literature. «<
L’INTERSEMIOTISATION DU LANGUAGE ET DU TEXTE (how these systems of signs interact with each other)
the aesthetic experience can result from the tension between materiality and the revelation of meaning/direction (transcendance). it is a bit like the double-coding that CPB was talking about, but perhaps could be extended by defining (precise/multiple) what materiality and transcendentality; but nonetheless advancing an aesthetics of materiality.
dual-positioning of source code text 1. against text (against literary) 2. against text (against productive software)
e-lit is at the frontier between print and digital, text and multimedia, litterature and art (??) e-lit is at the frontier surroundable, by authors, researchers, movements, and institutions e-lit is a laboratory, in which the researcher works on samples but those samples could influence the broader world
but it has first and foremost a quadruple dimension (social, technical, semotic and aesthetic) as such, it is a polysemiotic object (made out of the encounter of different signs)
classical rhetoric has: 1. invention 2. disposition 3. memory 4. elocution 5. action
today: 1. structure 2. choice of words 3. choice of figures
pierre fontanier: 1. metonymy (contiguity) (a thing for another thing) 2. synecdoche (intersection) (a part for the whole or vice versa) 3. metaphor (superposition) (a lower thing for a higher thing)
(klinenberg): une figure est un dispositif consistant a produire des sens implicites, de telle maniere que l’enonce ou on le trouve soit polyphonique. programming languages are the locus of a struggle induced by this polyphony
materiality as hardware, as interaction, but also as RESISTANCE
CORPUS: jean pierre balpe, lejourleplusclair, p. 189
e-lit has an aesthetics: - of noise/saturation - of letting go (the text can be out of our control) - of the ephemeral - of reenchating (alexandra saemmer)
e-lit extends existing theories: - the novel - the text - the figure - the materiality - the memory
hayles analyzes e-lit to produce theories of media studies
two important things tension between programmed language and cultural language, and tension of communication between the individual and the group
grammatization is the transforming of a time-based continuum into a space-based discrete suite
there is a continuum between ordinary writing and literary writing (the literate offers a different perspective on the ordinary)
writing: normative system and human activity and products (means that humans have found to make language visible)
keys to understand e-lit - textuality - narrativity - gesture (interactivity)
etre litteraire, c’est peut etre avant tout etre sensible a l’epaisseur signiante d’un message et aux infinis jeux de l’interpretation. ce que les etudes litteraires peuvent egalement apporter aux sciences de l’information et de la communication, c’est ainsi une sensibilite a la complexite des postures d’interpretation, mais aussi a l’esthetique d’un message a travers la question inepuisable du style


|
ViennaCL - The Vienna Computing Library
1.5.2
|
A slice class that refers to an interval [start, stop), where 'start' is included, and 'stop' is excluded. More...
#include <slice.hpp>
Public Types | |
| typedef SizeType | size_type |
| typedef DistanceType | difference_type |
| typedef size_type | value_type |
| typedef value_type | const_reference |
| typedef const_reference | reference |
Public Member Functions | |
| basic_slice () | |
| basic_slice (size_type start_index, difference_type stride_arg, size_type size_arg) | |
| size_type | start () const |
| difference_type | stride () const |
| size_type | size () const |
| const_reference | operator() (size_type i) const |
| const_reference | operator[] (size_type i) const |
| bool | operator== (const basic_slice &s) const |
| bool | operator!= (const basic_slice &s) const |
A slice class that refers to an interval [start, stop), where 'start' is included, and 'stop' is excluded.
Similar to the boost::numeric::ublas::basic_range class.
| typedef value_type const_reference |
| typedef DistanceType difference_type |
| typedef const_reference reference |
| typedef SizeType size_type |
| typedef size_type value_type |
| basic_slice | ( | ) | [inline] |
| basic_slice | ( | size_type | start_index, |
| difference_type | stride_arg, | ||
| size_type | size_arg | ||
| ) | [inline] |
| bool operator!= | ( | const basic_slice< SizeType, DistanceType > & | s | ) | const [inline] |
| const_reference operator() | ( | size_type | i | ) | const [inline] |
| bool operator== | ( | const basic_slice< SizeType, DistanceType > & | s | ) | const [inline] |
| const_reference operator[] | ( | size_type | i | ) | const [inline] |
| difference_type stride | ( | ) | const [inline] |


◄ Poland ►
Individual results
| Year | Contestant | Rank | Award |
|---|---|---|---|
| 2023 | Filip Baciak | 20 | Gold Medal |
| 2023 | Andrzej Franciszek Maroń | 64 | Silver Medal |
| 2023 | Michał Piotr Lipiec | 70 | Silver Medal |
| 2023 | Stanisław Marcin Karpiejczyk | 73 | Silver Medal |
| 2023 | Mateusz Kamiński | 148 | Bronze Medal |
| 2022 | Filip Baciak | 66 | Silver Medal |
| 2022 | Stanisław Karpiejczyk | 109 | Silver Medal |
| 2022 | Kacper Paciorek | 114 | Bronze Medal |
| 2022 | Mateusz Kamiński | 164 | Bronze Medal |
| 2022 | Piotr Borodako | 208 | Honourable Mention |
| 2021 | Miłosz Piotr Matraszek | 95 | Silver Medal |
| 2021 | Piotr Borodako | 117 | Bronze Medal |
| 2021 | Antoni Jan Skoczypiec | 129 | Bronze Medal |
| 2021 | Antoni Krzysztof Grabowski | 134 | Bronze Medal |
| 2021 | Emil Kisielewicz | 164 | Bronze Medal |
| 2019 | Tomasz Slusarczyk | 83 | Silver Medal |
| 2019 | Juliusz Banecki | 118 | Bronze Medal |
| 2019 | Jakub Wiktor Wornbard | 122 | Bronze Medal |
| 2019 | Piotr Daniel Sawicki | 158 | Bronze Medal |
| 2019 | Adam Jan Watroba | 246 | Honourable Mention |
| 2018 | Maciej Maruszczak | 171 | Bronze Medal |
| 2018 | Wojciech Szymański | 180 | Bronze Medal |
| 2018 | Lukasz Bialas | 214 | Honourable Mention |
| 2018 | Konrad Pawlik | 260 | Honourable Mention |
| 2017 | Jakub Boguta | ≥65 | Silver Medal |
| 2017 | Juliusz Neuman | ≥137 | Bronze Medal |
| 2017 | Wojciech Szymański | ≥239 | Honourable Mention |
| 2016 | Adam Sebastian Kucz | 51 | Silver Medal |
| 2016 | Bartosz Markowicz | 150 | Bronze Medal |
| 2016 | Stanislaw Pawel Kurdzialek | 183 | Bronze Medal |
| 2016 | Mateusz Raczynski | 186 | Bronze Medal |
| 2015 | Adam Sebastian Kucz | 26 | Gold Medal |
| 2015 | Jan Krzysztof Marucha | 107 | Bronze Medal |
| 2015 | Piotr Krzysztof Kubala | 132 | Bronze Medal |
| 2015 | Stanislaw Pawel Kurdzialek | 132 | Bronze Medal |
| 2015 | Rafal Ernest Cwiek | 253 | Honourable Mention |
| 2014 | Adam Krasuski | 30 | Gold Medal |
| 2014 | Jakub Supeł | 82 | Silver Medal |
| 2014 | Pawel Czajka | 115 | Silver Medal |
| 2014 | Filip Plata | 157 | Bronze Medal |
| 2014 | Andrzej Pisarek | 259 | Honourable Mention |
| 2013 | Jakub Supeł | 12 | Gold Medal |
| 2013 | Adam Krasuski | 72 | Silver Medal |
| 2013 | Jakub Mrożek | 85 | Silver Medal |
| 2013 | Kacper Oreszczuk | 159 | Bronze Medal |
| 2013 | Kamil Kaczmarek | 233 | Honourable Mention |
| 2012 | Michal Pacholski | 27 | Gold Medal |
| 2012 | Filip Ficek | 76 | Silver Medal |
| 2012 | Jan Rydzewski | 133 | Bronze Medal |
| 2012 | Kacper Oreszczuk | 145 | Bronze Medal |
| 2012 | Bartlomiej Zawalski | 221 | Honourable Mention |
| 2011 | Wojciech Tarnowski | 82 | Silver Medal |
| 2011 | Andrzej Sulecki | 123 | Bronze Medal |
| 2011 | Jakub Nowak | 125 | Bronze Medal |
| 2011 | Krzysztof Lis | 134 | Bronze Medal |
| 2011 | Piotr Podlaski | 188 | Bronze Medal |
| 2010 | Adam Scibior | 76 | Silver Medal |
| 2010 | Krzysztof Lis | 110 | Bronze Medal |
| 2010 | Michal Pacholski | 126 | Bronze Medal |
| 2010 | Michal Miskiewicz | 161 | Bronze Medal |
| 2010 | Mateusz Machalica | 168 | Bronze Medal |
| 2009 | Piotr Godlewski | 6 | Gold Medal |
| 2009 | Mateusz Jończyk | 82 | Silver Medal |
| 2009 | Adam Wyrzykowski | 153 | Bronze Medal |
| 2009 | Piotr Waluk | 158 | Bronze Medal |
| 2009 | Dominik Gronkiewicz | 228 | Honourable Mention |
| 2008 | Piotr Godlewski | 57 | Silver Medal |
| 2008 | Lukasz Mazurek | 59 | Silver Medal |
| 2008 | Robert Obryk | 65 | Silver Medal |
| 2008 | Maciej Pietrzak | 191 | Honourable Mention |
| 2008 | Grzegorz Kepisty | 200 | Honourable Mention |
| 2007 | Bartłomiej Kaminski | 42 | Silver Medal |
| 2007 | Jakub M. Sikorowski | 141 | Honourable Mention |
| 2007 | Pawel Tomasik | 148 | Honourable Mention |
| 2007 | Pawel Duch | 161 | Honourable Mention |
| 2007 | Adrian M. Panasiuk | 194 | Honourable Mention |
| 2006 | Tomasz Smolenski | 15 | Gold Medal |
| 2006 | Tomasz Badowski | 151 | Bronze Medal |
| 2006 | Michal Gawronski | 173 | Honourable Mention |
| 2006 | Marcin Sobczyk | 185 | Honourable Mention |
| 2006 | Arkadiusz Trawinski | 213 | Honourable Mention |
| 2005 | Sieciech Czajka | 54 | Silver Medal |
| 2005 | Kornel Maczynski | 117 | Bronze Medal |
| 2005 | Marcin Grzybowski | 141 | Honourable Mention |
| 2005 | Krzysztof Niemkiewicz | 170 | Honourable Mention |
| 2004 | Krzysztof Choromanski | ≥67 | Bronze Medal |
| 2004 | Piotr Migdal | ≥67 | Bronze Medal |
| 2004 | Sieciech Czajka | ≥67 | Bronze Medal |
| 2004 | Lukasz Krysiak | ≥135 | Honourable Mention |
| 2004 | Magdalena Gulewicz | ≥135 | Honourable Mention |
| 2003 | Marcin Pilipczuk | 9 | Gold Medal |
| 2003 | Szymon Szafraniec | 65 | Bronze Medal |
| 2003 | Tomasz Kazimierczuk | 71 | Bronze Medal |
| 2003 | Krzysztof Iwaszczuk | 73 | Bronze Medal |
| 2003 | Bartołomiej Szczygieł | 78 | Bronze Medal |
| 2002 | Marek Misztal | 64 | Silver Medal |
| 2002 | Miron Sadziak | 86 | Bronze Medal |
| 2002 | Piotr Powalowski | 117 | Bronze Medal |
| 2002 | Wojciech Samotij | 121 | Bronze Medal |
| 2002 | Adam Działak | 136 | Bronze Medal |
| 2001 | Andrzej Goerlich | 5 | Gold Medal |
| 2001 | Mateusz Kwaśnicki | 53 | Silver Medal |
| 2001 | Michał Jóźwikowski | 80 | Bronze Medal |
| 2001 | Maciej Fijałkowski | 129 | Honourable Mention |
| 2001 | Adam Działak | 137 | Honourable Mention |
| 2000 | Przemysław Piotr Broniek | 68 | Honourable Mention |
| 2000 | Jakub Maksymilian Gac | 120 | Honourable Mention |
| 1999 | Andrzej Janusz Jarosz | 78 | Silver Medal |
| 1999 | Przemysław Piotr Broniek | 91 | Silver Medal |
| 1999 | Marek Tomasz Biskup | 108 | Bronze Medal |
| 1999 | Piotr Nowakowski | 166 | Honourable Mention |
| 1998 | Jarosław Łabaziewicz | 8 | Gold Medal |
| 1998 | Matylla Łukasz | 18 | Silver Medal |
| 1998 | Legutko Piotr | 101 | Honourable Mention |
| 1998 | Demkowicz-Dobrzański Rafał | 109 | Honourable Mention |
| 1998 | Dybalski Wojciech | 124 | Honourable Mention |
| 1997 | Jarosław Łabaziewicz | 26 | Silver Medal |
| 1997 | Marcin Szlufik | 30 | Silver Medal |
| 1997 | Michał Szabelski | 54 | Bronze Medal |
| 1997 | Marek Miska | 75 | Bronze Medal |
| 1996 | Paweł Zin | 34 | Silver Medal |
| 1996 | Marcin Sawicki | 52 | Bronze Medal |
| 1996 | Jarosław Simiński | 57 | Bronze Medal |
| 1996 | Krzysztof Roszkowski | 118 | Honourable Mention |
| 1995 | Artur Gawryszczak | 90 | Bronze Medal |
| 1995 | Jarosław Simiński | 115 | Honourable Mention |
| 1995 | Edward Goerlich | 136 | Honourable Mention |
| 1995 | Jakub Strzałkowski | 141 | Honourable Mention |
| 1994 | Czajkowski Marek | 9 | Silver Medal |
| 1993 | Mariusz Szyposzyński | 76 | Honourable Mention |
| 1993 | Jarosław Potiuk | 81 | Honourable Mention |
| 1993 | Andrzej Komisarski | 103 | Honourable Mention |
| 1992 | Pliszka Jacek | 15 | Silver Medal |
| 1992 | Banaszek Konrad | 17 | Silver Medal |
| 1992 | Czajkowski Marek | 71 | Honourable Mention |
| 1992 | Kasprzak Jacek | 92 | Honourable Mention |
| 1991 | Leszek Motyka | 22 | Silver Medal |
| 1991 | Michał Rams | 26 | Bronze Medal |
| 1991 | Olgierd Cybulski | 32 | Bronze Medal |
| 1991 | Kacper Sokołowski | 72 | Honourable Mention |
| 1990 | Cezary Śliwa | 4 | Gold Medal |
| 1990 | Krzysztof Bobrowski | 27 | Bronze Medal |
| 1990 | Michał Rams | 38 | Bronze Medal |
| 1990 | Romuald Janik | 49 | Honourable Mention |
| 1989 | Cezary Śliwa | 11 | Silver Medal |
| 1989 | Piotr Kossacki | 12 | Silver Medal |
| 1989 | Tomasz Motylewski | 14 | Silver Medal |
| 1989 | Romuald Janik | 49 | Bronze Medal |
| 1989 | Leszek Mencnarowski | 97 | Honourable Mention |
| 1988 | Cezary Śliwa | 14 | Silver Medal |
| 1988 | Piotr Kossacki | 18 | Silver Medal |
| 1988 | Grzegorz Kondrat | 62 | Honourable Mention |
| 1988 | Maciej Sawicki | 68 | Honourable Mention |
| 1987 | Piotr Kossacki | 14 | Bronze Medal |
| 1987 | Andrzej Pyka | 20 | Bronze Medal |
| 1987 | Witold Skiba | 32 | Bronze Medal |
| 1987 | Grzegorz Kondrat | 53 | Honourable Mention |
| 1987 | Marcin Konecki | 59 | Honourable Mention |
| 1986 | Jacek Wójcik | 11 | Bronze Medal |
| 1986 | Witold Skiba | 30 | Bronze Medal |
| 1986 | Przemysław Siemion | 34 | Honourable Mention |
| 1986 | Piotr Jastrzębski | 47 | Honourable Mention |
| 1986 | Robert Chrzan | 54 | Honourable Mention |
| 1985 | Mirosław Lis | ≥12 | Bronze Medal |
| 1985 | Marcin Wolter | ≥12 | Bronze Medal |
| 1985 | Przemysław Siemion | ≥29 | Honourable Mention |
| 1985 | Jacek Wójcik | ≥29 | Honourable Mention |
| 1984 | Wojciech Zabołotny | ≥15 | Bronze Medal |
| 1984 | Jarosław Bogusz | ≥31 | Honourable Mention |
| 1984 | Adam Strzeboński | ≥31 | Honourable Mention |
| 1983 | Krzysztof Mnich | 10 | Silver Medal |
| 1983 | Paweł Jałocha | 12 | Silver Medal |
| 1983 | Zbigniew Płuciennik | 24 | Bronze Medal |
| 1982 | Aleksander Filip Żarnecki | 5 | Gold Medal |
| 1982 | Dariusz Wieczorek | 7 | Gold Medal |
| 1982 | Michał Kiełkowski | 9 | Gold Medal |
| 1982 | Paweł Jałocha | 24 | Silver Medal |
| 1982 | Cezary Juszczak | 39 | Bronze Medal |
| 1981 | Wojciech Lerch | 7 | Gold Medal |
| 1981 | Wojciech Kozubski | 13 | Silver Medal |
| 1981 | Grzegorz Szamel | 24 | Silver Medal |
| 1981 | Grzegorz Majcher | 27 | Bronze Medal |
| 1981 | Paweł Trautman | 31 | Bronze Medal |
| 1979 | Andrzej Praszmo | ≥2 | Gold Medal |
| 1979 | Sławomir Drażba | ≥14 | Bronze Medal |
| 1979 | Janusz Oleniacz | ≥14 | Bronze Medal |
| 1979 | Michał Szypowski | ≥14 | Bronze Medal |
| 1979 | Michał Sośnicki | ≥27 | Honourable Mention |
| 1977 | Grzegorz Zalot | 11 | Silver Medal |
| 1977 | Krzysztof Kulpa | 18 | Silver Medal |
| 1977 | Jacek Jasiak | 25 | Bronze Medal |
| 1977 | Pawel Grądzki | 35 | Bronze Medal |
| 1977 | Jacek Jurczyk | 51 | Honourable Mention |
| 1976 | Rafał Łubis | 1 | Gold Medal |
| 1976 | Krzysztof Kulpa | ≥2 | Gold Medal |
| 1976 | Konrad Gajewski | ≥27 | Honourable Mention |
| 1976 | Wojciech Jawień | ≥27 | Honourable Mention |
| 1976 | Waldemar Rachowicz | ≥27 | Honourable Mention |
| 1975 | Antoni Łączkowski | ≥8 | Silver Medal |
| 1975 | Jerzy Bławzdziewicz | ≥17 | Bronze Medal |
| 1975 | Andrzej Łusakowski | ≥17 | Bronze Medal |
| 1975 | Dariusz Pietraszkiewicz | ≥17 | Bronze Medal |
| 1975 | Bogusław Sulikowski | ≥17 | Bronze Medal |
| 1974 | Jarosław Deminet | 1 | Gold Medal |
| 1974 | Jerzy Tarasiuk | 1 | Gold Medal |
| 1972 | Andrzej Golnik | 15 | Bronze Medal |
| 1972 | Roman Stępniewski | 16 | Bronze Medal |
| 1972 | Józef Dygas | 21 | Honourable Mention |
| 1972 | Janusz Miller | 30 | Honourable Mention |
| 1972 | Zdzislaw Otwinowski | 33 | Honourable Mention |
| 1971 | Władysław Majewski | 10 | Silver Medal |
| 1971 | Jan Oficjalski | 11 | Silver Medal |
| 1971 | Marek Ziółkowski | 14 | Bronze Medal |
| 1971 | Aleksander Rusiecki | 15 | Bronze Medal |
| 1970 | Marek Ziółkowski | 4 | Gold Medal |
| 1970 | Jan Oficjalski | 9 | Silver Medal |
| 1970 | Antoni Cieniek | 22 | Honourable Mention |
| 1970 | Arkadiusz Rydel | 25 | Honourable Mention |
| 1970 | Stanisław Chyrczakowski | 26 | Honourable Mention |
| 1970 | Władysław Majewski | 28 | Honourable Mention |
| 1969 | Przemysław Prusinkiewicz | 18 | Silver Medal |
| 1969 | Jan Oficjalski | 22 | Silver Medal |
| 1969 | Juliusz Poltz | 25 | Bronze Medal |
| 1969 | Feliks Przytycki | 36 | Honourable Mention |
| 1968 | Tomasz Kręglewski | 1 | Gold Medal |
| 1967 | Bogdan Cichocki | 3 | Gold Medal |
| 1967 | Roman Libuszewski | 7 | Gold Medal |
| 1967 | Władyslaw Skarbek | 9 | Honourable Mention |
Results may be incomplete or incorrect.
Please send the relevant information to the webmaster:
<EMAIL_ADDRESS>If you are a participant you can send a personal page URL to be attached to your name.
If you are a participant you can send a personal page URL to be attached to your name.


YOUR ACCOUNT WAS CREATED.
Enter your username and password below to play!
Username:
Password:
Is this your first time?
Perhaps the
Guide
could help you begin your adventure...


The UCSD map of science and classification system was computed using
paper-level data from about 25,000 journals from Elsevier's Scopus and and
Thomson Reuters' Web of Science (WoS) for the years 2001-2010. The UCSD map
of science assigns the 25,000 journals to 554 subdisciplines that are further
aggregated into 13 main disciplines of science. In the map, each discipline
has a distinct color (green for 'Biology', brown for 'Earth Sciences', etc.)
and a label. (Sub)disciplines that are similar closer to one another on the
map. (Sub)disciplines that are especially similar are connected by grey lines.
The details of how this map was created are published in PLOS One.
DOI: 10.1371/journal.pone.0039464
Sample statistics about the publications, authors, and co-authorship are presented. The statistics update to reflect the time period selected.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/travis.20.22failed.20to.20expand.20macro.22.html ---
I just got another of these:
44.13s$ lean --recursive --export=mathlib.txt <unknown>:1:1: error: failed to expand macro The command "lean --recursive --export=mathlib.txt" exited with 1.
on travis.
https://travis-ci.org/leanprover/mathlib/jobs/454247679
lean --make .
and lean --make .
return happily.
that's because you used sorry
, I'm pretty sure
I remember someone else hitting this recently, but can't find it.
ah, okay, you're absolutely right, my mistake!
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


PRINCIPLES
When the design is intuitive, users can focus on what to do, not on how to do it. Move across Stratio products like at home. Learn
THEME
Space Blue is the theme that makes up the Stratio products to focus the user on the content, removing unneeded distractions. Overview
COMPONENTS
Boost productivity and consistency with a modern UI toolkit capable of being adapted to each project thanks to its theming capabilities. Browse components
FRAMEWORK
An angular-based toolkit that takes the best of what Google's framework offer with dozens of components and directives ready-to-use.
From data-centric to user-centric
Stratio has a big challenge: democratize access to the most complex technologies for business people with no specific technical education. With that goal in mind, we design a system as little design as possible, focused on the essentials. This approach let us guide the users subtly across the use of our products, in a natural way, so that they can focus their mind on what they want to do, not how to do it.
How do we get it done
Angular-based UI toolkit
A set of top-notch components and directives for the most used frontend framework worldwide.
Empower your design team
Let your designers work on the graphic details while your developers work on functionality.
Customization without compilation
Make some graphic adjusts or change your whole look-and-feel with no compilation needed.
Accessible by default
All the components and directives on Egeo include WAI-ARIA and keyboard-only behavior.


Given a series ID, return observations of that series as a tibble
object.
fredr()
is an alias for fredr_series_observations()
.
fredr_series_observations( series_id = NULL, observation_start = NULL, observation_end = NULL, frequency = NULL, aggregation_method = NULL, limit = NULL, offset = NULL, sort_order = NULL, units = NULL, realtime_start = NULL, realtime_end = NULL, vintage_dates = NULL, output_type = NULL ) fredr( series_id = NULL, observation_start = NULL, observation_end = NULL, frequency = NULL, aggregation_method = NULL, limit = NULL, offset = NULL, sort_order = NULL, units = NULL, realtime_start = NULL, realtime_end = NULL, vintage_dates = NULL, output_type = NULL )
| series_id | A string ID for the FRED series. Required parameter. |
|---|---|
| observation_start | A |
| observation_end | A |
| frequency | A string representing a lower frequency to aggregate to. Defaults to no frequency aggregation. Possible values are:
|
| aggregation_method | A string representing the aggregation method
used for frequency aggregation. This parameter has no affect is
|
| limit | An integer limit on the maximum number of results to return.
Defaults to |
| offset | An integer used in conjunction with |
| sort_order | A string representing the order of the resulting series.
Possible values are: |
| units | A string indicating the data value transformation.
Defaults to
|
| realtime_start | A |
| realtime_end | A |
| vintage_dates | A vector of |
| output_type | An integer indicating the output type. Not used unless
|
A tibble
object with observation dates and values.
fredr_series_search_text()
,
fredr_series_search_id()
, fredr_series_search_tags()
,
fredr_series_search_related_tags()
, fredr_series()
, fredr_series_categories()
,
fredr_series_release()
, fredr_series_tags()
, fredr_series_updates()
,
fredr_series_vintagedates()
.
# \donttest{ # Observations for "UNRATE" series between 1980 and 2000. Units are in terms # of change from pervious observation. fredr( series_id = "UNRATE", observation_start = as.Date("1980-01-01"), observation_end = as.Date("2000-01-01"), unit = "chg" )#> # A tibble: 241 x 3 #> date series_id value #> <date> <chr> <dbl> #> 1 1980-01-01 UNRATE 0.3 #> 2 1980-02-01 UNRATE 0 #> 3 1980-03-01 UNRATE 0 #> 4 1980-04-01 UNRATE 0.6 #> 5 1980-05-01 UNRATE 0.6 #> 6 1980-06-01 UNRATE 0.1 #> 7 1980-07-01 UNRATE 0.2 #> 8 1980-08-01 UNRATE -0.1 #> 9 1980-09-01 UNRATE -0.2 #> 10 1980-10-01 UNRATE 0 #> # … with 231 more rows# All observations for "OILPRICE" series. The data is first aggregated by # quarter by taking the average of all observations in the quarter then # transformed by taking the natural logarithm. fredr( series_id = "OILPRICE", frequency = "q", aggregation_method = "avg", unit = "log" )#> # A tibble: 271 x 3 #> date series_id value #> <date> <chr> <dbl> #> 1 1946-01-01 OILPRICE 0.157 #> 2 1946-04-01 OILPRICE 0.239 #> 3 1946-07-01 OILPRICE 0.362 #> 4 1946-10-01 OILPRICE 0.440 #> 5 1947-01-01 OILPRICE 0.482 #> 6 1947-04-01 OILPRICE 0.626 #> 7 1947-07-01 OILPRICE 0.626 #> 8 1947-10-01 OILPRICE 0.695 #> 9 1948-01-01 OILPRICE 0.944 #> 10 1948-04-01 OILPRICE 0.944 #> # … with 261 more rows# To retrieve values for multiple series, use purrr's map_dfr() function. if (requireNamespace("purrr", quietly = TRUE)) { library(purrr) purrr::map_dfr(c("UNRATE", "OILPRICE"), fredr) # Using purrr::pmap_dfr() allows you to use varying optional parameters params <- list( series_id = c("UNRATE", "OILPRICE"), frequency = c("m", "q") ) purrr::pmap_dfr( .l = params, .f = ~ fredr(series_id = .x, frequency = .y) ) }#> Warning: package ‘purrr’ was built under R version 3.6.2#> # A tibble: 1,139 x 3 #> date series_id value #> <date> <chr> <dbl> #> 1 1948-01-01 UNRATE 3.4 #> 2 1948-02-01 UNRATE 3.8 #> 3 1948-03-01 UNRATE 4 #> 4 1948-04-01 UNRATE 3.9 #> 5 1948-05-01 UNRATE 3.5 #> 6 1948-06-01 UNRATE 3.6 #> 7 1948-07-01 UNRATE 3.6 #> 8 1948-08-01 UNRATE 3.9 #> 9 1948-09-01 UNRATE 3.8 #> 10 1948-10-01 UNRATE 3.7 #> # … with 1,129 more rows# }


About
I’m Christian Bay. I live in Norway. Jack of all trades at heart. For the past 6 years I’ve been working as a consultant.
Talk to me about these things
- Team Leadership
IT, Design and Business - Product Design
Previous: social network design - Interaction Design
iOS and experience design - DevOps
Linux in the cloud, databases, API-servers - Backend programming
Ruby on Rails, Node.js, real-time servers - Network administration
Cisco and Aruba
Contact me @chrisvalleybay on Twitter, or find me on LinkedIn.


Genesis 40:4
And the captain of the guard charged Joseph with them, and he served them: and they continued a season in ward.


Class Journal
A digital journal.
Create New Entry
Share what's on your mind.
Title
Author
Entry
Submit
Journal Entries


munch
`Prev `__
M
`Next `__
--------------
**munch**: vt.
[often confused with `*mung* `__, q.v.] To transform
information in a serial fashion, often requiring large amounts of
computation. To trace down a data structure. Related to
`*crunch* <../C/crunch.html>`__ and nearly synonymous with
`*grovel* <../G/grovel.html>`__, but connotes less pain.
--------------
+---------------------------+----------------------------+-----------------------------+
| `Prev `__ | `Up <../M.html>`__ | `Next `__ |
+---------------------------+----------------------------+-----------------------------+
| mumble | `Home <../index.html>`__ | munching |
+---------------------------+----------------------------+-----------------------------+


send message with Face type --- Actor1 Actor2 Actor3 Evil Monster Nature People1 People2 People3 People4 ： 0 1 2 3 4 5 6 7 8
event swtitch [10] On Off
event variable [11] =10 +1 -1 *2 /2 %10
static event swtitch [10] On Off
static event variable [11] 0 333
static event reset Reset


This field chooses the File System which will be used for the Disc. If you have any files that are larger than 4 GB, then you should use a UDF file system.
Items marked with "/ISO 9960" employ a backup format using the ISO 9960 standard when the selected format can't be read.


See: Description
| Interface | Description |
|---|---|
| ExpressionEvalMap.EvaluationCallback |
Implementations of this interface can be provided to build 'on demand
ExpressionEvalMap.get(Object) logic'
for ExpressionEvalMap . |
| ExpressionEvalMap.ExpressionEvalMapComponentsBuilder | |
| ExpressionEvalMap.ExpressionEvalMapFinalBuilder | |
| ExpressionSource |
Strategy interface for retrieving Expressions.
|
| Class | Description |
|---|---|
| ControlBusMethodFilter |
SpEL
MethodFilter to restrict method invocations to:
Lifecycle components
get , set and shutdown methods of CustomizableThreadCreator
methods with ManagedAttribute and ManagedOperation annotations
This class isn't designed for target applications and typically is used from ExpressionControlBusFactoryBean . |
| DynamicExpression |
An implementation of
Expression that delegates to an ExpressionSource
for resolving the actual Expression instance per-invocation at runtime. |
| ExpressionEvalMap |
An immutable
AbstractMap implementation that wraps a Map<String, Object> ,
where values must be instances of String or Expression ,
and evaluates an expression for the provided key from the underlying
original Map. |
| ExpressionEvalMap.ComponentsEvaluationCallback |
The
ExpressionEvalMap.EvaluationCallback implementation which evaluates an expression using
the provided context , root and returnType variables. |
| ExpressionEvalMap.ExpressionEvalMapBuilder |
The builder class to instantiate
ExpressionEvalMap . |
| ExpressionUtils |
Utility class with static methods for helping with evaluation of SpEL expressions.
|
| FunctionExpression<S> | |
| ReloadableResourceBundleExpressionSource |
ExpressionSource implementation that accesses resource bundles using specified basenames. |
| SpelPropertyAccessorRegistrar |
Utility class that keeps track of a Set of SpEL
PropertyAccessor s
in order to register them with the "integrationEvaluationContext" upon initialization. |
| SupplierExpression<T> | |
| ValueExpression<V> |
A very simple hardcoded implementation of the
Expression interface that represents an
immutable value. |


SpiceJet to set up airline joint venture in Ras Al Khaimah
Firm also signs MoU with Bahrain’s flag carrier Gulf Air
by Special CorrespondentLow-cost carrier SpiceJet will set up a joint venture airline in Ras Al Khaimah (RAK) along with a local partner, chairman and managing director Ajay Singh said on Wednesday.
SpiceJet will first start flights to RAK early next year and then launch the new airline.
The name of the airline is yet to be finalised. The announcement at a press conference here followed a memorandum of understanding (MoU) with Ras Al Khaimah International Airport last month to develop and promote tourism there and also develop the airport as an aviation hub.
“From Ras Al Khaimah, there are onward (flight) possibilities to eastern Europe,” Mr. Singh said.
SpiceJet also signed an MoU with Bahrain’s flag carrier Gulf Air on Wednesday to explore greater co-operation between the two airlines, including interline and code-share agreement, co-ordinating cargo services, engineering services and pilot training.
In April, SpiceJet signed an initial pact for code share with the Dubai-based Emirates airline.
Mr. Singh said that tying up with so many international airlines did not mean that SpiceJet would not fly directly to both Europe and the U.S. “We need to give our passengers a choice. They should be able to fly directly using SpiceJet or our partner airlines to different parts of Europe and Africa and even the U.S.,” he said.
On possible interest in disinvestment of Air India, Mr. Singh maintained that the national carrier was too big an entity for a small airline such as SpiceJet.
“While we keep looking at what the government has to say, it is still a very tough call for us as far as Air India is concerned,” Mr. Singh said.


HOME
Explore
Notifications
Messages
Bookmarks
Lists
Profile
More
Tweet
Northwest Agency
16 Tweets
Edit Profile
Caner Uçar
@canerucar34
Design and development agency that promotes innovation through elevated websites, applications, and eCommerce solutions
Translate bio
Joined November 2019
29
Following
6
Followers
Tweets
Tweets & replies
Media
Likes
Caner Uçar
@canerucar34 . Feb 24
Proud to be selected for the
#siteoftheday
award by
@designnominees
:)
Northwest Creative Digital Agency
Design and development agency that promotes innovation in companies through elevated websites, applications, and eCommerce...
github.com/canerucar
1
Caner Uçar
@canerucar34 . Feb 24
Proud to be selected for the
#siteoftheday
award by
@designnominees
:)
Northwest Creative Digital Agency
Design and development agency that promotes innovation in companies through elevated websites, applications, and eCommerce...
github.com/canerucar
1
You might like
InVision
@InVisionApp
Promoted
Follow
Figma
@figmadesign
Follow
Adobe Illustrator
@Illustrator
Follow
Show more
Trends for you
Terms
Privacy policy
Cookies
Ads info
More
© 2020 Twitter, Inc.


Botswana Skies
Take a deep dive in the Mohembo zones of the tribe of Babirwa.Indulge your eyes in the beautiful cinimatic aerial view of the plains and the wildlife in this area.
Kazungula Bridge
Another prosperous stride for Botswana as they set up to open the Kazungula Bridge strenghting business and their relations with Zambia.
Dikgatlhong Dam
The Dikgatlhong Dam can impound 400 million cubic metres of water, surpassing the Gabarone Dam which can impound 141 million cubic metres at full capacity.
Tour The City
Take a tour around Gaborone. Be captivated by the essentric innovation and infrastructures that bear witness of the amazing capital city of Botswana.
Friday Creatives
Bringing together the biggest artist around Botswana by being given a moment of a sportlight.
Chobe
Chobe National Park is in northern Botswana near the vast, inland Okavango Delta. It's known for its large herds of elephants and Cape buffalo, which converge along the Chobe Riverfront in the dry months.
Okavango
The Okavango Delta is a vast inland river delta in northern Botswana. It's known for its sprawling grassy plains, which flood seasonally, becoming a lush animal habitat. The Moremi Game Reserve occupies the east and central areas of the region.
Gabs City
Stock on the CBD, the centre of business activities around Gaborone city. Fancied with its lavish hotels and office spaces.