url stringlengths 11 2.25k | text stringlengths 88 50k | ts timestamp[s]date 2026-01-13 08:47:33 2026-01-13 09:30:40 |
|---|---|---|
https://ben.balter.com/2014/10/08/open-source-licensing-for-government-attorneys/#fn:1 | Everything a government attorney needs to know about open source software licensing | Ben Balter Ben Balter Posts About Contact Technology leadership, collaboration, and open source Everything a government attorney needs to know about open source software licensing TL;DR : A high-level overview to highlight common legal issues government agencies may face when participating in the open source community 7 minute read Government agencies can and should participate in the open source community. Open source software is more than simply software for which the underlying human-readable code had been made available to the public . Along with the code comes an intellectual property license grant , a legal framework which government agencies are embracing with increasing frequency. Here are some common legal issues to look out for: Note: this is an early draft. If you notice anything wonky, please help improve it . Open source licenses generally Open source licenses are a straight-forward intellectual property license with one unique feature: they’re standardized . The software industry has adopted approximately fifteen mainstream and three primary licenses . While the wording and specific terms vary, most licenses have the following common clauses: An explicit grant to use, copy, modify, redistribute, sublicense, or sell the software. Disclaimer of implied warranties such as the warranties of merchantability or fitness for a particular purpose and other limitations on liability. A requirement that attribution to the author, the license name, or both be included in any redistributed software. Instructions on how to properly mark the code itself for distribution under the license. Some licenses may also include: The requirement that any submissions contributed to the project by the public be licensed under the same terms as the project (a copyright grant from contributors to downstream consumers). A patent grant from contributors to downstream consumers. The requirement that any changes to the original software be described when distributed. Changing requirements depending on whether the software is distributed in its original, human-readable form, or its compiled (binary), machine-readable form. Why standardized licenses In order for open source to work, downstream users must be able to use the code free of legal restriction or ambiguity, and must be able to do so without the need to retain costly legal counsel. Most developers and software firms are familiar with the most common open source licenses and terms, and thus can use such software freely. As such use of a standardized license serves as a proxy for those without legal training to know precisely what they can and can’t do with the software. Unless absolutely required, avoid custom, modified, or non-standard terms, which will serve as a barrier to downstream use of the agency code. The open source community is just that, a community, and one with a strong tradition. Open source software is published so that others may use it, and doing so under a legal framework alien to the community, is the easiest way to make sure it’s not used. Optimize for the code’s reuse, not its publication. Common licenses Within the software industry, the canonical source for most main licenses, along with a brief overview of their terms can be found at choosealicense.com . The three most popular licenses are the MIT, Apache, and GPL licenses: MIT - The most common license is the MIT license, which is a simple grant, copyright notice requirement, and disclaimer of warranty. Apache - The Apache license is functionally equivalent to the MIT license, but is more heavily lawyered and includes an explicit patent grant GPL The GPL is the most commonly used copyleft license, with v2, v3, and “v2 or later” variants. Copyleft Some licenses, most notably the GPL family of licenses, are copyleft licenses, meaning the license uses copyright law to ensure the code remains open source. The WordPress and Drupal content management systems are both licensed under the GPL license. Any work derived from copyleft-licensed code, if distributed, must be distributed under the same (or compatible terms). There are two threshold issues there: Derivative work - There are nuances within the particular license, but for most cases, if the new code depends on the original, copyleft-licensed code, such as a WordPress theme or a Drupal module, it is considered a derivative work subject to the copyleft requirements. Distribution - The copyleft requirements are not triggered unless the derivative work is distributed. Agencies are free to make derivative works and maintain that work as a closed-source project. When the underlying source code is published to the public, distribution is clear. Less clear is distribution to other business units within the same agency, or with other agency. Unless licensed under the AGPL license, using the code as part of a hosted service (for example, a site) does not trigger that requirement. When faced with copyleft restrictions, an agency should release code under the least-restrictive means available under the circumstances, which is often the copyleft license itself. While the government’s particular code may not be subject to copyright (see below), the project as a whole is encumbered by upstream license restrictions, and thus the agency does not have the right to release the code under less-restrictive terms. Consuming open source software There is nothing to legally bar agencies from using open source software on their servers or on their employees’s computers. Three common concerns: For procurement purposes, open source software is treated as commercial, off the shelf software (COTS). The work of contributors does not trigger gift authority or Anti-Deficiency Act obligations, unless the work is performed specifically for the agency. Under a traditional open source workflow, project contributors publish their code publicly and license their work to the world. See accepting contributions from the public below. The software must still go through the agency’s traditional approval process, such as security or privacy reviews, just as the agency would do before operationalizing a piece of commercial software Publishing open source software The agency can and under the digital strategy and open data policy is encouraged to publish the agency’s purpose-build software. This can arise under two arrangements: Government-created code Code created by government employees on government time is consider a government work, and thus is not subject to domestic copyright protection under 17 USC § 105. The internet, and thus open source, however, is not bound by geographic lines. It is not uncommon for government created code to be used by foreign citizens. As such, the agency should make it explicit under what terms foreign citizens can use the code. Best practices suggest that agencies release their code under the Creative Commons Zero license , a public domain dedication and copyright disclaimer, to ensure all downstream users receive the same rights in the software. Where not possible, (for example, a copyleft derivative work), prefer the least-restrictive terms possible. Contractor created code Under the FAR, by default, the government receives unlimited rights in any software developed under contract, and thus is free to publish the code as they see fit. Due to market forces and contracting tradition, many typical government IT contracts, however, contract away this right in favor of simple government purpose rights, with the contractor retaining the original copyright. If that’s the case, the agency has several options: Ask - Government contractors are typically contractually prohibited from talking about their work. As a result, most, if not all, would prefer their work be open sourced. For typical web or mobile development contracts, there is often little proprietary IP in the purpose-built code, and thus contractors have an incentive to grant the agency additional rights on request. Contractor licenses to agency - Rather than granting copyright or broad redistribution rights, the contractor can license the code to the agency under an open source license of their choosing. Once in the agency’s hands, the agency is free to redistribute the software under those same terms as they see fit. This may require a mod on the contract. Contractor publishes - The contractor, at the agency’s request, can independently publish the code under an open source license. While the agency will not get “credit” for publishing the software, the obligation to maintain the software will shift to the contractor. Once open source, the agency can consume that software as they would any other open source software. Contributing to open source software A central tenet of open source software is contributing downstream improvements to the upstream open source project. Agency-created code should be no exception. While there may be a business decision to prohibit government employees from contributing to community projects on government time, nothing should prohibit them legally. Whether a contribution to the community-maintained project directly (for example, contributing to WordPress or Drupal), or a derivative work (a plugin, theme, or module), agency contributions should be licensed under the terms of the parent project, using the project’s standard workflow and distribution channels. One thing to watch out for are contributor license agreements (CLAss) which may proscribe an explicit copyright grant (as opposed to a license), or the granting of additional rights beyond the copyright license, which may conflict with the contributor’s obligations as a government employee. Accepting contributions from the public Once published, there’s a high probability a member of the public will submit a proposed improvement to the agency project. There are two potential issues: Agency request - As is common practice in the open source world, the agency may maintain a project roadmap and backlog of known bugs or potential enhancements, but should not directly instruct potential contributors to address a certain issue. License - The proposed change (often in the form of a “pull request”) is licensed under the same terms as the project itself (for example, MIT, GPL, or CC0) and thus is independent open source software. 1 The agency is free to incorporate that code into the government project, just as it is free to use any other open source code. Open source community engagement platforms The open source community uses several platforms for communicating project plans and sharing source code. These platforms may be project specific, such as wordpress.org or drupal.org or can be general open source platforms such as GitHub or RubyGems . When used for public engagement, the agency’s use of such platforms is governed by OMB M-10–23. Agencies should review any terms of service (in many cases, there are custom, fed-friendly terms already negotiated), and ensure the agency itself establishes a formal presence on the platform. For platforms like GitHub, per the terms of service, government employees should add their government email address to their existing account, if they have one, or should create a new personal (non-agency-specific account). The service automatically disambiguates between personal and professional contexts to make ownership and agency clear. See also If you found this post helpful, there are two other resources you may be interested in reading: A more expansive post on open source licensing geared towards open source project maintainers An overview of the best way to handle copyright notices for open source projects in for example, Licenses or the readme, and Go forth and open source This is a high-level overview intended to highlight common legal issues agencies may face when participating in the open source community, and should not be consider to be legal advice or specific to a particular matter. Although this is my personal blog, agencies should feel free to contact [email protected] or post in the github.com/government peer group with any open-source related questions. The full mechanics of a pull request are beyond the scope of this post, but in short, a member of the public will fork the agency project, or make a copy in their personal account. In many cases, that is all downstream users do. The contributor may then modify the software, in their own personal copy, under the right to modify as granted in the open source license. Again, many downstream users will stop at this point as well, using the modified software for their own purposes. At both steps, the software is freely available to anyone in the world from the user’s account and is licensed under the project terms. The upstream project is free to incorporate the downstream users changes as they wish. A contributor may also choose to contribute that code back to the original project, by explicitly asking the upstream project to incorporate their changes. ↩ Originally published October 8, 2014 | View revision history If you enjoyed this post, you might also enjoy: Everything an open source maintainer might need to know about open source licensing Why you shouldn't write your own open source license Government's Release of Federally Funded Source Code: Public Domain or Open Source? Yes. Why isn't all government software open source? Open source, not just software anymore Eight reasons why government contractors should embrace open source software What's Missing from CFPB's Awesome New Source Code Policy A White House open source policy written by a geek Disclosed source is not the same as open source Why open source Twelve tips for growing communities around your open source project Ben Balter is the Director of Hubber Enablement within the Office of the COO at GitHub , the world’s largest software development platform, ensuring all Hubbers can do their best (remote) work. Previously, he served as the Director of Technical Business Operations, and as Chief of Staff for Security, he managed the office of the Chief Security Officer, improving overall business effectiveness of the Security organization through portfolio management, strategy, planning, culture, and values. As a Staff Technical Program manager for Enterprise and Compliance, Ben managed GitHub’s on-premises and SaaS enterprise offerings, and as the Senior Product Manager overseeing the platform’s Trust and Safety efforts, Ben shipped more than 500 features in support of community management, privacy, compliance, content moderation, product security, platform health, and open source workflows to ensure the GitHub community and platform remained safe, secure, and welcoming for all software developers. Before joining GitHub’s Product team, Ben served as GitHub’s Government Evangelist, leading the efforts to encourage more than 2,000 government organizations across 75 countries to adopt open source philosophies for code, data, and policy development. More about the author → This page is open source. Please help improve it . Edit Other recommended reading Fine Print | 2026-01-13T09:29:14 |
https://cvsweb.openbsd.org/cgi-bin/cvsweb/src/sys/conf/newvers.sh#rev1.1 | CVS log for src/sys/conf/newvers.sh CVS log for src/sys/conf/newvers.sh Up to [local] / src / sys / conf Request diff between arbitrary revisions Default branch: MAIN Revision 1.212.2.1 / ( download ) - annotate - [select for diffs] , Thu Oct 23 21:23:34 2025 UTC (2 months, 2 weeks ago) by bluhm Branch: OPENBSD_7_8 Changes since 1.212: +3 -3 lines Diff to previous 1.212 ( colored ) next main 1.213 ( colored ) 7.8-stable Revision 1.213 / ( download ) - annotate - [select for diffs] , Wed Oct 8 21:55:19 2025 UTC (3 months ago) by jsg Branch: MAIN CVS Tags: HEAD Changes since 1.212: +3 -3 lines Diff to previous 1.212 ( colored ) 7.8-current ok deraadt@ Revision 1.212 / ( download ) - annotate - [select for diffs] , Tue Sep 30 14:49:51 2025 UTC (3 months, 1 week ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_7_8_BASE Branch point for: OPENBSD_7_8 Changes since 1.211: +3 -3 lines Diff to previous 1.211 ( colored ) move out of -beta Revision 1.211 / ( download ) - annotate - [select for diffs] , Wed Sep 10 16:00:04 2025 UTC (4 months ago) by deraadt Branch: MAIN Changes since 1.210: +4 -4 lines Diff to previous 1.210 ( colored ) crank to 7.8-beta Revision 1.209.4.1 / ( download ) - annotate - [select for diffs] , Mon Apr 28 13:06:32 2025 UTC (8 months, 2 weeks ago) by bluhm Branch: OPENBSD_7_7 Changes since 1.209: +3 -3 lines Diff to previous 1.209 ( colored ) next main 1.210 ( colored ) 7.7-stable Revision 1.210 / ( download ) - annotate - [select for diffs] , Sat Apr 12 02:13:14 2025 UTC (9 months ago) by deraadt Branch: MAIN Changes since 1.209: +3 -3 lines Diff to previous 1.209 ( colored ) now working on 7.7-current Revision 1.209 / ( download ) - annotate - [select for diffs] , Sun Mar 30 20:43:36 2025 UTC (9 months, 2 weeks ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_7_7_BASE Branch point for: OPENBSD_7_7 Changes since 1.208: +3 -3 lines Diff to previous 1.208 ( colored ) head out of -beta to 7.7 Revision 1.208 / ( download ) - annotate - [select for diffs] , Sat Mar 1 19:44:07 2025 UTC (10 months, 1 week ago) by deraadt Branch: MAIN Changes since 1.207: +4 -4 lines Diff to previous 1.207 ( colored ) move to 7.7-beta Revision 1.205.2.1 / ( download ) - annotate - [select for diffs] , Tue Oct 8 11:42:49 2024 UTC (15 months ago) by bluhm Branch: OPENBSD_7_6 Changes since 1.205: +3 -3 lines Diff to previous 1.205 ( colored ) next main 1.206 ( colored ) 7.6-stable Revision 1.207 / ( download ) - annotate - [select for diffs] , Mon Sep 23 21:05:28 2024 UTC (15 months, 2 weeks ago) by deraadt Branch: MAIN Changes since 1.206: +2 -2 lines Diff to previous 1.206 ( colored ) now hacking on 7.6-current (corrected) Revision 1.206 / ( download ) - annotate - [select for diffs] , Mon Sep 23 20:50:47 2024 UTC (15 months, 2 weeks ago) by deraadt Branch: MAIN Changes since 1.205: +2 -2 lines Diff to previous 1.205 ( colored ) now hacking on 7.6-current Revision 1.205 / ( download ) - annotate - [select for diffs] , Tue Sep 17 13:39:17 2024 UTC (15 months, 3 weeks ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_7_6_BASE Branch point for: OPENBSD_7_6 Changes since 1.204: +3 -3 lines Diff to previous 1.204 ( colored ) head into release Revision 1.204 / ( download ) - annotate - [select for diffs] , Wed Aug 7 15:59:24 2024 UTC (17 months ago) by deraadt Branch: MAIN Changes since 1.203: +4 -4 lines Diff to previous 1.203 ( colored ) crank to 7.6-beta, release date is vague Revision 1.202.2.1 / ( download ) - annotate - [select for diffs] , Wed Apr 3 20:36:37 2024 UTC (21 months, 1 week ago) by bluhm Branch: OPENBSD_7_5 Changes since 1.202: +3 -3 lines Diff to previous 1.202 ( colored ) next main 1.203 ( colored ) 7.5-stable Revision 1.203 / ( download ) - annotate - [select for diffs] , Tue Mar 12 01:20:30 2024 UTC (22 months ago) by deraadt Branch: MAIN Changes since 1.202: +3 -3 lines Diff to previous 1.202 ( colored ) moving on to 7.5-current Revision 1.202 / ( download ) - annotate - [select for diffs] , Thu Feb 29 17:05:10 2024 UTC (22 months, 2 weeks ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_7_5_BASE Branch point for: OPENBSD_7_5 Changes since 1.201: +3 -3 lines Diff to previous 1.201 ( colored ) move from 7.5-beta to 7.5 Revision 1.201 / ( download ) - annotate - [select for diffs] , Sat Feb 17 16:13:24 2024 UTC (22 months, 3 weeks ago) by deraadt Branch: MAIN Changes since 1.200: +4 -4 lines Diff to previous 1.200 ( colored ) move to 7.5-beta Revision 1.200 / ( download ) - annotate - [select for diffs] , Tue Jan 2 16:40:03 2024 UTC (2 years ago) by bluhm Branch: MAIN Changes since 1.199: +2 -3 lines Diff to previous 1.199 ( colored ) Revert chunk that I have commited by accident. Revision 1.199 / ( download ) - annotate - [select for diffs] , Tue Jan 2 16:32:47 2024 UTC (2 years ago) by bluhm Branch: MAIN Changes since 1.198: +3 -2 lines Diff to previous 1.198 ( colored ) Prevent simultaneous dt(4) open. Syskaller has hit the assertion "dtlookup(unit) == NULL" by opening dt(4) device in two parallel threads. Convert kassert into if condition. Move check that device is not used after sleep points in malloc. The list dtdev_list is protected by kernel lock which is released during sleep. Reported-by: syzbot+6d66c21f796c817948f0@syzkaller.appspotmail.com OK miod@ Revision 1.197.2.1 / ( download ) - annotate - [select for diffs] , Fri Oct 20 19:05:11 2023 UTC (2 years, 2 months ago) by bluhm Branch: OPENBSD_7_4 Changes since 1.197: +3 -3 lines Diff to previous 1.197 ( colored ) next main 1.198 ( colored ) 7.4-stable Revision 1.198 / ( download ) - annotate - [select for diffs] , Wed Oct 4 15:40:13 2023 UTC (2 years, 3 months ago) by bluhm Branch: MAIN Changes since 1.197: +3 -3 lines Diff to previous 1.197 ( colored ) base is unlocked, move to 7.4-current OK deraadt@ Revision 1.197 / ( download ) - annotate - [select for diffs] , Tue Sep 26 13:27:32 2023 UTC (2 years, 3 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_7_4_BASE Branch point for: OPENBSD_7_4 Changes since 1.196: +3 -3 lines Diff to previous 1.196 ( colored ) we are heading out of -beta Revision 1.196 / ( download ) - annotate - [select for diffs] , Mon Sep 18 13:16:13 2023 UTC (2 years, 3 months ago) by deraadt Branch: MAIN Changes since 1.195: +4 -4 lines Diff to previous 1.195 ( colored ) crank to 7.4-beta Revision 1.194.4.1 / ( download ) - annotate - [select for diffs] , Tue Apr 11 15:45:40 2023 UTC (2 years, 9 months ago) by bluhm Branch: OPENBSD_7_3 Changes since 1.194: +3 -3 lines Diff to previous 1.194 ( colored ) next main 1.195 ( colored ) 7.3-stable Revision 1.195 / ( download ) - annotate - [select for diffs] , Sat Mar 25 05:49:50 2023 UTC (2 years, 9 months ago) by deraadt Branch: MAIN Changes since 1.194: +3 -3 lines Diff to previous 1.194 ( colored ) we are now hacking on 7.3-current Revision 1.194 / ( download ) - annotate - [select for diffs] , Fri Mar 17 22:52:22 2023 UTC (2 years, 9 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_7_3_BASE Branch point for: OPENBSD_7_3 Changes since 1.193: +3 -3 lines Diff to previous 1.193 ( colored ) remove -beta tag Revision 1.193 / ( download ) - annotate - [select for diffs] , Sat Mar 4 14:49:37 2023 UTC (2 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.192: +4 -4 lines Diff to previous 1.192 ( colored ) move to 7.3-beta Revision 1.191.2.1 / ( download ) - annotate - [select for diffs] , Thu Oct 20 09:44:17 2022 UTC (3 years, 2 months ago) by bluhm Branch: OPENBSD_7_2 Changes since 1.191: +3 -3 lines Diff to previous 1.191 ( colored ) next main 1.192 ( colored ) 7.2-stable Revision 1.192 / ( download ) - annotate - [select for diffs] , Tue Sep 27 02:39:24 2022 UTC (3 years, 3 months ago) by deraadt Branch: MAIN Changes since 1.191: +3 -3 lines Diff to previous 1.191 ( colored ) we are now working on 7.2-current Revision 1.191 / ( download ) - annotate - [select for diffs] , Sun Sep 11 14:27:09 2022 UTC (3 years, 4 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_7_2_BASE Branch point for: OPENBSD_7_2 Changes since 1.190: +3 -3 lines Diff to previous 1.190 ( colored ) drop the -beta Revision 1.190 / ( download ) - annotate - [select for diffs] , Wed Jul 20 15:12:38 2022 UTC (3 years, 5 months ago) by deraadt Branch: MAIN Changes since 1.189: +4 -4 lines Diff to previous 1.189 ( colored ) move to 7.2-beta. this gets done very early, to avoid finding out version number issues close to release Revision 1.188.4.1 / ( download ) - annotate - [select for diffs] , Thu Apr 21 21:44:09 2022 UTC (3 years, 8 months ago) by bluhm Branch: OPENBSD_7_1 Changes since 1.188: +3 -3 lines Diff to previous 1.188 ( colored ) next main 1.189 ( colored ) 7.1-stable Revision 1.189 / ( download ) - annotate - [select for diffs] , Tue Apr 5 16:25:30 2022 UTC (3 years, 9 months ago) by deraadt Branch: MAIN Changes since 1.188: +3 -3 lines Diff to previous 1.188 ( colored ) back to working on 7.1-current Revision 1.188 / ( download ) - annotate - [select for diffs] , Tue Mar 29 03:11:18 2022 UTC (3 years, 9 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_7_1_BASE Branch point for: OPENBSD_7_1 Changes since 1.187: +3 -3 lines Diff to previous 1.187 ( colored ) close enough to release, we drop -beta Revision 1.187 / ( download ) - annotate - [select for diffs] , Sun Feb 20 20:54:29 2022 UTC (3 years, 10 months ago) by sthen Branch: MAIN Changes since 1.186: +3 -3 lines Diff to previous 1.186 ( colored ) we should be 7.1-beta not 7.1-current Revision 1.186 / ( download ) - annotate - [select for diffs] , Sun Feb 20 17:11:05 2022 UTC (3 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.185: +3 -3 lines Diff to previous 1.185 ( colored ) move to 7.1-beta Revision 1.184.2.1 / ( download ) - annotate - [select for diffs] , Fri Oct 22 16:05:34 2021 UTC (4 years, 2 months ago) by bluhm Branch: OPENBSD_7_0 Changes since 1.184: +3 -3 lines Diff to previous 1.184 ( colored ) next main 1.185 ( colored ) 7.0-stable Revision 1.185 / ( download ) - annotate - [select for diffs] , Wed Sep 22 18:21:35 2021 UTC (4 years, 3 months ago) by deraadt Branch: MAIN Changes since 1.184: +3 -3 lines Diff to previous 1.184 ( colored ) we are now working on 7.0-current Revision 1.184 / ( download ) - annotate - [select for diffs] , Mon Sep 13 04:02:15 2021 UTC (4 years, 4 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_7_0_BASE Branch point for: OPENBSD_7_0 Changes since 1.183: +3 -3 lines Diff to previous 1.183 ( colored ) take us out of beta Revision 1.183 / ( download ) - annotate - [select for diffs] , Tue Aug 17 15:03:55 2021 UTC (4 years, 4 months ago) by deraadt Branch: MAIN Changes since 1.182: +4 -4 lines Diff to previous 1.182 ( colored ) 7.0-beta Revision 1.182 / ( download ) - annotate - [select for diffs] , Sun May 2 22:10:13 2021 UTC (4 years, 8 months ago) by bluhm Branch: MAIN Changes since 1.181: +2 -1 lines Diff to previous 1.181 ( colored ) Put -stable template into #if 0 section of current newvers.sh. OK deraadt@ Revision 1.180.2.1 / ( download ) - annotate - [select for diffs] , Sun May 2 12:56:59 2021 UTC (4 years, 8 months ago) by bluhm Branch: OPENBSD_6_9 Changes since 1.180: +3 -2 lines Diff to previous 1.180 ( colored ) next main 1.181 ( colored ) 6.9-stable Revision 1.181 / ( download ) - annotate - [select for diffs] , Sun Apr 18 23:40:52 2021 UTC (4 years, 8 months ago) by deraadt Branch: MAIN Changes since 1.180: +3 -3 lines Diff to previous 1.180 ( colored ) post 6.9 development continues... Revision 1.180 / ( download ) - annotate - [select for diffs] , Sun Apr 4 23:03:07 2021 UTC (4 years, 9 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_6_9_BASE Branch point for: OPENBSD_6_9 Changes since 1.179: +3 -3 lines Diff to previous 1.179 ( colored ) leave -beta Revision 1.179 / ( download ) - annotate - [select for diffs] , Sat Feb 6 21:26:19 2021 UTC (4 years, 11 months ago) by deraadt Branch: MAIN Changes since 1.178: +4 -4 lines Diff to previous 1.178 ( colored ) 6.9-beta Revision 1.177.4.1 / ( download ) - annotate - [select for diffs] , Mon Oct 26 21:06:03 2020 UTC (5 years, 2 months ago) by bluhm Branch: OPENBSD_6_8 Changes since 1.177: +2 -2 lines Diff to previous 1.177 ( colored ) next main 1.178 ( colored ) 6.8-stable Revision 1.178 / ( download ) - annotate - [select for diffs] , Wed Sep 30 14:46:02 2020 UTC (5 years, 3 months ago) by jsg Branch: MAIN Changes since 1.177: +3 -3 lines Diff to previous 1.177 ( colored ) 6.8-current ok deraadt@ Revision 1.177 / ( download ) - annotate - [select for diffs] , Fri Sep 25 05:12:39 2020 UTC (5 years, 3 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_6_8_BASE Branch point for: OPENBSD_6_8 Changes since 1.176: +3 -3 lines Diff to previous 1.176 ( colored ) take us out of -beta Revision 1.176 / ( download ) - annotate - [select for diffs] , Mon Aug 31 16:08:28 2020 UTC (5 years, 4 months ago) by deraadt Branch: MAIN Changes since 1.175: +4 -4 lines Diff to previous 1.175 ( colored ) crank to 6.8-beta Revision 1.174.4.1 / ( download ) - annotate - [select for diffs] , Tue May 19 17:32:04 2020 UTC (5 years, 7 months ago) by bluhm Branch: OPENBSD_6_7 Changes since 1.174: +2 -2 lines Diff to previous 1.174 ( colored ) next main 1.175 ( colored ) 6.7-stable Revision 1.175 / ( download ) - annotate - [select for diffs] , Thu May 7 18:46:35 2020 UTC (5 years, 8 months ago) by deraadt Branch: MAIN Changes since 1.174: +3 -3 lines Diff to previous 1.174 ( colored ) post-6.7 development continues Revision 1.174 / ( download ) - annotate - [select for diffs] , Mon May 4 15:00:35 2020 UTC (5 years, 8 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_6_7_BASE Branch point for: OPENBSD_6_7 Changes since 1.173: +3 -3 lines Diff to previous 1.173 ( colored ) leave -beta. Revision 1.173 / ( download ) - annotate - [select for diffs] , Sun Apr 5 06:34:20 2020 UTC (5 years, 9 months ago) by deraadt Branch: MAIN Changes since 1.172: +4 -4 lines Diff to previous 1.172 ( colored ) crank to 6.7-beta Revision 1.171.2.1 / ( download ) - annotate - [select for diffs] , Tue Oct 22 12:21:46 2019 UTC (6 years, 2 months ago) by bluhm Branch: OPENBSD_6_6 Changes since 1.171: +2 -2 lines Diff to previous 1.171 ( colored ) next main 1.172 ( colored ) 6.6-stable Revision 1.172 / ( download ) - annotate - [select for diffs] , Sat Oct 12 14:42:51 2019 UTC (6 years, 3 months ago) by deraadt Branch: MAIN Changes since 1.171: +3 -3 lines Diff to previous 1.171 ( colored ) we are now hacking on 6.6-current Revision 1.171 / ( download ) - annotate - [select for diffs] , Tue Oct 1 17:19:03 2019 UTC (6 years, 3 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_6_6_BASE Branch point for: OPENBSD_6_6 Changes since 1.170: +3 -3 lines Diff to previous 1.170 ( colored ) stop this -current stuff Revision 1.170 / ( download ) - annotate - [select for diffs] , Sat Aug 10 11:49:50 2019 UTC (6 years, 5 months ago) by naddy Branch: MAIN Changes since 1.169: +2 -2 lines Diff to previous 1.169 ( colored ) really crank to 6.6-beta Revision 1.169 / ( download ) - annotate - [select for diffs] , Sat Aug 10 03:56:02 2019 UTC (6 years, 5 months ago) by deraadt Branch: MAIN Changes since 1.168: +3 -3 lines Diff to previous 1.168 ( colored ) move to 6.6-beta Revision 1.167.2.1 / ( download ) - annotate - [select for diffs] , Wed May 1 21:02:07 2019 UTC (6 years, 8 months ago) by bluhm Branch: OPENBSD_6_5 Changes since 1.167: +2 -2 lines Diff to previous 1.167 ( colored ) next main 1.168 ( colored ) 6.5-stable Revision 1.168 / ( download ) - annotate - [select for diffs] , Sat Apr 13 17:35:07 2019 UTC (6 years, 9 months ago) by deraadt Branch: MAIN Changes since 1.167: +3 -3 lines Diff to previous 1.167 ( colored ) unlock tree, we are now working on 6.5-current Revision 1.167 / ( download ) - annotate - [select for diffs] , Tue Apr 2 08:30:38 2019 UTC (6 years, 9 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_6_5_BASE Branch point for: OPENBSD_6_5 Changes since 1.166: +3 -3 lines Diff to previous 1.166 ( colored ) Move to 6.5 release rathe than -beta. That means "pkg_add -u -Dsnap" becomes the norm until release is out. Revision 1.166 / ( download ) - annotate - [select for diffs] , Tue Feb 26 22:24:41 2019 UTC (6 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.165: +4 -4 lines Diff to previous 1.165 ( colored ) crank to 6.5-beta Revision 1.164.2.1 / ( download ) - annotate - [select for diffs] , Wed Oct 31 15:46:20 2018 UTC (7 years, 2 months ago) by bluhm Branch: OPENBSD_6_4 Changes since 1.164: +2 -2 lines Diff to previous 1.164 ( colored ) next main 1.165 ( colored ) 6.4-stable Revision 1.165 / ( download ) - annotate - [select for diffs] , Sat Oct 13 15:16:29 2018 UTC (7 years, 3 months ago) by deraadt Branch: MAIN Changes since 1.164: +3 -3 lines Diff to previous 1.164 ( colored ) we are now working on 6.4-current Revision 1.164 / ( download ) - annotate - [select for diffs] , Sat Sep 29 16:00:44 2018 UTC (7 years, 3 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_6_4_BASE Branch point for: OPENBSD_6_4 Changes since 1.163: +3 -3 lines Diff to previous 1.163 ( colored ) unmark -beta. There is still development happening, and we aren't locked in stone yet, but the clock starts ticking... Revision 1.163 / ( download ) - annotate - [select for diffs] , Fri Aug 10 20:27:01 2018 UTC (7 years, 5 months ago) by deraadt Branch: MAIN Changes since 1.162: +4 -4 lines Diff to previous 1.162 ( colored ) crank to 6.4-beta Revision 1.161.2.1 / ( download ) - annotate - [select for diffs] , Mon Apr 2 17:20:40 2018 UTC (7 years, 9 months ago) by bluhm Branch: OPENBSD_6_3 Changes since 1.161: +2 -2 lines Diff to previous 1.161 ( colored ) next main 1.162 ( colored ) 6.3-stable Revision 1.162 / ( download ) - annotate - [select for diffs] , Tue Mar 27 06:10:05 2018 UTC (7 years, 9 months ago) by deraadt Branch: MAIN Changes since 1.161: +3 -3 lines Diff to previous 1.161 ( colored ) take us to 6.3-current Revision 1.161 / ( download ) - annotate - [select for diffs] , Wed Mar 14 16:52:09 2018 UTC (7 years, 10 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_6_3_BASE Branch point for: OPENBSD_6_3 Changes since 1.160: +3 -3 lines Diff to previous 1.160 ( colored ) we head to release soon Revision 1.160 / ( download ) - annotate - [select for diffs] , Wed Feb 28 15:07:44 2018 UTC (7 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.159: +2 -2 lines Diff to previous 1.159 ( colored ) oops, skipped a step cranking to 6.3-beta Revision 1.159 / ( download ) - annotate - [select for diffs] , Wed Feb 28 14:56:46 2018 UTC (7 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.158: +3 -3 lines Diff to previous 1.158 ( colored ) move to 6.3-beta Revision 1.158 / ( download ) - annotate - [select for diffs] , Tue Feb 6 08:42:33 2018 UTC (7 years, 11 months ago) by tb Branch: MAIN Changes since 1.157: +3 -1 lines Diff to previous 1.157 ( colored ) Run newvers.sh with umask 007 to work around permission issues that cause 'make release' fail the first time around after building GENERIC if /usr/obj/ wasn't cleaned out properly. The proper fix would be to implement privdrop for kernel builds but this is trickier than it looks at first sight. discussed with deraadt Revision 1.155.2.1 / ( download ) - annotate - [select for diffs] , Mon Oct 9 17:15:23 2017 UTC (8 years, 3 months ago) by bluhm Branch: OPENBSD_6_2 Changes since 1.155: +2 -2 lines Diff to previous 1.155 ( colored ) next main 1.156 ( colored ) 6.2-stable Revision 1.157 / ( download ) - annotate - [select for diffs] , Wed Oct 4 17:59:41 2017 UTC (8 years, 3 months ago) by benno Branch: MAIN Changes since 1.156: +4 -1 lines Diff to previous 1.156 ( colored ) reminder to create <version>.html and roll errata pages for release. ok deraadt@ Revision 1.156 / ( download ) - annotate - [select for diffs] , Wed Oct 4 17:37:16 2017 UTC (8 years, 3 months ago) by deraadt Branch: MAIN Changes since 1.155: +3 -3 lines Diff to previous 1.155 ( colored ) 6.2-current, back to work Revision 1.155 / ( download ) - annotate - [select for diffs] , Mon Sep 25 06:45:54 2017 UTC (8 years, 3 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_6_2_BASE Branch point for: OPENBSD_6_2 Changes since 1.154: +3 -3 lines Diff to previous 1.154 ( colored ) take us out of -beta Revision 1.154 / ( download ) - annotate - [select for diffs] , Sun Aug 20 16:56:43 2017 UTC (8 years, 4 months ago) by deraadt Branch: MAIN Changes since 1.153: +4 -4 lines Diff to previous 1.153 ( colored ) crank to 6.2-beta Revision 1.152.4.1 / ( download ) - annotate - [select for diffs] , Tue May 2 07:35:55 2017 UTC (8 years, 8 months ago) by jsg Branch: OPENBSD_6_1 Changes since 1.152: +2 -2 lines Diff to previous 1.152 ( colored ) next main 1.153 ( colored ) 6.1-stable Revision 1.153 / ( download ) - annotate - [select for diffs] , Sun Apr 2 00:27:36 2017 UTC (8 years, 9 months ago) by deraadt Branch: MAIN Changes since 1.152: +3 -3 lines Diff to previous 1.152 ( colored ) unlock tree, we are now hacking on 6.1-current Revision 1.152 / ( download ) - annotate - [select for diffs] , Wed Mar 29 01:39:27 2017 UTC (8 years, 9 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_6_1_BASE Branch point for: OPENBSD_6_1 Changes since 1.151: +3 -3 lines Diff to previous 1.151 ( colored ) move to 6.1 release, drop -beta tag Revision 1.151 / ( download ) - annotate - [select for diffs] , Sat Mar 4 16:52:47 2017 UTC (8 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.150: +4 -4 lines Diff to previous 1.150 ( colored ) crank to 6.1-beta Revision 1.150 / ( download ) - annotate - [select for diffs] , Tue Jan 24 11:59:41 2017 UTC (8 years, 11 months ago) by tb Branch: MAIN Changes since 1.149: +2 -2 lines Diff to previous 1.149 ( colored ) logname(1) uses getlogin(2) to determine the user associated with the current session. This way kernels built during 'make release' should again have names such as deraadt@... bluhm@... instead of build@... in most environments. Issue reported by bluhm on icb eons ago. ok deraadt Revision 1.149 / ( download ) - annotate - [select for diffs] , Sun Oct 16 17:31:36 2016 UTC (9 years, 2 months ago) by tb Branch: MAIN Changes since 1.148: +2 -2 lines Diff to previous 1.148 ( colored ) Strip trailing obj/ from kernel build directories, so kernels are again marked with GENERIC{,.MP} RAMDISK, etc. Problem noticed by several (jsg, semarie, ...) ok many (sthen, natano, millert, deraadt, ...) Explanations why quotes aren't necessary by even more. Thanks! Revision 1.148 / ( download ) - annotate - [select for diffs] , Thu Sep 1 14:12:07 2016 UTC (9 years, 4 months ago) by tedu Branch: MAIN Changes since 1.147: +2 -2 lines Diff to previous 1.147 ( colored ) make the version symbol a fixed size (512) to reduce the potential for bad effects when savecore reads beyond it ok deraadt (and thanks to bluhm for remembering that this happens) Revision 1.146.2.1 / ( download ) - annotate - [select for diffs] , Tue Aug 2 09:48:40 2016 UTC (9 years, 5 months ago) by benno Branch: OPENBSD_6_0 Changes since 1.146: +2 -2 lines Diff to previous 1.146 ( colored ) next main 1.147 ( colored ) OPENBSD_6_0 is now -stable ok deraadt@ Revision 1.147 / ( download ) - annotate - [select for diffs] , Tue Jul 26 17:57:14 2016 UTC (9 years, 5 months ago) by kettenis Branch: MAIN Changes since 1.146: +3 -3 lines Diff to previous 1.146 ( colored ) Welcome to 6.0-current. ok deraadt@ Revision 1.146 / ( download ) - annotate - [select for diffs] , Fri Jul 15 05:06:24 2016 UTC (9 years, 6 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_6_0_BASE Branch point for: OPENBSD_6_0 Changes since 1.145: +3 -3 lines Diff to previous 1.145 ( colored ) take us out of -beta Revision 1.145 / ( download ) - annotate - [select for diffs] , Wed May 11 18:01:33 2016 UTC (9 years, 8 months ago) by deraadt Branch: MAIN Changes since 1.144: +4 -4 lines Diff to previous 1.144 ( colored ) crank to 6.0-beta Revision 1.143.2.1 / ( download ) - annotate - [select for diffs] , Thu Mar 24 05:08:56 2016 UTC (9 years, 9 months ago) by jsg Branch: OPENBSD_5_9 Changes since 1.143: +2 -2 lines Diff to previous 1.143 ( colored ) next main 1.144 ( colored ) 5.9-stable Revision 1.144 / ( download ) - annotate - [select for diffs] , Thu Feb 25 00:31:25 2016 UTC (9 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.143: +3 -3 lines Diff to previous 1.143 ( colored ) we are now hacking on 5.9-current Revision 1.143 / ( download ) - annotate - [select for diffs] , Mon Feb 1 22:15:30 2016 UTC (9 years, 11 months ago) by jsg Branch: MAIN CVS Tags: OPENBSD_5_9_BASE Branch point for: OPENBSD_5_9 Changes since 1.142: +3 -3 lines Diff to previous 1.142 ( colored ) move to -release mode requested by deraadt@ Revision 1.142 / ( download ) - annotate - [select for diffs] , Wed Jan 6 23:14:05 2016 UTC (10 years ago) by benno Branch: MAIN Changes since 1.141: +3 -1 lines Diff to previous 1.141 ( colored ) document the signify command for the next release, so that users can verify before the netx upgrade. document that signify.1 needs an edit bump once in a while. ok tedu@ florian@ Revision 1.141 / ( download ) - annotate - [select for diffs] , Sat Dec 19 19:44:09 2015 UTC (10 years ago) by deraadt Branch: MAIN Changes since 1.140: +4 -4 lines Diff to previous 1.140 ( colored ) move to 5.9-beta Revision 1.139.4.1 / ( download ) - annotate - [select for diffs] , Sat Sep 5 11:31:55 2015 UTC (10 years, 4 months ago) by sthen Branch: OPENBSD_5_8 Changes since 1.139: +2 -2 lines Diff to previous 1.139 ( colored ) next main 1.140 ( colored ) 5.8-stable Revision 1.140 / ( download ) - annotate - [select for diffs] , Mon Aug 10 20:31:00 2015 UTC (10 years, 5 months ago) by jca Branch: MAIN Changes since 1.139: +3 -3 lines Diff to previous 1.139 ( colored ) Back to -current. Revision 1.139 / ( download ) - annotate - [select for diffs] , Thu Jul 23 16:26:57 2015 UTC (10 years, 5 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_5_8_BASE Branch point for: OPENBSD_5_8 Changes since 1.138: +3 -3 lines Diff to previous 1.138 ( colored ) remove -beta tag. take that as a hint. Revision 1.138 / ( download ) - annotate - [select for diffs] , Wed Jun 17 19:52:18 2015 UTC (10 years, 6 months ago) by deraadt Branch: MAIN Changes since 1.137: +4 -4 lines Diff to previous 1.137 ( colored ) move to 5.8-beta. This is a bit earlier than normal... Revision 1.136.2.1 / ( download ) - annotate - [select for diffs] , Sun Mar 22 01:13:32 2015 UTC (10 years, 9 months ago) by tedu Branch: OPENBSD_5_7 Changes since 1.136: +2 -2 lines Diff to previous 1.136 ( colored ) next main 1.137 ( colored ) -stable Revision 1.137 / ( download ) - annotate - [select for diffs] , Mon Mar 9 20:08:55 2015 UTC (10 years, 10 months ago) by miod Branch: MAIN Changes since 1.136: +3 -3 lines Diff to previous 1.136 ( colored ) If my calculations are correct, when this baby hits 5.8... you're gonna see some serious shit. Revision 1.136 / ( download ) - annotate - [select for diffs] , Wed Mar 4 14:31:13 2015 UTC (10 years, 10 months ago) by jsg Branch: MAIN CVS Tags: OPENBSD_5_7_BASE Branch point for: OPENBSD_5_7 Changes since 1.135: +3 -3 lines Diff to previous 1.135 ( colored ) move to -release mode ok deraadt@ Revision 1.135 / ( download ) - annotate - [select for diffs] , Thu Jan 1 15:50:27 2015 UTC (11 years ago) by deraadt Branch: MAIN Changes since 1.134: +4 -4 lines Diff to previous 1.134 ( colored ) move to 5.7-beta Revision 1.133.4.1 / ( download ) - annotate - [select for diffs] , Sun Sep 7 03:07:16 2014 UTC (11 years, 4 months ago) by jsg Branch: OPENBSD_5_6 Changes since 1.133: +2 -2 lines Diff to previous 1.133 ( colored ) next main 1.134 ( colored ) 5.6-stable Revision 1.134 / ( download ) - annotate - [select for diffs] , Mon Aug 11 18:33:36 2014 UTC (11 years, 5 months ago) by miod Branch: MAIN Changes since 1.133: +3 -3 lines Diff to previous 1.133 ( colored ) -current dammit Revision 1.133 / ( download ) - annotate - [select for diffs] , Tue Jul 29 12:56:41 2014 UTC (11 years, 5 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_5_6_BASE Branch point for: OPENBSD_5_6 Changes since 1.132: +3 -3 lines Diff to previous 1.132 ( colored ) move to -release mode Revision 1.132 / ( download ) - annotate - [select for diffs] , Tue Jul 15 21:59:17 2014 UTC (11 years, 6 months ago) by deraadt Branch: MAIN Changes since 1.131: +4 -4 lines Diff to previous 1.131 ( colored ) crank to 5.6-beta Revision 1.130.4.1 / ( download ) - annotate - [select for diffs] , Sat May 3 19:32:01 2014 UTC (11 years, 8 months ago) by jsg Branch: OPENBSD_5_5 Changes since 1.130: +2 -2 lines Diff to previous 1.130 ( colored ) next main 1.131 ( colored ) 5.5-stable Revision 1.131 / ( download ) - annotate - [select for diffs] , Wed Mar 5 18:54:32 2014 UTC (11 years, 10 months ago) by chris Branch: MAIN Changes since 1.130: +3 -3 lines Diff to previous 1.130 ( colored ) We are now 5.5-current Revision 1.130 / ( download ) - annotate - [select for diffs] , Sat Feb 22 03:53:45 2014 UTC (11 years, 10 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_5_5_BASE Branch point for: OPENBSD_5_5 Changes since 1.129: +3 -3 lines Diff to previous 1.129 ( colored ) take us to -release mode Revision 1.129 / ( download ) - annotate - [select for diffs] , Sun Jan 12 11:26:08 2014 UTC (12 years ago) by deraadt Branch: MAIN Changes since 1.128: +4 -4 lines Diff to previous 1.128 ( colored ) crank to 5.5beta Revision 1.127.2.1 / ( download ) - annotate - [select for diffs] , Sun Nov 3 11:24:51 2013 UTC (12 years, 2 months ago) by sthen Branch: OPENBSD_5_4 Changes since 1.127: +2 -2 lines Diff to previous 1.127 ( colored ) next main 1.128 ( colored ) -stable, for mitja :) Revision 1.128 / ( download ) - annotate - [select for diffs] , Mon Jul 29 18:43:50 2013 UTC (12 years, 5 months ago) by kettenis Branch: MAIN Changes since 1.127: +3 -3 lines Diff to previous 1.127 ( colored ) and we're hacking on 5.4-current now Revision 1.127 / ( download ) - annotate - [select for diffs] , Wed Jul 17 13:35:57 2013 UTC (12 years, 6 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_5_4_BASE Branch point for: OPENBSD_5_4 Changes since 1.126: +3 -3 lines Diff to previous 1.126 ( colored ) no longer beta; get moving towards release Revision 1.126 / ( download ) - annotate - [select for diffs] , Sun Jul 7 18:11:50 2013 UTC (12 years, 6 months ago) by deraadt Branch: MAIN Changes since 1.125: +4 -4 lines Diff to previous 1.125 ( colored ) move to 5.4-beta Revision 1.123.2.1 / ( download ) - annotate - [select for diffs] , Sun May 5 19:41:53 2013 UTC (12 years, 8 months ago) by sthen Branch: OPENBSD_5_3 Changes since 1.123: +2 -2 lines Diff to previous 1.123 ( colored ) next main 1.124 ( colored ) switch to -stable suffix, reminded by mitja Revision 1.125 / ( download ) - annotate - [select for diffs] , Tue Apr 9 18:47:14 2013 UTC (12 years, 9 months ago) by mlarkin Branch: MAIN Changes since 1.124: +2 -2 lines Diff to previous 1.124 ( colored ) newvers.sh uses 'basename' to determine the directory name to stamp the kernel version ID with, but it did not account for spaces in the name, leading to version strings like "OpenBSD 5.3-current ()". Quote the call to basename to permit paths with spaces in the name. ok halex@, deraadt@ Revision 1.124 / ( download ) - annotate - [select for diffs] , Fri Mar 1 21:06:04 2013 UTC (12 years, 10 months ago) by guenther Branch: MAIN Changes since 1.123: +3 -3 lines Diff to previous 1.123 ( colored ) Antici pation: back to -current Revision 1.123 / ( download ) - annotate - [select for diffs] , Thu Feb 21 15:26:20 2013 UTC (12 years, 10 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_5_3_BASE Branch point for: OPENBSD_5_3 Changes since 1.122: +3 -3 lines Diff to previous 1.122 ( colored ) go to release Revision 1.122 / ( download ) - annotate - [select for diffs] , Thu Jan 31 23:30:40 2013 UTC (12 years, 11 months ago) by miod Branch: MAIN Changes since 1.121: +4 -4 lines Diff to previous 1.121 ( colored ) welcome to 5.3-BETA Revision 1.120.2.1 / ( download ) - annotate - [select for diffs] , Wed Dec 19 18:51:03 2012 UTC (13 years ago) by jj Branch: OPENBSD_5_2 Changes since 1.120: +2 -2 lines Diff to previous 1.120 ( colored ) next main 1.121 ( colored ) enter -stable. ok deraadt@, reported by Mitja M. Revision 1.121 / ( download ) - annotate - [select for diffs] , Thu Jul 26 15:51:22 2012 UTC (13 years, 5 months ago) by otto Branch: MAIN Changes since 1.120: +3 -3 lines Diff to previous 1.120 ( colored ) move to -current Revision 1.120 / ( download ) - annotate - [select for diffs] , Mon Jul 16 10:50:07 2012 UTC (13 years, 6 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_5_2_BASE Branch point for: OPENBSD_5_2 Changes since 1.119: +3 -3 lines Diff to previous 1.119 ( colored ) and we head towards release Revision 1.119 / ( download ) - annotate - [select for diffs] , Wed Jun 20 21:40:55 2012 UTC (13 years, 6 months ago) by deraadt Branch: MAIN Changes since 1.118: +4 -4 lines Diff to previous 1.118 ( colored ) move to 5.2-beta Revision 1.117.2.1 / ( download ) - annotate - [select for diffs] , Mon Apr 23 13:55:06 2012 UTC (13 years, 8 months ago) by henning Branch: OPENBSD_5_1 Changes since 1.117: +2 -2 lines Diff to previous 1.117 ( colored ) next main 1.118 ( colored ) enter -stable Revision 1.118 / ( download ) - annotate - [select for diffs] , Tue Feb 14 19:25:05 2012 UTC (13 years, 11 months ago) by kettenis Branch: MAIN Changes since 1.117: +3 -3 lines Diff to previous 1.117 ( colored ) we are now hacking on 5.1-current Revision 1.117 / ( download ) - annotate - [select for diffs] , Tue Feb 7 17:30:00 2012 UTC (13 years, 11 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_5_1_BASE Branch point for: OPENBSD_5_1 Changes since 1.116: +3 -3 lines Diff to previous 1.116 ( colored ) move out of -beta Revision 1.116 / ( download ) - annotate - [select for diffs] , Thu Jan 12 00:35:59 2012 UTC (14 years ago) by sthen Branch: MAIN Changes since 1.115: +2 -2 lines Diff to previous 1.115 ( colored ) s/5.0/5.1/, ok deraadt@ Revision 1.115 / ( download ) - annotate - [select for diffs] , Wed Jan 11 22:11:35 2012 UTC (14 years ago) by deraadt Branch: MAIN Changes since 1.114: +3 -3 lines Diff to previous 1.114 ( colored ) crank to 5.1-beta Revision 1.113.2.1 / ( download ) - annotate - [select for diffs] , Wed Oct 5 10:44:46 2011 UTC (14 years, 3 months ago) by henning Branch: OPENBSD_5_0 Changes since 1.113: +2 -2 lines Diff to previous 1.113 ( colored ) next main 1.114 ( colored ) enter -stable Revision 1.114 / ( download ) - annotate - [select for diffs] , Tue Aug 16 21:00:48 2011 UTC (14 years, 5 months ago) by kettenis Branch: MAIN Changes since 1.113: +3 -3 lines Diff to previous 1.113 ( colored ) we are now hacking on 5.0-current requested by deraadt@ Revision 1.113 / ( download ) - annotate - [select for diffs] , Wed Aug 3 18:45:55 2011 UTC (14 years, 5 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_5_0_BASE Branch point for: OPENBSD_5_0 Changes since 1.112: +3 -3 lines Diff to previous 1.112 ( colored ) move to release Revision 1.112 / ( download ) - annotate - [select for diffs] , Mon Jul 18 07:07:52 2011 UTC (14 years, 6 months ago) by deraadt Branch: MAIN Changes since 1.111: +4 -4 lines Diff to previous 1.111 ( colored ) take us to 5.0-beta Revision 1.110.2.1 / ( download ) - annotate - [select for diffs] , Wed Apr 20 14:16:54 2011 UTC (14 years, 8 months ago) by henning Branch: OPENBSD_4_9 Changes since 1.110: +2 -2 lines Diff to previous 1.110 ( colored ) next main 1.111 ( colored ) enter -stable Revision 1.111 / ( download ) - annotate - [select for diffs] , Wed Mar 2 01:58:39 2011 UTC (14 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.110: +3 -3 lines Diff to previous 1.110 ( colored ) we are now hacking on 4.9-current Revision 1.110 / ( download ) - annotate - [select for diffs] , Tue Feb 15 07:14:45 2011 UTC (14 years, 11 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_4_9_BASE Branch point for: OPENBSD_4_9 Changes since 1.109: +3 -3 lines Diff to previous 1.109 ( colored ) move us to real 4.9 Revision 1.109 / ( download ) - annotate - [select for diffs] , Thu Jan 13 23:17:50 2011 UTC (15 years ago) by deraadt Branch: MAIN Changes since 1.108: +4 -4 lines Diff to previous 1.108 ( colored ) move to 4.9-current Revision 1.108 / ( download ) - annotate - [select for diffs] , Mon Oct 18 19:17:29 2010 UTC (15 years, 2 months ago) by deraadt Branch: MAIN Changes since 1.107: +1 -4 lines Diff to previous 1.107 ( colored ) tmac update no longer needed Revision 1.106.2.1 / ( download ) - annotate - [select for diffs] , Sat Oct 2 03:03:15 2010 UTC (15 years, 3 months ago) by william Branch: OPENBSD_4_8 Changes since 1.106: +2 -2 lines Diff to previous 1.106 ( colored ) next main 1.107 ( colored ) 4.8-stable ok deraadt Revision 1.107 / ( download ) - annotate - [select for diffs] , Thu Aug 12 00:25:24 2010 UTC (15 years, 5 months ago) by deraadt Branch: MAIN Changes since 1.106: +3 -3 lines Diff to previous 1.106 ( colored ) we are at -current again Revision 1.106 / ( download ) - annotate - [select for diffs] , Sun Aug 8 17:18:31 2010 UTC (15 years, 5 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_4_8_BASE Branch point for: OPENBSD_4_8 Changes since 1.105: +3 -3 lines Diff to previous 1.105 ( colored ) take us to release Revision 1.105 / ( download ) - annotate - [select for diffs] , Sat Jul 24 15:31:53 2010 UTC (15 years, 5 months ago) by deraadt Branch: MAIN Changes since 1.104: +4 -4 lines Diff to previous 1.104 ( colored ) move to 4.8-beta Revision 1.103.2.1 / ( download ) - annotate - [select for diffs] , Fri Jun 11 01:32:25 2010 UTC (15 years, 7 months ago) by william Branch: OPENBSD_4_7 Changes since 1.103: +2 -2 lines Diff to previous 1.103 ( colored ) next main 1.104 ( colored ) 4.7-stable; ok deraadt@ Revision 1.104 / ( download ) - annotate - [select for diffs] , Thu Mar 18 21:17:48 2010 UTC (15 years, 10 months ago) by otto Branch: MAIN Changes since 1.103: +5 -3 lines Diff to previous 1.103 ( colored ) move to 4.7-current Revision 1.103 / ( download ) - annotate - [select for diffs] , Fri Mar 5 10:59:35 2010 UTC (15 years, 10 months ago) by miod Branch: MAIN CVS Tags: OPENBSD_4_7_BASE Branch point for: OPENBSD_4_7 Changes since 1.102: +3 -3 lines Diff to previous 1.102 ( colored ) head towards release, correctly. tsk tsk tsk. Revision 1.102 / ( download ) - annotate - [select for diffs] , Fri Mar 5 08:54:01 2010 UTC (15 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.101: +2 -2 lines Diff to previous 1.101 ( colored ) head towards release Revision 1.101 / ( download ) - annotate - [select for diffs] , Tue Jan 26 23:04:28 2010 UTC (15 years, 11 months ago) by miod Branch: MAIN Changes since 1.100: +4 -4 lines Diff to previous 1.100 ( colored ) 4.7-BETA (also, lo-carb and ozone layer friendly) Revision 1.99.4.1 / ( download ) - annotate - [select for diffs] , Sat Aug 8 10:41:41 2009 UTC (16 years, 5 months ago) by henning Branch: OPENBSD_4_6 Changes since 1.99: +2 -2 lines Diff to previous 1.99 ( colored ) next main 1.100 ( colored ) reveal identidy Revision 1.100 / ( download ) - annotate - [select for diffs] , Sun Jul 5 23:42:51 2009 UTC (16 years, 6 months ago) by dlg Branch: MAIN Changes since 1.99: +2 -2 lines Diff to previous 1.99 ( colored ) take us to 4.6-current Revision 1.99 / ( download ) - annotate - [select for diffs] , Wed Jul 1 15:10:25 2009 UTC (16 years, 6 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_4_6_BASE Branch point for: OPENBSD_4_6 Changes since 1.98: +3 -3 lines Diff to previous 1.98 ( colored ) take us to 4.6, though there will still be some changes Revision 1.98 / ( download ) - annotate - [select for diffs] , Sat Jun 20 23:38:12 2009 UTC (16 years, 6 months ago) by miod Branch: MAIN Changes since 1.97: +4 -6 lines Diff to previous 1.97 ( colored ) 4.6-BETA Revision 1.97 / ( download ) - annotate - [select for diffs] , Sun May 17 02:02:30 2009 UTC (16 years, 8 months ago) by deraadt Branch: MAIN Changes since 1.96: +1 -2 lines Diff to previous 1.96 ( colored ) the previous was a bug, and has been fixed Revision 1.96 / ( download ) - annotate - [select for diffs] , Sat May 16 22:24:11 2009 UTC (16 years, 8 months ago) by miod Branch: MAIN Changes since 1.95: +2 -1 lines Diff to previous 1.95 ( colored ) distrib/miniroot/install.sub now embeds the current version number in two places, update comments accordingly. Revision 1.94.2.1 / ( download ) - annotate - [select for diffs] , Fri May 1 05:42:44 2009 UTC (16 years, 8 months ago) by deraadt Branch: OPENBSD_4_5 Changes since 1.94: +2 -2 lines Diff to previous 1.94 ( colored ) next main 1.95 ( colored ) move OPENBSD_4_5 to -stable; Maurice Janssen Revision 1.95 / ( download ) - annotate - [select for diffs] , Sun Mar 1 02:21:07 2009 UTC (16 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.94: +3 -3 lines Diff to previous 1.94 ( colored ) move to 4.5-current Revision 1.94 / ( download ) - annotate - [select for diffs] , Thu Feb 26 17:55:17 2009 UTC (16 years, 10 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_4_5_BASE Branch point for: OPENBSD_4_5 Changes since 1.93: +3 -3 lines Diff to previous 1.93 ( colored ) declare builds from around here to be 4.5 instead of 4.5-beta, though it is not really true since there are a few more (very important) things going in. Revision 1.93 / ( download ) - annotate - [select for diffs] , Sun Feb 8 21:02:22 2009 UTC (16 years, 11 months ago) by miod Branch: MAIN Changes since 1.92: +4 -4 lines Diff to previous 1.92 ( colored ) Move to 4.5-BETA Revision 1.91.2.1 / ( download ) - annotate - [select for diffs] , Sun Nov 2 03:54:55 2008 UTC (17 years, 2 months ago) by brad Branch: OPENBSD_4_4 Changes since 1.91: +3 -2 lines Diff to previous 1.91 ( colored ) next main 1.92 ( colored ) Here comes -stable. Revision 1.92 / ( download ) - annotate - [select for diffs] , Thu Aug 7 17:18:03 2008 UTC (17 years, 5 months ago) by deraadt Branch: MAIN Changes since 1.91: +3 -3 lines Diff to previous 1.91 ( colored ) we are at 4.4-current Revision 1.91 / ( download ) - annotate - [select for diffs] , Wed Aug 6 03:56:53 2008 UTC (17 years, 5 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_4_4_BASE Branch point for: OPENBSD_4_4 Changes since 1.90: +3 -3 lines Diff to previous 1.90 ( colored ) we are no longer in -beta Revision 1.90 / ( download ) - annotate - [select for diffs] , Wed Jul 2 00:13:32 2008 UTC (17 years, 6 months ago) by deraadt Branch: MAIN Changes since 1.89: +4 -4 lines Diff to previous 1.89 ( colored ) move to 4.4-beta Revision 1.88.2.1 / ( download ) - annotate - [select for diffs] , Wed Jun 4 09:26:46 2008 UTC (17 years, 7 months ago) by henning Branch: OPENBSD_4_3 Changes since 1.88: +2 -2 lines Diff to previous 1.88 ( colored ) next main 1.89 ( colored ) -stable; noticed by otto Revision 1.89 / ( download ) - annotate - [select for diffs] , Sat Mar 8 00:00:17 2008 UTC (17 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.88: +3 -3 lines Diff to previous 1.88 ( colored ) move us to 4.3-current Revision 1.88 / ( download ) - annotate - [select for diffs] , Tue Mar 4 18:37:52 2008 UTC (17 years, 10 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_4_3_BASE Branch point for: OPENBSD_4_3 Changes since 1.87: +3 -3 lines Diff to previous 1.87 ( colored ) remove -beta Revision 1.87 / ( download ) - annotate - [select for diffs] , Wed Feb 20 17:46:51 2008 UTC (17 years, 10 months ago) by miod Branch: MAIN Changes since 1.86: +4 -4 lines Diff to previous 1.86 ( colored ) 4.3-beta Revision 1.85.2.1 / ( download ) - annotate - [select for diffs] , Thu Oct 11 11:30:19 2007 UTC (18 years, 3 months ago) by henning Branch: OPENBSD_4_2 Changes since 1.85: +2 -2 lines Diff to previous 1.85 ( colored ) next main 1.86 ( colored ) enter -stable Revision 1.86 / ( download ) - annotate - [select for diffs] , Tue Aug 21 18:53:28 2007 UTC (18 years, 4 months ago) by kettenis Branch: MAIN Changes since 1.85: +3 -3 lines Diff to previous 1.85 ( colored ) unlock tree, move towards 4.2-current requested by deraadt@ Revision 1.85 / ( download ) - annotate - [select for diffs] , Sun Aug 5 14:20:36 2007 UTC (18 years, 5 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_4_2_BASE Branch point for: OPENBSD_4_2 Changes since 1.84: +3 -3 lines Diff to previous 1.84 ( colored ) remove -beta Revision 1.84 / ( download ) - annotate - [select for diffs] , Wed Jul 25 20:07:27 2007 UTC (18 years, 5 months ago) by deraadt Branch: MAIN Changes since 1.83: +4 -4 lines Diff to previous 1.83 ( colored ) crank to 4.2-beta Revision 1.82.2.1 / ( download ) - annotate - [select for diffs] , Thu May 3 10:12:09 2007 UTC (18 years, 8 months ago) by henning Branch: OPENBSD_4_1 Changes since 1.82: +2 -2 lines Diff to previous 1.82 ( colored ) next main 1.83 ( colored ) enter -stable Revision 1.83 / ( download ) - annotate - [select for diffs] , Mon Mar 12 00:23:25 2007 UTC (18 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.82: +4 -4 lines Diff to previous 1.82 ( colored ) unlock tree, move on towards 4.1-current Revision 1.82 / ( download ) - annotate - [select for diffs] , Thu Mar 1 16:33:08 2007 UTC (18 years, 10 months ago) by pvalchev Branch: MAIN CVS Tags: OPENBSD_4_1_BASE Branch point for: OPENBSD_4_1 Changes since 1.81: +3 -3 lines Diff to previous 1.81 ( colored ) strip off -beta; ok deraadt Revision 1.81 / ( download ) - annotate - [select for diffs] , Mon Feb 12 13:10:02 2007 UTC (18 years, 11 months ago) by henning Branch: MAIN Changes since 1.80: +4 -4 lines Diff to previous 1.80 ( colored ) 4.1-beta Revision 1.78.2.1 / ( download ) - annotate - [select for diffs] , Thu Nov 2 01:49:04 2006 UTC (19 years, 2 months ago) by brad Branch: OPENBSD_4_0 Changes since 1.78: +3 -2 lines Diff to previous 1.78 ( colored ) next main 1.79 ( colored ) -stable Revision 1.80 / ( download ) - annotate - [select for diffs] , Sun Sep 17 16:47:27 2006 UTC (19 years, 4 months ago) by steven Branch: MAIN Changes since 1.79: +2 -2 lines Diff to previous 1.79 ( colored ) 4.0-current. yes deraadt Revision 1.79 / ( download ) - annotate - [select for diffs] , Sun Sep 17 16:25:30 2006 UTC (19 years, 4 months ago) by deraadt Branch: MAIN Changes since 1.78: +4 -4 lines Diff to previous 1.78 ( colored ) moving to 4.1-current Revision 1.78 / ( download ) - annotate - [select for diffs] , Mon Aug 28 21:16:16 2006 UTC (19 years, 4 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_4_0_BASE Branch point for: OPENBSD_4_0 Changes since 1.77: +3 -3 lines Diff to previous 1.77 ( colored ) move to official 4.0 Revision 1.77 / ( download ) - annotate - [select for diffs] , Wed Jul 26 20:34:11 2006 UTC (19 years, 5 months ago) by deraadt Branch: MAIN Changes since 1.76: +4 -4 lines Diff to previous 1.76 ( colored ) crank to 4.0-beta Revision 1.74.2.1 / ( download ) - annotate - [select for diffs] , Mon May 1 16:01:21 2006 UTC (19 years, 8 months ago) by brad Branch: OPENBSD_3_9 Changes since 1.74: +3 -2 lines Diff to previous 1.74 ( colored ) next main 1.75 ( colored ) -stable Revision 1.76 / ( download ) - annotate - [select for diffs] , Sat Mar 4 11:40:22 2006 UTC (19 years, 10 months ago) by grange Branch: MAIN Changes since 1.75: +3 -3 lines Diff to previous 1.75 ( colored ) -current, not -beta. Revision 1.75 / ( download ) - annotate - [select for diffs] , Sat Mar 4 02:56:10 2006 UTC (19 years, 10 months ago) by deraadt Branch: MAIN Changes since 1.74: +3 -3 lines Diff to previous 1.74 ( colored ) move to 3.9-current Revision 1.74 / ( download ) - annotate - [select for diffs] , Mon Feb 27 01:43:27 2006 UTC (19 years, 10 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_3_9_BASE Branch point for: OPENBSD_3_9 Changes since 1.73: +3 -3 lines Diff to previous 1.73 ( colored ) stop being -beta Revision 1.73 / ( download ) - annotate - [select for diffs] , Thu Jan 19 03:30:04 2006 UTC (19 years, 11 months ago) by deraadt Branch: MAIN Changes since 1.72: +4 -4 lines Diff to previous 1.72 ( colored ) crank to 3.8-beta Revision 1.71.2.1 / ( download ) - annotate - [select for diffs] , Tue Nov 1 01:07:32 2005 UTC (20 years, 2 months ago) by brad Branch: OPENBSD_3_8 Changes since 1.71: +3 -2 lines Diff to previous 1.71 ( colored ) next main 1.72 ( colored ) and here comes -stable Revision 1.72 / ( download ) - annotate - [select for diffs] , Mon Sep 5 20:43:25 2005 UTC (20 years, 4 months ago) by miod Branch: MAIN Changes since 1.71: +3 -3 lines Diff to previous 1.71 ( colored ) On the road again. Revision 1.71 / ( download ) - annotate - [select for diffs] , Sat Aug 27 16:47:04 2005 UTC (20 years, 4 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_3_8_BASE Branch point for: OPENBSD_3_8 Changes since 1.70: +3 -3 lines Diff to previous 1.70 ( colored ) remove -beta tag Revision 1.70 / ( download ) - annotate - [select for diffs] , Tue Aug 9 00:46:15 2005 UTC (20 years, 5 months ago) by deraadt Branch: MAIN Changes since 1.69: +4 -4 lines Diff to previous 1.69 ( colored ) move to 3.8-beta Revision 1.68.2.1 / ( download ) - annotate - [select for diffs] , Sun May 22 21:34:52 2005 UTC (20 years, 7 months ago) by brad Branch: OPENBSD_3_7 Changes since 1.68: +3 -2 lines Diff to previous 1.68 ( colored ) next main 1.69 ( colored ) and here comes -stable Revision 1.69 / ( download ) - annotate - [select for diffs] , Mon Mar 21 22:29:45 2005 UTC (20 years, 9 months ago) by miod Branch: MAIN Changes since 1.68: +3 -3 lines Diff to previous 1.68 ( colored ) Voltage reinforcements. Revision 1.68 / ( download ) - annotate - [select for diffs] , Tue Mar 15 21:26:50 2005 UTC (20 years, 10 months ago) by deraadt Branch: MAIN CVS Tags: OPENBSD_3_7_BASE Branch point for: OPENBSD_3_7 Changes since 1.67: +3 -3 lines Diff to previous 1.67 ( colored ) tag for release, more things coming, but ports needs this Revision 1.67 / ( download ) - annotate - [select for diff | 2026-01-13T09:29:14 |
https://l.facebook.com/l.php?u=https%3A%2F%2Fwww.instagram.com%2F&h=AT1xDb7wRoyTQ55TuJEutRMJUk5t8Or_qfcjzVaAIM_GgKcazrPCgD9n5mgcIyB5XZJDRVxoapEG4p2VquWhhaX43bCif1_6ui5viVQ_ZwJyB95f6dTePuPzECbBOCnwvlcgE0URZBj2rshT | Facebook Facebook 이메일 또는 휴대폰 비밀번호 계정을 잊으셨나요? 새 계정 만들기 일시적으로 차단됨 일시적으로 차단됨 회원님의 이 기능 사용 속도가 너무 빠른 것 같습니다. 이 기능 사용에서 일시적으로 차단되었습니다. Back 한국어 English (US) Tiếng Việt Bahasa Indonesia ภาษาไทย Español 中文(简体) 日本語 Português (Brasil) Français (France) Deutsch 가입하기 로그인 Messenger Facebook Lite 동영상 Meta Pay Meta 스토어 Meta Quest Ray-Ban Meta Meta AI Meta AI 콘텐츠 더 보기 Instagram Threads 투표 정보 센터 개인정보처리방침 개인정보 보호 센터 정보 광고 만들기 페이지 만들기 개발자 채용 정보 쿠키 AdChoices 이용 약관 고객 센터 연락처 업로드 및 비사용자 설정 활동 로그 Meta © 2026 | 2026-01-13T09:29:14 |
https://www.linkedin.com/uas/login?session_redirect=%2Fproducts%2Fkaltura-video-platform&trk=products_details_guest_primary_call_to_action | LinkedIn Login, Sign in | LinkedIn Sign in Sign in with Apple Sign in with a passkey By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . or Email or phone Password Show Forgot password? Keep me logged in Sign in We’ve emailed a one-time link to your primary email address Click on the link to sign in instantly to your LinkedIn account. If you don’t see the email in your inbox, check your spam folder. Resend email Back New to LinkedIn? Join now Agree & Join LinkedIn By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . LinkedIn © 2026 User Agreement Privacy Policy Community Guidelines Cookie Policy Copyright Policy Send Feedback Language العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) | 2026-01-13T09:29:14 |
https://www.linkedin.com/uas/login?session_redirect=%2Fservices%2Fproducts%2Fcategories%2Fserver-virtualization-software&fromSignIn=true&trk=products_seo_search_nav-header-signin | LinkedIn Login, Sign in | LinkedIn Sign in Sign in with Apple Sign in with a passkey By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . or Email or phone Password Show Forgot password? Sign in We’ve emailed a one-time link to your primary email address Click on the link to sign in instantly to your LinkedIn account. If you don’t see the email in your inbox, check your spam folder. Resend email Back New to LinkedIn? Join now Agree & Join LinkedIn By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . LinkedIn © 2026 User Agreement Privacy Policy Community Guidelines Cookie Policy Copyright Policy Send Feedback Language العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) | 2026-01-13T09:29:14 |
https://www.linkedin.com/uas/login?session_redirect=%2Fproducts%2Fkaltura-video-platform%3FviewConnections%3Dtrue&trk=products_details_guest_face-pile-cta | LinkedIn Login, Sign in | LinkedIn Sign in Sign in with Apple Sign in with a passkey By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . or Email or phone Password Show Forgot password? Keep me logged in Sign in We’ve emailed a one-time link to your primary email address Click on the link to sign in instantly to your LinkedIn account. If you don’t see the email in your inbox, check your spam folder. Resend email Back New to LinkedIn? Join now Agree & Join LinkedIn By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . LinkedIn © 2026 User Agreement Privacy Policy Community Guidelines Cookie Policy Copyright Policy Send Feedback Language العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) | 2026-01-13T09:29:14 |
https://www.linkedin.com/uas/login?session_redirect=%2Fservices%2Fproducts%2Fkaltura-video-platform%2F&fromSignIn=true&trk=products_details_guest_nav-header-signin | LinkedIn Login, Sign in | LinkedIn Sign in Sign in with Apple Sign in with a passkey By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . or Email or phone Password Show Forgot password? Keep me logged in Sign in We’ve emailed a one-time link to your primary email address Click on the link to sign in instantly to your LinkedIn account. If you don’t see the email in your inbox, check your spam folder. Resend email Back New to LinkedIn? Join now Agree & Join LinkedIn By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . LinkedIn © 2026 User Agreement Privacy Policy Community Guidelines Cookie Policy Copyright Policy Send Feedback Language العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) | 2026-01-13T09:29:14 |
https://unicode.org/reports/tr31/ | UAX #31: Unicode Identifiers and Syntax Technical Reports Unicode® Standard Annex #31 Unicode Identifiers and Syntax Version Unicode 17.0.0 Editors Mark Davis ( [email protected] ) and Robin Leroy ( [email protected] ) Date 2025-08-20 This Version https://www.unicode.org/reports/tr31/tr31-43.html Previous Version https://www.unicode.org/reports/tr31/tr31-41.html Latest Version https://www.unicode.org/reports/tr31/ Latest Proposed Update https://www.unicode.org/reports/tr31/proposed.html Revision 43 Summary This annex describes specifications for recommended defaults for the use of Unicode in the definitions of general-purpose identifiers, immutable identifiers, hashtag identifiers, and in pattern-based syntax. It also supplies guidelines for use of normalization with identifiers. Status This is a draft document which may be updated, replaced, or superseded by other documents at any time. Publication does not imply endorsement by the Unicode Consortium. This is not a stable document; it is inappropriate to cite this document as other than a work in progress. END NOT YET APPROVED --> This document has been reviewed by Unicode members and other interested parties, and has been approved for publication by the Unicode Consortium. This is a stable document and may be used as reference material or cited as a normative reference by other specifications. A Unicode Standard Annex (UAX) forms an integral part of the Unicode Standard, but is published online as a separate document. The Unicode Standard may require conformance to normative content in a Unicode Standard Annex, if so specified in the Conformance chapter of that version of the Unicode Standard. The version number of a UAX document corresponds to the version of the Unicode Standard of which it forms a part. Please submit corrigenda and other comments with the online reporting form [ Feedback ]. Related information that is useful in understanding this annex is found in Unicode Standard Annex #41, “ Common References for Unicode Standard Annexes .” For the latest version of the Unicode Standard, see [ Unicode ]. For a list of current Unicode Technical Reports, see [ Reports ]. For more information about versions of the Unicode Standard, see [ Versions ]. For any errata which may apply to this annex, see [ Errata ]. Contents 1 Introduction Figure 1. Code Point Categories for Identifier Parsing 1.1 Stability Table 1. Permitted Changes in Future Versions 1.2 Customization 1.3 Display Format 1.4 Conformance 1.5 Notation 2 Default Identifiers Table 2. Properties for Lexical Classes for Identifiers 2.1 Combining Marks 2.2 Modifier Letters 2.3 Layout and Format Control Characters 2.4 Specific Character Adjustments Table 3. Optional Characters for Start Table 3a. Optional Characters for Medial Table 3b. Optional Characters for Continue Table 4. Excluded Scripts Table 5. Recommended Scripts Table 6. Aspirational Use Scripts (Withdrawn) Table 7. Limited Use Scripts 2.5 Backward Compatibility 3 Immutable Identifiers 4 Whitespace and Syntax 4.1 Whitespace 4.1.1 Bidirectional Ordering 4.1.2 Required_Spaces 4.1.3 Contexts for Ignorable Format Controls 4.2 Syntax 4.2.1 User-Defined Operators 4.3 Pattern Syntax 5 Normalization and Case 5.1 NFKC Modifications 5.1.1 Modifications for Characters that Behave Like Combining Marks 5.1.2 Modifications for Irregularly Decomposing Characters 5.1.3 Identifier Closure Under Normalization Figure 5. Normalization Closure Figure 6. Case Closure Figure 7. Reverse Normalization Closure Table 8. Compatibility Equivalents to Letters or Decimal Numbers Table 9. Canonical Equivalence Exceptions Prior to Unicode 5.1 5.2 Case and Stability 5.2.1 Edge Cases for Folding 6 Hashtag Identifiers 7 Standard Profiles 7.1 Mathematical Compatibility Notation Profile 7.2 Emoji Profile 7.3 Default Ignorable Exclusion Profile Acknowledgments References Migration Modifications 1 Introduction A common task facing an implementer of the Unicode Standard is the provision of a parsing and/or lexing engine for identifiers, such as programming language variables or domain names. There are also realms where identifiers need to be defined with an extended set of characters to align better with what end users expect, such as in hashtags. To assist in the standard treatment of identifiers in Unicode character-based parsers and lexical analyzers, a set of specifications is provided here as a basis for parsing identifiers that contain Unicode characters. These specifications include: Default Identifiers : a recommended default for the definition of identifiers. Immutable Identifiers : for environments that need a definition of identifiers that does not change across versions of Unicode. Hashtag Identifiers : for identifiers that need a broader set of characters, principally for hashtags. These guidelines follow the typical pattern of identifier syntax rules in common programming languages, by defining an ID_Start class and an ID_Continue class and using a simple BNF rule for identifiers based on those classes; however, the composition of those classes is more complex and contains additional types of characters, due to the universal scope of the Unicode Standard. This annex also provides guidelines for the use of normalization and case insensitivity with identifiers, expanding on a section that was originally in Unicode Standard Annex #15, “Unicode Normalization Forms” [ UAX15 ]. Lexical analysis of computer languages is also concerned with lexical elements other than identifiers, and with white space and line breaks that separate them. This annex provides guidelines for the sets of characters that have such lexical significance outside of identifiers. The specification in this annex provides a definition of identifiers that is guaranteed to be backward compatible with each successive release of Unicode, but also allows any appropriate new Unicode characters to become available in identifiers. In addition, Unicode character properties for stable pattern syntax are provided. The resulting pattern syntax is backward compatible and forward compatible over future versions of the Unicode Standard. These properties can either be used alone or in conjunction with the identifier characters. Figure 1 shows the disjoint categories of code points defined in this annex. (The sizes of the boxes are not to scale.) Figure 1. Code Point Categories for Identifier Parsing ID_Start Characters Pattern_Syntax Characters Unassigned Code Points ID_Nonstart Characters Pattern_White_Space Characters Other Assigned Code Points The set consisting of the union of ID_Start and ID_Nonstart characters is known as Identifier Characters and has the property ID_Continue . The ID_Nonstart set is defined as the set difference ID_Continue minus ID_Start : it is not a formal Unicode property. While lexical rules are traditionally expressed in terms of the latter, the discussion here is simplified by referring to disjoint categories. 1.1 Stability There are certain features that developers can depend on for stability: Identifier characters, Pattern_Syntax characters, and Pattern_White_Space are disjoint: they will never overlap. By definition, the Identifier characters are always a superset of the ID_Start characters. The Pattern_Syntax characters and Pattern_White_Space characters are immutable and will not change over successive versions of Unicode. The ID_Start and ID_Nonstart characters may grow over time, either by the addition of new characters provided in a future version of Unicode or (in rare cases) by the addition of characters that were in Other. In successive versions of Unicode, the only allowed changes of characters from one of the above classes to another are those listed with a plus sign (+) in Table 1. Table 1. Permitted Changes in Future Versions ID_Start ID_Nonstart Other Assigned Unassigned + + + Other Assigned + + ID_Nonstart + The Unicode Consortium has formally adopted a stability policy on identifiers. For more information, see [ Stability ]. 1.2 Customization Each programming language standard has its own identifier syntax; different programming languages have different conventions for the use of certain characters such as $, @, #, and _ in identifiers. To extend such a syntax to cover the full behavior of a Unicode implementation, implementers may combine those specific rules with the syntax and properties provided here. Each programming language can define its identifier syntax as relative to the Unicode identifier syntax, such as saying that identifiers are defined by the Unicode properties, with the addition of “$”. By addition or subtraction of a small set of language specific characters, a programming language standard can easily track a growing repertoire of Unicode characters in a compatible way. See also Section 2.5, Backward Compatibility . Similarly, each programming language can define its own whitespace characters or syntax characters relative to the Unicode Pattern_White_Space or Pattern_Syntax characters, with some specified set of additions or subtractions. Systems that want to extend identifiers to encompass words used in natural languages, or narrow identifiers for security may do so as described in Section 2.3, Layout and Format Control Characters , Section 2.4, Specific Character Adjustments , and Section 5, Normalization and Case . To preserve the disjoint nature of the categories illustrated in Figure 1 , any character added to one of the categories must be subtracted from the others. Note: In many cases there are important security implications that may require additional constraints on identifiers. For more information, see [ UTR36 ]. 1.3 Display Format Implementations may use a format for displaying identifiers that differs from the internal form used to compare identifiers. For example, an implementation might display what the user has entered, but use a normalized format for comparison. Examples of this include: Case. The display format retains case differences, but the comparison format erases them by using Case_Folding. Thus “A” and its lowercase variant “a” would be treated as the same identifier internally, even though they may have been input differently and may display differently. Variants. The display format retains variant distinctions, such as halfwidth versus fullwidth forms, or between variation sequences and their base characters, but the comparison format erases them by using NFKC_Case_Folding. Thus “A” and its full-width variant “Ａ” would be treated as the same identifier internally, even though they may have been input differently and may display differently. For an example of the use of display versus comparison formats see UTS #46: Unicode IDNA Compatibility Processing [ UTS46 ]. For more information about normalization and case in identifiers see Section 5, Normalization and Case . 1.4 Conformance The following describes the possible ways that an implementation can claim conformance to this specification. UAX31-C1 . An implementation claiming conformance to this specification shall identify the version of this specification. Note: An implementation can make use of the property-based definitions from a specific version of this specification with property assignments from an unversioned reference to the Unicode Character Database. In this case, the implementation should specify a minimum version of Unicode for the properties. UAX31-C2 . An implementation claiming conformance to this specification shall describe which of the following requirements it observes: R1. Default Identifiers R1b. Stable Identifiers R2. Immutable Identifiers R3. Pattern_White_Space and Pattern_Syntax Characters R3a. Pattern_White_Space Characters R3b. Pattern_Syntax Characters R3c. Operator Identifiers R4. Equivalent Normalized Identifiers R5. Equivalent Case-Insensitive Identifiers R6. Filtered Normalized Identifiers R7. Filtered Case-Insensitive Identifiers R8. Hashtag Identifiers Note: Requirement R1a has been removed. The characters that were added when meeting this requirement are now part of the default; the contextual checks required by this requirement remain as part of the General Security Profile in Unicode Technical Standard #39, “Unicode Security Mechanisms” [ UTS39 ]. Note: Meeting requirement R3 is equivalent to meeting requirements R3a and R3b. 1.5 Notation This annex uses UnicodeSet notation to illustrate the derivation of some properties or sets of characters. This notation is defined in the “Unicode Sets” section of UTS #35, Unicode Locale Data Markup Language [ UTS35 ]. 2 Default Identifiers The formal syntax provided here captures the general intent that an identifier consists of a string of characters beginning with a letter or an ideograph, and followed by any number of letters, ideographs, digits, or underscores. It provides a definition of identifiers that is guaranteed to be backward compatible with each successive release of Unicode, but also adds any appropriate new Unicode characters. The formulations allow for extensions, also known as profiles . That is, the particular set of code points or sequences of code points for each category used by the syntax can be customized according to the requirements of the environment. Profiles are described as additions to or removals from the categories used by the syntax. They can thus be combined, provided that there are no conflicts (whereby one profile adds a character and another removes it), or that the resolution of such conflicts is specified. If such extensions include characters from Pattern_White_Space or Pattern_Syntax, then such identifiers do not conform to an unmodified UAX31-R3 Pattern_White_Space and Pattern_Syntax Characters . However, such extensions may often be necessary. For example, Java and C++ identifiers include ‘$’, which is a Pattern_Syntax character. UAX31-D1 . Default Identifier Syntax: <Identifier> := <Start> <Continue>* (<Medial> <Continue>+)* Identifiers are defined by assigning the sets of lexical classes defined as properties in the Unicode Character Database [ UAX44 ]. These properties are shown in Table 2 . The first column shows the property name, whose values are defined in the UCD. The second column provides a general description of the coverage for the associated class, the derivational relationship between the ID properties and the XID properties, and an associated UnicodeSet notation for the class. Table 2. Properties for Lexical Classes for Identifiers Properties General Description of Coverage ID_Start ID_Start characters are derived from the Unicode General_Category of uppercase letters, lowercase letters, titlecase letters, modifier letters, other letters, letter numbers, plus Other_ID_Start, minus Pattern_Syntax and Pattern_White_Space code points. In UnicodeSet notation: [\p{L}\p{Nl}\p{Other_ID_Start}-\p{Pattern_Syntax}-\p{Pattern_White_Space}] XID_Start XID_Start characters are derived from ID_Start as per Section 5.1, NFKC Modifications . ID_Continue ID_Continue characters include ID_Start characters, plus characters having the Unicode General_Category of nonspacing marks, spacing combining marks, decimal number, connector punctuation, plus Other_ID_Continue, minus Pattern_Syntax and Pattern_White_Space code points. In UnicodeSet notation: [\p{ID_Start}\p{Mn}\p{Mc}\p{Nd}\p{Pc}\p{Other_ID_Continue}-\p{Pattern_Syntax}-\p{Pattern_White_Space}] XID_Continue XID_Continue characters are derived from ID_Continue as per Section 5.1, NFKC Modifications . XID_Continue characters are also known simply as Identifier Characters , because they are a superset of the XID_Start characters. Note that “other letters” includes ideographs. For more about the stability extensions, see Section 2.5 Backward Compatibility . The innovations in the identifier syntax to cover the Unicode Standard include the following: Incorporation of proper handling of combining marks. Allowance for layout and format control characters, which should be ignored when parsing identifiers. The XID_Start and XID_Continue properties are improved lexical classes that incorporate the changes described in Section 5.1, NFKC Modifications . They are recommended for most purposes, especially for security, over the original ID_Start and ID_Continue properties. UAX31-R1 . Default Identifiers: To meet this requirement, to determine whether a string is an identifier an implementation shall choose either UAX31-R1-1 or UAX31-R1-2 . UAX31-R1-1 . Use definition UAX31-D1 , setting Start and Continue to the properties XID_Start and XID_Continue, respectively, and leaving Medial empty. UAX31-R1-2 . Declare that it uses a profile of UAX31-R1-1 and define that profile with a precise specification of the characters and character sequences that are added to or removed from Start, Continue, and Medial and/or provide a list of additional constraints on identifiers. Note: Such a specification may incorporate a reference to one or more of the standard profiles described in Section 7, Standard Profiles . One such profile may be to use the contents of ID_Start and ID_Continue in place of XID_Start and XID_Continue, for backward compatibility. Another such profile would be to include some set of the optional characters, for example: Start := XID_Start, plus some characters from Table 3 Continue := Start + XID_Continue, plus some characters from Table 3b Medial := some characters from Table 3a Note: Characters in the Medial class must not overlap with those in either the Start or Continue classes. Thus, any characters added to the Medial class from Table 3a must be be checked to ensure they do not also occur in either the newly defined Start class or Continue class. Beyond such minor modifications, profiles could also be used to significantly extend the character set available in identifiers. In so doing, care must be taken not to unintentionally include undesired characters, or to violate important invariants. An implementation should be careful when adding a property-based set to a profile. For example, consider a profile that adds subscript and superscript digits and operators in order to support technical notations, such as: Context Example Identifier Assyriology dun₃⁺ Chemistry Ca²⁺_concentration Mathematics xₖ₊₁ or f⁽⁴⁾ Phonetics daan⁶ That profile may be described as adding the following set to XID_Continue: [⁽₍⁾₎⁺₊⁼₌⁻₋⁰₀¹₁²₂³₃⁴₄⁵₅⁶₆⁷₇⁸₈⁹₉] . Note: The above list is for illustration only. A standard profile is provided to support the use of Mathematical Compatibility Notation Profile in identifiers. See Section 7.1, Mathematical Compatibility Notation Profile . If, instead of listing these characters explicitly, the profile had chosen to use properties or combinations of properties, that might result in including undesired characters. For example, \p{General_Category=Other_Number} is the general category set containing the subscript and superscript digits. But it also includes the compatibility characters [ ⑴ 🄂 ⒈ ], which are not needed for technical notations, and are very likely inappropriate for identifiers—on multiple counts. On the other hand, a language that allows currency symbols in identifiers could have \p{General_Category=Currency_Symbol} as a profile, since that property matches the intent. Similarly, a profile based on adding entire blocks is likely to include unintended characters, or to miss ones that are desired. For the use of blocks see Annex A, Character Blocks , in [ UTS18 ]. Defining a profile by use of a property also needs to take account of the fact that unless the property is designed to be stable (such as XID_Continue), code points could be removed in a future version of Unicode. If the profile also needs stable identifiers (backwards compatible), then it must take additional measures. See UAX31-R1b Stable Identifiers . Implementations that require identifier closure under normalization should ensure that any custom profile preserves identifier closure under the chosen normalization form. See Section 5.1.3, Identifier Closure Under Normalization . The example cited above regarding subscripts and superscripts preserves identifier closure under Normalization Forms C and D, but not under Forms KC and KD. Under NFKC and NFKD, the subscript and superscript parentheses and operators normalize to their ASCII counterparts. If an implementation that uses this profile relies on identifier closure under normalization, it should conform to UAX31-R4 using NFC, not NFKC. Note: While default identifiers are less open-ended than immutable identifiers, they are still subject to spoofing issues arising from invisible characters, visually identical characters, or bidirectional reordering causing distinct sequences to appear in the same order. Where spoofing concerns are relevant, the mechanisms described in Unicode Technical Standard #39, “Unicode Security Mechanisms” [ UTS39 ], should be used. For the specific case of programming languages and programming environments, recommendations are provided in Unicode Technical Standard #55, “Unicode Source Code Handling” [ UTS55 ]. UAX31-R1a . Restricted Format Characters: This clause has been removed. The characters that were added when meeting this requirement are now part of the default; the contextual checks required by this requirement remain as part of the General Security Profile in Unicode Technical Standard #39, “Unicode Security Mechanisms” [ UTS39 ]. UAX31-R1b . Stable Identifiers: To meet this requirement, an implementation shall guarantee that identifiers are stable across versions of the Unicode Standard: that is, once a string qualifies as an identifier, it does so in all future versions of the Unicode Standard. Note: The UAX31-R1b requirement is relevant when an identifier definition is based on property assignments from an unversioned reference to the Unicode Standard, as property assignments may change in a future version of the standard. It is typically achieved by using a small list of characters that qualified as identifier characters in some previous version of Unicode. See Section 2.5, Backward Compatibility . Where profiles are allowed, management of those profiles may also be required to guarantee backwards compatibility. Typically such management also uses a list of characters that qualified previously. Because of the stability policy [ Stability ], if an implementation meets either requirement UAX31-R1 or UAX31-R2 without declaring a profile, that implementation also meets requirement UAX31-R1b. Example: Consider an identifier definition which uses UAX31-R1 default identifiers with a profile that adds digits (characters with General_Category=Nd) to the set Start , and uses an unversioned reference to the Unicode Character Database, with a minimum version of 5.2.0. With property assignments from Unicode Version 5.2.0, both ᧚ (U+19DA) and A᧚ (U+0041, U+19DA) are valid identifiers under this definition: U+19DA has General_Category=Nd. In Unicode Version 6.0.0, U+19DA has General_Category=No. The identifier A᧚ (U+0041, U+19DA) remains valid, because XID_Continue includes any characters that used to be XID_Continue. However, ᧚ is not a valid identifier, because U+19DA is no longer in the set [:Nd:]. In order to meet requirement UAX31-R1b , the definition would need to be changed to add to the set Start all characters that have the property General_Category=Nd in any version of Unicode starting from Unicode 5.2.0 and up to the version used by the implementation. 2.1 Combining Marks Combining marks are accounted for in identifier syntax: a composed character sequence consisting of a base character followed by any number of combining marks is valid in an identifier. Combining marks are required in the representation of many languages, and the conformance rules in Chapter 3, Conformance , of [ Unicode ] require the interpretation of canonical-equivalent character sequences. The simplest way to do this is to require identifiers in the NFC format (or transform them into that format); see Section 5, Normalization and Case . Enclosing combining marks (such as U+20DD..U+20E0) are excluded from the definition of the lexical class ID_Continue , because the composite characters that result from their composition with letters are themselves not normally considered valid constituents of these identifiers. 2.2 Modifier Letters Modifier letters (General_Category=Lm) are also included in the definition of the syntax classes for identifiers. Modifier letters are often part of natural language orthographies and are useful for making word-like identifiers in formal languages. On the other hand, modifier symbols (General_Category=Sk), which are seldom a part of language orthographies, are excluded from identifiers. For more discussion of modifier letters and how they function, see [ Unicode ]. Implementations that tailor identifier syntax for special purposes may wish to take special note of modifier letters, as in some cases modifier letters have appearances, such as raised commas, which may be confused with common syntax characters such as quotation marks. 2.3 Layout and Format Control Characters Certain Unicode characters are known as Default_Ignorable_Code_Points. These include variation selectors and characters used to control joining behavior, bidirectional ordering control, and alternative formats for display (having the General_Category value of Cf). The use of default-ignorable characters in identifiers is problematic, first because the effects they represent are stylistic or otherwise out of scope for identifiers, and second because the characters themselves often have no visible display. It is also possible to misapply these characters such that users can create strings that look the same but actually contain different characters, which can create security problems. In environments where spoofing concerns are paramount, such as top-level domain names, identifiers should also be limited to characters that are case-folded and normalized with the NFKC_Casefold operation. For more information, see Section 5, Normalization and Case and UTR #36: Unicode Security Considerations [ UTR36 ]. While not all Default_Ignorable_Code_Points are in XID_Continue, the variation selectors and joining controls are included in XID_Continue. These variation selectors are used in standardized variation sequences, sequences from the Ideographic Variation Database, and emoji variation sequences. The joining controls are used in the orthographies of some languages, as well as in emoji ZWJ sequences. However, these characters are subject to the same considerations as other Default_Ignorable_Code_Points listed above. Because variation selectors and joining controls request a difference in display but do not guarantee it, they do not work well in general-purpose identifiers. A profile should be used to remove them from general-purpose identifiers (along with other Default_Ignorable_Code_Points), unless their use is required in a particular domain, such as in a profile that includes emoji. For such a profile it may be useful to explicitly retain or even add certain Default_Ignorable_Code_Points in the identifier syntax. For programming language identifiers, spoofing issues are more comprehensively addressed by higher-level diagnostics rather than at the syntactic level. See Unicode Technical Standard #55, “Unicode Source Code Handling” [ UTS55 ]. Comparison. In any environment where the display form for identifiers differs from the form used to compare them, Default_Ignorable_Code_Points should be ignored for comparison. For example, this applies to case-insensitive identifiers. For more information, see Section 1.3, Display Format . Notes: An implementation of UAX31-R4 and UAX31-R5 (Equivalent Case and Compatibility-Insensitive Identifiers) that compares identifiers under the identifier caseless match defined by D147 [ Unicode ], that is, canonical decomposition (NFD) followed by the toNFKC_Casefold operation, ignores Default_Ignorable_Code_Points. The Default_Ignorable_Code_Point property values are not guaranteed to be stable. However, the derivation of the NFKC_Casefold property will be changed if necessary to ensure that it remains stable for default identifiers. That means that the toNFKC_Casefold operation applied to a string with only characters in XID_Continue in a version of Unicode will have the same results in any future version of Unicode. In addition, a standard profile is provided to exclude all Default_Ignorable_Code_Points; see Section 7, Standard Profiles . Note however that, even if Default_Ignorable_Code_Points are excluded, spoofing issues remain unless the mechanisms in Unicode Technical Standard #39, “Unicode Security Mechanisms” [ UTS39 ] are utilized. The General Security Profile defined in Section 3.1, General Security Profile for Identifiers, in UTS #39, Unicode Security Mechanisms [ UTS39 ], excludes all Default_Ignorable_Code_Points by default, including variation selectors. 2.4 Specific Character Adjustments Specific identifier syntaxes can be treated as tailorings (or profiles ) of the generic syntax based on character properties. For example, SQL identifiers allow an underscore as an identifier continue, but not as an identifier start; C identifiers allow an underscore as either an identifier continue or an identifier start. Specific languages may also want to exclude the characters that have a Decomposition_Type other than Canonical or None, or to exclude some subset of those, such as those with a Decomposition_Type equal to Font. There are circumstances in which identifiers are expected to more fully encompass words or phrases used in natural languages. For more natural-language identifiers, a profile should allow the characters in Table 3 , Table 3a , and Table 3b in identifiers, unless there are compelling reasons not to. Most additions to identifiers are restricted to medial positions. These are listed in Table 3a . A few characters can also occur in final positions, and are listed in Table 3b . The contents of these tables may overlap. In some environments even spaces and @ are allowed in identifiers, such as in SQL: SELECT * FROM Employee Pension. Table 3. Optional Characters for Start Code Point Character Name 0024 $ DOLLAR SIGN 005F _ LOW LINE Table 3a. Optional Characters for Medial Code Point Character Name 0027 ' APOSTROPHE 002D - HYPHEN-MINUS 002E . FULL STOP 003A : COLON 058A ֊ ARMENIAN HYPHEN 05F4 ״ HEBREW PUNCTUATION GERSHAYIM 0F0B ་ TIBETAN MARK INTERSYLLABIC TSHEG 2010 ‐ HYPHEN 2019 ’ RIGHT SINGLE QUOTATION MARK 2027 ‧ HYPHENATION POINT 30A0 ゠ KATAKANA-HIRAGANA DOUBLE HYPHEN Table 3b. Optional Characters for Continue Code Point Character Name 05F3 ׳ HEBREW PUNCTUATION GERESH In UnicodeSet notation, the characters in these tables are: Table 3: [\$_] Table 3a: ['\-.\:֊״་‐’‧゠・] Table 3b: [ ׳] In identifiers that allow for unnormalized characters, the compatibility equivalents of the characters listed in Table 3 , Table 3a , and Table 3b may also be appropriate. For more information on characters that may occur in words, and those that may be used in name validation, see Section 4, Word Boundaries , in [ UAX29 ]. Some scripts are not in customary modern use, and thus implementations may want to exclude them from identifiers. These include historic and obsolete scripts, scripts used mostly liturgically, and regional scripts used only in very small communities or with very limited current usage. Some scripts also have unresolved architectural issues that make them currently unsuitable for identifiers. The scripts in Table 4, Excluded Scripts are recommended for exclusion from identifiers. Table 4. Excluded Scripts Property Notation Description \p{script=Aghb} Caucasian Albanian \p{script=Ahom} Ahom \p{script=Armi} Imperial Aramaic \p{script=Avst} Avestan \p{script=Bass} Bassa Vah \p{script=Berf} Beria Erfe \p{script=Bhks} Bhaiksuki \p{script=Brah} Brahmi \p{script=Bugi} Buginese \p{script=Buhd} Buhid \p{script=Cari} Carian \p{script=Chrs} Chorasmian \p{script=Copt} Coptic \p{script=Cpmn} Cypro-Minoan \p{script=Cprt} Cypriot \p{script=Diak} Dives Akuru \p{script=Dogr} Dogra \p{script=Dsrt} Deseret \p{script=Dupl} Duployan \p{script=Egyp} Egyptian Hieroglyphs \p{script=Elba} Elbasan \p{script=Elym} Elymaic \p{script=Gara} Garay \p{script=Glag} Glagolitic \p{script=Gong} Gunjala Gondi \p{script=Gonm} Masaram Gondi \p{script=Goth} Gothic \p{script=Gran} Grantha \p{script=Gukh} Gurung Khema \p{script=Hano} Hanunoo \p{script=Hatr} Hatran \p{script=Hluw} Anatolian Hieroglyphs \p{script=Hmng} Pahawh Hmong \p{script=Hung} Old Hungarian \p{script=Ital} Old Italic \p{script=Kawi} Kawi \p{script=Khar} Kharoshthi \p{script=Khoj} Khojki \p{script=Kits} Khitan Small Script \p{script=Krai} Kirat Rai \p{script=Kthi} Kaithi \p{script=Lina} Linear A \p{script=Linb} Linear B \p{script=Lyci} Lycian \p{script=Lydi} Lydian \p{script=Maka} Makasar \p{script=Mahj} Mahajani \p{script=Mani} Manichaean \p{script=Marc} Marchen \p{script=Medf} Medefaidrin \p{script=Mend} Mende Kikakui \p{script=Merc} Meroitic Cursive \p{script=Mero} Meroitic Hieroglyphs \p{script=Modi} Modi \p{script=Mong} Mongolian \p{script=Mroo} Mro \p{script=Mult} Multani \p{script=Nagm} Nag Mundari \p{script=Narb} Old North Arabian \p{script=Nand} Nandinagari \p{script=Nbat} Nabataean \p{script=Nshu} Nushu \p{script=Ogam} Ogham \p{script=Onao} Ol Onal \p{script=Orkh} Old Turkic \p{script=Osma} Osmanya \p{script=Ougr} Old Uyghur \p{script=Palm} Palmyrene \p{script=Pauc} Pau Cin Hau \p{script=Perm} Old Permic \p{script=Phag} Phags-pa \p{script=Phli} Inscriptional Pahlavi \p{script=Phlp} Psalter Pahlavi \p{script=Phnx} Phoenician \p{script=Prti} Inscriptional Parthian \p{script=Rjng} Rejang \p{script=Runr} Runic \p{script=Samr} Samaritan \p{script=Sarb} Old South Arabian \p{script=Sgnw} SignWriting \p{script=Shaw} Shavian \p{script=Shrd} Sharada \p{script=Sidd} Siddham \p{script=Sidt} Sidetic \p{script=Sind} Khudawadi \p{script=Sora} Sora Sompeng \p{script=Sogd} Sogdian \p{script=Sogo} Old Sogdian \p{script=Soyo} Soyombo \p{script=Sunu} Sunuwar \p{script=Tagb} Tagbanwa \p{script=Takr} Takri \p{script=Tang} Tangut \p{script=Tayo} Tai Yo \p{script=Tglg} Tagalog \p{script=Tirh} Tirhuta \p{script=Tnsa} Tangsa \p{script=Todr} Todhri \p{script=Tols} Tolong Siki \p{script=Toto} Toto \p{script=Tutg} Tulu-Tigalari \p{script=Ugar} Ugaritic \p{script=Vith} Vithkuqi \p{script=Wara} Warang Citi \p{script=Xpeo} Old Persian \p{script=Xsux} Cuneiform \p{script=Yezi} Yezidi \p{script=Zanb} Zanabazar Square Some characters used with recommended scripts may still be problematic for identifiers, for example because they are part of extensions that are not in modern customary use, and thus implementations may want to exclude them from identifiers. These include characters for historic and obsolete orthographies, characters used mostly liturgically, and in orthographies for languages used only in very small communities or with very limited current or declining usage. Some characters also have architectural issues that may make them unsuitable for identifiers. See UTS #39, Unicode Security Mechanisms [ UTS39 ] for more information. The scripts listed in Table 5, Recommended Scripts are generally recommended for use in identifiers. These are in widespread modern customary use, or are regional scripts in modern customary use by large communities. Note: The Tibetan script is included in the list of recommended scripts because the language and its script are in widespread common use. However, implementers should be aware that the vertical stacking nature of Tibetan, unless constrained by additional rules, may lead to difficulties viewing an identifier in user interface elements such as address or status bars. In addition, at the current time, the script has not been as carefully vetted or seen as much practical experience when deployed for identifiers in security-relevant contexts as is the case for the other recommended scripts. Table 5. Recommended Scripts Property Notation Description \p{script=Zyyy} Common \p{script=Zinh} Inherited \p{script=Arab} Arabic \p{script=Armn} Armenian \p{script=Beng} Bengali \p{script=Cyrl} Cyrillic \p{script=Deva} Devanagari \p{script=Ethi} Ethiopic \p{script=Geor} Georgian \p{script=Grek} Greek \p{script=Gujr} Gujarati \p{script=Guru} Gurmukhi \p{script=Hang} Hangul \p{script=Hani} Han \p{script=Hebr} Hebrew \p{script=Hira} Hiragana \p{script=Kana} Katakana \p{script=Knda} Kannada \p{script=Khmr} Khmer \p{script=Laoo} Lao \p{script=Latn} Latin \p{script=Mlym} Malayalam \p{script=Mymr} Myanmar \p{script=Orya} Oriya \p{script=Sinh} Sinhala \p{script=Taml} Tamil \p{script=Telu} Telugu \p{script=Thaa} Thaana \p{script=Thai} Thai \p{script=Tibt} Tibetan As of Unicode 10.0, there is no longer a distinction between aspirational use and limited use scripts, as this has not proven to be productive for the derivation of identifier-related classes used in security profiles. (See UTS #39, Unicode Security Mechanisms [ UTS39 ].) Thus the aspirational use scripts in Table 6, Aspirational Use Scripts have been recategorized as Limited Use and moved to Table 7, Limited Use Scripts . Table 6. Aspirational Use Scripts (Withdrawn) Property Notation Description intentionally blank Modern scripts that are in more limited use are listed in Table 7, Limited Use Scripts . To avoid security issues, some implementations may wish to disallow the limited-use scripts in identifiers. For more information on usage, see the Unicode Locale project [ CLDR ]. Note: Since Unicode 17, the Bopomofo script is listed as a Limited Use script. It is widely used, but mainly for educational purposes, not for the full range of “everyday” common uses. Table 7. Limited Use Scripts Property Notation Description \p{script=Adlm} Adlam \p{script=Bali} Balinese \p{script=Bamu} Bamum \p{script=Batk} Batak \p{script=Bopo} Bopomofo \p{script=Cakm} Chakma \p{script=Cans} Canadian Aboriginal Syllabics \p{script=Cham} Cham \p{script=Cher} Cherokee \p{script=Hmnp} Nyiakeng Puachue Hmong \p{script=Java} Javanese \p{script=Kali} Kayah Li \p{script=Lana} Tai Tham \p{script=Lepc} Lepcha \p{script=Limb} Limbu \p{script=Lisu} Lisu \p{script=Mand} Mandaic \p{script=Mtei} Meetei Mayek \p{script=Newa} Newa \p{script=Nkoo} Nko \p{script=Olck} Ol Chiki \p{script=Osge} Osage \p{script=Plrd} Miao \p{script=Rohg} Hanifi Rohingya \p{script=Saur} Saurashtra \p{script=Sund} Sundanese \p{script=Sylo} Syloti Nagri \p{script=Syrc} Syriac \p{script=Tale} Tai Le \p{script=Talu} New Tai Lue \p{script=Tavt} Tai Viet \p{script=Tfng} Tifinagh \p{script=Vaii} Vai \p{script=Wcho} Wancho \p{script=Yiii} Yi This is the recommendation as of the current version of Unicode; as new scripts are added to future versions of Unicode, characters and scripts may be added to Tables 4 , 5 , and 7 . Scripts may also be moved from one table to another as more information becomes available. There are a few special cases: The Common and Inherited script values [\p{script=Zyyy}\p{script=Zinh}] are used widely with other scripts, rather than being scripts per se. See also the Script_Extensions property in the Unicode Character Database [ UAX44 ]. The Unknown script \p{script=Zzzz} is used for Unassigned characters. Braille \p{script=Brai} consists only of symbols Katakana_Or_Hiragana \p{script=Hrkt} is empty. This value was used in earlier versions, but is no longer used. With respect to the scripts Balinese, Cham, Ol Chiki, Vai, Kayah Li, and Saurashtra, there may be large communities of people speaking an associated language, but the script itself is not in widespread use. However, there are significant revival efforts. Bopomofo is used primarily in education. For programming language identifiers, normalization and case have a number of important implications. For a discussion of these issues, see Section 5, Normalization and Case . 2.5 Backward Compatibility Unicode General_Category values are kept as stable as possible, but they can change across versions of the Unicode Standard. The bulk of the characters having a given value are determined by other properties, and the coverage expands in the future according to the assignment of those properties. In addition, the Other_ID_Start property provides a small list of characters that qualified as ID_Start characters in some previous version of Unicode solely on the basis of their General_Category properties, but that no longer qualify in the current version. The Other_ID_Start property includes characters such as the following: U+2118 ( ℘ ) SCRIPT CAPITAL P U+212E ( ℮ ) ESTIMATED SYMBOL U+309B ( ゛ ) KATAKANA-HIRAGANA VOICED SOUND MARK U+309C ( ゜ ) KATAKANA-HIRAGANA SEMI-VOICED SOUND MARK Similarly, the Other_ID_Continue property adds a small list of characters that qualified as ID_Continue characters in some previous version of Unicode solely on the basis of their General_Category properties, but that no longer qualify in the current version. The Other_ID_Continue property includes characters such as the following: U+1369 ETHIOPIC DIGIT ONE...U+1371 ETHIOPIC DIGIT NINE U+00B7 ( · ) MIDDLE DOT U+0387 ( · ) GREEK ANO TELEIA U+19DA ( ᧚ ) NEW TAI LUE THAM DIGIT ONE The exact list of characters covered by the Other_ID_Start and Other_ID_Continue properties depends on the version of Unicode. For more information, see Unicode Standard Annex #44, “Unicode Character Database” [ UAX44 ]. The Other_ID_Start and Other_ID_Continue properties are thus designed to ensure that the Unicode identifier specification is backward compatible. Any sequence of characters that qualified as an identifier in some version of Unicode will continue to qualify as an identifier in future versions. If a specification tailors the Unicode recommendations for identifiers, then this technique can also be used to maintain backwards compatibility across versions. 3 Immutable Identifiers The disadvantage of working with the lexical classes defined previously is the storage space needed for the detailed definitions, plus the fact that with each new version of the Unicode Standard new characters are added, which an existing parser would not be able to recognize. In other words, the recommendations based on that table are not upwardly compatible. This problem can be addressed by turning the question around. Instead of defining the set of code points that are allowed, define a small, fixed set of code points that are reserved for syntactic use and allow everything else (including unassigned code points) as part of an identifier. All parsers written to this specification would behave the same way for all versions of the Unicode Standard, because the classification of code points is fixed forever. The drawback of this method is that it allows “nonsense” to be part of identifiers because the concerns of lexical classification and of human intelligibility are separated. Human intelligibility can, however, be addressed by other means, such as usage guidelines that encourage a restriction to meaningful terms for identifiers. For an example of such guidelines, see the XML specification by the W3C, Version 1.0 5th Edition or later [ XML ]. By increasing the set of disallowed characters, a reasonably intuitive recommendation for identifiers can be achieved. This approach uses the full specification of identifier classes, as of a particular version of the Unicode Standard, and permanently disallows any characters not recommended in that version for inclusion in identifiers. All code points unassigned as of that version would be allowed in identifiers, so that any future additions to the standard would already be accounted for. This approach ensures both upwardly compatible identifier stability and a reasonable division of characters into those that do and do not make human sense as part of identifiers. With or without such fine-tuning, such a compromise approach still incurs the expense of implementing large lists of code points. While they no longer change over time, it is a matter of choice whether the benefit of enforcing somewhat word-like identifiers justifies their cost. Alternatively, one can use the properties described below and allow all sequences of characters to be identifiers that are neither Pattern_Syntax nor Pattern_White_Space. This has the advantage of simplicity and small tables, but allows many more “unnatural” identifiers. UAX31-R2 . Immutable Identifiers: To meet this requirement, an implementation shall choose either UAX31-R2-1 or UAX31-R2-2 . UAX31-R2-1 . Define identifiers to be any non-empty string of characters that contains no character having any of the following property values: Pattern_White_Space=True Pattern_Syntax=True General_Category=Private_Use, Surrogate, or Control Noncharacter_Code_Point=True UAX31-R2-2 . Declare that it uses a profile of UAX31-R2-1 and define that profile with a precise specification of the characters and character sequences that are added to or removed from the sets of code points defined by these properties and/or provide a list of additional constraints on identifiers. Note: The expectation from an implementation meeting requirement UAX31-R2 Immutable Identifiers is that it will never change its definition of identifiers; in particular, that it will not switch to UAX31-R1 Default Identifiers. However, the downsides of normalization issues and the inapplicability of measures guarding against spoofing attacks may warrant such a change in definition. In such circumstances, a profile should be used to extend XID_Start and XID_Continue to cover likely existing usages. See Section 3.3, Language Evolution , in Unicode Technical Standard #55, “Unicode Source Code Handling” [ UTS55 ]. In its profile, a specification can define identifiers to be more in accordance with the Unicode identifier definitions at the time the profile is adopted, while still allowing for strict immutability. For example, an implementation adopting a profile after a particular version of Unicode is released (such as Unicode 5.0) could define the profile as follows: All characters satisfying UAX31-R1 Default Identifiers according to Unicode 5.0 Plus all code points unassigned in Unicode 5.0 that do not have the property values specified in UAX31-R2 Immutable Identifiers . This technique allows identifiers to have a more natural format—excluding symbols and punctuation already defined—yet also provides absolute code point immutability. Immutable identifiers are intended for those cases (like XML) that cannot update across versions of Unicode, and do not require information about normalization form, or properties such as General_Category and Script. Immutable identifers that allow unassigned characters cannot provide for normalization forms or these properties, which means that they: cannot be compared for NFC, NFKC, or case-insensitive equality are unsuitable for restrictions such as those in UTS #39 For best practice, a profile disallowing unassigned characters should be provided where possible. Specifications should also include guidelines and recommendations for those creating new identifiers. Although UAX31-R2 Immutable Identifiers permits a wide range of characters, as a best practice identifiers should be in the format NFKC, without using any unassigned characters. For more information on NFKC, see Unicode Standard Annex #15, “Unicode Normalization Forms” [ UAX15 ]. 4 Whitespace and Syntax Most programming languages have a concept of whitespace as part of their lexical structure, as well as some set of characters that are disallowed in identifiers but have syntactic use, such as arithmetic operators. Beyond general programming languages, there are also many circumstances where software interprets patterns that are a mixture of literal characters, whitespace, and syntax characters. Examples include regular expressions, Java collation rules, Excel or ICU number formats, and many others. In the past, regular expressions and other formal languages have been forced to use clumsy combinations of ASCII characters for their syntax. As Unicode becomes ubiquitous, some of these will start to use non-ASCII characters for their syntax: first as more readable optional alternatives, then eventually as the standard syntax. For forward and backward compatibility, it is advantageous to have a fixed set of whitespace and syntax code points. This follows the recommendations that the Unicode Consortium has made regarding completely stable identifiers, and the practice that is seen in XML 1.0, 5th Edition or later [ XML ]. (In particular, the Unicode Consortium is committed to not allocating characters suitable for identifiers in the range U+2190..U+2BFF, which is being used by XML 1.0, 5th Edition.) As of Unicode 4.1, two Unicode character properties are defined to provide for stable syntax: Pattern_White_Space and Pattern_Syntax. Particular languages may, of course, override these recommendations, for example, by adding or removing other characters for compatibility with ASCII usage. For stability, the values of these properties are absolutely invariant, not changing with successive versions of Unicode. Of course, this does not limit the ability of the Unicode Standard to encode more symbol or whitespace characters, but the default sets of syntax and whitespace code points recommended for use in computer languages will not change. UAX31-R3 . Pattern_White_Space and Pattern_Syntax Characters: To meet this requirement, an implementation shall meet both UAX31-R3a and UAX31-R3b . Note: When meeting requirement UAX31-R3 with no profile, all characters except those tha | 2026-01-13T09:29:14 |
https://deterministic.space | Pascal’s scribbles - Pascal’s Scribbles Pascal’s scribbles A bunch of notes on various topics (probably mostly programming-related). Some are more, some are less well written. Many will just be crazy ideas I had in the shower and needed to write down. I won’t guarantee that all of this makes sense. More about me. You can also follow me on Mastodon or on Bluesky . You can find the source of this website on Github , where you can also open issues to discuss the posts. Posts Rust BufWriter and LZ4 Compression rust --> The Rust features that make Bevy’s systems work rust bevy --> How Bevy uses Rust traits for labeling rust bevy --> Long-form Texts on Interesting Details of Computers Cheap tricks for high-performance Rust rust --> Return-type based dispatch rust --> Notes on proper systemd services systemd linux --> How to order Rust code rust --> Rust 2019 rust --> Serve archived static files over HTTP tools rust --> The Secret Life of Cows rust --> quicli - The ideas behind my small Rust CLI framework rust --> Rust 2018 rust --> Passing Functions as Parameters in Ruby ruby programming --> Conferences 2018 conferences --> Learning Programming Concepts by Jumping in at the Deep End programming teaching rust --> 5 Tips for Writing Small CLI Tools in Rust rust --> Diesel.rs Trick: Treat View as Table rust --> Conferences 2017 How to implement a trait for &str and &[&str] rust --> Rust Concurrency Libraries rust --> A way to customize Rust error messages rust idea --> Idea: cargo-giftwrap - giving the gift awesome Rust libraries rust idea --> Programming Wisdom tech incomplete --> Teaching libraries through good documentation rust --> Programming cross-pollination with Rust and Ruby rust programming incomplete --> Pascal vs. USB-C tech --> No biggie Markdown slideshows idea --> Trait Driven Development in Rust rust --> Zero-cost abstractions in web frontend dev tech webdev incomplete --> Rust IDE Features Wishlist rust --> I tech --> Research paper organization academia idea --> README-driven Development tech --> Machine Readable Inline Markdown Code Documentation rust --> Rust's ownership and borrowing in 150 words rust --> Rich diffs of rendered HTML idea --> A sane admin panel for Silicon Zucchini idea webdev incomplete --> Hidden treasures of the Rust ecosystem rust list --> Compile-time website checking idea webdev --> Virtual DOM for CLI and libui rust idea --> Elegant Library APIs in Rust rust writing incomplete --> Twitter-bot-driven twitter bot idea --> Things to rewrite in Rust rust --> Cards against compilers JS-less photo grids with `display: flex` incomplete css --> Symbol Pronounciation The fn key idea --> Car-driven music generator idea --> Paper Plane iPhone Game idea app --> Story with Non-Coherent Time idea writing --> Public Domain Me Post Mortem Glue You Can Break Using Microwaves idea hardware --> Digital Information Management As I Would Like It To Be idea --> RSS feed / Follow me on Mastodon / Follow me on Bluesky © Copyright 2025 Pascal Hertleif / Imprint | 2026-01-13T09:29:14 |
https://www.linkedin.com/signup/cold-join?session_redirect=%2Fservices%2Fproducts%2Fmogi-i-o-liveu%2F&trk=products_details_guest_nav-header-join | Sign Up | LinkedIn Make the most of your professional life Not you? Remove photo Join LinkedIn To create a LinkedIn account, you must understand how LinkedIn processes your personal information by selecting learn more for each item listed. Agree to all terms We collect and use personal information. Learn more We share personal information with third parties to provide our services. Learn more Further information is available in our Korea Privacy Addendum . Privacy Policy Addendum 1 of 2 2 of 2 Agree to the term Continue Back Agree to all terms Email Password Show First name Last name By clicking Agree & Join, you agree to the LinkedIn User Agreement , Privacy Policy , and Cookie Policy . Agree & Join or Security verification Already on LinkedIn? Sign in Looking to create a page for a business? Get help LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) Language | 2026-01-13T09:29:14 |
https://docs.collab.land/help-docs/miniapps/#docusaurus_skipToContent_fallback | Miniapps | Collab.Land Documentation Skip to main content Collab.Land Documentation Members & Admins ctrl K Introduction Key Features Setting Up the Bot Command Center Miniapps Getting started Miniapps Wallets Bot Errors FAQs Miniapps On this page Miniapps Miniapps are extensions and add-ons developed by third party teams as well as built internally by Collab.Land. They enable community admins to enhance their community with new features. Overview The Command Center Miniapps section is an extension of the Command Center that showcases add-ons developed by third party teams, and apps built internally by Collab.Land. It provides community admins with the ability to view, install, and uninstall apps to enhance their community with previously unavailable features. note View the Miniapps overview video on the Collab.Land youtube channel. Empowering Community Admins CollabLand's Miniapps are designed to empower community admins to unlock the full potential of their community. With an extensive collection of apps, admins can add new capabilities and features, such as complex TGRs (Role Composition) and Snapshot, that enhance their community's functionality. With the ease of updating installed Miniapps through the Command Center, admins can ensure their community always has access to the latest features and functionalities. If you are looking to expand your community's capabilities, this is the tool you need to get the job done. 📄️ Getting started Browse & Install apps 🗃️ Miniapps 6 items Previous Community Roles Next Getting started Overview Empowering Community Admins Privacy Policy Terms of Service Collab.Land® 2025 | 2026-01-13T09:29:14 |
https://www.eff.org/document/hacking-patent-system-2016#main-content | Hacking the Patent System (2016) | Electronic Frontier Foundation Skip to main content About Contact Press People Opportunities EFF's 35th Anniversary Issues Free Speech Privacy Creativity and Innovation Transparency International Security Our Work Deeplinks Blog Press Releases Events Legal Cases Whitepapers Podcast Annual Reports Take Action Action Center Electronic Frontier Alliance Volunteer Tools Privacy Badger Surveillance Self-Defense Certbot Atlas of Surveillance Cover Your Tracks Street Level Surveillance apkeep Donate Donate to EFF Giving Societies Shop Sponsorships Other Ways to Give Membership FAQ Donate Donate to EFF Shop Other Ways to Give Email updates on news, actions, and events in your area. Join EFF Lists Copyright (CC BY) Trademark Privacy Policy Thanks Electronic Frontier Foundation Donate EFFecting Change: The Human Cost of Online Age Verification on January 15 Electronic Frontier Foundation About Contact Press People Opportunities EFF's 35th Anniversary Issues Free Speech Privacy Creativity and Innovation Transparency International Security Our Work Deeplinks Blog Press Releases Events Legal Cases Whitepapers Podcast Annual Reports Take Action Action Center Electronic Frontier Alliance Volunteer Tools Privacy Badger Surveillance Self-Defense Certbot Atlas of Surveillance Cover Your Tracks Street Level Surveillance apkeep Donate Donate to EFF Giving Societies Shop Sponsorships Other Ways to Give Membership FAQ Donate Donate to EFF Shop Other Ways to Give Hacking the Patent System (2016) DOCUMENT Hacking the Patent System (2016) A guide to alternative patent licensing produced by the Juelsgaard Intellectual Property & Innovation Clinic at Stanford Law School in partnership with EFF and Engine . Revised and expanded for 2016. https://www.eff.org/files/2016/01/26/hacking_the_patent_system_belcher_and_casey_updated_january_2016.pdf hacking_the_patent_system_belcher_and_casey_updated_january_2016.pdf Related Issues Fair Use Patents Creativity & Innovation Back to top Follow EFF: mastodon facebook instagram x Blue Sky youtube flicker linkedin tiktok threads Check out our 4-star rating on Charity Navigator . Contact General Legal Security Membership Press About Calendar Volunteer Victories History Internships Jobs Staff Diversity & Inclusion Issues Free Speech Privacy Creativity & Innovation Transparency International Security Updates Blog Press Releases Events Legal Cases Whitepapers EFFector Newsletter Press Press Contact Donate Join or Renew Membership Online One-Time Donation Online Giving Societies Corporate Giving and Sponsorship Shop Other Ways to Give Copyright (CC BY) Trademark Privacy Policy Thanks JavaScript license information | 2026-01-13T09:29:14 |
https://docs.collab.land/help-docs/miniapps/#empowering-community-admins | Miniapps | Collab.Land Documentation Skip to main content Collab.Land Documentation Members & Admins ctrl K Introduction Key Features Setting Up the Bot Command Center Miniapps Getting started Miniapps Wallets Bot Errors FAQs Miniapps On this page Miniapps Miniapps are extensions and add-ons developed by third party teams as well as built internally by Collab.Land. They enable community admins to enhance their community with new features. Overview The Command Center Miniapps section is an extension of the Command Center that showcases add-ons developed by third party teams, and apps built internally by Collab.Land. It provides community admins with the ability to view, install, and uninstall apps to enhance their community with previously unavailable features. note View the Miniapps overview video on the Collab.Land youtube channel. Empowering Community Admins CollabLand's Miniapps are designed to empower community admins to unlock the full potential of their community. With an extensive collection of apps, admins can add new capabilities and features, such as complex TGRs (Role Composition) and Snapshot, that enhance their community's functionality. With the ease of updating installed Miniapps through the Command Center, admins can ensure their community always has access to the latest features and functionalities. If you are looking to expand your community's capabilities, this is the tool you need to get the job done. 📄️ Getting started Browse & Install apps 🗃️ Miniapps 6 items Previous Community Roles Next Getting started Overview Empowering Community Admins Privacy Policy Terms of Service Collab.Land® 2025 | 2026-01-13T09:29:14 |
https://docs.collab.land/help-docs/miniapps/#overview | Miniapps | Collab.Land Documentation Skip to main content Collab.Land Documentation Members & Admins ctrl K Introduction Key Features Setting Up the Bot Command Center Miniapps Getting started Miniapps Wallets Bot Errors FAQs Miniapps On this page Miniapps Miniapps are extensions and add-ons developed by third party teams as well as built internally by Collab.Land. They enable community admins to enhance their community with new features. Overview The Command Center Miniapps section is an extension of the Command Center that showcases add-ons developed by third party teams, and apps built internally by Collab.Land. It provides community admins with the ability to view, install, and uninstall apps to enhance their community with previously unavailable features. note View the Miniapps overview video on the Collab.Land youtube channel. Empowering Community Admins CollabLand's Miniapps are designed to empower community admins to unlock the full potential of their community. With an extensive collection of apps, admins can add new capabilities and features, such as complex TGRs (Role Composition) and Snapshot, that enhance their community's functionality. With the ease of updating installed Miniapps through the Command Center, admins can ensure their community always has access to the latest features and functionalities. If you are looking to expand your community's capabilities, this is the tool you need to get the job done. 📄️ Getting started Browse & Install apps 🗃️ Miniapps 6 items Previous Community Roles Next Getting started Overview Empowering Community Admins Privacy Policy Terms of Service Collab.Land® 2025 | 2026-01-13T09:29:14 |
https://docs.collab.land/help-docs/miniapps/#overview | Miniapps | Collab.Land Documentation Skip to main content Collab.Land Documentation Members & Admins ctrl K Introduction Key Features Setting Up the Bot Command Center Miniapps Getting started Miniapps Wallets Bot Errors FAQs Miniapps On this page Miniapps Miniapps are extensions and add-ons developed by third party teams as well as built internally by Collab.Land. They enable community admins to enhance their community with new features. Overview The Command Center Miniapps section is an extension of the Command Center that showcases add-ons developed by third party teams, and apps built internally by Collab.Land. It provides community admins with the ability to view, install, and uninstall apps to enhance their community with previously unavailable features. note View the Miniapps overview video on the Collab.Land youtube channel. Empowering Community Admins CollabLand's Miniapps are designed to empower community admins to unlock the full potential of their community. With an extensive collection of apps, admins can add new capabilities and features, such as complex TGRs (Role Composition) and Snapshot, that enhance their community's functionality. With the ease of updating installed Miniapps through the Command Center, admins can ensure their community always has access to the latest features and functionalities. If you are looking to expand your community's capabilities, this is the tool you need to get the job done. 📄️ Getting started Browse & Install apps 🗃️ Miniapps 6 items Previous Community Roles Next Getting started Overview Empowering Community Admins Privacy Policy Terms of Service Collab.Land® 2025 | 2026-01-13T09:29:14 |
https://docs.rs/flate2/0.2/flate2/write/struct.GzEncoder.html#method.new | GzEncoder in flate2::write - Rust Docs.rs flate2-0.2.20 flate2 0.2.20 Docs.rs crate page MIT / Apache-2.0 Links Homepage Repository crates.io Source Owners Byron joshtriplett rust-lang-owner Dependencies futures ^0.1 normal libc ^0.2 normal libz-sys ^1.0 normal miniz-sys ^0.1.7 normal tokio-io ^0.1 normal quickcheck ^0.4 dev rand ^0.3 dev tokio-core ^0.1 dev Versions 100% of the crate is documented Go to latest version Platform i686-unknown-linux-gnu x86_64-unknown-linux-gnu Feature flags docs.rs About docs.rs Badges Builds Metadata Shorthand URLs Download Rustdoc JSON Build queue Privacy policy Rust Rust website The Book Standard Library API Reference Rust by Example The Cargo Guide Clippy Documentation This old browser is unsupported and will most likely display funky things. ☰ GzEncoder Methods finish get_mut get_ref new try_finish Trait Implementations Debug Drop Read Write Auto Trait Implementations RefUnwindSafe Send Sync Unpin UnwindSafe Blanket Implementations Any Borrow<T> BorrowMut<T> FlateReadExt FlateWriteExt From<T> Into<U> TryFrom<U> TryInto<U> In flate2::write ? Struct flate2 :: write :: GzEncoder source · [ − ] pub struct GzEncoder<W: Write > { /* private fields */ } Expand description A gzip streaming encoder This structure exposes a Write interface that will emit compressed data to the underlying writer W . Examples use std::io::prelude:: * ; use flate2::Compression; use flate2::write::GzEncoder; // Vec<u8> implements Write to print the compressed bytes of sample string let mut e = GzEncoder::new(Vec::new(), Compression::Default); e.write( b"Hello World" ).unwrap(); println! ( "{:?}" , e.finish().unwrap()); Implementations § source § impl<W: Write > GzEncoder <W> source pub fn new (w: W, level: Compression ) -> GzEncoder <W> ⓘ Creates a new encoder which will use the given compression level. The encoder is not configured specially for the emitted header. For header configuration, see the Builder type. The data written to the returned encoder will be compressed and then written to the stream w . source pub fn get_ref (&self) -> &W Acquires a reference to the underlying writer. source pub fn get_mut (&mut self) -> &mut W Acquires a mutable reference to the underlying writer. Note that mutation of the writer may result in surprising results if this encoder is continued to be used. source pub fn try_finish (&mut self) -> Result < () > Attempt to finish this output stream, writing out final chunks of data. Note that this function can only be used once data has finished being written to the output stream. After this function is called then further calls to write may result in a panic. Panics Attempts to write data to this stream may result in a panic after this function is called. Errors This function will perform I/O to complete this stream, and any I/O errors which occur will be returned from this function. source pub fn finish (self) -> Result <W> Finish encoding this stream, returning the underlying writer once the encoding is done. Note that this function may not be suitable to call in a situation where the underlying stream is an asynchronous I/O stream. To finish a stream the try_finish (or shutdown ) method should be used instead. To re-acquire ownership of a stream it is safe to call this method after try_finish or shutdown has returned Ok . Errors This function will perform I/O to complete this stream, and any I/O errors which occur will be returned from this function. Trait Implementations § source § impl<W: Debug + Write > Debug for GzEncoder <W> source § fn fmt (&self, f: &mut Formatter <'_>) -> Result Formats the value using the given formatter. Read more source § impl<W: Write > Drop for GzEncoder <W> source § fn drop (&mut self) Executes the destructor for this type. Read more source § impl<R: Read + Write > Read for GzEncoder <R> source § fn read (&mut self, buf: &mut [ u8 ]) -> Result < usize > Pull some bytes from this source into the specified buffer, returning how many bytes were read. Read more 1.36.0 · source § fn read_vectored (&mut self, bufs: &mut [ IoSliceMut <'_>]) -> Result < usize , Error > Like read , except that it reads into a slice of buffers. Read more source § fn is_read_vectored (&self) -> bool 🔬 This is a nightly-only experimental API. ( can_vector ) Determines if this Read er has an efficient read_vectored implementation. Read more 1.0.0 · source § fn read_to_end (&mut self, buf: &mut Vec < u8 , Global >) -> Result < usize , Error > Read all bytes until EOF in this source, placing them into buf . Read more 1.0.0 · source § fn read_to_string (&mut self, buf: &mut String ) -> Result < usize , Error > Read all bytes until EOF in this source, appending them to buf . Read more 1.6.0 · source § fn read_exact (&mut self, buf: &mut [ u8 ]) -> Result < () , Error > Read the exact number of bytes required to fill buf . Read more source § fn read_buf (&mut self, buf: BorrowedCursor <'_>) -> Result < () , Error > 🔬 This is a nightly-only experimental API. ( read_buf ) Pull some bytes from this source into the specified buffer. Read more source § fn read_buf_exact (&mut self, cursor: BorrowedCursor <'_>) -> Result < () , Error > 🔬 This is a nightly-only experimental API. ( read_buf ) Read the exact number of bytes required to fill cursor . Read more 1.0.0 · source § fn by_ref (&mut self) -> &mut Self where Self: Sized , Creates a “by reference” adaptor for this instance of Read . Read more 1.0.0 · source § fn bytes (self) -> Bytes <Self> where Self: Sized , Transforms this Read instance to an Iterator over its bytes. Read more 1.0.0 · source § fn chain <R>(self, next: R) -> Chain <Self, R> where R: Read , Self: Sized , Creates an adapter which will chain this stream with another. Read more 1.0.0 · source § fn take (self, limit: u64 ) -> Take <Self> where Self: Sized , Creates an adapter which will read at most limit bytes from it. Read more source § impl<W: Write > Write for GzEncoder <W> source § fn write (&mut self, buf: &[ u8 ]) -> Result < usize > Write a buffer into this writer, returning how many bytes were written. Read more source § fn flush (&mut self) -> Result < () > Flush this output stream, ensuring that all intermediately buffered contents reach their destination. Read more 1.36.0 · source § fn write_vectored (&mut self, bufs: &[ IoSlice <'_>]) -> Result < usize , Error > Like write , except that it writes from a slice of buffers. Read more source § fn is_write_vectored (&self) -> bool 🔬 This is a nightly-only experimental API. ( can_vector ) Determines if this Write r has an efficient write_vectored implementation. Read more 1.0.0 · source § fn write_all (&mut self, buf: &[ u8 ]) -> Result < () , Error > Attempts to write an entire buffer into this writer. Read more source § fn write_all_vectored (&mut self, bufs: &mut [ IoSlice <'_>]) -> Result < () , Error > 🔬 This is a nightly-only experimental API. ( write_all_vectored ) Attempts to write multiple buffers into this writer. Read more 1.0.0 · source § fn write_fmt (&mut self, fmt: Arguments <'_>) -> Result < () , Error > Writes a formatted string into this writer, returning any error encountered. Read more 1.0.0 · source § fn by_ref (&mut self) -> &mut Self where Self: Sized , Creates a “by reference” adapter for this instance of Write . Read more Auto Trait Implementations § § impl<W> RefUnwindSafe for GzEncoder <W> where W: RefUnwindSafe , § impl<W> Send for GzEncoder <W> where W: Send , § impl<W> Sync for GzEncoder <W> where W: Sync , § impl<W> Unpin for GzEncoder <W> where W: Unpin , § impl<W> UnwindSafe for GzEncoder <W> where W: UnwindSafe , Blanket Implementations § source § impl<T> Any for T where T: 'static + ? Sized , source § fn type_id (&self) -> TypeId Gets the TypeId of self . Read more source § impl<T> Borrow <T> for T where T: ? Sized , source § fn borrow (&self) -> &T Immutably borrows from an owned value. Read more source § impl<T> BorrowMut <T> for T where T: ? Sized , source § fn borrow_mut (&mut self) -> &mut T Mutably borrows from an owned value. Read more source § impl<T> FlateReadExt for T where T: Read , source § fn gz_encode (self, lvl: Compression ) -> GzEncoder <Self> ⓘ Consume this reader to create a compression stream at the specified compression level. source § fn gz_decode (self) -> Result < GzDecoder <Self>> Consume this reader to create a decompression stream of this stream. source § fn zlib_encode (self, lvl: Compression ) -> ZlibEncoder <Self> ⓘ Consume this reader to create a compression stream at the specified compression level. source § fn zlib_decode (self) -> ZlibDecoder <Self> ⓘ Consume this reader to create a decompression stream of this stream. source § fn deflate_encode (self, lvl: Compression ) -> DeflateEncoder <Self> ⓘ Consume this reader to create a compression stream at the specified compression level. source § fn deflate_decode (self) -> DeflateDecoder <Self> ⓘ Consume this reader to create a decompression stream of this stream. source § impl<T> FlateWriteExt for T where T: Write , source § fn gz_encode (self, lvl: Compression ) -> GzEncoder <Self> ⓘ Consume this writer to create a compression stream at the specified compression level. source § fn zlib_encode (self, lvl: Compression ) -> ZlibEncoder <Self> ⓘ Consume this writer to create a compression stream at the specified compression level. source § fn zlib_decode (self) -> ZlibDecoder <Self> ⓘ Consume this writer to create a decompression stream of this stream. source § fn deflate_encode (self, lvl: Compression ) -> DeflateEncoder <Self> ⓘ Consume this writer to create a compression stream at the specified compression level. source § fn deflate_decode (self) -> DeflateDecoder <Self> ⓘ Consume this writer to create a decompression stream of this stream. source § impl<T> From <T> for T source § fn from (t: T) -> T Returns the argument unchanged. source § impl<T, U> Into <U> for T where U: From <T>, source § fn into (self) -> U Calls U::from(self) . That is, this conversion is whatever the implementation of From <T> for U chooses to do. source § impl<T, U> TryFrom <U> for T where U: Into <T>, § type Error = Infallible The type returned in the event of a conversion error. source § fn try_from (value: U) -> Result <T, <T as TryFrom <U>>:: Error > Performs the conversion. source § impl<T, U> TryInto <U> for T where U: TryFrom <T>, § type Error = <U as TryFrom <T>>:: Error The type returned in the event of a conversion error. source § fn try_into (self) -> Result <U, <U as TryFrom <T>>:: Error > Performs the conversion. | 2026-01-13T09:29:14 |
https://www.linkedin.com/uas/login?session_redirect=%2Fservices%2Fproducts%2Fmogi-i-o-liveu%2F&fromSignIn=true&trk=products_details_guest_nav-header-signin | LinkedIn Login, Sign in | LinkedIn Sign in Sign in with Apple Sign in with a passkey By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . or Email or phone Password Show Forgot password? Keep me logged in Sign in We’ve emailed a one-time link to your primary email address Click on the link to sign in instantly to your LinkedIn account. If you don’t see the email in your inbox, check your spam folder. Resend email Back New to LinkedIn? Join now Agree & Join LinkedIn By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . LinkedIn © 2026 User Agreement Privacy Policy Community Guidelines Cookie Policy Copyright Policy Send Feedback Language العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) | 2026-01-13T09:29:14 |
https://www.linkedin.com/signup/cold-join?session_redirect=%2Fservices%2Fproducts%2Fcloudflare-workers%2F&trk=products_details_guest_nav-header-join | Sign Up | LinkedIn Make the most of your professional life Not you? Remove photo Join LinkedIn To create a LinkedIn account, you must understand how LinkedIn processes your personal information by selecting learn more for each item listed. Agree to all terms We collect and use personal information. Learn more We share personal information with third parties to provide our services. Learn more Further information is available in our Korea Privacy Addendum . Privacy Policy Addendum 1 of 2 2 of 2 Agree to the term Continue Back Agree to all terms Email Password Show First name Last name By clicking Agree & Join, you agree to the LinkedIn User Agreement , Privacy Policy , and Cookie Policy . Agree & Join or Security verification Already on LinkedIn? Sign in Looking to create a page for a business? Get help LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) Language | 2026-01-13T09:29:14 |
https://docs.rs/flate2/0.2/flate2/read/struct.GzDecoder.html#method.new | GzDecoder in flate2::read - Rust Docs.rs flate2-0.2.20 flate2 0.2.20 Docs.rs crate page MIT / Apache-2.0 Links Homepage Repository crates.io Source Owners Byron joshtriplett rust-lang-owner Dependencies futures ^0.1 normal libc ^0.2 normal libz-sys ^1.0 normal miniz-sys ^0.1.7 normal tokio-io ^0.1 normal quickcheck ^0.4 dev rand ^0.3 dev tokio-core ^0.1 dev Versions 100% of the crate is documented Go to latest version Platform i686-unknown-linux-gnu x86_64-unknown-linux-gnu Feature flags docs.rs About docs.rs Badges Builds Metadata Shorthand URLs Download Rustdoc JSON Build queue Privacy policy Rust Rust website The Book Standard Library API Reference Rust by Example The Cargo Guide Clippy Documentation This old browser is unsupported and will most likely display funky things. ☰ GzDecoder Methods get_mut get_ref header into_inner new Trait Implementations Debug Read Write Auto Trait Implementations RefUnwindSafe Send Sync Unpin UnwindSafe Blanket Implementations Any Borrow<T> BorrowMut<T> FlateReadExt FlateWriteExt From<T> Into<U> TryFrom<U> TryInto<U> In flate2::read ? Struct flate2 :: read :: GzDecoder source · [ − ] pub struct GzDecoder<R> { /* private fields */ } Expand description A gzip streaming decoder This structure exposes a Read interface that will consume compressed data from the underlying reader and emit uncompressed data. Examples use std::io::prelude:: * ; use std::io; use flate2::read::GzDecoder; // Uncompresses a Gz Encoded vector of bytes and returns a string or error // Here &[u8] implements Read fn decode_reader(bytes: Vec<u8>) -> io::Result<String> { let mut gz = GzDecoder::new( & bytes[..]) ? ; let mut s = String::new(); gz.read_to_string( &mut s) ? ; Ok (s) } Implementations § source § impl<R: Read > GzDecoder <R> source pub fn new (r: R) -> Result < GzDecoder <R>> Creates a new decoder from the given reader, immediately parsing the gzip header. Errors If an error is encountered when parsing the gzip header, an error is returned. source § impl<R> GzDecoder <R> source pub fn header (&self) -> & Header Returns the header associated with this stream. source pub fn get_ref (&self) -> &R Acquires a reference to the underlying reader. source pub fn get_mut (&mut self) -> &mut R Acquires a mutable reference to the underlying stream. Note that mutation of the stream may result in surprising results if this encoder is continued to be used. source pub fn into_inner (self) -> R Consumes this decoder, returning the underlying reader. Trait Implementations § source § impl<R: Debug > Debug for GzDecoder <R> source § fn fmt (&self, f: &mut Formatter <'_>) -> Result Formats the value using the given formatter. Read more source § impl<R: Read > Read for GzDecoder <R> source § fn read (&mut self, into: &mut [ u8 ]) -> Result < usize > Pull some bytes from this source into the specified buffer, returning how many bytes were read. Read more 1.36.0 · source § fn read_vectored (&mut self, bufs: &mut [ IoSliceMut <'_>]) -> Result < usize , Error > Like read , except that it reads into a slice of buffers. Read more source § fn is_read_vectored (&self) -> bool 🔬 This is a nightly-only experimental API. ( can_vector ) Determines if this Read er has an efficient read_vectored implementation. Read more 1.0.0 · source § fn read_to_end (&mut self, buf: &mut Vec < u8 , Global >) -> Result < usize , Error > Read all bytes until EOF in this source, placing them into buf . Read more 1.0.0 · source § fn read_to_string (&mut self, buf: &mut String ) -> Result < usize , Error > Read all bytes until EOF in this source, appending them to buf . Read more 1.6.0 · source § fn read_exact (&mut self, buf: &mut [ u8 ]) -> Result < () , Error > Read the exact number of bytes required to fill buf . Read more source § fn read_buf (&mut self, buf: BorrowedCursor <'_>) -> Result < () , Error > 🔬 This is a nightly-only experimental API. ( read_buf ) Pull some bytes from this source into the specified buffer. Read more source § fn read_buf_exact (&mut self, cursor: BorrowedCursor <'_>) -> Result < () , Error > 🔬 This is a nightly-only experimental API. ( read_buf ) Read the exact number of bytes required to fill cursor . Read more 1.0.0 · source § fn by_ref (&mut self) -> &mut Self where Self: Sized , Creates a “by reference” adaptor for this instance of Read . Read more 1.0.0 · source § fn bytes (self) -> Bytes <Self> where Self: Sized , Transforms this Read instance to an Iterator over its bytes. Read more 1.0.0 · source § fn chain <R>(self, next: R) -> Chain <Self, R> where R: Read , Self: Sized , Creates an adapter which will chain this stream with another. Read more 1.0.0 · source § fn take (self, limit: u64 ) -> Take <Self> where Self: Sized , Creates an adapter which will read at most limit bytes from it. Read more source § impl<R: Read + Write > Write for GzDecoder <R> source § fn write (&mut self, buf: &[ u8 ]) -> Result < usize > Write a buffer into this writer, returning how many bytes were written. Read more source § fn flush (&mut self) -> Result < () > Flush this output stream, ensuring that all intermediately buffered contents reach their destination. Read more 1.36.0 · source § fn write_vectored (&mut self, bufs: &[ IoSlice <'_>]) -> Result < usize , Error > Like write , except that it writes from a slice of buffers. Read more source § fn is_write_vectored (&self) -> bool 🔬 This is a nightly-only experimental API. ( can_vector ) Determines if this Write r has an efficient write_vectored implementation. Read more 1.0.0 · source § fn write_all (&mut self, buf: &[ u8 ]) -> Result < () , Error > Attempts to write an entire buffer into this writer. Read more source § fn write_all_vectored (&mut self, bufs: &mut [ IoSlice <'_>]) -> Result < () , Error > 🔬 This is a nightly-only experimental API. ( write_all_vectored ) Attempts to write multiple buffers into this writer. Read more 1.0.0 · source § fn write_fmt (&mut self, fmt: Arguments <'_>) -> Result < () , Error > Writes a formatted string into this writer, returning any error encountered. Read more 1.0.0 · source § fn by_ref (&mut self) -> &mut Self where Self: Sized , Creates a “by reference” adapter for this instance of Write . Read more Auto Trait Implementations § § impl<R> RefUnwindSafe for GzDecoder <R> where R: RefUnwindSafe , § impl<R> Send for GzDecoder <R> where R: Send , § impl<R> Sync for GzDecoder <R> where R: Sync , § impl<R> Unpin for GzDecoder <R> where R: Unpin , § impl<R> UnwindSafe for GzDecoder <R> where R: UnwindSafe , Blanket Implementations § source § impl<T> Any for T where T: 'static + ? Sized , source § fn type_id (&self) -> TypeId Gets the TypeId of self . Read more source § impl<T> Borrow <T> for T where T: ? Sized , source § fn borrow (&self) -> &T Immutably borrows from an owned value. Read more source § impl<T> BorrowMut <T> for T where T: ? Sized , source § fn borrow_mut (&mut self) -> &mut T Mutably borrows from an owned value. Read more source § impl<T> FlateReadExt for T where T: Read , source § fn gz_encode (self, lvl: Compression ) -> GzEncoder <Self> ⓘ Consume this reader to create a compression stream at the specified compression level. source § fn gz_decode (self) -> Result < GzDecoder <Self>> Consume this reader to create a decompression stream of this stream. source § fn zlib_encode (self, lvl: Compression ) -> ZlibEncoder <Self> ⓘ Consume this reader to create a compression stream at the specified compression level. source § fn zlib_decode (self) -> ZlibDecoder <Self> ⓘ Consume this reader to create a decompression stream of this stream. source § fn deflate_encode (self, lvl: Compression ) -> DeflateEncoder <Self> ⓘ Consume this reader to create a compression stream at the specified compression level. source § fn deflate_decode (self) -> DeflateDecoder <Self> ⓘ Consume this reader to create a decompression stream of this stream. source § impl<T> FlateWriteExt for T where T: Write , source § fn gz_encode (self, lvl: Compression ) -> GzEncoder <Self> ⓘ Consume this writer to create a compression stream at the specified compression level. source § fn zlib_encode (self, lvl: Compression ) -> ZlibEncoder <Self> ⓘ Consume this writer to create a compression stream at the specified compression level. source § fn zlib_decode (self) -> ZlibDecoder <Self> ⓘ Consume this writer to create a decompression stream of this stream. source § fn deflate_encode (self, lvl: Compression ) -> DeflateEncoder <Self> ⓘ Consume this writer to create a compression stream at the specified compression level. source § fn deflate_decode (self) -> DeflateDecoder <Self> ⓘ Consume this writer to create a decompression stream of this stream. source § impl<T> From <T> for T source § fn from (t: T) -> T Returns the argument unchanged. source § impl<T, U> Into <U> for T where U: From <T>, source § fn into (self) -> U Calls U::from(self) . That is, this conversion is whatever the implementation of From <T> for U chooses to do. source § impl<T, U> TryFrom <U> for T where U: Into <T>, § type Error = Infallible The type returned in the event of a conversion error. source § fn try_from (value: U) -> Result <T, <T as TryFrom <U>>:: Error > Performs the conversion. source § impl<T, U> TryInto <U> for T where U: TryFrom <T>, § type Error = <U as TryFrom <T>>:: Error The type returned in the event of a conversion error. source § fn try_into (self) -> Result <U, <U as TryFrom <T>>:: Error > Performs the conversion. | 2026-01-13T09:29:14 |
https://www.linkedin.com/legal/privacy-policy?session_redirect=https%3A%2F%2Fwww%2Elinkedin%2Ecom%2Fposts%2Fryanheinrichs_userexperience-webdesign-uiux-activity-7408999842783395840--gY1&trk=registration-frontend_join-form-privacy-policy | LinkedIn Privacy Policy Skip to main content User Agreement Summary of User Agreement Privacy Policy Professional Community Policies Cookie Policy Copyright Policy Regional Info EU Notice California Privacy Disclosure U.S. State Privacy Laws User Agreement Summary of User Agreement Privacy Policy Professional Community Policies Cookie Policy Copyright Policy Regional Info EU Notice California Privacy Disclosure U.S. State Privacy Laws Privacy Policy Effective November 3, 2025 Your Privacy Matters LinkedIn’s mission is to connect the world’s professionals to allow them to be more productive and successful. Central to this mission is our commitment to be transparent about the data we collect about you, how it is used and with whom it is shared. This Privacy Policy applies when you use our Services (described below). We offer our users choices about the data we collect, use and share as described in this Privacy Policy, Cookie Policy , Settings and our Help Center. Key Terms Choices Settings are available to Members of LinkedIn and Visitors are provided separate controls. Learn More . Table of Contents Data We Collect How We Use Your Data How We Share Information Your Choices and Obligations Other Important Information Introduction We are a social network and online platform for professionals. People use our Services to find and be found for business opportunities, to connect with others and find information. Our Privacy Policy applies to any Member or Visitor to our Services. Our registered users (“Members”) share their professional identities, engage with their network, exchange knowledge and professional insights, post and view relevant content, learn and develop skills, and find business and career opportunities. Content and data on some of our Services is viewable to non-Members (“Visitors”). We use the term “Designated Countries” to refer to countries in the European Union (EU), European Economic Area (EEA), and Switzerland. Members and Visitors located in the Designated Countries or the UK can review additional information in our European Regional Privacy Notice . Services This Privacy Policy, including our Cookie Policy applies to your use of our Services. This Privacy Policy applies to LinkedIn.com, LinkedIn-branded apps, and other LinkedIn-branded sites, apps, communications and services offered by LinkedIn (“Services”), including off-site Services, such as our ad services and the “Apply with LinkedIn” and “Share with LinkedIn” plugins, but excluding services that state that they are offered under a different privacy policy. For California residents, additional disclosures required by California law may be found in our California Privacy Disclosure . Data Controllers and Contracting Parties If you are in the “Designated Countries”, LinkedIn Ireland Unlimited Company (“LinkedIn Ireland”) will be the controller of your personal data provided to, or collected by or for, or processed in connection with our Services. If you are outside of the Designated Countries, LinkedIn Corporation will be the controller of (or business responsible for) your personal data provided to, or collected by or for, or processed in connection with our Services. As a Visitor or Member of our Services, the collection, use and sharing of your personal data is subject to this Privacy Policy and other documents referenced in this Privacy Policy, as well as updates. Change Changes to the Privacy Policy apply to your use of our Services after the “effective date.” LinkedIn (“we” or “us”) can modify this Privacy Policy, and if we make material changes to it, we will provide notice through our Services, or by other means, to provide you the opportunity to review the changes before they become effective. If you object to any changes, you may close your account. You acknowledge that your continued use of our Services after we publish or send a notice about our changes to this Privacy Policy means that the collection, use and sharing of your personal data is subject to the updated Privacy Policy, as of its effective date. 1. Data We Collect 1.1 Data You Provide To Us You provide data to create an account with us. Registration To create an account you need to provide data including your name, email address and/or mobile number, general location (e.g., city), and a password. If you register for a premium Service, you will need to provide payment (e.g., credit card) and billing information. You create your LinkedIn profile (a complete profile helps you get the most from our Services). Profile You have choices about the information on your profile, such as your education, work experience, skills, photo, city or area , endorsements, and optional verifications of information on your profile (such as verifications of your identity or workplace). You don’t have to provide additional information on your profile; however, profile information helps you to get more from our Services, including helping recruiters and business opportunities find you. It’s your choice whether to include sensitive information on your profile and to make that sensitive information public. Please do not post or add personal data to your profile that you would not want to be publicly available. You may give other data to us, such as by syncing your calendar. Posting and Uploading We collect personal data from you when you provide, post or upload it to our Services, such as when you fill out a form, (e.g., with demographic data or salary), respond to a survey, or submit a resume or fill out a job application on our Services. If you sync your calendars with our Services, we will collect your calendar meeting information to keep growing your network by suggesting connections for you and others, and by providing information about events, e.g. times, places, attendees and contacts. You don’t have to post or upload personal data; though if you don’t, it may limit your ability to grow and engage with your network over our Services. 1.2 Data From Others Others may post or write about you. Content and News You and others may post content that includes information about you (as part of articles, posts, comments, videos) on our Services. We also may collect public information about you, such as professional-related news and accomplishments, and make it available as part of our Services, including, as permitted by your settings, in notifications to others of mentions in the news . Others may sync their calendar with our Services Contact and Calendar Information We receive personal data (including contact information) about you when others import or sync their calendar with our Services, associate their contacts with Member profiles, scan and upload business cards, or send messages using our Services (including invites or connection requests). If you or others opt-in to sync email accounts with our Services, we will also collect “email header” information that we can associate with Member profiles. Customers and partners may provide data to us. Partners We receive personal data (e.g., your job title and work email address) about you when you use the services of our customers and partners, such as employers or prospective employers and applicant tracking systems providing us job application data. Related Companies and Other Services We receive data about you when you use some of the other services provided by us or our Affiliates , including Microsoft. For example, you may choose to send us information about your contacts in Microsoft apps and services, such as Outlook, for improved professional networking activities on our Services or we may receive information from Microsoft about your engagement with their sites and services. 1.3 Service Use We log your visits and use of our Services, including mobile apps. We log usage data when you visit or otherwise use our Services, including our sites, app and platform technology, such as when you view or click on content (e.g., learning video) or ads (on or off our sites and apps), perform a search, install or update one of our mobile apps, share articles or apply for jobs. We use log-ins, cookies, device information and internet protocol (“IP”) addresses to identify you and log your use. 1.4 Cookies and Similar Technologies We collect data through cookies and similar technologies. As further described in our Cookie Policy , we use cookies and similar technologies (e.g., pixels and ad tags) to collect data (e.g., device IDs) to recognize you and your device(s) on, off and across different services and devices where you have engaged with our Services. We also allow some others to use cookies as described in our Cookie Policy. If you are outside the Designated Countries, we also collect (or rely on others, including Microsoft, who collect) information about your device where you have not engaged with our Services (e.g., ad ID, IP address, operating system and browser information) so we can provide our Members with relevant ads and better understand their effectiveness. Learn more . You can opt out from our use of data from cookies and similar technologies that track your behavior on the sites of others for ad targeting and other ad-related purposes. For Visitors, the controls are here . 1.5 Your Device and Location We receive data through cookies and similar technologies When you visit or leave our Services (including some plugins and our cookies or similar technology on the sites of others), we receive the URL of both the site you came from and the one you go to and the time of your visit. We also get information about your network and device (e.g., IP address, proxy server, operating system, web browser and add-ons, device identifier and features, cookie IDs and/or ISP, or your mobile carrier). If you use our Services from a mobile device, that device will send us data about your location based on your phone settings. We will ask you to opt-in before we use GPS or other tools to identify your precise location. 1.6 Communications If you communicate through our Services, we learn about that. We collect information about you when you communicate with others through our Services (e.g., when you send, receive, or engage with messages, events, or connection requests, including our marketing communications). This may include information that indicates who you are communicating with and when. We also use automated systems to support and protect our site. For example, we use such systems to suggest possible responses to messages and to manage or block content that violates our User Agreement or Professional Community Policies . 1.7 Workplace and School Provided Information When your organization (e.g., employer or school) buys a premium Service for you to use, they give us data about you. Others buying our Services for your use, such as your employer or your school, provide us with personal data about you and your eligibility to use the Services that they purchase for use by their workers, students or alumni. For example, we will get contact information for “ LinkedIn Page ” (formerly Company Page) administrators and for authorizing users of our premium Services, such as our recruiting, sales or learning products. 1.8 Sites and Services of Others We get data when you visit sites that include our ads, cookies or plugins or when you log-in to others’ services with your LinkedIn account. We receive information about your visits and interaction with services provided by others when you log-in with LinkedIn or visit others’ services that include some of our plugins (such as “Apply with LinkedIn”) or our ads, cookies or similar technologies. 1.9 Other We are improving our Services, which means we get new data and create new ways to use data. Our Services are dynamic, and we often introduce new features, which may require the collection of new information. If we collect materially different personal data or materially change how we collect, use or share your data, we will notify you and may also modify this Privacy Policy. Key Terms Affiliates Affiliates are companies controlling, controlled by or under common control with us, including, for example, LinkedIn Ireland, LinkedIn Corporation, LinkedIn Singapore and Microsoft Corporation or any of its subsidiaries (e.g., GitHub, Inc.). 2. How We Use Your Data We use your data to provide, support, personalize and develop our Services. How we use your personal data will depend on which Services you use, how you use those Services and the choices you make in your settings . We may use your personal data to improve, develop, and provide products and Services, develop and train artificial intelligence (AI) models, develop, provide, and personalize our Services, and gain insights with the help of AI, automated systems, and inferences, so that our Services can be more relevant and useful to you and others. You can review LinkedIn's Responsible AI principles here and learn more about our approach to generative AI here . Learn more about the inferences we may make, including as to your age and gender and how we use them. 2.1 Services Our Services help you connect with others, find and be found for work and business opportunities, stay informed, get training and be more productive. We use your data to authorize access to our Services and honor your settings. Stay Connected Our Services allow you to stay in touch and up to date with colleagues, partners, clients, and other professional contacts. To do so, you can “connect” with the professionals who you choose, and who also wish to “connect” with you. Subject to your and their settings , when you connect with other Members, you will be able to search each others’ connections in order to exchange professional opportunities. We use data about you (such as your profile, profiles you have viewed or data provided through address book uploads or partner integrations) to help others find your profile, suggest connections for you and others (e.g. Members who share your contacts or job experiences) and enable you to invite others to become a Member and connect with you. You can also opt-in to allow us to use your precise location or proximity to others for certain tasks (e.g. to suggest other nearby Members for you to connect with, calculate the commute to a new job, or notify your connections that you are at a professional event). It is your choice whether to invite someone to our Services, send a connection request, or allow another Member to become your connection. When you invite someone to connect with you, your invitation will include your network and basic profile information (e.g., name, profile photo, job title, region). We will send invitation reminders to the person you invited. You can choose whether or not to share your own list of connections with your connections. Visitors have choices about how we use their data. Stay Informed Our Services allow you to stay informed about news, events and ideas regarding professional topics you care about, and from professionals you respect. Our Services also allow you to improve your professional skills, or learn new ones. We use the data we have about you (e.g., data you provide, data we collect from your engagement with our Services and inferences we make from the data we have about you), to personalize our Services for you, such as by recommending or ranking relevant content and conversations on our Services. We also use the data we have about you to suggest skills you could add to your profile and skills that you might need to pursue your next opportunity. So, if you let us know that you are interested in a new skill (e.g., by watching a learning video), we will use this information to personalize content in your feed, suggest that you follow certain Members on our site, or suggest related learning content to help you towards that new skill. We use your content, activity and other data, including your name and photo, to provide notices to your network and others. For example, subject to your settings , we may notify others that you have updated your profile, posted content, took a social action , used a feature, made new connections or were mentioned in the news . Career Our Services allow you to explore careers, evaluate educational opportunities, and seek out, and be found for, career opportunities. Your profile can be found by those looking to hire (for a job or a specific task ) or be hired by you. We will use your data to recommend jobs and show you and others relevant professional contacts (e.g., who work at a company, in an industry, function or location or have certain skills and connections). You can signal that you are interested in changing jobs and share information with recruiters. We will use your data to recommend jobs to you and you to recruiters. We may use automated systems to provide content and recommendations to help make our Services more relevant to our Members, Visitors and customers. Keeping your profile accurate and up-to-date may help you better connect to others and to opportunities through our Services. Productivity Our Services allow you to collaborate with colleagues, search for potential clients, customers, partners and others to do business with. Our Services allow you to communicate with other Members and schedule and prepare meetings with them. If your settings allow, we scan messages to provide “bots” or similar tools that facilitate tasks such as scheduling meetings, drafting responses, summarizing messages or recommending next steps. Learn more . 2.2 Premium Services Our premium Services help paying users to search for and contact Members through our Services, such as searching for and contacting job candidates, sales leads and co-workers, manage talent and promote content. We sell premium Services that provide our customers and subscribers with customized-search functionality and tools (including messaging and activity alerts) as part of our talent, marketing and sales solutions. Customers can export limited information from your profile, such as name, headline, current company, current title, and general location (e.g., Dublin), such as to manage sales leads or talent, unless you opt-out . We do not provide contact information to customers as part of these premium Services without your consent. Premium Services customers can store information they have about you in our premium Services, such as a resume or contact information or sales history. The data stored about you by these customers is subject to the policies of those customers. Other enterprise Services and features that use your data include TeamLink and LinkedIn Pages (e.g., content analytics and followers). 2.3 Communications We contact you and enable communications between Members. We offer settings to control what messages you receive and how often you receive some types of messages. We will contact you through email, mobile phone, notices posted on our websites or apps, messages to your LinkedIn inbox, and other ways through our Services, including text messages and push notifications. We will send you messages about the availability of our Services, security, or other service-related issues. We also send messages about how to use our Services, network updates, reminders, job suggestions and promotional messages from us and our partners. You may change your communication preferences at any time. Please be aware that you cannot opt out of receiving service messages from us, including security and legal notices. We also enable communications between you and others through our Services, including for example invitations , InMail , groups and messages between connections. 2.4 Advertising We serve you tailored ads both on and off our Services. We offer you choices regarding personalized ads, but you cannot opt-out of seeing non-personalized ads. We target (and measure the performance of) ads to Members, Visitors and others both on and off our Services directly or through a variety of partners, using the following data, whether separately or combined: Data collected by advertising technologies on and off our Services using pixels, ad tags (e.g., when an advertiser installs a LinkedIn tag on their website), cookies, and other device identifiers; Member-provided information (e.g., profile, contact information, title and industry); Data from your use of our Services (e.g., search history, feed, content you read, who you follow or is following you, connections, groups participation, page visits, videos you watch, clicking on an ad, etc.), including as described in Section 1.3; Information from advertising partners , vendors and publishers ; and Information inferred from data described above (e.g., using job titles from a profile to infer industry, seniority, and compensation bracket; using graduation dates to infer age or using first names or pronoun usage to infer gender; using your feed activity to infer your interests; or using device data to recognize you as a Member). Learn more about the inferences we make and how they may be used for advertising. Learn more about the ad technologies we use and our advertising services and partners. You can learn more about our compliance with laws in the Designated Countries or the UK in our European Regional Privacy Notice . We will show you ads called sponsored content which look similar to non-sponsored content, except that they are labeled as advertising (e.g., as “ad” or “sponsored”). If you take a social action (such as like, comment or share) on these ads, your action is associated with your name and viewable by others, including the advertiser. Subject to your settings , if you take a social action on the LinkedIn Services, that action may be mentioned with related ads. For example, when you like a company we may include your name and photo when their sponsored content is shown. Ad Choices You have choices regarding our uses of certain categories of data to show you more relevant ads. Member settings can be found here . For Visitors, the setting is here . Info to Ad Providers We do not share your personal data with any non-Affiliated third-party advertisers or ad networks except for: (i) hashed IDs or device identifiers (to the extent they are personal data in some countries); (ii) with your separate permission (e.g., in a lead generation form) or (iii) data already visible to any users of the Services (e.g., profile). However, if you view or click on an ad on or off our Services, the ad provider will get a signal that someone visited the page that displayed the ad, and they may, through the use of mechanisms such as cookies, determine it is you. Advertising partners can associate personal data collected by the advertiser directly from you with hashed IDs or device identifiers received from us. We seek to contractually require such advertising partners to obtain your explicit, opt-in consent before doing so where legally required, and in such instances, we take steps to ensure that consent has been provided before processing data from them. 2.5 Marketing We promote our Services to you and others. In addition to advertising our Services, we use Members’ data and content for invitations and communications promoting membership and network growth, engagement and our Services, such as by showing your connections that you have used a feature on our Services. 2.6 Developing Services and Research We develop our Services and conduct research Service Development We use data, including public feedback, to conduct research and development for our Services in order to provide you and others with a better, more intuitive and personalized experience, drive membership growth and engagement on our Services, and help connect professionals to each other and to economic opportunity. Other Research We seek to create economic opportunity for Members of the global workforce and to help them be more productive and successful. We use the personal data available to us to research social, economic and workplace trends, such as jobs availability and skills needed for these jobs and policies that help bridge the gap in various industries and geographic areas. In some cases, we work with trusted third parties to perform this research, under controls that are designed to protect your privacy. We may also make public data available to researchers to enable assessment of the safety and legal compliance of our Services. We publish or allow others to publish economic insights, presented as aggregated data rather than personal data. Surveys Polls and surveys are conducted by us and others through our Services. You are not obligated to respond to polls or surveys, and you have choices about the information you provide. You may opt-out of survey invitations. 2.7 Customer Support We use data to help you and fix problems. We use data (which can include your communications) to investigate, respond to and resolve complaints and for Service issues (e.g., bugs). 2.8 Insights That Do Not Identify You We use data to generate insights that do not identify you. We use your data to perform analytics to produce and share insights that do not identify you. For example, we may use your data to generate statistics about our Members, their profession or industry, to calculate ad impressions served or clicked on (e.g., for basic business reporting to support billing and budget management or, subject to your settings , for reports to advertisers who may use them to inform their advertising campaigns), to show Members' information about engagement with a post or LinkedIn Page , to publish visitor demographics for a Service or create demographic workforce insights, or to understand usage of our services. 2.9 Security and Investigations We use data for security, fraud prevention and investigations. We and our Affiliates, including Microsoft, may use your data (including your communications) for security purposes or to prevent or investigate possible fraud or other violations of the law, our User Agreement and/or attempts to harm our Members, Visitors, company, Affiliates, or others. Key Terms Social Action E.g. like, comment, follow, share Partners Partners include ad networks, exchanges and others 3. How We Share Information 3.1 Our Services Any data that you include on your profile and any content you post or social action (e.g., likes, follows, comments, shares) you take on our Services will be seen by others, consistent with your settings. Profile Your profile is fully visible to all Members and customers of our Services. Subject to your settings , it can also be visible to others on or off of our Services (e.g., Visitors to our Services or users of third-party search tools). As detailed in our Help Center , your settings, degree of connection with the viewing Member, the subscriptions they may have, their usage of our Services , access channels and search types (e.g., by name or by keyword) impact the availability of your profile and whether they can view certain fields in your profile. Posts, Likes, Follows, Comments, Messages Our Services allow viewing and sharing information including through posts, likes, follows and comments. When you share an article or a post (e.g., an update, image, video or article) publicly it can be viewed by everyone and re-shared anywhere (subject to your settings ). Members, Visitors and others will be able to find and see your publicly-shared content, including your name (and photo if you have provided one). In a group , posts are visible to others according to group type. For example, posts in private groups are visible to others in the group and posts in public groups are visible publicly. Your membership in groups is public and part of your profile, but you can change visibility in your settings . Any information you share through companies’ or other organizations’ pages on our Services will be viewable by those organizations and others who view those pages' content. When you follow a person or organization, you are visible to others and that “page owner” as a follower. We let senders know when you act on their message, subject to your settings where applicable. Subject to your settings , we let a Member know when you view their profile. We also give you choices about letting organizations know when you've viewed their Page. When you like or re-share or comment on another’s content (including ads), others will be able to view these “social actions” and associate it with you (e.g., your name, profile and photo if you provided it). Your employer can see how you use Services they provided for your work (e.g. as a recruiter or sales agent) and related information. We will not show them your job searches or personal messages. Enterprise Accounts Your employer may offer you access to our enterprise Services such as Recruiter, Sales Navigator, LinkedIn Learning or our advertising Campaign Manager. Your employer can review and manage your use of such enterprise Services. Depending on the enterprise Service, before you use such Service, we will ask for permission to share with your employer relevant data from your profile or use of our non-enterprise Services. For example, users of Sales Navigator will be asked to share their “social selling index”, a score calculated in part based on their personal account activity. We understand that certain activities such as job hunting and personal messages are sensitive, and so we do not share those with your employer unless you choose to share it with them through our Services (for example, by applying for a new position in the same company or mentioning your job hunting in a message to a co-worker through our Services). Subject to your settings , when you use workplace tools and services (e.g., interactive employee directory tools) certain of your data may also be made available to your employer or be connected with information we receive from your employer to enable these tools and services. 3.2 Communication Archival Regulated Members may need to store communications outside of our Service. Some Members (or their employers) need, for legal or professional compliance, to archive their communications and social media activity, and will use services of others to provide these archival services. We enable archiving of messages by and to those Members outside of our Services. For example, a financial advisor needs to archive communications with her clients through our Services in order to maintain her professional financial advisor license. 3.3 Others’ Services You may link your account with others’ services so that they can look up your contacts’ profiles, post your shares on such platforms, or enable you to start conversations with your connections on such platforms. Excerpts from your profile will also appear on the services of others. Subject to your settings , other services may look up your profile. When you opt to link your account with other services, personal data (e.g., your name, title, and company) will become available to them. The sharing and use of that personal data will be described in, or linked to, a consent screen when you opt to link the accounts. For example, you may link your Twitter or WeChat account to share content from our Services into these other services, or your email provider may give you the option to upload your LinkedIn contacts into its own service. Third-party services have their own privacy policies, and you may be giving them permission to use your data in ways we would not. You may revoke the link with such accounts. The information you make available to others in our Services (e.g., information from your profile, your posts, your engagement with the posts, or message to Pages) may be available to them on other services . For example, search tools, mail and calendar applications, or talent and lead managers may show a user limited profile data (subject to your settings ), and social media management tools or other platforms may display your posts. The information retained on these services may not reflect updates you make on LinkedIn. 3.4 Related Services We share your data across our different Services and LinkedIn affiliated entities. We will share your personal data with our Affiliates to provide and develop our Services. For example, we may refer a query to Bing in some instances, such as where you'd benefit from a more up to date response in a chat experience. Subject to our European Regional Privacy Notice , we may also share with our Affiliates, including Microsoft, your (1) publicly-shared content (such as your public LinkedIn posts) to provide or develop their services and (2) personal data to improve, provide or develop their advertising services. Where allowed , we may combine information internally across the different Services covered by this Privacy Policy to help our Services be more relevant and useful to you and others. For example, we may personalize your feed or job recommendations based on your learning history. 3.5 Service Providers We may use others to help us with our Services. We use others to help us provide our Services (e.g., maintenance, analysis, audit, payments, fraud detection, customer support, marketing and development). They will have access to your information (e.g., the contents of a customer support request) as reasonably necessary to perform these tasks on our behalf and are obligated not to disclose or use it for other purposes. If you purchase a Service from us, we may use a payments service provider who may separately collect information about you (e.g., for fraud prevention or to comply with legal obligations). 3.6 Legal Disclosures We may need to share your data when we believe it’s required by law or to help protect the rights and safety of you, us or others. It is possible that we will need to disclose information about you when required by law, subpoena, or other legal process or if we have a good faith belief that disclosure is reasonably necessary to (1) investigate, prevent or take action regarding suspected or actual illegal activities or to assist government enforcement agencies; (2) enforce our agreements with you; (3) investigate and defend ourselves against any third-party claims or allegations; (4) protect the security or integrity of our Services or the products or services of our Affiliates (such as by sharing with companies facing similar threats); or (5) exercise or protect the rights and safety of LinkedIn, our Members, personnel or others. We attempt to notify Members about legal demands for their personal data when appropriate in our judgment, unless prohibited by law or court order or when the request is an emergency. We may dispute such demands when we believe, in our discretion, that the requests are overbroad, vague or lack proper authority, but we do not promise to challenge every demand. To learn more see our Data Request Guidelines and Transparency Report . 3.7 Change in Control or Sale We may share your data when our business is sold to others, but it must continue to be used in accordance with this Privacy Policy. We can also share your personal data as part of a sale, merger or change in control, or in preparation for any of these events. Any other entity which buys us or part of our business will have the right to continue to use your data, but only in the manner set out in this Privacy Policy unless you agree otherwise. 4. Your Choices & Obligations 4.1 Data Retention We keep most of your personal data for as long as your account is open. We generally retain your personal data as long as you keep your account open or as needed to provide you Services. This includes data you or others provided to us and data generated or inferred from your use of our Services. Even if you only use our Services when looking for a new job every few years, we will retain your information and keep your profile open, unless you close your account. In some cases we choose to retain certain information (e.g., insights about Services use) in a depersonalized or aggregated form. 4.2 Rights to Access and Control Your Personal Data You can access or delete your personal data. You have many choices about how your data is collected, used and shared. We provide many choices about the collection, use and sharing of your data, from deleting or correcting data you include in your profile and controlling the visibility of your posts to advertising opt-outs and communication controls. We offer you settings to control and manage the personal data we have about you. For personal data that we have about you, you can: Delete Data : You can ask us to erase or delete all or some of your personal data (e.g., if it is no longer necessary to provide Services to you). Change or Correct Data : You can edit some of your personal data through your account. You can also ask us to change, update or fix your data in certain cases, particularly if it’s inaccurate. Object to, or Limit or Restrict, Use of Data : You can ask us to stop using all or some of your personal data (e.g., if we have no legal right to keep using it) or to limit our use of it (e.g., if your personal data is inaccurate or unlawfully held). Right to Access and/or Take Your Data : You can ask us for a copy of your personal data and can ask for a copy of personal data you provided in machine readable form. Visitors can learn more about how to make these requests here . You may also contact us using the contact information below, and we will consider your request in accordance with applicable laws. Residents in the Designated Countries and the UK , and other regions , may have additional rights under their laws. 4.3 Account Closure We keep some of your data even after you close your account. If you choose to close your LinkedIn account, your personal data will generally stop being visible to others on our Services within 24 hours. We generally delete closed account information within 30 days of account closure, except as noted below. We retain your personal data even after you have closed your account if reasonably necessary to comply with our legal obligations (including law enforcement requests), meet regulatory requirements, resolve disputes, maintain security, prevent fraud and abuse (e.g., if we have restricted your account for breach of our Professional Community Policies ), enforce our User Agreement, or fulfill your request to "unsubscribe" from further messages from us. We will retain de-personalized information after your account has been closed. Information you have shared with others (e.g., through InMail, updates or group posts) will remain visible after you close your account or delete the information from your own profile or mailbox, and we do not control data that other Members have copied out of our Services. Groups content and ratings or review content associated with closed accounts will show an unknown user as the source. Your profile may continue to be displayed in the services of others (e.g., search tools) until they refresh their cache. 5. Other Important Information 5.1. Security We monitor for and try to prevent security breaches. Please use the security features available through our Services. We implement security safeguards designed to protect your data, such as HTTPS. We regularly monitor our systems for possible vulnerabilities and attacks. However, we cannot warrant the security of any information that you send us. There is no guarantee that data may not be accessed, disclosed, altered, or destroyed by breach of any of our physical, technical, or managerial safeguards. 5.2. Cross-Border Data Transfers We store and use your data outside your country. We process data both inside and outside of the United States and rely on legally-provided mechanisms to lawfully transfer data across borders. Learn more . Countries where we process data may have laws which are different from, and potentially not as protective as, the laws of your own country. 5.3 Lawful Bases for Processing We have lawful bases to collect, use and share data about you. You have choices about our use of your data. At any time, you can withdraw consent you have provided by going to settings. We will only collect and process personal data about you where we have lawful bases. Lawful bases include consent (where you have given consent), contract (where processing is necessary for the performance of a contract with you (e.g., to deliver the LinkedIn Services you have requested) and “legitimate interests.” Learn more . Where we rely on your consent to process personal data, you have the right to withdraw or decline your consent at any time and where we rely on legitimate interests, you have the right to object. Learn More . If you have any questions about the lawful bases upon which we collect and use your personal data, please contact our Data Protection Officer here . If you're located in one of the Designated Countries or the UK, you can learn more about our lawful bases for processing in our European Regional Privacy Notice . 5.4. Direct Marketing and Do Not Track Signals Our statements regarding direct marketing and “do not track” signals. We currently do not share personal data with third parties for their direct marketing purposes without your permission. Learn more about this and about our response to “do not track” signals. 5.5. Contact Information You can contact us or use other options to resolve any complaints. If you have questions or complaints regarding this Policy, please first contact LinkedIn online. You can also reach us by physical mail . If contacting us does not resolve your complaint, you have more options . Residents in the Designated Countries and other regions may also have the right to contact our Data Protection Officer here . If this does not resolve your complaint, Residents in the Designated Countries and other regions may have more options under their laws. Key Terms Consent Where we process data based on consent, we will ask for your explicit consent. You may withdraw your consent at any time, but that will not affect the lawfulness of the processing of your personal data prior to such withdrawal. Where we rely on contract, we will ask that you agree to the processing of personal data that is necessary for entering into or performance of your contract with us. We will rely on legitimate interests as a basis for data processing where the processing of your data is not overridden by your interests or fundamental rights and freedoms. LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) Language | 2026-01-13T09:29:14 |
https://www.linkedin.com/signup/cold-join?session_redirect=%2Fservices%2Fproducts%2Fcategories%2Fserver-virtualization-software&trk=products_seo_search_nav-header-join | Sign Up | LinkedIn Make the most of your professional life Not you? Remove photo Join LinkedIn To create a LinkedIn account, you must understand how LinkedIn processes your personal information by selecting learn more for each item listed. Agree to all terms We collect and use personal information. Learn more We share personal information with third parties to provide our services. Learn more Further information is available in our Korea Privacy Addendum . Privacy Policy Addendum 1 of 2 2 of 2 Agree to the term Continue Back Agree to all terms Email Password Show Remember me First name Last name By clicking Agree & Join, you agree to the LinkedIn User Agreement , Privacy Policy , and Cookie Policy . Agree & Join or Security verification Already on LinkedIn? Sign in Looking to create a page for a business? Get help LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) Language | 2026-01-13T09:29:14 |
https://doc.rust-lang.org/book/appendix-05-editions.html | E - Editions - The Rust Programming Language Keyboard shortcuts Press ← or → to navigate between chapters Press S or / to search in the book Press ? to show this help Press Esc to hide this help Auto Light Rust Coal Navy Ayu The Rust Programming Language Appendix E: Editions In Chapter 1, you saw that cargo new adds a bit of metadata to your Cargo.toml file about an edition. This appendix talks about what that means! The Rust language and compiler have a six-week release cycle, meaning users get a constant stream of new features. Other programming languages release larger changes less often; Rust releases smaller updates more frequently. After a while, all of these tiny changes add up. But from release to release, it can be difficult to look back and say, “Wow, between Rust 1.10 and Rust 1.31, Rust has changed a lot!” Every three years or so, the Rust team produces a new Rust edition . Each edition brings together the features that have landed into a clear package with fully updated documentation and tooling. New editions ship as part of the usual six-week release process. Editions serve different purposes for different people: For active Rust users, a new edition brings together incremental changes into an easy-to-understand package. For non-users, a new edition signals that some major advancements have landed, which might make Rust worth another look. For those developing Rust, a new edition provides a rallying point for the project as a whole. At the time of this writing, four Rust editions are available: Rust 2015, Rust 2018, Rust 2021, and Rust 2024. This book is written using Rust 2024 edition idioms. The edition key in Cargo.toml indicates which edition the compiler should use for your code. If the key doesn’t exist, Rust uses 2015 as the edition value for backward compatibility reasons. Each project can opt in to an edition other than the default 2015 edition. Editions can contain incompatible changes, such as including a new keyword that conflicts with identifiers in code. However, unless you opt in to those changes, your code will continue to compile even as you upgrade the Rust compiler version you use. All Rust compiler versions support any edition that existed prior to that compiler’s release, and they can link crates of any supported editions together. Edition changes only affect the way the compiler initially parses code. Therefore, if you’re using Rust 2015 and one of your dependencies uses Rust 2018, your project will compile and be able to use that dependency. The opposite situation, where your project uses Rust 2018 and a dependency uses Rust 2015, works as well. To be clear: Most features will be available on all editions. Developers using any Rust edition will continue to see improvements as new stable releases are made. However, in some cases, mainly when new keywords are added, some new features might only be available in later editions. You will need to switch editions if you want to take advantage of such features. For more details, see The Rust Edition Guide . This is a complete book that enumerates the differences between editions and explains how to automatically upgrade your code to a new edition via cargo fix . | 2026-01-13T09:29:14 |
https://id-id.facebook.com/login/?next=https%3A%2F%2Fl.facebook.com%2Fl.php%3Fu%3Dhttps%253A%252F%252Fwww.instagram.com%252F%26amp%253Bh%3DAT01G6_nw6Bh-5sCbp2-aSr0g4Qn7kzux3KaClq4B-Ydqu_2cilx63HukRJNrpVSfO5KTOnvI2cAQAO9cOP5vcEy6U8cteIXFwQYm9A31sMi4P1LSY6nof6oJFyCIthvYsIp7MuPsMmVpsdU | Facebook Jelajahi hal-hal yang Anda sukai . Masuk Facebook Email atau nomor ponsel Kata Sandi Masuk Lupa kata sandi? Buat akun baru Bahasa Indonesia 한국어 English (US) Tiếng Việt ภาษาไทย Español 中文(简体) Bahasa lainnya... Daftar Masuk Messenger Facebook Lite Video Meta Pay Meta Store Meta Quest Ray-Ban Meta Meta AI Konten Meta AI lainnya Instagram Threads Pusat Informasi Pemilu Kebijakan Privasi Pusat Privasi Tentang Buat Iklan Buat Halaman Developer Karier Cookie Pilihan Iklan Ketentuan Bantuan Pengunggahan Kontak & Non-Pengguna Meta © 2026 | 2026-01-13T09:29:14 |
https://th-th.facebook.com/reg/?entry_point=login&amp%3Bnext=https%3A%2F%2Fwww.facebook.com%2Fshare_channel%2F%3Ftype%3Dreshare%26link%3Dhttps%253A%252F%252Fdev.to%252Ftauri%252Ftauri-10-release-candidate-53jk%26app_id%3D966242223397117%26source_surface%3Dexternal_reshare%26display%26hashtag | Facebook Facebook อีเมลหรือโทรศัพท์ รหัสผ่าน ลืมบัญชีใช่หรือไม่ สร้างบัญชีใหม่ คุณถูกบล็อกชั่วคราว คุณถูกบล็อกชั่วคราว ดูเหมือนว่าคุณจะใช้คุณสมบัตินี้ในทางที่ผิดโดยการใช้เร็วเกินไป คุณถูกบล็อกจากการใช้โดยชั่วคราว Back ภาษาไทย 한국어 English (US) Tiếng Việt Bahasa Indonesia Español 中文(简体) 日本語 Português (Brasil) Français (France) Deutsch สมัคร เข้าสู่ระบบ Messenger Facebook Lite วิดีโอ Meta Pay Meta Store Meta Quest Ray-Ban Meta Meta AI เนื้อหาเพิ่มเติมจาก Meta AI Instagram Threads ศูนย์ข้อมูลการลงคะแนนเสียง นโยบายความเป็นส่วนตัว ศูนย์ความเป็นส่วนตัว เกี่ยวกับ สร้างโฆษณา สร้างเพจ ผู้พัฒนา ร่วมงานกับ Facebook คุกกี้ ตัวเลือกโฆษณา เงื่อนไข ความช่วยเหลือ การอัพโหลดผู้ติดต่อและผู้ที่ไม่ได้ใช้บริการ การตั้งค่า บันทึกกิจกรรม Meta © 2026 | 2026-01-13T09:29:14 |
https://doc.rust-lang.org/std/fmt/trait.Debug.html | Debug in std::fmt - Rust This old browser is unsupported and will most likely display funky things. Debug std 1.92.0 (ded5c06cf 2025-12-08) Debug Sections Stability Examples Required Methods fmt Implementors In std:: fmt std :: fmt Trait Debug Copy item path 1.0.0 · Source pub trait Debug { // Required method fn fmt (&self, f: &mut Formatter <'_>) -> Result < () , Error >; } Expand description ? formatting. Debug should format the output in a programmer-facing, debugging context. Generally speaking, you should just derive a Debug implementation. When used with the alternate format specifier #? , the output is pretty-printed. For more information on formatters, see the module-level documentation . This trait can be used with #[derive] if all fields implement Debug . When derive d for structs, it will use the name of the struct , then { , then a comma-separated list of each field’s name and Debug value, then } . For enum s, it will use the name of the variant and, if applicable, ( , then the Debug values of the fields, then ) . § Stability Derived Debug formats are not stable, and so may change with future Rust versions. Additionally, Debug implementations of types provided by the standard library ( std , core , alloc , etc.) are not stable, and may also change with future Rust versions. § Examples Deriving an implementation: #[derive(Debug)] struct Point { x: i32, y: i32, } let origin = Point { x: 0 , y: 0 }; assert_eq! ( format! ( "The origin is: {origin:?}" ), "The origin is: Point { x: 0, y: 0 }" , ); Manually implementing: use std::fmt; struct Point { x: i32, y: i32, } impl fmt::Debug for Point { fn fmt( & self , f: &mut fmt::Formatter< '_ >) -> fmt::Result { f.debug_struct( "Point" ) .field( "x" , & self .x) .field( "y" , & self .y) .finish() } } let origin = Point { x: 0 , y: 0 }; assert_eq! ( format! ( "The origin is: {origin:?}" ), "The origin is: Point { x: 0, y: 0 }" , ); There are a number of helper methods on the Formatter struct to help you with manual implementations, such as debug_struct . Types that do not wish to use the standard suite of debug representations provided by the Formatter trait ( debug_struct , debug_tuple , debug_list , debug_set , debug_map ) can do something totally custom by manually writing an arbitrary representation to the Formatter . impl fmt::Debug for Point { fn fmt( & self , f: &mut fmt::Formatter< '_ >) -> fmt::Result { write! (f, "Point [{} {}]" , self .x, self .y) } } Debug implementations using either derive or the debug builder API on Formatter support pretty-printing using the alternate flag: {:#?} . Pretty-printing with #? : #[derive(Debug)] struct Point { x: i32, y: i32, } let origin = Point { x: 0 , y: 0 }; let expected = "The origin is: Point { x: 0, y: 0, }" ; assert_eq! ( format! ( "The origin is: {origin:#?}" ), expected); Required Methods § 1.0.0 · Source fn fmt (&self, f: &mut Formatter <'_>) -> Result < () , Error > Formats the value using the given formatter. § Errors This function should return Err if, and only if, the provided Formatter returns Err . String formatting is considered an infallible operation; this function only returns a Result because writing to the underlying stream might fail and it must provide a way to propagate the fact that an error has occurred back up the stack. § Examples use std::fmt; struct Position { longitude: f32, latitude: f32, } impl fmt::Debug for Position { fn fmt( & self , f: &mut fmt::Formatter< '_ >) -> fmt::Result { f.debug_tuple( "" ) .field( & self .longitude) .field( & self .latitude) .finish() } } let position = Position { longitude: 1.987 , latitude: 2.983 }; assert_eq! ( format! ( "{position:?}" ), "(1.987, 2.983)" ); assert_eq! ( format! ( "{position:#?}" ), "( 1.987, 2.983, )" ); Implementors § Source § impl Debug for AsciiChar 1.65.0 · Source § impl Debug for BacktraceStatus 1.0.0 · Source § impl Debug for std::cmp:: Ordering Source § impl Debug for TryReserveErrorKind 1.34.0 · Source § impl Debug for Infallible 1.0.0 · Source § impl Debug for VarError 1.64.0 · Source § impl Debug for FromBytesWithNulError 1.16.0 · Source § impl Debug for c_void 1.89.0 · Source § impl Debug for std::fs:: TryLockError Source § impl Debug for AtomicOrdering 1.0.0 · Source § impl Debug for ErrorKind 1.0.0 · Source § impl Debug for SeekFrom 1.7.0 · Source § impl Debug for IpAddr Source § impl Debug for Ipv6MulticastScope 1.0.0 · Source § impl Debug for Shutdown 1.0.0 · Source § impl Debug for std::net:: SocketAddr 1.0.0 · Source § impl Debug for FpCategory 1.55.0 · Source § impl Debug for IntErrorKind Source § impl Debug for AncillaryError Available on (Android or Linux or Cygwin) and Unix only. Source § impl Debug for BacktraceStyle 1.86.0 · Source § impl Debug for GetDisjointMutError Source § impl Debug for SearchStep 1.0.0 · Source § impl Debug for std::sync::atomic:: Ordering 1.12.0 · Source § impl Debug for RecvTimeoutError 1.0.0 · Source § impl Debug for TryRecvError 1.28.0 · Source § impl Debug for std::fmt:: Alignment Source § impl Debug for DebugAsHex Source § impl Debug for Sign 1.0.0 · Source § impl Debug for bool 1.0.0 · Source § impl Debug for char 1.0.0 · Source § impl Debug for f16 1.0.0 · Source § impl Debug for f32 1.0.0 · Source § impl Debug for f64 1.0.0 · Source § impl Debug for f128 1.0.0 · Source § impl Debug for i8 1.0.0 · Source § impl Debug for i16 1.0.0 · Source § impl Debug for i32 1.0.0 · Source § impl Debug for i64 1.0.0 · Source § impl Debug for i128 1.0.0 · Source § impl Debug for isize Source § impl Debug for ! 1.0.0 · Source § impl Debug for str 1.0.0 · Source § impl Debug for u8 1.0.0 · Source § impl Debug for u16 1.0.0 · Source § impl Debug for u32 1.0.0 · Source § impl Debug for u64 1.0.0 · Source § impl Debug for u128 1.0.0 · Source § impl Debug for () 1.0.0 · Source § impl Debug for usize 1.27.0 · Source § impl Debug for CpuidResult 1.27.0 · Source § impl Debug for __m128 1.89.0 · Source § impl Debug for __m128bh 1.27.0 · Source § impl Debug for __m128d Source § impl Debug for __m128h 1.27.0 · Source § impl Debug for __m128i 1.27.0 · Source § impl Debug for __m256 1.89.0 · Source § impl Debug for __m256bh 1.27.0 · Source § impl Debug for __m256d Source § impl Debug for __m256h 1.27.0 · Source § impl Debug for __m256i 1.72.0 · Source § impl Debug for __m512 1.89.0 · Source § impl Debug for __m512bh 1.72.0 · Source § impl Debug for __m512d Source § impl Debug for __m512h 1.72.0 · Source § impl Debug for __m512i Source § impl Debug for bf16 1.81.0 · Source § impl Debug for PanicMessage <'_> Source § impl Debug for AllocError Source § impl Debug for Global 1.28.0 · Source § impl Debug for Layout 1.50.0 · Source § impl Debug for LayoutError 1.28.0 · Source § impl Debug for System 1.0.0 · Source § impl Debug for TypeId 1.34.0 · Source § impl Debug for TryFromSliceError 1.16.0 · Source § impl Debug for std::ascii:: EscapeDefault 1.65.0 · Source § impl Debug for Backtrace Source § impl Debug for BacktraceFrame Source § impl Debug for ByteStr Source § impl Debug for ByteString 1.13.0 · Source § impl Debug for BorrowError 1.13.0 · Source § impl Debug for BorrowMutError 1.34.0 · Source § impl Debug for CharTryFromError 1.9.0 · Source § impl Debug for DecodeUtf16Error 1.20.0 · Source § impl Debug for std::char:: EscapeDebug 1.0.0 · Source § impl Debug for std::char:: EscapeDefault 1.0.0 · Source § impl Debug for std::char:: EscapeUnicode 1.20.0 · Source § impl Debug for ParseCharError 1.0.0 · Source § impl Debug for ToLowercase 1.0.0 · Source § impl Debug for ToUppercase 1.59.0 · Source § impl Debug for TryFromCharError Source § impl Debug for UnorderedKeyError 1.57.0 · Source § impl Debug for TryReserveError 1.16.0 · Source § impl Debug for Args 1.16.0 · Source § impl Debug for ArgsOs 1.0.0 · Source § impl Debug for JoinPathsError 1.16.0 · Source § impl Debug for SplitPaths <'_> 1.16.0 · Source § impl Debug for Vars 1.16.0 · Source § impl Debug for VarsOs 1.87.0 · Source § impl Debug for std::ffi::os_str:: Display <'_> 1.3.0 · Source § impl Debug for CStr Shows the underlying bytes as a normal string, with invalid UTF-8 presented as hex escape sequences. 1.0.0 · Source § impl Debug for CString Delegates to the CStr implementation of fmt::Debug , showing invalid UTF-8 as hex escapes. 1.69.0 · Source § impl Debug for FromBytesUntilNulError 1.64.0 · Source § impl Debug for FromVecWithNulError 1.64.0 · Source § impl Debug for IntoStringError 1.64.0 · Source § impl Debug for NulError 1.0.0 · Source § impl Debug for OsStr 1.0.0 · Source § impl Debug for OsString 1.6.0 · Source § impl Debug for DirBuilder 1.13.0 · Source § impl Debug for DirEntry 1.0.0 · Source § impl Debug for File 1.75.0 · Source § impl Debug for FileTimes 1.16.0 · Source § impl Debug for FileType 1.16.0 · Source § impl Debug for Metadata 1.0.0 · Source § impl Debug for OpenOptions 1.0.0 · Source § impl Debug for Permissions 1.0.0 · Source § impl Debug for ReadDir 1.7.0 · Source § impl Debug for DefaultHasher 1.16.0 · Source § impl Debug for RandomState 1.0.0 · Source § impl Debug for SipHasher Source § impl Debug for BorrowedBuf <'_> 1.0.0 · Source § impl Debug for std::io:: Empty 1.0.0 · Source § impl Debug for std::io:: Error 1.87.0 · Source § impl Debug for PipeReader 1.87.0 · Source § impl Debug for PipeWriter 1.16.0 · Source § impl Debug for std::io:: Repeat 1.0.0 · Source § impl Debug for Sink 1.16.0 · Source § impl Debug for Stderr 1.16.0 · Source § impl Debug for StderrLock <'_> 1.16.0 · Source § impl Debug for Stdin 1.16.0 · Source § impl Debug for StdinLock <'_> 1.16.0 · Source § impl Debug for Stdout 1.16.0 · Source § impl Debug for StdoutLock <'_> 1.56.0 · Source § impl Debug for WriterPanicked Source § impl Debug for PhantomContravariantLifetime <'_> Source § impl Debug for PhantomCovariantLifetime <'_> Source § impl Debug for PhantomInvariantLifetime <'_> 1.33.0 · Source § impl Debug for PhantomPinned Source § impl Debug for Assume 1.0.0 · Source § impl Debug for AddrParseError Source § impl Debug for IntoIncoming 1.0.0 · Source § impl Debug for Ipv4Addr 1.0.0 · Source § impl Debug for Ipv6Addr 1.0.0 · Source § impl Debug for SocketAddrV4 1.0.0 · Source § impl Debug for SocketAddrV6 1.0.0 · Source § impl Debug for TcpListener 1.0.0 · Source § impl Debug for TcpStream 1.0.0 · Source § impl Debug for UdpSocket 1.0.0 · Source § impl Debug for ParseFloatError 1.0.0 · Source § impl Debug for ParseIntError 1.34.0 · Source § impl Debug for TryFromIntError 1.0.0 · Source § impl Debug for RangeFull 1.63.0 · Source § impl Debug for BorrowedFd <'_> Available on Unix or HermitCore or target_os=trusty or WASI or target_os=motor only. 1.63.0 · Source § impl Debug for OwnedFd Available on Unix or HermitCore or target_os=trusty or WASI or target_os=motor only. Source § impl Debug for PidFd Available on Linux only. 1.10.0 · Source § impl Debug for std::os::unix::net:: SocketAddr Available on Unix only. Source § impl Debug for UCred Available on Unix only. 1.10.0 · Source § impl Debug for UnixDatagram Available on Unix only. 1.10.0 · Source § impl Debug for UnixListener Available on Unix only. 1.10.0 · Source § impl Debug for UnixStream Available on Unix only. 1.91.0 · Source § impl Debug for EncodeWide <'_> Available on Windows only. 1.63.0 · Source § impl Debug for BorrowedHandle <'_> Available on Windows only. 1.63.0 · Source § impl Debug for BorrowedSocket <'_> Available on Windows only. 1.63.0 · Source § impl Debug for HandleOrInvalid Available on Windows only. 1.63.0 · Source § impl Debug for HandleOrNull Available on Windows only. 1.63.0 · Source § impl Debug for InvalidHandleError Available on Windows only. 1.63.0 · Source § impl Debug for NullHandleError Available on Windows only. 1.63.0 · Source § impl Debug for OwnedHandle Available on Windows only. 1.63.0 · Source § impl Debug for OwnedSocket Available on Windows only. 1.10.0 · Source § impl Debug for Location <'_> 1.13.0 · Source § impl Debug for Components <'_> 1.0.0 · Source § impl Debug for std::path:: Display <'_> 1.13.0 · Source § impl Debug for std::path:: Iter <'_> Source § impl Debug for NormalizeError 1.0.0 · Source § impl Debug for Path 1.0.0 · Source § impl Debug for PathBuf 1.7.0 · Source § impl Debug for StripPrefixError 1.16.0 · Source § impl Debug for Child 1.16.0 · Source § impl Debug for ChildStderr 1.16.0 · Source § impl Debug for ChildStdin 1.16.0 · Source § impl Debug for ChildStdout 1.0.0 · Source § impl Debug for Command 1.61.0 · Source § impl Debug for ExitCode 1.0.0 · Source § impl Debug for ExitStatus Source § impl Debug for ExitStatusError 1.7.0 · Source § impl Debug for Output 1.16.0 · Source § impl Debug for Stdio Source § impl Debug for std::ptr:: Alignment Source § impl Debug for DefaultRandomSource 1.38.0 · Source § impl Debug for Chars <'_> 1.17.0 · Source § impl Debug for EncodeUtf16 <'_> 1.0.0 · Source § impl Debug for ParseBoolError 1.79.0 · Source § impl Debug for Utf8Chunks <'_> 1.0.0 · Source § impl Debug for Utf8Error 1.17.0 · Source § impl Debug for std::string:: Drain <'_> 1.0.0 · Source § impl Debug for FromUtf8Error 1.0.0 · Source § impl Debug for FromUtf16Error Source § impl Debug for IntoChars 1.0.0 · Source § impl Debug for String 1.3.0 · Source § impl Debug for AtomicBool 1.34.0 · Source § impl Debug for AtomicI8 1.34.0 · Source § impl Debug for AtomicI16 1.34.0 · Source § impl Debug for AtomicI32 1.34.0 · Source § impl Debug for AtomicI64 1.3.0 · Source § impl Debug for AtomicIsize 1.34.0 · Source § impl Debug for AtomicU8 1.34.0 · Source § impl Debug for AtomicU16 1.34.0 · Source § impl Debug for AtomicU32 1.34.0 · Source § impl Debug for AtomicU64 1.3.0 · Source § impl Debug for AtomicUsize 1.0.0 · Source § impl Debug for RecvError Source § impl Debug for std::sync::nonpoison:: Condvar Source § impl Debug for WouldBlock 1.16.0 · Source § impl Debug for Barrier 1.16.0 · Source § impl Debug for BarrierWaitResult 1.16.0 · Source § impl Debug for std::sync:: Condvar 1.16.0 · Source § impl Debug for std::sync:: Once 1.16.0 · Source § impl Debug for OnceState 1.5.0 · Source § impl Debug for WaitTimeoutResult 1.36.0 · Source § impl Debug for Context <'_> Source § impl Debug for LocalWaker 1.36.0 · Source § impl Debug for RawWaker 1.36.0 · Source § impl Debug for RawWakerVTable 1.36.0 · Source § impl Debug for Waker 1.26.0 · Source § impl Debug for AccessError 1.0.0 · Source § impl Debug for Builder 1.63.0 · Source § impl Debug for Scope <'_, '_> 1.0.0 · Source § impl Debug for Thread 1.19.0 · Source § impl Debug for ThreadId 1.27.0 · Source § impl Debug for Duration 1.8.0 · Source § impl Debug for Instant 1.8.0 · Source § impl Debug for SystemTime 1.8.0 · Source § impl Debug for SystemTimeError 1.66.0 · Source § impl Debug for TryFromFloatSecsError 1.0.0 · Source § impl Debug for Arguments <'_> 1.0.0 · Source § impl Debug for std::fmt:: Error Source § impl Debug for FormattingOptions 1.0.0 · Source § impl Debug for dyn Any 1.0.0 · Source § impl Debug for dyn Any + Send 1.28.0 · Source § impl Debug for dyn Any + Send + Sync 1.0.0 · Source § impl<'a> Debug for Component <'a> 1.0.0 · Source § impl<'a> Debug for Prefix <'a> Source § impl<'a> Debug for Utf8Pattern <'a> Source § impl<'a> Debug for Source <'a> Source § impl<'a> Debug for core::ffi::c_str:: Bytes <'a> 1.10.0 · Source § impl<'a> Debug for PanicInfo <'a> Source § impl<'a> Debug for Request <'a> Source § impl<'a> Debug for BorrowedCursor <'a> 1.36.0 · Source § impl<'a> Debug for IoSlice <'a> 1.36.0 · Source § impl<'a> Debug for IoSliceMut <'a> 1.0.0 · Source § impl<'a> Debug for std::net:: Incoming <'a> 1.10.0 · Source § impl<'a> Debug for std::os::unix::net:: Incoming <'a> Available on Unix only. Source § impl<'a> Debug for SocketAncillary <'a> Available on (Android or Linux or Cygwin) and Unix only. Source § impl<'a> Debug for ProcThreadAttributeList <'a> Available on Windows only. Source § impl<'a> Debug for ProcThreadAttributeListBuilder <'a> Available on Windows only. 1.81.0 · Source § impl<'a> Debug for PanicHookInfo <'a> 1.28.0 · Source § impl<'a> Debug for Ancestors <'a> 1.0.0 · Source § impl<'a> Debug for PrefixComponent <'a> 1.57.0 · Source § impl<'a> Debug for CommandArgs <'a> 1.57.0 · Source § impl<'a> Debug for CommandEnvs <'a> 1.60.0 · Source § impl<'a> Debug for EscapeAscii <'a> Source § impl<'a> Debug for CharSearcher <'a> 1.0.0 · Source § impl<'a> Debug for std::str:: Bytes <'a> 1.0.0 · Source § impl<'a> Debug for CharIndices <'a> 1.34.0 · Source § impl<'a> Debug for std::str:: EscapeDebug <'a> 1.34.0 · Source § impl<'a> Debug for std::str:: EscapeDefault <'a> 1.34.0 · Source § impl<'a> Debug for std::str:: EscapeUnicode <'a> 1.0.0 · Source § impl<'a> Debug for std::str:: Lines <'a> 1.0.0 · Source § impl<'a> Debug for LinesAny <'a> 1.34.0 · Source § impl<'a> Debug for SplitAsciiWhitespace <'a> 1.1.0 · Source § impl<'a> Debug for SplitWhitespace <'a> 1.79.0 · Source § impl<'a> Debug for Utf8Chunk <'a> Source § impl<'a> Debug for ContextBuilder <'a> Source § impl<'a, 'b> Debug for CharSliceSearcher <'a, 'b> Source § impl<'a, 'b> Debug for StrSearcher <'a, 'b> Source § impl<'a, 'b, const N: usize > Debug for CharArrayRefSearcher <'a, 'b, N> Source § impl<'a, 'f> Debug for VaList <'a, 'f> where 'f: 'a, 1.0.0 · Source § impl<'a, A> Debug for std::option:: Iter <'a, A> where A: Debug + 'a, 1.0.0 · Source § impl<'a, A> Debug for std::option:: IterMut <'a, A> where A: Debug + 'a, Source § impl<'a, I> Debug for ByRefSized <'a, I> where I: Debug , 1.21.0 · Source § impl<'a, I, A> Debug for Splice <'a, I, A> where I: Debug + Iterator + 'a, A: Debug + Allocator + 'a, <I as Iterator >:: Item : Debug , 1.5.0 · Source § impl<'a, P> Debug for MatchIndices <'a, P> where P: Pattern , <P as Pattern >:: Searcher <'a>: Debug , 1.2.0 · Source § impl<'a, P> Debug for Matches <'a, P> where P: Pattern , <P as Pattern >:: Searcher <'a>: Debug , 1.5.0 · Source § impl<'a, P> Debug for RMatchIndices <'a, P> where P: Pattern , <P as Pattern >:: Searcher <'a>: Debug , 1.2.0 · Source § impl<'a, P> Debug for RMatches <'a, P> where P: Pattern , <P as Pattern >:: Searcher <'a>: Debug , 1.0.0 · Source § impl<'a, P> Debug for std::str:: RSplit <'a, P> where P: Pattern , <P as Pattern >:: Searcher <'a>: Debug , 1.0.0 · Source § impl<'a, P> Debug for std::str:: RSplitN <'a, P> where P: Pattern , <P as Pattern >:: Searcher <'a>: Debug , 1.0.0 · Source § impl<'a, P> Debug for RSplitTerminator <'a, P> where P: Pattern , <P as Pattern >:: Searcher <'a>: Debug , 1.0.0 · Source § impl<'a, P> Debug for std::str:: Split <'a, P> where P: Pattern , <P as Pattern >:: Searcher <'a>: Debug , 1.51.0 · Source § impl<'a, P> Debug for std::str:: SplitInclusive <'a, P> where P: Pattern , <P as Pattern >:: Searcher <'a>: Debug , 1.0.0 · Source § impl<'a, P> Debug for std::str:: SplitN <'a, P> where P: Pattern , <P as Pattern >:: Searcher <'a>: Debug , 1.0.0 · Source § impl<'a, P> Debug for SplitTerminator <'a, P> where P: Pattern , <P as Pattern >:: Searcher <'a>: Debug , 1.17.0 · Source § impl<'a, T> Debug for std::collections::btree_set:: Range <'a, T> where T: Debug + 'a, 1.0.0 · Source § impl<'a, T> Debug for std::result:: Iter <'a, T> where T: Debug + 'a, 1.0.0 · Source § impl<'a, T> Debug for std::result:: IterMut <'a, T> where T: Debug + 'a, 1.0.0 · Source § impl<'a, T> Debug for Chunks <'a, T> where T: Debug + 'a, 1.31.0 · Source § impl<'a, T> Debug for ChunksExact <'a, T> where T: Debug + 'a, 1.31.0 · Source § impl<'a, T> Debug for ChunksExactMut <'a, T> where T: Debug + 'a, 1.0.0 · Source § impl<'a, T> Debug for ChunksMut <'a, T> where T: Debug + 'a, 1.31.0 · Source § impl<'a, T> Debug for RChunks <'a, T> where T: Debug + 'a, 1.31.0 · Source § impl<'a, T> Debug for RChunksExact <'a, T> where T: Debug + 'a, 1.31.0 · Source § impl<'a, T> Debug for RChunksExactMut <'a, T> where T: Debug + 'a, 1.31.0 · Source § impl<'a, T> Debug for RChunksMut <'a, T> where T: Debug + 'a, 1.0.0 · Source § impl<'a, T> Debug for Windows <'a, T> where T: Debug + 'a, 1.6.0 · Source § impl<'a, T, A> Debug for std::collections::binary_heap:: Drain <'a, T, A> where T: Debug + 'a, A: Debug + Allocator , Source § impl<'a, T, A> Debug for DrainSorted <'a, T, A> where T: Debug + Ord , A: Debug + Allocator , 1.77.0 · Source § impl<'a, T, P> Debug for ChunkBy <'a, T, P> where T: 'a + Debug , 1.77.0 · Source § impl<'a, T, P> Debug for ChunkByMut <'a, T, P> where T: 'a + Debug , Source § impl<'a, T, const N: usize > Debug for ArrayWindows <'a, T, N> where T: Debug + 'a, Source § impl<'a, T: Debug + 'a> Debug for std::sync::mpmc:: Iter <'a, T> Source § impl<'a, T: Debug + 'a> Debug for std::sync::mpmc:: TryIter <'a, T> 1.0.0 · Source § impl<'a, T: Debug + 'a> Debug for std::sync::mpsc:: Iter <'a, T> 1.15.0 · Source § impl<'a, T: Debug + 'a> Debug for std::sync::mpsc:: TryIter <'a, T> Source § impl<'a, const N: usize > Debug for CharArraySearcher <'a, N> Source § impl<'f> Debug for VaListImpl <'f> 1.63.0 · Source § impl<'scope, T> Debug for ScopedJoinHandle <'scope, T> 1.0.0 · Source § impl<A> Debug for std::iter:: Repeat <A> where A: Debug , 1.82.0 · Source § impl<A> Debug for RepeatN <A> where A: Debug , 1.0.0 · Source § impl<A> Debug for std::option:: IntoIter <A> where A: Debug , Source § impl<A> Debug for IterRange <A> where A: Debug , Source § impl<A> Debug for IterRangeFrom <A> where A: Debug , Source § impl<A> Debug for IterRangeInclusive <A> where A: Debug , 1.0.0 · Source § impl<A, B> Debug for std::iter:: Chain <A, B> where A: Debug , B: Debug , 1.0.0 · Source § impl<A, B> Debug for Zip <A, B> where A: Debug , B: Debug , 1.0.0 · Source § impl<B> Debug for Cow <'_, B> where B: Debug + ToOwned + ? Sized , <B as ToOwned >:: Owned : Debug , 1.55.0 · Source § impl<B, C> Debug for ControlFlow <B, C> where B: Debug , C: Debug , 1.0.0 · Source § impl<B: Debug > Debug for std::io:: Lines <B> 1.0.0 · Source § impl<B: Debug > Debug for std::io:: Split <B> Source § impl<Dyn> Debug for DynMetadata <Dyn> where Dyn: ? Sized , Source § impl<E> Debug for Report <E> where Report <E>: Display , 1.64.0 · Source § impl<F> Debug for PollFn <F> 1.34.0 · Source § impl<F> Debug for std::iter:: FromFn <F> 1.68.0 · Source § impl<F> Debug for OnceWith <F> 1.68.0 · Source § impl<F> Debug for RepeatWith <F> Source § impl<F> Debug for CharPredicateSearcher <'_, F> where F: FnMut ( char ) -> bool , Source § impl<F> Debug for std::fmt:: FromFn <F> where F: Fn (&mut Formatter <'_>) -> Result < () , Error >, 1.4.0 · Source § impl<F> Debug for F where F: FnPtr , Source § impl<G> Debug for FromCoroutine <G> 1.9.0 · Source § impl<H> Debug for BuildHasherDefault <H> Source § impl<I> Debug for FromIter <I> where I: Debug , 1.9.0 · Source § impl<I> Debug for DecodeUtf16 <I> where I: Debug + Iterator <Item = u16 >, 1.1.0 · Source § impl<I> Debug for Cloned <I> where I: Debug , 1.36.0 · Source § impl<I> Debug for Copied <I> where I: Debug , 1.0.0 · Source § impl<I> Debug for Cycle <I> where I: Debug , 1.0.0 · Source § impl<I> Debug for Enumerate <I> where I: Debug , 1.0.0 · Source § impl<I> Debug for Fuse <I> where I: Debug , Source § impl<I> Debug for Intersperse <I> where I: Debug + Iterator , <I as Iterator >:: Item : Clone + Debug , 1.0.0 · Source § impl<I> Debug for Peekable <I> where I: Debug + Iterator , <I as Iterator >:: Item : Debug , 1.0.0 · Source § impl<I> Debug for Skip <I> where I: Debug , 1.28.0 · Source § impl<I> Debug for StepBy <I> where I: Debug , 1.0.0 · Source § impl<I> Debug for std::iter:: Take <I> where I: Debug , 1.9.0 · Source § impl<I, F> Debug for FilterMap <I, F> where I: Debug , 1.9.0 · Source § impl<I, F> Debug for Inspect <I, F> where I: Debug , 1.9.0 · Source § impl<I, F> Debug for Map <I, F> where I: Debug , Source § impl<I, F, const N: usize > Debug for MapWindows <I, F, N> where I: Iterator + Debug , Source § impl<I, G> Debug for IntersperseWith <I, G> where I: Iterator + Debug , <I as Iterator >:: Item : Debug , G: Debug , 1.9.0 · Source § impl<I, P> Debug for Filter <I, P> where I: Debug , 1.57.0 · Source § impl<I, P> Debug for MapWhile <I, P> where I: Debug , 1.9.0 · Source § impl<I, P> Debug for SkipWhile <I, P> where I: Debug , 1.9.0 · Source § impl<I, P> Debug for TakeWhile <I, P> where I: Debug , 1.9.0 · Source § impl<I, St, F> Debug for Scan <I, St, F> where I: Debug , St: Debug , 1.29.0 · Source § impl<I, U> Debug for Flatten <I> where I: Debug + Iterator , <I as Iterator >:: Item : IntoIterator <IntoIter = U, Item = <U as Iterator >:: Item >, U: Debug + Iterator , 1.9.0 · Source § impl<I, U, F> Debug for FlatMap <I, U, F> where I: Debug , U: IntoIterator , <U as IntoIterator >:: IntoIter : Debug , Source § impl<I, const N: usize > Debug for ArrayChunks <I, N> where I: Debug + Iterator , <I as Iterator >:: Item : Debug , 1.0.0 · Source § impl<Idx> Debug for std::ops:: Range <Idx> where Idx: Debug , 1.0.0 · Source § impl<Idx> Debug for std::ops:: RangeFrom <Idx> where Idx: Debug , 1.26.0 · Source § impl<Idx> Debug for std::ops:: RangeInclusive <Idx> where Idx: Debug , 1.0.0 · Source § impl<Idx> Debug for RangeTo <Idx> where Idx: Debug , 1.26.0 · Source § impl<Idx> Debug for std::ops:: RangeToInclusive <Idx> where Idx: Debug , Source § impl<Idx> Debug for std::range:: Range <Idx> where Idx: Debug , Source § impl<Idx> Debug for std::range:: RangeFrom <Idx> where Idx: Debug , Source § impl<Idx> Debug for std::range:: RangeInclusive <Idx> where Idx: Debug , Source § impl<Idx> Debug for std::range:: RangeToInclusive <Idx> where Idx: Debug , Source § impl<K> Debug for std::collections::btree_set:: Cursor <'_, K> where K: Debug , Source § impl<K, A> Debug for std::collections::btree_set:: CursorMut <'_, K, A> where K: Debug , Source § impl<K, A> Debug for std::collections::btree_set:: CursorMutKey <'_, K, A> where K: Debug , 1.88.0 · Source § impl<K, F> Debug for std::collections::hash_set:: ExtractIf <'_, K, F> where K: Debug , Source § impl<K, V> Debug for std::collections::btree_map:: Cursor <'_, K, V> where K: Debug , V: Debug , 1.17.0 · Source § impl<K, V> Debug for std::collections::btree_map:: Iter <'_, K, V> where K: Debug , V: Debug , 1.17.0 · Source § impl<K, V> Debug for std::collections::btree_map:: IterMut <'_, K, V> where K: Debug , V: Debug , 1.17.0 · Source § impl<K, V> Debug for std::collections::btree_map:: Keys <'_, K, V> where K: Debug , 1.17.0 · Source § impl<K, V> Debug for std::collections::btree_map:: Range <'_, K, V> where K: Debug , V: Debug , 1.17.0 · Source § impl<K, V> Debug for RangeMut <'_, K, V> where K: Debug , V: Debug , 1.17.0 · Source § impl<K, V> Debug for std::collections::btree_map:: Values <'_, K, V> where V: Debug , 1.10.0 · Source § impl<K, V> Debug for std::collections::btree_map:: ValuesMut <'_, K, V> where V: Debug , 1.16.0 · Source § impl<K, V> Debug for std::collections::hash_map:: Drain <'_, K, V> where K: Debug , V: Debug , 1.16.0 · Source § impl<K, V> Debug for std::collections::hash_map:: IterMut <'_, K, V> where K: Debug , V: Debug , 1.12.0 · Source § impl<K, V, A> Debug for std::collections::btree_map:: Entry <'_, K, V, A> where K: Debug + Ord , V: Debug , A: Allocator + Clone , Source § impl<K, V, A> Debug for std::collections::btree_map:: CursorMut <'_, K, V, A> where K: Debug , V: Debug , Source § impl<K, V, A> Debug for std::collections::btree_map:: CursorMutKey <'_, K, V, A> where K: Debug , V: Debug , 1.17.0 · Source § impl<K, V, A> Debug for std::collections::btree_map:: IntoIter <K, V, A> where K: Debug , V: Debug , A: Allocator + Clone , 1.54.0 · Source § impl<K, V, A> Debug for std::collections::btree_map:: IntoKeys <K, V, A> where K: Debug , A: Allocator + Clone , 1.54.0 · Source § impl<K, V, A> Debug for std::collections::btree_map:: IntoValues <K, V, A> where V: Debug , A: Allocator + Clone , 1.12.0 · Source § impl<K, V, A> Debug for std::collections::btree_map:: OccupiedEntry <'_, K, V, A> where K: Debug + Ord , V: Debug , A: Allocator + Clone , Source § impl<K, V, A> Debug for std::collections::btree_map:: OccupiedError <'_, K, V, A> where K: Debug + Ord , V: Debug , A: Allocator + Clone , 1.12.0 · Source § impl<K, V, A> Debug for std::collections::btree_map:: VacantEntry <'_, K, V, A> where K: Debug + Ord , A: Allocator + Clone , 1.0.0 · Source § impl<K, V, A> Debug for BTreeMap <K, V, A> where K: Debug , V: Debug , A: Allocator + Clone , 1.88.0 · Source § impl<K, V, F> Debug for std::collections::hash_map:: ExtractIf <'_, K, V, F> where K: Debug , V: Debug , 1.91.0 · Source § impl<K, V, R, F, A> Debug for std::collections::btree_map:: ExtractIf <'_, K, V, R, F, A> where K: Debug , V: Debug , A: Allocator + Clone , 1.0.0 · Source § impl<K, V, S> Debug for HashMap <K, V, S> where K: Debug , V: Debug , 1.54.0 · Source § impl<K, V: Debug > Debug for std::collections::hash_map:: IntoValues <K, V> 1.16.0 · Source § impl<K, V: Debug > Debug for std::collections::hash_map:: Values <'_, K, V> 1.16.0 · Source § impl<K, V: Debug > Debug for std::collections::hash_map:: ValuesMut <'_, K, V> 1.16.0 · Source § impl<K: Debug > Debug for std::collections::hash_set:: Drain <'_, K> 1.16.0 · Source § impl<K: Debug > Debug for std::collections::hash_set:: IntoIter <K> 1.16.0 · Source § impl<K: Debug > Debug for std::collections::hash_set:: Iter <'_, K> 1.54.0 · Source § impl<K: Debug , V> Debug for std::collections::hash_map:: IntoKeys <K, V> 1.16.0 · Source § impl<K: Debug , V> Debug for std::collections::hash_map:: Keys <'_, K, V> 1.12.0 · Source § impl<K: Debug , V> Debug for std::collections::hash_map:: VacantEntry <'_, K, V> 1.12.0 · Source § impl<K: Debug , V: Debug > Debug for std::collections::hash_map:: Entry <'_, K, V> 1.16.0 · Source § impl<K: Debug , V: Debug > Debug for std::collections::hash_map:: IntoIter <K, V> 1.16.0 · Source § impl<K: Debug , V: Debug > Debug for std::collections::hash_map:: Iter <'_, K, V> 1.12.0 · Source § impl<K: Debug , V: Debug > Debug for std::collections::hash_map:: OccupiedEntry <'_, K, V> Source § impl<K: Debug , V: Debug > Debug for std::collections::hash_map:: OccupiedError <'_, K, V> 1.33.0 · Source § impl<Ptr> Debug for Pin <Ptr> where Ptr: Debug , 1.0.0 · Source § impl<R> Debug for BufReader <R> where R: ? Sized + Debug , 1.0.0 · Source § impl<R: Debug > Debug for std::io:: Bytes <R> 1.17.0 · Source § impl<T> Debug for Bound <T> where T: Debug , 1.0.0 · Source § impl<T> Debug for Option <T> where T: Debug , 1.0.0 · Source § impl<T> Debug for std::sync:: TryLockError <T> Source § impl<T> Debug for SendTimeoutError <T> 1.0.0 · Source § impl<T> Debug for TrySendError <T> 1.36.0 · Source § impl<T> Debug for Poll <T> where T: Debug , 1.0.0 · Source § impl<T> Debug for *const T where T: ? Sized , 1.0.0 · Source § impl<T> Debug for *mut T where T: ? Sized , 1.0.0 · Source § impl<T> Debug for &T where T: Debug + ? Sized , 1.0.0 · Source § impl<T> Debug for &mut T where T: Debug + ? Sized , 1.0.0 · Source § impl<T> Debug for [T] where T: Debug , 1.0.0 · Source § impl<T> Debug for (T₁, T₂, …, Tₙ) where T: Debug , This trait is implemented for tuples up to twelve items long. Source § impl<T> Debug for NumBuffer <T> where T: Debug + NumBufferTrait , Source § impl<T> Debug for ThinBox <T> where T: Debug + ? Sized , 1.0.0 · Source § impl<T> Debug for Cell <T> where T: Copy + Debug , 1.70.0 · Source § impl<T> Debug for OnceCell <T> where T: Debug , 1.0.0 · Source § impl<T> Debug for Ref <'_, T> where T: Debug + ? Sized , 1.0.0 · Source § impl<T> Debug for RefCell <T> where T: Debug + ? Sized , 1.0.0 · Source § impl<T> Debug for RefMut <'_, T> where T: Debug + ? Sized , Source § impl<T> Debug for SyncUnsafeCell <T> where T: ? Sized , 1.9.0 · Source § impl<T> Debug for UnsafeCell <T> where T: ? Sized , 1.19.0 · Source § impl<T> Debug for Reverse <T> where T: Debug , 1.17.0 · Source § impl<T> Debug for std::collections::binary_heap:: Iter <'_, T> where T: Debug , 1.17.0 · Source § impl<T> Debug for std::collections::btree_set:: Iter <'_, T> where T: Debug , 1.17.0 · Source § impl<T> Debug for std::collections::btree_set:: SymmetricDifference <'_, T> where T: Debug , 1.17.0 · Source § impl<T> Debug for std::collections::btree_set:: Union <'_, T> where T: Debug , 1.17.0 · Source § impl<T> Debug for std::collections::linked_list:: Iter <'_, T> where T: Debug , 1.17.0 · Source § impl<T> Debug for std::collections::linked_list:: IterMut <'_, T> where T: Debug , 1.17.0 · Source § impl<T> Debug for std::collections::vec_deque:: Iter <'_, T> where T: Debug , 1.17.0 · Source § impl<T> Debug for std::collections::vec_deque:: IterMut <'_, T> where T: Debug , 1.48.0 · Source § impl<T> Debug for Pending <T> 1.48.0 · Source § impl<T> Debug for Ready <T> where T: Debug , 1.9.0 · Source § impl<T> Debug for std::iter:: Empty <T> 1.2.0 · Source § impl<T> Debug for std::iter:: Once <T> where T: Debug , 1.0.0 · Source § impl<T> Debug for Rev <T> where T: Debug , Source § impl<T> Debug for PhantomContravariant <T> where T: ? Sized , Source § impl<T> Debug for PhantomCovariant <T> where T: ? Sized , 1.0.0 · Source § impl<T> Debug for PhantomData <T> where T: ? Sized , Source § impl<T> Debug for PhantomInvariant <T> where T: ? Sized , 1.21.0 · Source § impl<T> Debug for Discriminant <T> 1.20.0 · Source § impl<T> Debug for ManuallyDrop <T> where T: Debug + ? Sized , 1.28.0 · Source § impl<T> Debug for NonZero <T> where T: ZeroablePrimitive + Debug , 1.74.0 · Source § impl<T> Debug for Saturating <T> where T: Debug , 1.0.0 · Source § impl<T> Debug for Wrapping <T> where T: Debug , Source § impl<T> Debug for Yeet <T> where T: Debug , 1.16.0 · Source § impl<T> Debug for AssertUnwindSafe <T> where T: Debug , Source § impl<T> Debug for UnsafePinned <T> where T: ? Sized , 1.25.0 · Source § impl<T> Debug for NonNull <T> where T: ? Sized , 1.0.0 · Source § impl<T> Debug for std::result:: IntoIter <T> where T: Debug , 1.9.0 · Source § impl<T> Debug for std::slice:: Iter <'_, T> where T: Debug , 1.9.0 · Source § impl<T> Debug for std::slice:: IterMut <'_, T> where T: Debug , 1.3.0 · Source § impl<T> Debug for AtomicPtr <T> Source § impl<T> Debug for std::sync::mpmc:: Receiver <T> Source § impl<T> Debug for std::sync::mpmc:: Sender <T> 1.8.0 · Source § impl<T> Debug for std::sync::mpsc:: Receiver <T> 1.0.0 · Source § impl<T> Debug for SendError <T> 1.8.0 · Source § impl<T> Debug for std::sync::mpsc:: Sender <T> 1.8.0 · Source § impl<T> Debug for SyncSender <T> Source § impl<T> Debug for Exclusive <T> where T: ? Sized , 1.0.0 · Source § impl<T> Debug for PoisonError <T> 1.16.0 · Source § impl<T> Debug for JoinHandle <T> 1.41.0 · Source § impl<T> Debug for MaybeUninit <T> Source § impl<T, A> Debug for std::collections::btree_set:: Entry <'_, T, A> where T: Debug + Ord , A: Allocator + Clone , 1.0.0 · Source § impl<T, A> Debug for Box <T, A> where T: Debug + ? Sized , A: Allocator , 1.17.0 · Source § impl<T, A> Debug for std::collections::binary_heap:: IntoIter <T, A> where T: Debug , A: Allocator , Source § impl<T, A> Debug for IntoIterSorted <T, A> where T: Debug , A: Debug + Allocator , 1.17.0 · Source § impl<T, A> Debug for std::collections::binary_heap:: PeekMut <'_, T, A> where T: Ord + Debug , A: Allocator , 1.17.0 · Source § impl<T, A> Debug for std::collections::btree_set:: Difference <'_, T, A> where T: Debug , A: Allocator + Clone , 1.17.0 · Source § impl<T, A> Debug for std::collections::btree_set:: Intersection <'_, T, A> where T: Debug , A: Allocator + Clone , 1.0.0 · Source § impl<T, A> Debug for std::collections::btree_set:: IntoIter <T, A> where T: Debug , A: Debug + Allocator + Clone , Source § impl<T, A> Debug for std::collections::btree_set:: OccupiedEntry <'_, T, A> where T: Debug + Ord , A: Allocator + Clone , Source § impl<T, A> Debug for std::collections::btree_set:: VacantEntry <'_, T, A> where T: Debug + Ord , A: Allocator + Clone , Source § impl<T, A> Debug for std::collections::linked_list:: Cursor <'_, T, A> where T: Debug , A: Allocator , Source § impl<T, A> Debug for std::collections::linked_list:: CursorMut <'_, T, A> where T: Debug , A: Allocator , 1.17.0 · Source § impl<T, A> Debug for std::collections::linked_list:: IntoIter <T, A> where T: Debug , A: Allocator , 1.0.0 · Source § impl<T, A> Debug for BTreeSet <T, A> where T: Debug , A: Allocator + Clone , 1.4.0 · Source § impl<T, A> Debug for BinaryHeap <T, A> where T: Debug , A: Allocator , 1.0.0 · Source § impl<T, A> Debug for LinkedList <T, A> where T: Debug , A: Allocator , 1.0.0 · Source § impl<T, A> Debug for VecDeque <T, A> where T: Debug , A: Allocator , 1.17.0 · Source § impl<T, A> Debug for std::collections::vec_deque:: Drain <'_, T, A> where T: Debug , A: Allocator , 1.17.0 · Source § impl<T, A> Debug for std::collections::vec_deque:: IntoIter <T, A> where T: Debug , A: Allocator , 1.0.0 · Source § impl<T, A> Debug for Rc <T, A> where T: Debug + ? Sized , A: Allocator , Source § impl<T, A> Debug for UniqueRc <T, A> where T: Debug + ? Sized , A: Allocator , 1.4.0 · Source § impl<T, A> Debug for std::rc:: Weak <T, A> where A: Allocator , T: ? Sized , 1.0.0 · Source § impl<T, A> Debug for Arc <T, A> where T: Debug + ? Sized , A: Allocator , Source § impl<T, A> Debug for UniqueArc <T, A> where T: Debug + ? Sized , A: Allocator , 1.4.0 · Source § impl<T, A> Debug for std::sync:: Weak <T, A> where A: Allocator , T: ? Sized , 1.17.0 · Source § impl<T, A> Debug for std::vec:: Drain <'_, T, A> where T: Debug , A: Allocator , 1.13.0 · Source § impl<T, A> Debug for std::vec:: IntoIter <T, A> where T: Debug , A: Allocator , Source § impl<T, A> Debug for std::vec:: PeekMut <'_, T, A> where T: Debug , A: Allocator , 1.0.0 · Source § impl<T, A> Debug for Vec <T, A> where T: Debug , A: Allocator , 1.0.0 · Source § impl<T, E> Debug for Result <T, E> where T: Debug , E: Debug , 1.80.0 · Source § impl<T, F> Debug for LazyCell <T, F> where T: Debug , 1.34.0 · Source § impl<T, F> Debug for Successors <T, F> where T: Debug , Source § impl<T, F> Debug for DropGuard <T, F> where T: Debug , F: FnOnce (T), 1.87.0 · Source § impl<T, F, A> Debug for std::collections::linked_list:: ExtractIf <'_, T, F, A> where T: Debug , A: Allocator , 1.87.0 · Source § impl<T, F, A> Debug for std::vec:: ExtractIf <'_, T, F, A> where T: Debug , A: Allocator , 1.27.0 · Source § impl<T, P> Debug for std::slice:: RSplit <'_, T, P> where T: Debug , P: FnMut ( &T ) -> bool , 1.27.0 · Source § impl<T, P> Debug for RSplitMut <'_, T, P> where T: Debug , P: FnMut ( &T ) -> bool , 1.9.0 · Source § impl<T, P> Debug for std::slice:: RSplitN <'_, T, P> where T: Debug , P: FnMut ( &T ) -> bool , 1.9.0 · Source § impl<T, P> Debug for RSplitNMut <'_, T, P> where T: Debug , P: FnMut ( &T ) -> bool , 1.9.0 · Source § impl<T, P> Debug for std::slice:: Split <'_, T, P> where T: Debug , P: FnMut ( &T ) -> bool , 1.51.0 · Source § impl<T, P> Debug for std::slice:: SplitInclusive <'_, T, P> where T: Debug , P: FnMut ( &T ) -> bool , 1.51.0 · Source § impl<T, P> Debug for SplitInclusiveMut <'_, T, P> where T: Debug , P: FnMut ( &T ) -> bool , 1.9.0 · Source § impl<T, P> Debug for SplitMut <'_, T, P> where T: Debug , P: FnMut ( &T ) -> bool , 1.9.0 · Source § impl<T, P> Debug for std::slice:: SplitN <'_, T, P> where T: Debug , P: FnMut ( &T ) -> bool , 1.9.0 · Source § impl<T, P> Debug for SplitNMut <'_, T, P> where T: Debug , P: FnMut ( &T ) -> bool , 1.91.0 · Source § impl<T, R, F, A> Debug for std::collections::btree_set:: ExtractIf <'_, T, R, F, A> where T: Debug , A: Allocator + Clone , 1.16.0 · Source § impl<T, S> Debug for std::collections::hash_set:: Difference <'_, T, S> where T: Debug + Eq + Hash , S: BuildHasher , 1.16.0 · Source § impl<T, S> Debug for std::collections::hash_set:: Intersection <'_, T, S> where T: Debug + Eq + Hash , S: BuildHasher , 1.16.0 · Source § impl<T, S> Debug for std::collections::hash_set:: SymmetricDifference <'_, T, S> where T: Debug + Eq + Hash , S: BuildHasher , 1.16.0 · Source § impl<T, S> Debug for std::collections::hash_set:: Union <'_, T, S> where T: Debug + Eq + Hash , S: BuildHasher , 1.0.0 · Source § impl<T, S> Debug for HashSet <T, S> where T: Debug , 1.0.0 · Source § impl<T, const N: usize > Debug for [T; N] where T: Debug , 1.40.0 · Source § impl<T, const N: usize > Debug for std::array:: IntoIter <T, N> where T: Debug , Source § impl<T, const N: usize > Debug for Mask <T, N> where T: MaskElement + Debug , LaneCount <N>: SupportedLaneCount , Source § impl<T, const N: usize > Debug for Simd <T, N> where LaneCount <N>: SupportedLaneCount , T: SimdElement + Debug , 1.16.0 · Source § impl<T: 'static> Debug for LocalKey <T> Source § impl<T: Debug + ? Sized > Debug for ReentrantLock <T> Source § impl<T: Debug + ? Sized > Debug for ReentrantLockGuard <'_, T> 1.0.0 · Source § impl<T: Debug > Debug for std::io:: Cursor <T> 1.0.0 · Source § impl<T: Debug > Debug for std::io:: Take <T> Source § impl<T: Debug > Debug for std::sync::mpmc:: IntoIter <T> 1.1.0 · Source § impl<T: Debug > Debug for std::sync::mpsc:: IntoIter <T> 1.70.0 · Source § impl<T: Debug > Debug for OnceLock <T> 1.80.0 · Source § impl<T: Debug , F> Debug for LazyLock <T, F> Source § impl<T: Debug , S> Debug for std::collections::hash_set:: Entry <'_, T, S> Source § impl<T: Debug , S> Debug for std::collections::hash_set:: OccupiedEntry <'_, T, S> Source § impl<T: Debug , S> Debug for std::collections::hash_set:: VacantEntry <'_, T, S> 1.0.0 · Source § impl<T: Debug , U: Debug > Debug for std::io:: Chain <T, U> Source § impl<T: ? Sized + Debug > Debug for std::sync::nonpoison:: MappedMutexGuard <'_, T> Source § impl<T: ? Sized + Debug > Debug for std::sync::nonpoison:: MappedRwLockReadGuard <'_, T> Source § impl<T: ? Sized + Debug > Debug for std::sync::nonpoison:: MappedRwLockWriteGuard <'_, T> Source § impl<T: ? Sized + Debug > Debug for std::sync::nonpoison:: Mutex <T> Source § impl<T: ? Sized + Debug > Debug for std::sync::nonpoison:: MutexGuard <'_, T> Source § impl<T: ? Sized + Debug > Debug for std::sync::nonpoison:: RwLock <T> Source § impl<T: ? Sized + Debug > Debug for std::sync::nonpoison:: RwLockReadGuard <'_, T> Source § impl<T: ? Sized + Debug > Debug for std::sync::nonpoison:: RwLockWriteGuard <'_, T> Source § impl<T: ? Sized + Debug > Debug for std::sync:: MappedMutexGuard <'_, T> Source § impl<T: ? Sized + Debug > Debug for std::sync:: MappedRwLockReadGuard <'_, T> Source § impl<T: ? Sized + Debug > Debug for std::sync:: MappedRwLockWriteGuard <'_, T> 1.0.0 · Source § impl<T: ? Sized + Debug > Debug for std::sync:: Mutex <T> 1.16.0 · Source § impl<T: ? Sized + Debug > Debug for std::sync:: MutexGuard <'_, T> 1.0.0 · Source § impl<T: ? Sized + Debug > Debug for std::sync:: RwLock <T> 1.16.0 · Source § impl<T: ? Sized + Debug > Debug for std::sync:: RwLockReadGuard <'_, T> 1.16.0 · Source § impl<T: ? Sized + Debug > Debug for std::sync:: RwLockWriteGuard <'_, T> 1.0.0 · Source § impl<W> Debug for BufWriter <W> where W: Debug + ? Sized + Write , 1.0.0 · Source § impl<W> Debug for LineWriter <W> where W: Debug + ? Sized + Write , 1.0.0 · Source § impl<W: Debug > Debug for IntoInnerError <W> Source § impl<Y, R> Debug for CoroutineState <Y, R> where Y: Debug , R: Debug , | 2026-01-13T09:29:14 |
https://in.linkedin.com/company/perensoft-solutions#main-content | Perensoft Solutions | LinkedIn Skip to main content LinkedIn Articles People Learning Jobs Games Sign in Join for free Perensoft Solutions IT Services and IT Consulting Rajkot, Gujarat 45 followers Ideas that Matter. Engineered for Impact, Built to Scale Follow Report this company About us At Perensoft, we drive digital transformation by delivering customized technology solutions designed to empower businesses across various industries worldwide. With expertise spanning DevOps, Cloud Solutions, Mobile and Web Development, UI/UX Design, Custom Software Development, and Digital Marketing, we provide comprehensive, end-to-end services that foster innovation, agility, and growth. Our dedicated team of 10+ talented engineers continues to evolve daily, committed to mastering emerging technologies and industry best practices. Our engineers hold prestigious certifications, including AWS Cloud, Terraform, and Adobe Magento2, ensuring our solutions are reliable, secure, and highly efficient. We proudly serve clients across the globe, including the USA, UAE, Canada, UK, Australia, and Brazil, building partnerships that transcend geographical boundaries. From initial concept through deployment and beyond, we collaborate closely with our clients, crafting scalable solutions that streamline operations, enhance customer experiences, and drive measurable results. Website www.perensoft.com External link for Perensoft Solutions Industry IT Services and IT Consulting Company size 2-10 employees Headquarters Rajkot, Gujarat Type Partnership Specialties Cloud Migrations, Web Apps Development, Custom Software Development, Full-stack Development, DevOps, Mobile Application Development, Flutter Application Development, React Native Development, Graphics Design, Contractual Outsourcing, and DevSecOps Locations Primary Rajkot, Gujarat, IN Get directions Updates Perensoft Solutions 45 followers 1d Report this post 𝐔𝐗 𝐝𝐞𝐛𝐭 𝐢𝐬 𝐨𝐧𝐞 𝐨𝐟 𝐭𝐡𝐞 𝐦𝐨𝐬𝐭 𝐜𝐨𝐦𝐦𝐨𝐧 - 𝐚𝐧𝐝 𝐦𝐨𝐬𝐭 𝐨𝐯𝐞𝐫𝐥𝐨𝐨𝐤𝐞𝐝 - 𝐫𝐞𝐚𝐬𝐨𝐧𝐬 𝐮𝐬𝐞𝐫𝐬 𝐪𝐮𝐢𝐞𝐭𝐥𝐲 𝐬𝐭𝐨𝐩 𝐞𝐧𝐠𝐚𝐠𝐢𝐧𝐠 𝐰𝐢𝐭𝐡 𝐝𝐢𝐠𝐢𝐭𝐚𝐥 𝐩𝐫𝐨𝐝𝐮𝐜𝐭𝐬. As products grow, rushed design decisions, inconsistent UI patterns, and poor onboarding create friction that makes it harder for users to find value quickly. Over time, this friction leads to lower adoption, reduced retention, and declining trust, even if the product is technically strong. Addressing UX debt through thoughtful UI/UX design helps simplify user journeys, improve usability, and support long-term product growth. 👉 Learn how user-centric UI/UX design can improve product adoption and retention: https://lnkd.in/diRUEw6U 4 Like Comment Share Perensoft Solutions 45 followers 4d Edited Report this post 𝐖𝐡𝐲 𝐒𝐨𝐟𝐭𝐰𝐚𝐫𝐞 𝐓𝐡𝐚𝐭 𝐖𝐨𝐫𝐤𝐬 𝐒𝐭𝐢𝐥𝐥 𝐅𝐚𝐢𝐥𝐬: 𝐓𝐡𝐞 𝐆𝐚𝐩 𝐁𝐞𝐭𝐰𝐞𝐞𝐧 𝐅𝐮𝐧𝐜𝐭𝐢𝐨𝐧𝐚𝐥 𝐚𝐧𝐝 𝐒𝐜𝐚𝐥𝐚𝐛𝐥𝐞 𝐏𝐫𝐨𝐝𝐮𝐜𝐭𝐬 Many software products fail not because they’re broken, but because they were never built to scale. A product can function perfectly for early users and still struggle as usage grows. What works for a small user base often breaks down under higher traffic, more data, and evolving business requirements. The gap between functional and scalable software usually shows up in a few key areas: 𝐀𝐫𝐜𝐡𝐢𝐭𝐞𝐜𝐭𝐮𝐫𝐞 𝐝𝐞𝐜𝐢𝐬𝐢𝐨𝐧𝐬 𝐦𝐚𝐝𝐞 𝐟𝐨𝐫 𝐬𝐩𝐞𝐞𝐝, 𝐧𝐨𝐭 𝐠𝐫𝐨𝐰𝐭𝐡 Quick builds and shortcuts help launch faster, but they often create limitations when the product needs to expand. 𝐏𝐞𝐫𝐟𝐨𝐫𝐦𝐚𝐧𝐜𝐞 𝐢𝐬𝐬𝐮𝐞𝐬 𝐮𝐧𝐝𝐞𝐫 𝐫𝐞𝐚𝐥-𝐰𝐨𝐫𝐥𝐝 𝐥𝐨𝐚𝐝 Slow response times, timeouts, and system crashes appear when infrastructure and code aren’t designed for scale. 𝐑𝐢𝐬𝐢𝐧𝐠 𝐦𝐚𝐢𝐧𝐭𝐞𝐧𝐚𝐧𝐜𝐞 𝐚𝐧𝐝 𝐭𝐞𝐜𝐡𝐧𝐢𝐜𝐚𝐥 𝐝𝐞𝐛𝐭 Teams spend more time fixing issues than building new features, slowing innovation. 𝐏𝐨𝐨𝐫 𝐚𝐝𝐚𝐩𝐭𝐚𝐛𝐢𝐥𝐢𝐭𝐲 𝐭𝐨 𝐜𝐡𝐚𝐧𝐠𝐞 🔸 Adding new features, integrations, or markets becomes risky and expensive. 🔸 Scalable software requires more than functionality. It needs: 1. Thoughtful architecture 2. Performance planning 3. Clean, maintainable code 𝐈𝐧𝐟𝐫𝐚𝐬𝐭𝐫𝐮𝐜𝐭𝐮𝐫𝐞 𝐭𝐡𝐚𝐭 𝐠𝐫𝐨𝐰𝐬 𝐰𝐢𝐭𝐡 𝐝𝐞𝐦𝐚𝐧𝐝 Products that succeed long-term are designed with scale in mind from the start - even if they launch small. 👉 Learn how scalable custom software is built for long-term growth: https://lnkd.in/dG_rJ8Mq #CustomSoftwareDevelopment #ScalableSoftware #SoftwareArchitecture #ProductEngineering #TechStrategy #DigitalTransformation #SoftwareDevelopment #StartupGrowth #EnterpriseSoftware #PerensoftSolutions Custom Software Development Services https://www.perensoft.com 2 Like Comment Share Perensoft Solutions 45 followers 6d Report this post 𝐓𝐫𝐚𝐟𝐟𝐢𝐜 𝐚𝐥𝐨𝐧𝐞 𝐝𝐨𝐞𝐬𝐧’𝐭 𝐝𝐫𝐢𝐯𝐞 𝐠𝐫𝐨𝐰𝐭𝐡 - 𝐜𝐨𝐧𝐯𝐞𝐫𝐬𝐢𝐨𝐧𝐬 𝐝𝐨. Many websites attract the right audience but lose users because the conversion path is unclear. Confusing navigation, too many steps, weak CTAs, or missing trust signals often create friction that stops users from taking action. Improving conversions isn’t about getting more visitors. It’s about designing clear, simple user journeys that guide users to the next step. 👉 Learn how conversion-focused digital marketing and UX strategies improve results: https://lnkd.in/dqrH-8wP #DigitalMarketing #ConversionOptimization #CRO #UserJourney #UXDesign #MarketingStrategy #LeadGeneration #WebsiteOptimization #GrowthMarketing #PerensoftSolutions 3 Like Comment Share Perensoft Solutions 45 followers 1w Report this post 𝐀𝐥𝐰𝐚𝐲𝐬-𝐨𝐧 𝐜𝐥𝐨𝐮𝐝 𝐢𝐧𝐟𝐫𝐚𝐬𝐭𝐫𝐮𝐜𝐭𝐮𝐫𝐞 𝐟𝐞𝐞𝐥𝐬 𝐬𝐚𝐟𝐞 𝐛𝐮𝐭 𝐢𝐧 𝐫𝐞𝐚𝐥𝐢𝐭𝐲, 𝐢𝐭’𝐬 𝐨𝐧𝐞 𝐨𝐟 𝐭𝐡𝐞 𝐛𝐢𝐠𝐠𝐞𝐬𝐭 𝐫𝐞𝐚𝐬𝐨𝐧𝐬 𝐭𝐞𝐚𝐦𝐬 𝐨𝐯𝐞𝐫𝐬𝐩𝐞𝐧𝐝 𝐨𝐧 𝐀𝐖𝐒 𝐚𝐧𝐝 𝐜𝐥𝐨𝐮𝐝 𝐬𝐞𝐫𝐯𝐢𝐜𝐞𝐬. Idle resources, over-provisioned environments, and static capacity designed for peak traffic lead to unnecessary cloud costs without improving performance. Modern cloud-native teams are moving toward auto-scaling, demand-based provisioning, serverless architectures, and smarter DevOps practices to reduce waste while maintaining reliability. Cloud cost optimization isn’t about turning things off blindly, it’s about building infrastructure that adapts to real usage and business needs. 👉 Learn how modern cloud and DevOps strategies help teams optimize performance and cost: https://lnkd.in/dzEEGyFZ #CloudComputing #DevOps #CloudCostOptimization #AWS #CloudArchitecture #AutoScaling #Serverless #CloudInfrastructure #CloudEngineering #DevOpsStrategy #CostEfficientCloud #PerensoftSolutions 1 Like Comment Share Perensoft Solutions 45 followers 1w Report this post 𝐀𝐜𝐜𝐞𝐬𝐬𝐢𝐛𝐢𝐥𝐢𝐭𝐲 𝐢𝐧 𝐔𝐗 𝐢𝐬𝐧’𝐭 𝐣𝐮𝐬𝐭 𝐚𝐛𝐨𝐮𝐭 𝐜𝐨𝐦𝐩𝐥𝐢𝐚𝐧𝐜𝐞, 𝐢𝐭’𝐬 𝐚𝐛𝐨𝐮𝐭 𝐜𝐫𝐞𝐚𝐭𝐢𝐧𝐠 𝐛𝐞𝐭𝐭𝐞𝐫. When interfaces are easier to navigate, read, and understand, users find value faster, friction reduces, and engagement improves. At the same time, accessible UX strengthens SEO by improving page structure, content clarity, crawlability, and overall usability signals. Good accessibility practices help products perform better for users and search engines, making them a smart design and business decision. 👉 Learn more about building accessible, user-friendly digital experiences: https://lnkd.in/diRUEw6U #AccessibilityInUX #UXDesign #UIUX #InclusiveDesign #UserExperience #UXBestPractices #SEO #WebAccessibility #DigitalExperience #ProductDesign #Usability #PerensoftSolutions 2 Like Comment Share Perensoft Solutions 45 followers 1w Report this post 𝐈𝐧𝐟𝐫𝐚𝐬𝐭𝐫𝐮𝐜𝐭𝐮𝐫𝐞 𝐚𝐬 𝐂𝐨𝐝𝐞 (𝐈𝐚𝐂) 𝐜𝐡𝐚𝐧𝐠𝐞𝐬 𝐡𝐨𝐰 𝐦𝐨𝐝𝐞𝐫𝐧 𝐜𝐥𝐨𝐮𝐝 Instead of configuring servers, networks, and databases manually, IaC lets teams define infrastructure using code making environments consistent, repeatable, and automated across development, staging, and production. With IaC, teams can: • Reduce human errors • Track infrastructure changes through version control • Recreate environments reliably at any time • Scale infrastructure faster and with more confidence For organizations adopting cloud and DevOps, IaC is no longer optional, it’s a foundation for stability, speed, and scalability. 👉 Learn more about Infrastructure as Code solutions: https://lnkd.in/eKhfFDBU 2 Like Comment Share Perensoft Solutions 45 followers 2w Report this post 𝐀𝐖𝐒 𝐂𝐨𝐬𝐭 𝐎𝐩𝐭𝐢𝐦𝐢𝐳𝐚𝐭𝐢𝐨𝐧: 𝐇𝐢𝐝𝐝𝐞𝐧 𝐖𝐚𝐲𝐬 𝐘𝐨𝐮’𝐫𝐞 𝐎𝐯𝐞𝐫𝐬𝐩𝐞𝐧𝐝𝐢𝐧𝐠 Modern cloud environments give you power and flexibility, but without cost discipline, expenses can spiral quickly. Below are key areas where AWS teams often overspend, and exactly how to fix them. 1️⃣ 𝐈𝐝𝐥𝐞 / 𝐔𝐧𝐝𝐞𝐫𝐮𝐭𝐢𝐥𝐢𝐳𝐞𝐝 𝐑𝐞𝐬𝐨𝐮𝐫𝐜𝐞𝐬 + 𝐍𝐨 𝐀𝐮𝐭𝐨-𝐒𝐜𝐚𝐥𝐢𝐧𝐠 A lot of AWS waste comes from resources running 24/7 even when demand is low. 𝐄𝐱𝐚𝐦𝐩𝐥𝐞𝐬: * EC2/ECS/EKS workloads with low utilization or fixed capacity * RDS sized for peak load all day/night * Unattached EBS volumes, forgotten dev/test environments 𝐅𝐢𝐱: * Schedule shutdowns for non-prod * Enable auto-scaling (EC2 ASG, ECS/EKS, Lambda) + scheduled scaling * Run regular cleanups + set budgets/alerts to catch drift early 2️⃣ 𝐑𝐞𝐬𝐞𝐫𝐯𝐞𝐝 𝐯𝐬 𝐒𝐩𝐨𝐭 𝐯𝐬 𝐒𝐚𝐯𝐢𝐧𝐠𝐬 𝐏𝐥𝐚𝐧𝐬 (𝐏𝐢𝐜𝐤 𝐭𝐡𝐞 𝐑𝐢𝐠𝐡𝐭 𝐏𝐫𝐢𝐜𝐢𝐧𝐠 𝐌𝐨𝐝𝐞𝐥) Most teams overspend by defaulting to On-Demand. The real savings come from choosing the right commitment level. 𝐔𝐬𝐞 𝐰𝐡𝐞𝐧: * Spot Instances → Up to ~70–90% cheaper for fault-tolerant workloads (batch, CI/CD runners, stateless services, dev/test). * Reserved Instances (RI) → Best for steady, predictable usage (especially RDS/ElastiCache where RIs are common). * Savings Plans → Most flexible commitment for EC2/Fargate/Lambda (great if instance families may change but usage is consistent). 3️⃣ 𝐒𝐭𝐨𝐫𝐚𝐠𝐞 𝐎𝐩𝐭𝐢𝐦𝐢𝐳𝐚𝐭𝐢𝐨𝐧 (𝐒3) S3 looks cheap, but costs grow fast when data stays in Standard forever (and when requests + data transfer pile up). 𝐎𝐯𝐞𝐫𝐬𝐩𝐞𝐧𝐝𝐢𝐧𝐠 𝐬𝐢𝐠𝐧𝐬: * Old/inactive data still in S3 Standard * No lifecycle rules → buckets never “age out” * Multiple versions / incomplete multipart uploads * Logs, backups, exports stored without retention 𝐅𝐢𝐱: * Add Lifecycle Policies: Standard → IA → Glacier (or Intelligent-Tiering) * Enable expiration for logs/temp files * Review Versioning + set limits where appropriate * Clean up incomplete multipart uploads * Monitor with Storage Lens + set alerts 4️⃣ 𝐃𝐚𝐭𝐚 𝐓𝐫𝐚𝐧𝐬𝐟𝐞𝐫 𝐂𝐨𝐬𝐭𝐬 Data transfer (especially cross-AZ, cross-region, and internet egress) can silently spike your bill. 𝐅𝐢𝐱: * Keep traffic in the same AZ where possible (avoid cross-AZ chatter) * Use VPC endpoints (S3/DynamoDB) to reduce NAT/internet paths * Put CloudFront in front of public content/APIs to cut egress * Avoid unnecessary cross-region replication and inter-region calls AWS gives you incredible flexibility, but without proactive optimization, you end up paying far more than you should. If you want expert support to optimize cloud spend, improve efficiency, and architect cost-effective AWS solutions, check out: 👉 https://lnkd.in/ecGtdTY8 #AWSCostOptimization #CloudCostSavings #AWS #CloudComputing #CloudArchitecture #DevOps #CloudOptimization #CloudInfrastructure #EBS #PerensoftSolutions #CloudDevOps 5 Like Comment Share Perensoft Solutions 45 followers 2w Report this post 𝐆𝐞𝐧𝐞𝐫𝐚𝐭𝐢𝐯𝐞 𝐀𝐈 𝐢𝐬 𝐜𝐡𝐚𝐧𝐠𝐢𝐧𝐠 𝐡𝐨𝐰 𝐜𝐨𝐧𝐭𝐞𝐧𝐭 𝐦𝐚𝐫𝐤𝐞𝐭𝐢𝐧𝐠 𝐭𝐞𝐚𝐦𝐬 𝐰𝐨𝐫𝐤 - not by replacing creativity, but by removing friction from the process. Today, AI helps marketers move faster by improving content ideation, speeding up research, validating topics with data, and repurposing content across channels, all while keeping strategy and creativity in human hands. The real advantage comes when AI is used as a support system, not a shortcut. When combined with strong content strategy, audience understanding, and SEO best practices, AI enables teams to scale content without losing quality or relevance. 👉 Explore how modern content marketing strategies are evolving: https://lnkd.in/dqrH-8wP 4 Like Comment Share Perensoft Solutions 45 followers 2w Report this post Sending out warmest wishes for a bright and peaceful Christmas. May the spirit of the holiday bring comfort and joy to all corners of the world. Hoping the day is as wonderful and bright as the season itself. 𝐌𝐞𝐫𝐫𝐲 𝐂𝐡𝐫𝐢𝐬𝐭𝐦𝐚𝐬 𝐚𝐧𝐝 𝐚 𝐰𝐨𝐧𝐝𝐞𝐫𝐟𝐮𝐥 𝐡𝐨𝐥𝐢𝐝𝐚𝐲 𝐭𝐨 𝐞𝐯𝐞𝐫𝐲𝐨𝐧𝐞. 🎄 #Christmas2025 #MerryChristmas #SeasonOfGiving #PeaceAndJoy #HolidaySpirit #Grateful #ChristmasWishes #perensoftsolutions 6 Like Comment Share Perensoft Solutions 45 followers 2w Report this post 𝐓𝐮𝐫𝐧𝐢𝐧𝐠 𝐔𝐬𝐞𝐫 𝐑𝐞𝐬𝐞𝐚𝐫𝐜𝐡 𝐈𝐧𝐭𝐨 𝐀𝐜𝐭𝐢𝐨𝐧𝐚𝐛𝐥𝐞 𝐔𝐈 𝐂𝐡𝐚𝐧𝐠𝐞𝐬 User research only creates value when it leads to real UI improvements. Too often, insights stay in reports while the product remains unchanged. Here’s how successful teams turn user research into actionable UI decisions: ➡️ 𝐅𝐢𝐫𝐬𝐭, they focus on patterns, not opinions. Instead of reacting to one-off feedback, they identify repeated usability issues across sessions, recordings, and surveys. These patterns reveal what’s actually blocking users. ➡️ 𝐒𝐞𝐜𝐨𝐧𝐝, they map research insights to core user flows. Not every suggestion needs implementation. High-impact UI changes are the ones that improve onboarding, task completion, and navigation clarity. ➡️ 𝐓𝐡𝐢𝐫𝐝, they translate insights into specific UI actions. For example: Confusing feedback → clearer microcopy Drop-offs → simplified forms or fewer steps Missed features → better visual hierarchy or placement ➡️ 𝐅𝐨𝐮𝐫𝐭𝐡, they validate changes with quick testing. Small usability tests, A/B experiments, or feedback loops ensure the UI change actually improves user experience before scaling it. Finally, they treat UX as an ongoing process, not a one-time task. Continuous user research helps products evolve alongside user needs, leading to better engagement, retention, and conversion rates. 𝐆𝐨𝐨𝐝 𝐔𝐈 𝐢𝐬𝐧’𝐭 𝐛𝐚𝐬𝐞𝐝 𝐨𝐧 𝐚𝐬𝐬𝐮𝐦𝐩𝐭𝐢𝐨𝐧𝐬 𝐢𝐭’𝐬 𝐛𝐮𝐢𝐥𝐭 𝐨𝐧 𝐝𝐚𝐭𝐚, 𝐛𝐞𝐡𝐚𝐯𝐢𝐨𝐫, 𝐚𝐧𝐝 𝐜𝐨𝐧𝐭𝐢𝐧𝐮𝐨𝐮𝐬 𝐥𝐞𝐚𝐫𝐧𝐢𝐧𝐠. ➡️ Discover how better UX design translates into better product adoption: https://lnkd.in/diRUEw6U #UserResearch #UXDesign #UIUX #UserExperience #ProductDesign #UsabilityTesting #UXStrategy #DigitalProducts #ProductGrowth #DesignThinking #UXInsights #PerensoftSolutions UI UX Design Services https://www.perensoft.com 4 Like Comment Share Join now to see what you are missing Find people you know at Perensoft Solutions Browse recommended jobs for you View all updates, news, and articles Join now Similar pages AppCraft Tech Software Development El Cajon, California JK Parmar Web services IT Services and IT Consulting Rajkot, Gujarat MobiTech Solutions IT Services and IT Consulting Rajkot, Gujarat SUN K INNOVATIONS Technology, Information and Internet Rajkot, Gujarat The Unknown Company IT Services and IT Consulting Techacorn IT Services and IT Consulting Rajkot, Gujrat iFlashApps Software Development Anmatics® Technologies Software Development Rajkot, Gujarat 𝑲𝒍𝒂𝒂𝒏𝒊𝒙 𝑰𝒏𝒇𝒐𝒘𝒂𝒚 IT System Custom Software Development Rajkot, Gujarat Dynamic Edge Inc. Software Development Rajkot, Gujarat Show more similar pages Show fewer similar pages LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) Language Agree & Join LinkedIn By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . Sign in to see who you already know at Perensoft Solutions Sign in Welcome back Email or phone Password Show Forgot password? Sign in or By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . New to LinkedIn? Join now or New to LinkedIn? Join now By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . | 2026-01-13T09:29:14 |
https://es-la.facebook.com/login/?next=https%3A%2F%2Fl.facebook.com%2Fl.php%3Fu%3Dhttps%253A%252F%252Fwww.instagram.com%252F%26amp%253Bh%3DAT3JYaROIHDRnGnvxRuIozFF_BGGvvoNi8kVPWnSK0yCW2_Va2rKJWNXZ3PUqk5CKpNtOfbF-WNUpIWc7WVvePlsk9n9z3ptr24Okxk2028tZW0HuZ3QVvGoPKfc7Ts55I89ELD7U7OWf7bu | Facebook Explora lo que más te gusta . Iniciar sesión en Facebook Correo electrónico o número de celular Contraseña Iniciar sesión ¿Olvidaste tu contraseña? Crear cuenta nueva Español 한국어 English (US) Tiếng Việt Bahasa Indonesia ภาษาไทย 中文(简体) Más idiomas… Registrarte Iniciar sesión Messenger Facebook Lite Video Meta Pay Tienda de Meta Meta Quest Ray-Ban Meta Meta AI Más contenido de Meta AI Instagram Threads Centro de información de votación Política de privacidad Centro de privacidad Información Crear anuncio Crear página Desarrolladores Empleo Cookies Opciones de anuncios Condiciones Ayuda Importación de contactos y no usuarios Meta © 2026 | 2026-01-13T09:29:14 |
https://doc.rust-lang.org/std/net/struct.Ipv6Addr.html | Ipv6Addr in std::net - Rust This old browser is unsupported and will most likely display funky things. Ipv6Addr std 1.92.0 (ded5c06cf 2025-12-08) Ipv6 Addr Sections Embedding IPv4 Addresses IPv4-Compatible IPv6 Addresses IPv4-Mapped IPv6 Addresses Textual representation Examples Associated Constants BITS LOCALHOST UNSPECIFIED Methods as_octets from_bits from_octets from_segments is_benchmarking is_documentation is_global is_ipv4_mapped is_loopback is_multicast is_unicast is_unicast_global is_unicast_link_local is_unique_local is_unspecified multicast_scope new octets parse_ascii segments to_bits to_canonical to_ipv4 to_ipv4_mapped Trait Implementations BitAnd BitAnd<&Ipv6Addr> BitAnd<&Ipv6Addr> BitAnd<Ipv6Addr> BitAndAssign BitAndAssign<&Ipv6Addr> BitOr BitOr<&Ipv6Addr> BitOr<&Ipv6Addr> BitOr<Ipv6Addr> BitOrAssign BitOrAssign<&Ipv6Addr> Clone Copy Debug Display Eq From<Ipv6Addr> From<Ipv6Addr> From<[u8; 16]> From<[u16; 8]> From<u128> FromStr Hash Not Not Ord PartialEq PartialEq<IpAddr> PartialEq<Ipv6Addr> PartialOrd PartialOrd<IpAddr> PartialOrd<Ipv6Addr> Step StructuralPartialEq TrustedStep Auto Trait Implementations Freeze RefUnwindSafe Send Sync Unpin UnwindSafe Blanket Implementations Any Borrow<T> BorrowMut<T> CloneToUninit From<T> Into<U> ToOwned ToString TryFrom<U> TryInto<U> In std:: net std :: net Struct Ipv6 Addr Copy item path 1.0.0 · Source pub struct Ipv6Addr { /* private fields */ } Expand description An IPv6 address. IPv6 addresses are defined as 128-bit integers in IETF RFC 4291 . They are usually represented as eight 16-bit segments. § Embedding IPv4 Addresses See IpAddr for a type encompassing both IPv4 and IPv6 addresses. To assist in the transition from IPv4 to IPv6 two types of IPv6 addresses that embed an IPv4 address were defined: IPv4-compatible and IPv4-mapped addresses. Of these IPv4-compatible addresses have been officially deprecated. Both types of addresses are not assigned any special meaning by this implementation, other than what the relevant standards prescribe. This means that an address like ::ffff:127.0.0.1 , while representing an IPv4 loopback address, is not itself an IPv6 loopback address; only ::1 is. To handle these so called “IPv4-in-IPv6” addresses, they have to first be converted to their canonical IPv4 address. § IPv4-Compatible IPv6 Addresses IPv4-compatible IPv6 addresses are defined in IETF RFC 4291 Section 2.5.5.1 , and have been officially deprecated. The RFC describes the format of an “IPv4-Compatible IPv6 address” as follows: | 80 bits | 16 | 32 bits | +--------------------------------------+--------------------------+ |0000..............................0000|0000| IPv4 address | +--------------------------------------+----+---------------------+ So ::a.b.c.d would be an IPv4-compatible IPv6 address representing the IPv4 address a.b.c.d . To convert from an IPv4 address to an IPv4-compatible IPv6 address, use Ipv4Addr::to_ipv6_compatible . Use Ipv6Addr::to_ipv4 to convert an IPv4-compatible IPv6 address to the canonical IPv4 address. § IPv4-Mapped IPv6 Addresses IPv4-mapped IPv6 addresses are defined in IETF RFC 4291 Section 2.5.5.2 . The RFC describes the format of an “IPv4-Mapped IPv6 address” as follows: | 80 bits | 16 | 32 bits | +--------------------------------------+--------------------------+ |0000..............................0000|FFFF| IPv4 address | +--------------------------------------+----+---------------------+ So ::ffff:a.b.c.d would be an IPv4-mapped IPv6 address representing the IPv4 address a.b.c.d . To convert from an IPv4 address to an IPv4-mapped IPv6 address, use Ipv4Addr::to_ipv6_mapped . Use Ipv6Addr::to_ipv4 to convert an IPv4-mapped IPv6 address to the canonical IPv4 address. Note that this will also convert the IPv6 loopback address ::1 to 0.0.0.1 . Use Ipv6Addr::to_ipv4_mapped to avoid this. § Textual representation Ipv6Addr provides a FromStr implementation. There are many ways to represent an IPv6 address in text, but in general, each segments is written in hexadecimal notation, and segments are separated by : . For more information, see IETF RFC 5952 . § Examples use std::net::Ipv6Addr; let localhost = Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 ); assert_eq! ( "::1" .parse(), Ok (localhost)); assert_eq! (localhost.is_loopback(), true ); Implementations § Source § impl Ipv6Addr 1.80.0 · Source pub const BITS : u32 = 128u32 The size of an IPv6 address in bits. § Examples use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::BITS, 128 ); 1.30.0 · Source pub const LOCALHOST : Ipv6Addr An IPv6 address representing localhost: ::1 . This corresponds to constant IN6ADDR_LOOPBACK_INIT or in6addr_loopback in other languages. § Examples use std::net::Ipv6Addr; let addr = Ipv6Addr::LOCALHOST; assert_eq! (addr, Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 )); 1.30.0 · Source pub const UNSPECIFIED : Ipv6Addr An IPv6 address representing the unspecified address: :: . This corresponds to constant IN6ADDR_ANY_INIT or in6addr_any in other languages. § Examples use std::net::Ipv6Addr; let addr = Ipv6Addr::UNSPECIFIED; assert_eq! (addr, Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 )); 1.0.0 (const: 1.32.0) · Source pub const fn new ( a: u16 , b: u16 , c: u16 , d: u16 , e: u16 , f: u16 , g: u16 , h: u16 , ) -> Ipv6Addr Creates a new IPv6 address from eight 16-bit segments. The result will represent the IP address a:b:c:d:e:f:g:h . § Examples use std::net::Ipv6Addr; let addr = Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ); 1.80.0 (const: 1.80.0) · Source pub const fn to_bits (self) -> u128 Converts an IPv6 address into a u128 representation using native byte order. Although IPv6 addresses are big-endian, the u128 value will use the target platform’s native byte order. That is, the u128 value is an integer representation of the IPv6 address and not an integer interpretation of the IPv6 address’s big-endian bitstring. This means that the u128 value masked with 0xffffffffffffffffffffffffffff0000_u128 will set the last segment in the address to 0, regardless of the target platform’s endianness. § Examples use std::net::Ipv6Addr; let addr = Ipv6Addr::new( 0x1020 , 0x3040 , 0x5060 , 0x7080 , 0x90A0 , 0xB0C0 , 0xD0E0 , 0xF00D , ); assert_eq! ( 0x102030405060708090A0B0C0D0E0F00D_u128 , addr.to_bits()); use std::net::Ipv6Addr; let addr = Ipv6Addr::new( 0x1020 , 0x3040 , 0x5060 , 0x7080 , 0x90A0 , 0xB0C0 , 0xD0E0 , 0xF00D , ); let addr_bits = addr.to_bits() & 0xffffffffffffffffffffffffffff0000_u128 ; assert_eq! ( Ipv6Addr::new( 0x1020 , 0x3040 , 0x5060 , 0x7080 , 0x90A0 , 0xB0C0 , 0xD0E0 , 0x0000 , ), Ipv6Addr::from_bits(addr_bits)); 1.80.0 (const: 1.80.0) · Source pub const fn from_bits (bits: u128 ) -> Ipv6Addr Converts a native byte order u128 into an IPv6 address. See Ipv6Addr::to_bits for an explanation on endianness. § Examples use std::net::Ipv6Addr; let addr = Ipv6Addr::from_bits( 0x102030405060708090A0B0C0D0E0F00D_u128 ); assert_eq! ( Ipv6Addr::new( 0x1020 , 0x3040 , 0x5060 , 0x7080 , 0x90A0 , 0xB0C0 , 0xD0E0 , 0xF00D , ), addr); 1.0.0 (const: 1.50.0) · Source pub const fn segments (&self) -> [ u16 ; 8 ] Returns the eight 16-bit segments that make up this address. § Examples use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ).segments(), [ 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ]); 1.91.0 (const: 1.91.0) · Source pub const fn from_segments (segments: [ u16 ; 8 ]) -> Ipv6Addr Creates an Ipv6Addr from an eight element 16-bit array. § Examples use std::net::Ipv6Addr; let addr = Ipv6Addr::from_segments([ 0x20du16 , 0x20cu16 , 0x20bu16 , 0x20au16 , 0x209u16 , 0x208u16 , 0x207u16 , 0x206u16 , ]); assert_eq! ( Ipv6Addr::new( 0x20d , 0x20c , 0x20b , 0x20a , 0x209 , 0x208 , 0x207 , 0x206 , ), addr ); 1.7.0 (const: 1.50.0) · Source pub const fn is_unspecified (&self) -> bool Returns true for the special ‘unspecified’ address ( :: ). This property is defined in IETF RFC 4291 . § Examples use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ).is_unspecified(), false ); assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).is_unspecified(), true ); 1.7.0 (const: 1.50.0) · Source pub const fn is_loopback (&self) -> bool Returns true if this is the loopback address ( ::1 ), as defined in IETF RFC 4291 section 2.5.3 . Contrary to IPv4, in IPv6 there is only one loopback address. § Examples use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ).is_loopback(), false ); assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0x1 ).is_loopback(), true ); Source pub const fn is_global (&self) -> bool 🔬 This is a nightly-only experimental API. ( ip #27709 ) Returns true if the address appears to be globally reachable as specified by the IANA IPv6 Special-Purpose Address Registry . Whether or not an address is practically reachable will depend on your network configuration. Most IPv6 addresses are globally reachable, unless they are specifically defined as not globally reachable. Non-exhaustive list of notable addresses that are not globally reachable: The unspecified address ( is_unspecified ) The loopback address ( is_loopback ) IPv4-mapped addresses Addresses reserved for benchmarking ( is_benchmarking ) Addresses reserved for documentation ( is_documentation ) Unique local addresses ( is_unique_local ) Unicast addresses with link-local scope ( is_unicast_link_local ) For the complete overview of which addresses are globally reachable, see the table at the IANA IPv6 Special-Purpose Address Registry . Note that an address having global scope is not the same as being globally reachable, and there is no direct relation between the two concepts: There exist addresses with global scope that are not globally reachable (for example unique local addresses), and addresses that are globally reachable without having global scope (multicast addresses with non-global scope). § Examples #![feature(ip)] use std::net::Ipv6Addr; // Most IPv6 addresses are globally reachable: assert_eq! (Ipv6Addr::new( 0x26 , 0 , 0x1c9 , 0 , 0 , 0xafc8 , 0x10 , 0x1 ).is_global(), true ); // However some addresses have been assigned a special meaning // that makes them not globally reachable. Some examples are: // The unspecified address (`::`) assert_eq! (Ipv6Addr::UNSPECIFIED.is_global(), false ); // The loopback address (`::1`) assert_eq! (Ipv6Addr::LOCALHOST.is_global(), false ); // IPv4-mapped addresses (`::ffff:0:0/96`) assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ).is_global(), false ); // Addresses reserved for benchmarking (`2001:2::/48`) assert_eq! (Ipv6Addr::new( 0x2001 , 2 , 0 , 0 , 0 , 0 , 0 , 1 ,).is_global(), false ); // Addresses reserved for documentation (`2001:db8::/32` and `3fff::/20`) assert_eq! (Ipv6Addr::new( 0x2001 , 0xdb8 , 0 , 0 , 0 , 0 , 0 , 1 ).is_global(), false ); assert_eq! (Ipv6Addr::new( 0x3fff , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).is_global(), false ); // Unique local addresses (`fc00::/7`) assert_eq! (Ipv6Addr::new( 0xfc02 , 0 , 0 , 0 , 0 , 0 , 0 , 1 ).is_global(), false ); // Unicast addresses with link-local scope (`fe80::/10`) assert_eq! (Ipv6Addr::new( 0xfe81 , 0 , 0 , 0 , 0 , 0 , 0 , 1 ).is_global(), false ); // For a complete overview see the IANA IPv6 Special-Purpose Address Registry. 1.84.0 (const: 1.84.0) · Source pub const fn is_unique_local (&self) -> bool Returns true if this is a unique local address ( fc00::/7 ). This property is defined in IETF RFC 4193 . § Examples use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ).is_unique_local(), false ); assert_eq! (Ipv6Addr::new( 0xfc02 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).is_unique_local(), true ); Source pub const fn is_unicast (&self) -> bool 🔬 This is a nightly-only experimental API. ( ip #27709 ) Returns true if this is a unicast address, as defined by IETF RFC 4291 . Any address that is not a multicast address ( ff00::/8 ) is unicast. § Examples #![feature(ip)] use std::net::Ipv6Addr; // The unspecified and loopback addresses are unicast. assert_eq! (Ipv6Addr::UNSPECIFIED.is_unicast(), true ); assert_eq! (Ipv6Addr::LOCALHOST.is_unicast(), true ); // Any address that is not a multicast address (`ff00::/8`) is unicast. assert_eq! (Ipv6Addr::new( 0x2001 , 0xdb8 , 0 , 0 , 0 , 0 , 0 , 0 ).is_unicast(), true ); assert_eq! (Ipv6Addr::new( 0xff00 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).is_unicast(), false ); 1.84.0 (const: 1.84.0) · Source pub const fn is_unicast_link_local (&self) -> bool Returns true if the address is a unicast address with link-local scope, as defined in RFC 4291 . A unicast address has link-local scope if it has the prefix fe80::/10 , as per RFC 4291 section 2.4 . Note that this encompasses more addresses than those defined in RFC 4291 section 2.5.6 , which describes “Link-Local IPv6 Unicast Addresses” as having the following stricter format: | 10 bits | 54 bits | 64 bits | +----------+-------------------------+----------------------------+ |1111111010| 0 | interface ID | +----------+-------------------------+----------------------------+ So while currently the only addresses with link-local scope an application will encounter are all in fe80::/64 , this might change in the future with the publication of new standards. More addresses in fe80::/10 could be allocated, and those addresses will have link-local scope. Also note that while RFC 4291 section 2.5.3 mentions about the loopback address ( ::1 ) that “it is treated as having Link-Local scope”, this does not mean that the loopback address actually has link-local scope and this method will return false on it. § Examples use std::net::Ipv6Addr; // The loopback address (`::1`) does not actually have link-local scope. assert_eq! (Ipv6Addr::LOCALHOST.is_unicast_link_local(), false ); // Only addresses in `fe80::/10` have link-local scope. assert_eq! (Ipv6Addr::new( 0x2001 , 0xdb8 , 0 , 0 , 0 , 0 , 0 , 0 ).is_unicast_link_local(), false ); assert_eq! (Ipv6Addr::new( 0xfe80 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).is_unicast_link_local(), true ); // Addresses outside the stricter `fe80::/64` also have link-local scope. assert_eq! (Ipv6Addr::new( 0xfe80 , 0 , 0 , 1 , 0 , 0 , 0 , 0 ).is_unicast_link_local(), true ); assert_eq! (Ipv6Addr::new( 0xfe81 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).is_unicast_link_local(), true ); Source pub const fn is_documentation (&self) -> bool 🔬 This is a nightly-only experimental API. ( ip #27709 ) Returns true if this is an address reserved for documentation ( 2001:db8::/32 and 3fff::/20 ). This property is defined by IETF RFC 3849 and IETF RFC 9637 . § Examples #![feature(ip)] use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ).is_documentation(), false ); assert_eq! (Ipv6Addr::new( 0x2001 , 0xdb8 , 0 , 0 , 0 , 0 , 0 , 0 ).is_documentation(), true ); assert_eq! (Ipv6Addr::new( 0x3fff , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).is_documentation(), true ); Source pub const fn is_benchmarking (&self) -> bool 🔬 This is a nightly-only experimental API. ( ip #27709 ) Returns true if this is an address reserved for benchmarking ( 2001:2::/48 ). This property is defined in IETF RFC 5180 , where it is mistakenly specified as covering the range 2001:0200::/48 . This is corrected in IETF RFC Errata 1752 to 2001:0002::/48 . #![feature(ip)] use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc613 , 0x0 ).is_benchmarking(), false ); assert_eq! (Ipv6Addr::new( 0x2001 , 0x2 , 0 , 0 , 0 , 0 , 0 , 0 ).is_benchmarking(), true ); Source pub const fn is_unicast_global (&self) -> bool 🔬 This is a nightly-only experimental API. ( ip #27709 ) Returns true if the address is a globally routable unicast address. The following return false: the loopback address the link-local addresses unique local addresses the unspecified address the address range reserved for documentation This method returns true for site-local addresses as per RFC 4291 section 2.5.7 The special behavior of [the site-local unicast] prefix defined in [RFC3513] must no longer be supported in new implementations (i.e., new implementations must treat this prefix as Global Unicast). § Examples #![feature(ip)] use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::new( 0x2001 , 0xdb8 , 0 , 0 , 0 , 0 , 0 , 0 ).is_unicast_global(), false ); assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ).is_unicast_global(), true ); Source pub const fn multicast_scope (&self) -> Option < Ipv6MulticastScope > 🔬 This is a nightly-only experimental API. ( ip #27709 ) Returns the address’s multicast scope if the address is multicast. § Examples #![feature(ip)] use std::net::{Ipv6Addr, Ipv6MulticastScope}; assert_eq! ( Ipv6Addr::new( 0xff0e , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).multicast_scope(), Some (Ipv6MulticastScope::Global) ); assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ).multicast_scope(), None ); 1.7.0 (const: 1.50.0) · Source pub const fn is_multicast (&self) -> bool Returns true if this is a multicast address ( ff00::/8 ). This property is defined by IETF RFC 4291 . § Examples use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::new( 0xff00 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).is_multicast(), true ); assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ).is_multicast(), false ); Source pub const fn is_ipv4_mapped (&self) -> bool 🔬 This is a nightly-only experimental API. ( ip #27709 ) Returns true if the address is an IPv4-mapped address ( ::ffff:0:0/96 ). IPv4-mapped addresses can be converted to their canonical IPv4 address with to_ipv4_mapped . § Examples #![feature(ip)] use std::net::{Ipv4Addr, Ipv6Addr}; let ipv4_mapped = Ipv4Addr::new( 192 , 0 , 2 , 255 ).to_ipv6_mapped(); assert_eq! (ipv4_mapped.is_ipv4_mapped(), true ); assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc000 , 0x2ff ).is_ipv4_mapped(), true ); assert_eq! (Ipv6Addr::new( 0x2001 , 0xdb8 , 0 , 0 , 0 , 0 , 0 , 0 ).is_ipv4_mapped(), false ); 1.63.0 (const: 1.75.0) · Source pub const fn to_ipv4_mapped (&self) -> Option < Ipv4Addr > Converts this address to an IPv4 address if it’s an IPv4-mapped address, as defined in IETF RFC 4291 section 2.5.5.2 , otherwise returns None . ::ffff:a.b.c.d becomes a.b.c.d . All addresses not starting with ::ffff will return None . § Examples use std::net::{Ipv4Addr, Ipv6Addr}; assert_eq! (Ipv6Addr::new( 0xff00 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).to_ipv4_mapped(), None ); assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ).to_ipv4_mapped(), Some (Ipv4Addr::new( 192 , 10 , 2 , 255 ))); assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 ).to_ipv4_mapped(), None ); 1.0.0 (const: 1.50.0) · Source pub const fn to_ipv4 (&self) -> Option < Ipv4Addr > Converts this address to an IPv4 address if it is either an IPv4-compatible address as defined in IETF RFC 4291 section 2.5.5.1 , or an IPv4-mapped address as defined in IETF RFC 4291 section 2.5.5.2 , otherwise returns None . Note that this will return an IPv4 address for the IPv6 loopback address ::1 . Use Ipv6Addr::to_ipv4_mapped to avoid this. ::a.b.c.d and ::ffff:a.b.c.d become a.b.c.d . ::1 becomes 0.0.0.1 . All addresses not starting with either all zeroes or ::ffff will return None . § Examples use std::net::{Ipv4Addr, Ipv6Addr}; assert_eq! (Ipv6Addr::new( 0xff00 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).to_ipv4(), None ); assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ).to_ipv4(), Some (Ipv4Addr::new( 192 , 10 , 2 , 255 ))); assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 ).to_ipv4(), Some (Ipv4Addr::new( 0 , 0 , 0 , 1 ))); 1.75.0 (const: 1.75.0) · Source pub const fn to_canonical (&self) -> IpAddr Converts this address to an IpAddr::V4 if it is an IPv4-mapped address, otherwise returns self wrapped in an IpAddr::V6 . § Examples use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0x7f00 , 0x1 ).is_loopback(), false ); assert_eq! (Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0x7f00 , 0x1 ).to_canonical().is_loopback(), true ); 1.12.0 (const: 1.32.0) · Source pub const fn octets (&self) -> [ u8 ; 16 ] Returns the sixteen eight-bit integers the IPv6 address consists of. use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::new( 0xff00 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).octets(), [ 0xff , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ]); 1.91.0 (const: 1.91.0) · Source pub const fn from_octets (octets: [ u8 ; 16 ]) -> Ipv6Addr Creates an Ipv6Addr from a sixteen element byte array. § Examples use std::net::Ipv6Addr; let addr = Ipv6Addr::from_octets([ 0x19u8 , 0x18u8 , 0x17u8 , 0x16u8 , 0x15u8 , 0x14u8 , 0x13u8 , 0x12u8 , 0x11u8 , 0x10u8 , 0x0fu8 , 0x0eu8 , 0x0du8 , 0x0cu8 , 0x0bu8 , 0x0au8 , ]); assert_eq! ( Ipv6Addr::new( 0x1918 , 0x1716 , 0x1514 , 0x1312 , 0x1110 , 0x0f0e , 0x0d0c , 0x0b0a , ), addr ); Source pub const fn as_octets (&self) -> &[ u8 ; 16 ] 🔬 This is a nightly-only experimental API. ( ip_as_octets #137259 ) Returns the sixteen eight-bit integers the IPv6 address consists of as a slice. § Examples #![feature(ip_as_octets)] use std::net::Ipv6Addr; assert_eq! (Ipv6Addr::new( 0xff00 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ).as_octets(), & [ 255 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ]) Source § impl Ipv6Addr Source pub fn parse_ascii (b: &[ u8 ]) -> Result < Ipv6Addr , AddrParseError > 🔬 This is a nightly-only experimental API. ( addr_parse_ascii #101035 ) Parse an IPv6 address from a slice of bytes. #![feature(addr_parse_ascii)] use std::net::Ipv6Addr; let localhost = Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 ); assert_eq! (Ipv6Addr::parse_ascii( b"::1" ), Ok (localhost)); Trait Implementations § 1.75.0 (const: unstable ) · Source § impl BitAnd <& Ipv6Addr > for & Ipv6Addr Source § type Output = Ipv6Addr The resulting type after applying the & operator. Source § fn bitand (self, rhs: & Ipv6Addr ) -> Ipv6Addr Performs the & operation. Read more 1.75.0 (const: unstable ) · Source § impl BitAnd <& Ipv6Addr > for Ipv6Addr Source § type Output = Ipv6Addr The resulting type after applying the & operator. Source § fn bitand (self, rhs: & Ipv6Addr ) -> Ipv6Addr Performs the & operation. Read more 1.75.0 (const: unstable ) · Source § impl BitAnd < Ipv6Addr > for & Ipv6Addr Source § type Output = Ipv6Addr The resulting type after applying the & operator. Source § fn bitand (self, rhs: Ipv6Addr ) -> Ipv6Addr Performs the & operation. Read more 1.75.0 (const: unstable ) · Source § impl BitAnd for Ipv6Addr Source § type Output = Ipv6Addr The resulting type after applying the & operator. Source § fn bitand (self, rhs: Ipv6Addr ) -> Ipv6Addr Performs the & operation. Read more 1.75.0 (const: unstable ) · Source § impl BitAndAssign <& Ipv6Addr > for Ipv6Addr Source § fn bitand_assign (&mut self, rhs: & Ipv6Addr ) Performs the &= operation. Read more 1.75.0 (const: unstable ) · Source § impl BitAndAssign for Ipv6Addr Source § fn bitand_assign (&mut self, rhs: Ipv6Addr ) Performs the &= operation. Read more 1.75.0 (const: unstable ) · Source § impl BitOr <& Ipv6Addr > for & Ipv6Addr Source § type Output = Ipv6Addr The resulting type after applying the | operator. Source § fn bitor (self, rhs: & Ipv6Addr ) -> Ipv6Addr Performs the | operation. Read more 1.75.0 (const: unstable ) · Source § impl BitOr <& Ipv6Addr > for Ipv6Addr Source § type Output = Ipv6Addr The resulting type after applying the | operator. Source § fn bitor (self, rhs: & Ipv6Addr ) -> Ipv6Addr Performs the | operation. Read more 1.75.0 (const: unstable ) · Source § impl BitOr < Ipv6Addr > for & Ipv6Addr Source § type Output = Ipv6Addr The resulting type after applying the | operator. Source § fn bitor (self, rhs: Ipv6Addr ) -> Ipv6Addr Performs the | operation. Read more 1.75.0 (const: unstable ) · Source § impl BitOr for Ipv6Addr Source § type Output = Ipv6Addr The resulting type after applying the | operator. Source § fn bitor (self, rhs: Ipv6Addr ) -> Ipv6Addr Performs the | operation. Read more 1.75.0 (const: unstable ) · Source § impl BitOrAssign <& Ipv6Addr > for Ipv6Addr Source § fn bitor_assign (&mut self, rhs: & Ipv6Addr ) Performs the |= operation. Read more 1.75.0 (const: unstable ) · Source § impl BitOrAssign for Ipv6Addr Source § fn bitor_assign (&mut self, rhs: Ipv6Addr ) Performs the |= operation. Read more 1.0.0 · Source § impl Clone for Ipv6Addr Source § fn clone (&self) -> Ipv6Addr Returns a duplicate of the value. Read more 1.0.0 · Source § fn clone_from (&mut self, source: &Self) Performs copy-assignment from source . Read more 1.0.0 · Source § impl Debug for Ipv6Addr Source § fn fmt (&self, fmt: &mut Formatter <'_>) -> Result < () , Error > Formats the value using the given formatter. Read more 1.0.0 · Source § impl Display for Ipv6Addr Writes an Ipv6Addr, conforming to the canonical style described by RFC 5952 . Source § fn fmt (&self, f: &mut Formatter <'_>) -> Result < () , Error > Formats the value using the given formatter. Read more 1.16.0 (const: unstable ) · Source § impl From <[ u16 ; 8 ]> for Ipv6Addr Source § fn from (segments: [ u16 ; 8 ]) -> Ipv6Addr Creates an Ipv6Addr from an eight element 16-bit array. § Examples use std::net::Ipv6Addr; let addr = Ipv6Addr::from([ 0x20du16 , 0x20cu16 , 0x20bu16 , 0x20au16 , 0x209u16 , 0x208u16 , 0x207u16 , 0x206u16 , ]); assert_eq! ( Ipv6Addr::new( 0x20d , 0x20c , 0x20b , 0x20a , 0x209 , 0x208 , 0x207 , 0x206 , ), addr ); 1.9.0 (const: unstable ) · Source § impl From <[ u8 ; 16 ]> for Ipv6Addr Source § fn from (octets: [ u8 ; 16 ]) -> Ipv6Addr Creates an Ipv6Addr from a sixteen element byte array. § Examples use std::net::Ipv6Addr; let addr = Ipv6Addr::from([ 0x19u8 , 0x18u8 , 0x17u8 , 0x16u8 , 0x15u8 , 0x14u8 , 0x13u8 , 0x12u8 , 0x11u8 , 0x10u8 , 0x0fu8 , 0x0eu8 , 0x0du8 , 0x0cu8 , 0x0bu8 , 0x0au8 , ]); assert_eq! ( Ipv6Addr::new( 0x1918 , 0x1716 , 0x1514 , 0x1312 , 0x1110 , 0x0f0e , 0x0d0c , 0x0b0a , ), addr ); 1.16.0 (const: unstable ) · Source § impl From < Ipv6Addr > for IpAddr Source § fn from (ipv6: Ipv6Addr ) -> IpAddr Copies this address to a new IpAddr::V6 . § Examples use std::net::{IpAddr, Ipv6Addr}; let addr = Ipv6Addr::new( 0 , 0 , 0 , 0 , 0 , 0xffff , 0xc00a , 0x2ff ); assert_eq! ( IpAddr::V6(addr), IpAddr::from(addr) ); 1.26.0 (const: unstable ) · Source § impl From < Ipv6Addr > for u128 Source § fn from (ip: Ipv6Addr ) -> u128 Uses Ipv6Addr::to_bits to convert an IPv6 address to a host byte order u128 . 1.26.0 (const: unstable ) · Source § impl From < u128 > for Ipv6Addr Source § fn from (ip: u128 ) -> Ipv6Addr Uses Ipv6Addr::from_bits to convert a host byte order u128 to an IPv6 address. 1.0.0 · Source § impl FromStr for Ipv6Addr Source § type Err = AddrParseError The associated error which can be returned from parsing. Source § fn from_str (s: & str ) -> Result < Ipv6Addr , AddrParseError > Parses a string s to return a value of this type. Read more 1.0.0 · Source § impl Hash for Ipv6Addr Source § fn hash <H>(&self, state: &mut H ) where H: Hasher , Feeds this value into the given Hasher . Read more 1.3.0 · Source § fn hash_slice <H>(data: &[Self], state: &mut H ) where H: Hasher , Self: Sized , Feeds a slice of this type into the given Hasher . Read more 1.75.0 (const: unstable ) · Source § impl Not for & Ipv6Addr Source § type Output = Ipv6Addr The resulting type after applying the ! operator. Source § fn not (self) -> Ipv6Addr Performs the unary ! operation. Read more 1.75.0 (const: unstable ) · Source § impl Not for Ipv6Addr Source § type Output = Ipv6Addr The resulting type after applying the ! operator. Source § fn not (self) -> Ipv6Addr Performs the unary ! operation. Read more 1.0.0 · Source § impl Ord for Ipv6Addr Source § fn cmp (&self, other: & Ipv6Addr ) -> Ordering This method returns an Ordering between self and other . Read more 1.21.0 · Source § fn max (self, other: Self) -> Self where Self: Sized , Compares and returns the maximum of two values. Read more 1.21.0 · Source § fn min (self, other: Self) -> Self where Self: Sized , Compares and returns the minimum of two values. Read more 1.50.0 · Source § fn clamp (self, min: Self, max: Self) -> Self where Self: Sized , Restrict a value to a certain interval. Read more 1.16.0 · Source § impl PartialEq < IpAddr > for Ipv6Addr Source § fn eq (&self, other: & IpAddr ) -> bool Tests for self and other values to be equal, and is used by == . 1.0.0 · Source § fn ne (&self, other: &Rhs ) -> bool Tests for != . The default implementation is almost always sufficient, and should not be overridden without very good reason. 1.16.0 · Source § impl PartialEq < Ipv6Addr > for IpAddr Source § fn eq (&self, other: & Ipv6Addr ) -> bool Tests for self and other values to be equal, and is used by == . 1.0.0 · Source § fn ne (&self, other: &Rhs ) -> bool Tests for != . The default implementation is almost always sufficient, and should not be overridden without very good reason. 1.0.0 · Source § impl PartialEq for Ipv6Addr Source § fn eq (&self, other: & Ipv6Addr ) -> bool Tests for self and other values to be equal, and is used by == . 1.0.0 · Source § fn ne (&self, other: &Rhs ) -> bool Tests for != . The default implementation is almost always sufficient, and should not be overridden without very good reason. 1.16.0 · Source § impl PartialOrd < IpAddr > for Ipv6Addr Source § fn partial_cmp (&self, other: & IpAddr ) -> Option < Ordering > This method returns an ordering between self and other values if one exists. Read more 1.0.0 · Source § fn lt (&self, other: &Rhs ) -> bool Tests less than (for self and other ) and is used by the < operator. Read more 1.0.0 · Source § fn le (&self, other: &Rhs ) -> bool Tests less than or equal to (for self and other ) and is used by the <= operator. Read more 1.0.0 · Source § fn gt (&self, other: &Rhs ) -> bool Tests greater than (for self and other ) and is used by the > operator. Read more 1.0.0 · Source § fn ge (&self, other: &Rhs ) -> bool Tests greater than or equal to (for self and other ) and is used by the >= operator. Read more 1.16.0 · Source § impl PartialOrd < Ipv6Addr > for IpAddr Source § fn partial_cmp (&self, other: & Ipv6Addr ) -> Option < Ordering > This method returns an ordering between self and other values if one exists. Read more 1.0.0 · Source § fn lt (&self, other: &Rhs ) -> bool Tests less than (for self and other ) and is used by the < operator. Read more 1.0.0 · Source § fn le (&self, other: &Rhs ) -> bool Tests less than or equal to (for self and other ) and is used by the <= operator. Read more 1.0.0 · Source § fn gt (&self, other: &Rhs ) -> bool Tests greater than (for self and other ) and is used by the > operator. Read more 1.0.0 · Source § fn ge (&self, other: &Rhs ) -> bool Tests greater than or equal to (for self and other ) and is used by the >= operator. Read more 1.0.0 · Source § impl PartialOrd for Ipv6Addr Source § fn partial_cmp (&self, other: & Ipv6Addr ) -> Option < Ordering > This method returns an ordering between self and other values if one exists. Read more 1.0.0 · Source § fn lt (&self, other: &Rhs ) -> bool Tests less than (for self and other ) and is used by the < operator. Read more 1.0.0 · Source § fn le (&self, other: &Rhs ) -> bool Tests less than or equal to (for self and other ) and is used by the <= operator. Read more 1.0.0 · Source § fn gt (&self, other: &Rhs ) -> bool Tests greater than (for self and other ) and is used by the > operator. Read more 1.0.0 · Source § fn ge (&self, other: &Rhs ) -> bool Tests greater than or equal to (for self and other ) and is used by the >= operator. Read more Source § impl Step for Ipv6Addr Source § fn steps_between (_: & Ipv6Addr , _: & Ipv6Addr ) -> ( usize , Option < usize >) 🔬 This is a nightly-only experimental API. ( step_trait #42168 ) Returns the bounds on the number of successor steps required to get from start to end like Iterator::size_hint() . Read more Source § fn forward_checked (start: Ipv6Addr , count: usize ) -> Option < Ipv6Addr > 🔬 This is a nightly-only experimental API. ( step_trait #42168 ) Returns the value that would be obtained by taking the successor of self count times. Read more Source § fn backward_checked (start: Ipv6Addr , count: usize ) -> Option < Ipv6Addr > 🔬 This is a nightly-only experimental API. ( step_trait #42168 ) Returns the value that would be obtained by taking the predecessor of self count times. Read more Source § unsafe fn forward_unchecked (start: Ipv6Addr , count: usize ) -> Ipv6Addr 🔬 This is a nightly-only experimental API. ( step_trait #42168 ) Returns the value that would be obtained by taking the successor of self count times. Read more Source § unsafe fn backward_unchecked (start: Ipv6Addr , count: usize ) -> Ipv6Addr 🔬 This is a nightly-only experimental API. ( step_trait #42168 ) Returns the value that would be obtained by taking the predecessor of self count times. Read more Source § fn forward (start: Self, count: usize ) -> Self 🔬 This is a nightly-only experimental API. ( step_trait #42168 ) Returns the value that would be obtained by taking the successor of self count times. Read more Source § fn backward (start: Self, count: usize ) -> Self 🔬 This is a nightly-only experimental API. ( step_trait #42168 ) Returns the value that would be obtained by taking the predecessor of self count times. Read more 1.0.0 · Source § impl Copy for Ipv6Addr 1.0.0 · Source § impl Eq for Ipv6Addr 1.0.0 · Source § impl StructuralPartialEq for Ipv6Addr Source § impl TrustedStep for Ipv6Addr Auto Trait Implementations § § impl Freeze for Ipv6Addr § impl RefUnwindSafe for Ipv6Addr § impl Send for Ipv6Addr § impl Sync for Ipv6Addr § impl Unpin for Ipv6Addr § impl UnwindSafe for Ipv6Addr Blanket Implementations § Source § impl<T> Any for T where T: 'static + ? Sized , Source § fn type_id (&self) -> TypeId Gets the TypeId of self . Read more Source § impl<T> Borrow <T> for T where T: ? Sized , Source § fn borrow (&self) -> &T Immutably borrows from an owned value. Read more Source § impl<T> BorrowMut <T> for T where T: ? Sized , Source § fn borrow_mut (&mut self) -> &mut T Mutably borrows from an owned value. Read more Source § impl<T> CloneToUninit for T where T: Clone , Source § unsafe fn clone_to_uninit (&self, dest: *mut u8 ) 🔬 This is a nightly-only experimental API. ( clone_to_uninit #126799 ) Performs copy-assignment from self to dest . Read more Source § impl<T> From <T> for T Source § fn from (t: T) -> T Returns the argument unchanged. Source § impl<T, U> Into <U> for T where U: From <T>, Source § fn into (self) -> U Calls U::from(self) . That is, this conversion is whatever the implementation of From <T> for U chooses to do. Source § impl<T> ToOwned for T where T: Clone , Source § type Owned = T The resulting type after obtaining ownership. Source § fn to_owned (&self) -> T Creates owned data from borrowed data, usually by cloning. Read more Source § fn clone_into (&self, target: &mut T ) Uses borrowed data to replace owned data, usually by cloning. Read more Source § impl<T> ToString for T where T: Display + ? Sized , Source § fn to_string (&self) -> String Converts the given value to a String . Read more Source § impl<T, U> TryFrom <U> for T where U: Into <T>, Source § type Error = Infallible The type returned in the event of a conversion error. Source § fn try_from (value: U) -> Result <T, <T as TryFrom <U>>:: Error > Performs the conversion. Source § impl<T, U> TryInto <U> for T where U: TryFrom <T>, Source § type Error = <U as TryFrom <T>>:: Error The type returned in the event of a conversion error. Source § fn try_into (self) -> Result <U, <U as TryFrom <T>>:: Error > Performs the conversion. | 2026-01-13T09:29:14 |
https://www.linkedin.com/products/categories/load-balancing-software | Best Load Balancing Software | Products | LinkedIn Skip to main content LinkedIn Expand search This button displays the currently selected search type. When expanded it provides a list of search options that will switch the search inputs to match the current selection. Jobs People Learning Clear text Clear text Clear text Clear text Clear text Join now Sign in Clear text Used by Used by Information Technology Manager (3) Network Specialist (3) Chief Technology Officer (2) DevOps Engineer (2) Software Engineer (2) See all products Find top products in Load Balancing Software category Software used to monitor and distribute resources and traffic on websites or applications across server pools. - Provide automation via balancing algorithms that identify fluctuations - Make processing more efficient and optimize infrastructure workloads - Use integrations with failover and backup systems 25 results Cloudflare Load Balancing Load Balancing Software by Cloudflare Overutilized or geographically distant servers add latency and degrade the user experience. Such mistakes can prove costly, resulting in lost customers, missed revenue, and reputational damage. With Cloudflare Load Balancing, you can improve application performance and availability by steering traffic away from unhealthy origin servers and dynamically distributing it to the most available and responsive server pools. View product Progress Kemp LoadMaster Load Balancing Software by Progress Software Kemp Load Balancers are designed to optimize a wide array of applications with templates and support for: • Web Application servers including SSL and HTTP/2 • Microsoft Applications including Exchange, Skype, RDS, Always-on-VPN • SharePoint and ADFS • Dell EMC ECS • Citrix XenApp/XenDesk • Oracle E-Business Suite, PeopleSoft and WebLogic • E-Commerce, Healthcare, Education and Government Applications View product Radware Alteon Load Balancing Software by Radware Alteon is Radware’s next-generation application delivery controller (ADC) and the only network load balancer that guarantees application SLA. View product F5 Load Balancing Software by CLM Segurança, Performance e Disponibilidade. A F5 é líder global em segurança e entrega de aplicações, garantindo proteção, escalabilidade e alto desempenho em qualquer ambiente – on-premises, nuvem e híbrido. ✅ Segurança e Proteção • Defesa contra DDoS, bots e fraudes digitais. • WAF para proteção contra ameaças na web. • Segurança Zero Trust para aplicações e APIs. ✅ Otimização e Disponibilidade • Balanceamento de carga inteligente. • Aceleração para reduzir latência e melhorar UX. • Alta disponibilidade com failover automatizado. ✅ Integração com Soluções CLM • Complementa Netskope, Proofpoint e SentinelOne. • Segurança reforçada para ambientes híbridos. 🔗 CLM e F5: • Proteção Estratégica • Suporte técnico e consultoria especializada. • Treinamentos e PoCs para validação da tecnologia. 🚀 Fortaleça suas aplicações com F5 e CLM! #CyberSecurity #CloudSecurity #AppProtection #F5 #CLMTech View product Fastly Load Balancer Load Balancing Software by Fastly Our Layer 7 Load Balancer lets you define content-aware routing decisions while ensuring instant convergence and failover. Unlike DNS-based solutions, our Load Balancer gives you granular control, immediate scalability, and real-time visibility. View product Find products trusted by professionals in your network See which products are used by connections in your network and those that share similar job titles Sign in to view full insights ADC Management Load Balancing Software by TCPWave Themis ADC integrates GSLB, SLB, and WAF capabilities to offer a comprehensive solution for intelligent network management. Explore TCPWave's ADC solutions: Our SLB ensures optimal application performance by intelligently distributing traffic across multiple servers. Our GSLB enhances resilience by geographically routing users based on server health. And with our WAF, safeguard web applications by filtering and monitoring HTTP traffic. Together, they provide a seamless, secure application delivery experience. Business Challenges Discovering Challenges with TCPWave: Charting cloud terrains, fortifying against threats, optimizing resources, and illuminating network blind spots. Our Solution Know how TCPWave's ADC acts as a digital compass for intelligent routing, real-time analytics, and robust security in the digital realm. Our Difference Discover TCPWave's ADC solutions: unparalleled innovation, AI-driven tech, dedicated support, and global recognition, all craft View product Kemp Load Balancing Software by Fakhroo Information Technology Services Load Balancers, Exchange Load Balancing, Application Delivery Controllers, Reverse Proxy, SSL Acceleration and Off-loading, AD FS Load Balancing, Azure Load Balancer, AWS Load Balancer, SDN Adaptive, Internet of things, Skype for Business, Hybrid Cloud, Azure Stack, Multi-Cloud, CMP, AMP, CSP, MSP, and Multicloud. View product NGINX Ingress Controller Load Balancing Software by NGINX News and updates (UnOfficial) Streamline and simplify Kubernetes (north-south) network traffic management, delivering consistent, predictable performance at scale without slowing down your apps. Production-Grade Kubernetes NGINX Ingress Controller, the most widely used Ingress technology with more than 50 million DockerHub pulls, is synonymous with high‑performing, scalable, and secure modern apps in production View product Load Balancer Load Balancing Software by GoCache Entregue uma alta disponibilidade para sua audiência e otimize o desempenho de suas aplicações, distribuindo o tráfego de forma eficiente entre os servidores e garanta uma experiência online fluida e confiável para sua audiência. View product Haltdos Link Balancer Load Balancing Software by Haltdos Haltdos Enterprise Link Balancing Solution - High performance WAN link balancer and QoS solution Features: Built-in DDoS Protection DNS Firewall Context Aware Qos With Haltdos Build Reliable Enterprise Network Improve Network Utilization Optimize WAN Links Eliminate Downtime Improve Productivity Quality of Service Secure DNS View product See more How it works Explore Discover the best product for your need from a growing catalog of 25,000 products and categories trusted by LinkedIn professionals Learn Evaluate new tools, explore trending products in your industry and see who in your network is skilled in the product Grow Join communities of product users to learn best practices, celebrate your progress and accelerate your career LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines English Language | 2026-01-13T09:29:14 |
https://doc.rust-lang.org/std/convert/trait.From.html | From in std::convert - Rust This old browser is unsupported and will most likely display funky things. From std 1.92.0 (ded5c06cf 2025-12-08) From Sections Generic Implementations When to implement From Examples Required Methods from Dyn Compatibility Implementors In std:: convert std :: convert Trait From Copy item path 1.0.0 (const: unstable ) · Source pub trait From<T>: Sized { // Required method fn from (value: T) -> Self; } Expand description Used to do value-to-value conversions while consuming the input value. It is the reciprocal of Into . One should always prefer implementing From over Into because implementing From automatically provides one with an implementation of Into thanks to the blanket implementation in the standard library. Only implement Into when targeting a version prior to Rust 1.41 and converting to a type outside the current crate. From was not able to do these types of conversions in earlier versions because of Rust’s orphaning rules. See Into for more details. Prefer using Into over From when specifying trait bounds on a generic function to ensure that types that only implement Into can be used as well. The From trait is also very useful when performing error handling. When constructing a function that is capable of failing, the return type will generally be of the form Result<T, E> . From simplifies error handling by allowing a function to return a single error type that encapsulates multiple error types. See the “Examples” section and the book for more details. Note: This trait must not fail . The From trait is intended for perfect conversions. If the conversion can fail or is not perfect, use TryFrom . § Generic Implementations From<T> for U implies Into <U> for T From is reflexive, which means that From<T> for T is implemented § When to implement From While there’s no technical restrictions on which conversions can be done using a From implementation, the general expectation is that the conversions should typically be restricted as follows: The conversion is infallible : if the conversion can fail, use TryFrom instead; don’t provide a From impl that panics. The conversion is lossless : semantically, it should not lose or discard information. For example, i32: From<u16> exists, where the original value can be recovered using u16: TryFrom<i32> . And String: From<&str> exists, where you can get something equivalent to the original value via Deref . But From cannot be used to convert from u32 to u16 , since that cannot succeed in a lossless way. (There’s some wiggle room here for information not considered semantically relevant. For example, Box<[T]>: From<Vec<T>> exists even though it might not preserve capacity, like how two vectors can be equal despite differing capacities.) The conversion is value-preserving : the conceptual kind and meaning of the resulting value is the same, even though the Rust type and technical representation might be different. For example -1_i8 as u8 is lossless , since as casting back can recover the original value, but that conversion is not available via From because -1 and 255 are different conceptual values (despite being identical bit patterns technically). But f32: From<i16> is available because 1_i16 and 1.0_f32 are conceptually the same real number (despite having very different bit patterns technically). String: From<char> is available because they’re both text , but String: From<u32> is not available, since 1 (a number) and "1" (text) are too different. (Converting values to text is instead covered by the Display trait.) The conversion is obvious : it’s the only reasonable conversion between the two types. Otherwise it’s better to have it be a named method or constructor, like how str::as_bytes is a method and how integers have methods like u32::from_ne_bytes , u32::from_le_bytes , and u32::from_be_bytes , none of which are From implementations. Whereas there’s only one reasonable way to wrap an Ipv6Addr into an IpAddr , thus IpAddr: From<Ipv6Addr> exists. § Examples String implements From<&str> : An explicit conversion from a &str to a String is done as follows: let string = "hello" .to_string(); let other_string = String::from( "hello" ); assert_eq! (string, other_string); While performing error handling it is often useful to implement From for your own error type. By converting underlying error types to our own custom error type that encapsulates the underlying error type, we can return a single error type without losing information on the underlying cause. The ‘?’ operator automatically converts the underlying error type to our custom error type with From::from . use std::fs; use std::io; use std::num; enum CliError { IoError(io::Error), ParseError(num::ParseIntError), } impl From<io::Error> for CliError { fn from(error: io::Error) -> Self { CliError::IoError(error) } } impl From<num::ParseIntError> for CliError { fn from(error: num::ParseIntError) -> Self { CliError::ParseError(error) } } fn open_and_parse_file(file_name: & str) -> Result <i32, CliError> { let mut contents = fs::read_to_string( & file_name) ? ; let num: i32 = contents.trim().parse() ? ; Ok (num) } Required Methods § 1.0.0 · Source fn from (value: T) -> Self Converts to this type from the input type. Dyn Compatibility § This trait is not dyn compatible . In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe. Implementors § 1.17.0 · Source § impl From <& str > for Box < str > 1.21.0 · Source § impl From <& str > for Rc < str > 1.0.0 · Source § impl From <& str > for String 1.21.0 · Source § impl From <& str > for Arc < str > 1.0.0 · Source § impl From <& str > for Vec < u8 > 1.17.0 · Source § impl From <& CStr > for Box < CStr > 1.7.0 · Source § impl From <& CStr > for CString 1.24.0 · Source § impl From <& CStr > for Rc < CStr > 1.24.0 · Source § impl From <& CStr > for Arc < CStr > 1.17.0 · Source § impl From <& OsStr > for Box < OsStr > 1.24.0 · Source § impl From <& OsStr > for Rc < OsStr > 1.24.0 · Source § impl From <& OsStr > for Arc < OsStr > 1.17.0 · Source § impl From <& Path > for Box < Path > 1.24.0 · Source § impl From <& Path > for Rc < Path > 1.24.0 · Source § impl From <& Path > for Arc < Path > 1.35.0 · Source § impl From <& String > for String 1.84.0 · Source § impl From <&mut str > for Box < str > 1.84.0 · Source § impl From <&mut str > for Rc < str > 1.44.0 · Source § impl From <&mut str > for String 1.84.0 · Source § impl From <&mut str > for Arc < str > 1.84.0 · Source § impl From <&mut CStr > for Box < CStr > 1.84.0 · Source § impl From <&mut CStr > for Rc < CStr > 1.84.0 · Source § impl From <&mut CStr > for Arc < CStr > 1.84.0 · Source § impl From <&mut OsStr > for Box < OsStr > 1.84.0 · Source § impl From <&mut OsStr > for Rc < OsStr > 1.84.0 · Source § impl From <&mut OsStr > for Arc < OsStr > 1.84.0 · Source § impl From <&mut Path > for Box < Path > 1.84.0 · Source § impl From <&mut Path > for Rc < Path > 1.84.0 · Source § impl From <&mut Path > for Arc < Path > Source § impl From < AsciiChar > for char Source § impl From < AsciiChar > for u8 Source § impl From < AsciiChar > for u16 Source § impl From < AsciiChar > for u32 Source § impl From < AsciiChar > for u64 Source § impl From < AsciiChar > for u128 1.45.0 · Source § impl From < Cow <'_, str >> for Box < str > 1.45.0 · Source § impl From < Cow <'_, CStr >> for Box < CStr > 1.45.0 · Source § impl From < Cow <'_, OsStr >> for Box < OsStr > 1.45.0 · Source § impl From < Cow <'_, Path >> for Box < Path > Source § impl From < TryReserveErrorKind > for TryReserveError 1.89.0 · Source § impl From < TryLockError > for Error 1.14.0 · Source § impl From < ErrorKind > for Error Intended for use for errors not exposed to the user, where allocating onto the heap (for normal construction via Error::new) is too costly. 1.36.0 (const: unstable ) · Source § impl From < Infallible > for TryFromSliceError 1.34.0 (const: unstable ) · Source § impl From < Infallible > for TryFromIntError 1.68.0 (const: unstable ) · Source § impl From < bool > for f16 1.68.0 (const: unstable ) · Source § impl From < bool > for f32 1.68.0 (const: unstable ) · Source § impl From < bool > for f64 1.68.0 (const: unstable ) · Source § impl From < bool > for f128 1.28.0 (const: unstable ) · Source § impl From < bool > for i8 1.28.0 (const: unstable ) · Source § impl From < bool > for i16 1.28.0 (const: unstable ) · Source § impl From < bool > for i32 1.28.0 (const: unstable ) · Source § impl From < bool > for i64 1.28.0 (const: unstable ) · Source § impl From < bool > for i128 1.28.0 (const: unstable ) · Source § impl From < bool > for isize 1.28.0 (const: unstable ) · Source § impl From < bool > for u8 1.28.0 (const: unstable ) · Source § impl From < bool > for u16 1.28.0 (const: unstable ) · Source § impl From < bool > for u32 1.28.0 (const: unstable ) · Source § impl From < bool > for u64 1.28.0 (const: unstable ) · Source § impl From < bool > for u128 1.28.0 (const: unstable ) · Source § impl From < bool > for usize 1.24.0 (const: unstable ) · Source § impl From < bool > for AtomicBool 1.13.0 (const: unstable ) · Source § impl From < char > for u32 1.51.0 (const: unstable ) · Source § impl From < char > for u64 1.51.0 (const: unstable ) · Source § impl From < char > for u128 1.46.0 · Source § impl From < char > for String 1.6.0 (const: unstable ) · Source § impl From < f16 > for f64 1.6.0 (const: unstable ) · Source § impl From < f16 > for f128 1.6.0 (const: unstable ) · Source § impl From < f32 > for f64 1.6.0 (const: unstable ) · Source § impl From < f32 > for f128 1.6.0 (const: unstable ) · Source § impl From < f64 > for f128 1.6.0 (const: unstable ) · Source § impl From < i8 > for f16 1.6.0 (const: unstable ) · Source § impl From < i8 > for f32 1.6.0 (const: unstable ) · Source § impl From < i8 > for f64 1.6.0 (const: unstable ) · Source § impl From < i8 > for f128 1.5.0 (const: unstable ) · Source § impl From < i8 > for i16 1.5.0 (const: unstable ) · Source § impl From < i8 > for i32 1.5.0 (const: unstable ) · Source § impl From < i8 > for i64 1.26.0 (const: unstable ) · Source § impl From < i8 > for i128 1.5.0 (const: unstable ) · Source § impl From < i8 > for isize 1.34.0 (const: unstable ) · Source § impl From < i8 > for AtomicI8 1.6.0 (const: unstable ) · Source § impl From < i16 > for f32 1.6.0 (const: unstable ) · Source § impl From < i16 > for f64 1.6.0 (const: unstable ) · Source § impl From < i16 > for f128 1.5.0 (const: unstable ) · Source § impl From < i16 > for i32 1.5.0 (const: unstable ) · Source § impl From < i16 > for i64 1.26.0 (const: unstable ) · Source § impl From < i16 > for i128 1.26.0 (const: unstable ) · Source § impl From < i16 > for isize 1.34.0 (const: unstable ) · Source § impl From < i16 > for AtomicI16 1.6.0 (const: unstable ) · Source § impl From < i32 > for f64 1.6.0 (const: unstable ) · Source § impl From < i32 > for f128 1.5.0 (const: unstable ) · Source § impl From < i32 > for i64 1.26.0 (const: unstable ) · Source § impl From < i32 > for i128 1.34.0 (const: unstable ) · Source § impl From < i32 > for AtomicI32 1.26.0 (const: unstable ) · Source § impl From < i64 > for i128 1.34.0 (const: unstable ) · Source § impl From < i64 > for AtomicI64 1.23.0 (const: unstable ) · Source § impl From < isize > for AtomicIsize 1.34.0 (const: unstable ) · Source § impl From < ! > for Infallible Source § impl From < ! > for TryFromIntError 1.13.0 (const: unstable ) · Source § impl From < u8 > for char Maps a byte in 0x00..=0xFF to a char whose code point has the same value, in U+0000..=U+00FF. Unicode is designed such that this effectively decodes bytes with the character encoding that IANA calls ISO-8859-1. This encoding is compatible with ASCII. Note that this is different from ISO/IEC 8859-1 a.k.a. ISO 8859-1 (with one less hyphen), which leaves some “blanks”, byte values that are not assigned to any character. ISO-8859-1 (the IANA one) assigns them to the C0 and C1 control codes. Note that this is also different from Windows-1252 a.k.a. code page 1252, which is a superset ISO/IEC 8859-1 that assigns some (not all!) blanks to punctuation and various Latin characters. To confuse things further, on the Web ascii , iso-8859-1 , and windows-1252 are all aliases for a superset of Windows-1252 that fills the remaining blanks with corresponding C0 and C1 control codes. 1.6.0 (const: unstable ) · Source § impl From < u8 > for f16 1.6.0 (const: unstable ) · Source § impl From < u8 > for f32 1.6.0 (const: unstable ) · Source § impl From < u8 > for f64 1.6.0 (const: unstable ) · Source § impl From < u8 > for f128 1.5.0 (const: unstable ) · Source § impl From < u8 > for i16 1.5.0 (const: unstable ) · Source § impl From < u8 > for i32 1.5.0 (const: unstable ) · Source § impl From < u8 > for i64 1.26.0 (const: unstable ) · Source § impl From < u8 > for i128 1.26.0 (const: unstable ) · Source § impl From < u8 > for isize 1.5.0 (const: unstable ) · Source § impl From < u8 > for u16 1.5.0 (const: unstable ) · Source § impl From < u8 > for u32 1.5.0 (const: unstable ) · Source § impl From < u8 > for u64 1.26.0 (const: unstable ) · Source § impl From < u8 > for u128 1.5.0 (const: unstable ) · Source § impl From < u8 > for usize 1.61.0 · Source § impl From < u8 > for ExitCode 1.34.0 (const: unstable ) · Source § impl From < u8 > for AtomicU8 1.6.0 (const: unstable ) · Source § impl From < u16 > for f32 1.6.0 (const: unstable ) · Source § impl From < u16 > for f64 1.6.0 (const: unstable ) · Source § impl From < u16 > for f128 1.5.0 (const: unstable ) · Source § impl From < u16 > for i32 1.5.0 (const: unstable ) · Source § impl From < u16 > for i64 1.26.0 (const: unstable ) · Source § impl From < u16 > for i128 1.5.0 (const: unstable ) · Source § impl From < u16 > for u32 1.5.0 (const: unstable ) · Source § impl From < u16 > for u64 1.26.0 (const: unstable ) · Source § impl From < u16 > for u128 1.26.0 (const: unstable ) · Source § impl From < u16 > for usize 1.34.0 (const: unstable ) · Source § impl From < u16 > for AtomicU16 1.6.0 (const: unstable ) · Source § impl From < u32 > for f64 1.6.0 (const: unstable ) · Source § impl From < u32 > for f128 1.5.0 (const: unstable ) · Source § impl From < u32 > for i64 1.26.0 (const: unstable ) · Source § impl From < u32 > for i128 1.5.0 (const: unstable ) · Source § impl From < u32 > for u64 1.26.0 (const: unstable ) · Source § impl From < u32 > for u128 1.1.0 (const: unstable ) · Source § impl From < u32 > for Ipv4Addr 1.34.0 (const: unstable ) · Source § impl From < u32 > for AtomicU32 1.26.0 (const: unstable ) · Source § impl From < u64 > for i128 1.26.0 (const: unstable ) · Source § impl From < u64 > for u128 1.34.0 (const: unstable ) · Source § impl From < u64 > for AtomicU64 1.26.0 (const: unstable ) · Source § impl From < u128 > for Ipv6Addr 1.23.0 (const: unstable ) · Source § impl From < usize > for AtomicUsize Source § impl From < __m128 > for Simd < f32 , 4> Source § impl From < __m128d > for Simd < f64 , 2> Source § impl From < __m128i > for Simd < i8 , 16> Source § impl From < __m128i > for Simd < i16 , 8> Source § impl From < __m128i > for Simd < i32 , 4> Source § impl From < __m128i > for Simd < i64 , 2> Source § impl From < __m128i > for Simd < isize , 2> Source § impl From < __m128i > for Simd < u8 , 16> Source § impl From < __m128i > for Simd < u16 , 8> Source § impl From < __m128i > for Simd < u32 , 4> Source § impl From < __m128i > for Simd < u64 , 2> Source § impl From < __m128i > for Simd < usize , 2> Source § impl From < __m256 > for Simd < f32 , 8> Source § impl From < __m256d > for Simd < f64 , 4> Source § impl From < __m256i > for Simd < i8 , 32> Source § impl From < __m256i > for Simd < i16 , 16> Source § impl From < __m256i > for Simd < i32 , 8> Source § impl From < __m256i > for Simd < i64 , 4> Source § impl From < __m256i > for Simd < isize , 4> Source § impl From < __m256i > for Simd < u8 , 32> Source § impl From < __m256i > for Simd < u16 , 16> Source § impl From < __m256i > for Simd < u32 , 8> Source § impl From < __m256i > for Simd < u64 , 4> Source § impl From < __m256i > for Simd < usize , 4> Source § impl From < __m512 > for Simd < f32 , 16> Source § impl From < __m512d > for Simd < f64 , 8> Source § impl From < __m512i > for Simd < i8 , 64> Source § impl From < __m512i > for Simd < i16 , 32> Source § impl From < __m512i > for Simd < i32 , 16> Source § impl From < __m512i > for Simd < i64 , 8> Source § impl From < __m512i > for Simd < isize , 8> Source § impl From < __m512i > for Simd < u8 , 64> Source § impl From < __m512i > for Simd < u16 , 32> Source § impl From < __m512i > for Simd < u32 , 16> Source § impl From < __m512i > for Simd < u64 , 8> Source § impl From < __m512i > for Simd < usize , 8> Source § impl From < LayoutError > for TryReserveErrorKind 1.18.0 · Source § impl From < Box < str >> for String Source § impl From < Box < ByteStr >> for Box <[ u8 ]> 1.18.0 · Source § impl From < Box < CStr >> for CString 1.18.0 · Source § impl From < Box < OsStr >> for OsString 1.18.0 · Source § impl From < Box < Path >> for PathBuf Source § impl From < Box <[ u8 ]>> for Box < ByteStr > Source § impl From < ByteString > for Vec < u8 > 1.78.0 · Source § impl From < TryReserveError > for Error 1.20.0 · Source § impl From < CString > for Box < CStr > 1.24.0 · Source § impl From < CString > for Rc < CStr > 1.24.0 · Source § impl From < CString > for Arc < CStr > 1.7.0 · Source § impl From < CString > for Vec < u8 > 1.0.0 · Source § impl From < NulError > for Error 1.20.0 · Source § impl From < OsString > for Box < OsStr > 1.0.0 · Source § impl From < OsString > for PathBuf 1.24.0 · Source § impl From < OsString > for Rc < OsStr > 1.24.0 · Source § impl From < OsString > for Arc < OsStr > 1.63.0 · Source § impl From < File > for OwnedFd Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. 1.63.0 · Source § impl From < File > for OwnedHandle Available on Windows only. 1.20.0 · Source § impl From < File > for Stdio 1.87.0 · Source § impl From < PipeReader > for OwnedFd Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. 1.87.0 · Source § impl From < PipeReader > for OwnedHandle Available on Windows only. 1.87.0 · Source § impl From < PipeReader > for Stdio 1.87.0 · Source § impl From < PipeWriter > for OwnedFd Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. 1.87.0 · Source § impl From < PipeWriter > for OwnedHandle Available on Windows only. 1.87.0 · Source § impl From < PipeWriter > for Stdio 1.74.0 · Source § impl From < Stderr > for Stdio 1.74.0 · Source § impl From < Stdout > for Stdio 1.16.0 (const: unstable ) · Source § impl From < Ipv4Addr > for IpAddr 1.1.0 (const: unstable ) · Source § impl From < Ipv4Addr > for u32 1.16.0 (const: unstable ) · Source § impl From < Ipv6Addr > for IpAddr 1.26.0 (const: unstable ) · Source § impl From < Ipv6Addr > for u128 1.16.0 (const: unstable ) · Source § impl From < SocketAddrV4 > for SocketAddr 1.16.0 (const: unstable ) · Source § impl From < SocketAddrV6 > for SocketAddr 1.63.0 · Source § impl From < TcpListener > for OwnedFd Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. 1.63.0 · Source § impl From < TcpListener > for OwnedSocket Available on Windows only. 1.63.0 · Source § impl From < TcpStream > for OwnedFd Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. 1.63.0 · Source § impl From < TcpStream > for OwnedSocket Available on Windows only. 1.63.0 · Source § impl From < UdpSocket > for OwnedFd Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. 1.63.0 · Source § impl From < UdpSocket > for OwnedSocket Available on Windows only. 1.41.0 (const: unstable ) · Source § impl From < NonZero < i8 >> for NonZero < i16 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < i8 >> for NonZero < i32 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < i8 >> for NonZero < i64 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < i8 >> for NonZero < i128 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < i8 >> for NonZero < isize > 1.41.0 (const: unstable ) · Source § impl From < NonZero < i16 >> for NonZero < i32 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < i16 >> for NonZero < i64 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < i16 >> for NonZero < i128 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < i16 >> for NonZero < isize > 1.41.0 (const: unstable ) · Source § impl From < NonZero < i32 >> for NonZero < i64 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < i32 >> for NonZero < i128 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < i64 >> for NonZero < i128 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u8 >> for NonZero < i16 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u8 >> for NonZero < i32 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u8 >> for NonZero < i64 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u8 >> for NonZero < i128 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u8 >> for NonZero < isize > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u8 >> for NonZero < u16 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u8 >> for NonZero < u32 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u8 >> for NonZero < u64 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u8 >> for NonZero < u128 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u8 >> for NonZero < usize > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u16 >> for NonZero < i32 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u16 >> for NonZero < i64 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u16 >> for NonZero < i128 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u16 >> for NonZero < u32 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u16 >> for NonZero < u64 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u16 >> for NonZero < u128 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u16 >> for NonZero < usize > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u32 >> for NonZero < i64 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u32 >> for NonZero < i128 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u32 >> for NonZero < u64 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u32 >> for NonZero < u128 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u64 >> for NonZero < i128 > 1.41.0 (const: unstable ) · Source § impl From < NonZero < u64 >> for NonZero < u128 > 1.63.0 · Source § impl From < OwnedFd > for File Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. 1.87.0 · Source § impl From < OwnedFd > for PipeReader Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. 1.87.0 · Source § impl From < OwnedFd > for PipeWriter Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. 1.63.0 · Source § impl From < OwnedFd > for TcpListener Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. 1.63.0 · Source § impl From < OwnedFd > for TcpStream Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. 1.63.0 · Source § impl From < OwnedFd > for UdpSocket Available on (Unix or HermitCore or target_os=trusty or WASI or target_os=motor ) and non- target_os=trusty only. Source § impl From < OwnedFd > for PidFd Available on Linux only. 1.63.0 · Source § impl From < OwnedFd > for UnixDatagram Available on Unix only. 1.63.0 · Source § impl From < OwnedFd > for UnixListener Available on Unix only. 1.63.0 · Source § impl From < OwnedFd > for UnixStream Available on Unix only. 1.74.0 · Source § impl From < OwnedFd > for ChildStderr Available on Unix only. Creates a ChildStderr from the provided OwnedFd . The provided file descriptor must point to a pipe with the CLOEXEC flag set. 1.74.0 · Source § impl From < OwnedFd > for ChildStdin Available on Unix only. Creates a ChildStdin from the provided OwnedFd . The provided file descriptor must point to a pipe with the CLOEXEC flag set. 1.74.0 · Source § impl From < OwnedFd > for ChildStdout Available on Unix only. Creates a ChildStdout from the provided OwnedFd . The provided file descriptor must point to a pipe with the CLOEXEC flag set. 1.63.0 · Source § impl From < OwnedFd > for Stdio Available on Unix only. Source § impl From < PidFd > for OwnedFd Available on Linux only. 1.63.0 · Source § impl From < UnixDatagram > for OwnedFd Available on Unix only. 1.63.0 · Source § impl From < UnixListener > for OwnedFd Available on Unix only. 1.63.0 · Source § impl From < UnixStream > for OwnedFd Available on Unix only. 1.63.0 · Source § impl From < OwnedHandle > for File Available on Windows only. 1.87.0 · Source § impl From < OwnedHandle > for PipeReader Available on Windows only. 1.87.0 · Source § impl From < OwnedHandle > for PipeWriter Available on Windows only. 1.74.0 · Source § impl From < OwnedHandle > for ChildStderr Available on Windows only. Creates a ChildStderr from the provided OwnedHandle . The provided handle must be asynchronous, as reading and writing from and to it is implemented using asynchronous APIs. 1.74.0 · Source § impl From < OwnedHandle > for ChildStdin Available on Windows only. Creates a ChildStdin from the provided OwnedHandle . The provided handle must be asynchronous, as reading and writing from and to it is implemented using asynchronous APIs. 1.74.0 · Source § impl From < OwnedHandle > for ChildStdout Available on Windows only. Creates a ChildStdout from the provided OwnedHandle . The provided handle must be asynchronous, as reading and writing from and to it is implemented using asynchronous APIs. 1.63.0 · Source § impl From < OwnedHandle > for Stdio Available on Windows only. 1.63.0 · Source § impl From < OwnedSocket > for TcpListener Available on Windows only. 1.63.0 · Source § impl From < OwnedSocket > for TcpStream Available on Windows only. 1.63.0 · Source § impl From < OwnedSocket > for UdpSocket Available on Windows only. 1.20.0 · Source § impl From < PathBuf > for Box < Path > 1.14.0 · Source § impl From < PathBuf > for OsString 1.24.0 · Source § impl From < PathBuf > for Rc < Path > 1.24.0 · Source § impl From < PathBuf > for Arc < Path > 1.63.0 · Source § impl From < Child > for OwnedHandle Available on Windows only. 1.63.0 · Source § impl From < ChildStderr > for OwnedFd Available on Unix only. 1.63.0 · Source § impl From < ChildStderr > for OwnedHandle Available on Windows only. 1.20.0 · Source § impl From < ChildStderr > for Stdio 1.63.0 · Source § impl From < ChildStdin > for OwnedFd Available on Unix only. 1.63.0 · Source § impl From < ChildStdin > for OwnedHandle Available on Windows only. 1.20.0 · Source § impl From < ChildStdin > for Stdio 1.63.0 · Source § impl From < ChildStdout > for OwnedFd Available on Unix only. 1.63.0 · Source § impl From < ChildStdout > for OwnedHandle Available on Windows only. 1.20.0 · Source § impl From < ChildStdout > for Stdio Source § impl From < ExitStatusError > for ExitStatus Source § impl From < Alignment > for usize Source § impl From < Alignment > for NonZero < usize > 1.62.0 · Source § impl From < Rc < str >> for Rc <[ u8 ]> Source § impl From < Rc < ByteStr >> for Rc <[ u8 ]> Source § impl From < Rc <[ u8 ]>> for Rc < ByteStr > Source § impl From < Simd < f32 , 4>> for __m128 Source § impl From < Simd < f32 , 8>> for __m256 Source § impl From < Simd < f32 , 16>> for __m512 Source § impl From < Simd < f64 , 2>> for __m128d Source § impl From < Simd < f64 , 4>> for __m256d Source § impl From < Simd < f64 , 8>> for __m512d Source § impl From < Simd < i8 , 16>> for __m128i Source § impl From < Simd < i8 , 32>> for __m256i Source § impl From < Simd < i8 , 64>> for __m512i Source § impl From < Simd < i16 , 8>> for __m128i Source § impl From < Simd < i16 , 16>> for __m256i Source § impl From < Simd < i16 , 32>> for __m512i Source § impl From < Simd < i32 , 4>> for __m128i Source § impl From < Simd < i32 , 8>> for __m256i Source § impl From < Simd < i32 , 16>> for __m512i Source § impl From < Simd < i64 , 2>> for __m128i Source § impl From < Simd < i64 , 4>> for __m256i Source § impl From < Simd < i64 , 8>> for __m512i Source § impl From < Simd < isize , 2>> for __m128i Source § impl From < Simd < isize , 4>> for __m256i Source § impl From < Simd < isize , 8>> for __m512i Source § impl From < Simd < u8 , 16>> for __m128i Source § impl From < Simd < u8 , 32>> for __m256i Source § impl From < Simd < u8 , 64>> for __m512i Source § impl From < Simd < u16 , 8>> for __m128i Source § impl From < Simd < u16 , 16>> for __m256i Source § impl From < Simd < u16 , 32>> for __m512i Source § impl From < Simd < u32 , 4>> for __m128i Source § impl From < Simd < u32 , 8>> for __m256i Source § impl From < Simd < u32 , 16>> for __m512i Source § impl From < Simd < u64 , 2>> for __m128i Source § impl From < Simd < u64 , 4>> for __m256i Source § impl From < Simd < u64 , 8>> for __m512i Source § impl From < Simd < usize , 2>> for __m128i Source § impl From < Simd < usize , 4>> for __m256i Source § impl From < Simd < usize , 8>> for __m512i 1.20.0 · Source § impl From < String > for Box < str > 1.0.0 · Source § impl From < String > for OsString 1.0.0 · Source § impl From < String > for PathBuf 1.21.0 · Source § impl From < String > for Rc < str > 1.21.0 · Source § impl From < String > for Arc < str > 1.14.0 · Source § impl From < String > for Vec < u8 > 1.24.0 · Source § impl From < RecvError > for RecvTimeoutError 1.24.0 · Source § impl From < RecvError > for TryRecvError 1.62.0 · Source § impl From < Arc < str >> for Arc <[ u8 ]> Source § impl From < Arc < ByteStr >> for Arc <[ u8 ]> Source § impl From < Arc <[ u8 ]>> for Arc < ByteStr > 1.43.0 · Source § impl From < Vec < NonZero < u8 >>> for CString 1.17.0 (const: unstable ) · Source § impl From <[ u8 ; 4 ]> for IpAddr 1.9.0 (const: unstable ) · Source § impl From <[ u8 ; 4 ]> for Ipv4Addr 1.17.0 (const: unstable ) · Source § impl From <[ u8 ; 16 ]> for IpAddr 1.9.0 (const: unstable ) · Source § impl From <[ u8 ; 16 ]> for Ipv6Addr 1.17.0 (const: unstable ) · Source § impl From <[ u16 ; 8 ]> for IpAddr 1.16.0 (const: unstable ) · Source § impl From <[ u16 ; 8 ]> for Ipv6Addr 1.0.0 · Source § impl<'a> From <&'a str > for Cow <'a, str > Source § impl<'a> From <&'a ByteStr > for Cow <'a, ByteStr > Source § impl<'a> From <&'a ByteStr > for ByteString Source § impl<'a> From <&'a ByteString > for Cow <'a, ByteStr > 1.28.0 · Source § impl<'a> From <&'a CStr > for Cow <'a, CStr > 1.28.0 · Source § impl<'a> From <&'a CString > for Cow <'a, CStr > 1.28.0 · Source § impl<'a> From <&'a OsStr > for Cow <'a, OsStr > 1.28.0 · Source § impl<'a> From <&'a OsString > for Cow <'a, OsStr > 1.6.0 · Source § impl<'a> From <&'a Path > for Cow <'a, Path > 1.28.0 · Source § impl<'a> From <&'a PathBuf > for Cow <'a, Path > 1.28.0 · Source § impl<'a> From <&'a String > for Cow <'a, str > 1.6.0 · Source § impl<'a> From <& str > for Box <dyn Error + 'a> 1.0.0 · Source § impl<'a> From <& str > for Box <dyn Error + Send + Sync + 'a> 1.14.0 · Source § impl<'a> From < Cow <'a, str >> for String 1.28.0 · Source § impl<'a> From < Cow <'a, CStr >> for CString 1.28.0 · Source § impl<'a> From < Cow <'a, OsStr >> for OsString 1.28.0 · Source § impl<'a> From < Cow <'a, Path >> for PathBuf Source § impl<'a> From < ByteString > for Cow <'a, ByteStr > 1.28.0 · Source § impl<'a> From < CString > for Cow <'a, CStr > 1.28.0 · Source § impl<'a> From < OsString > for Cow <'a, OsStr > 1.6.0 · Source § impl<'a> From < PathBuf > for Cow <'a, Path > 1.0.0 · Source § impl<'a> From < String > for Cow <'a, str > 1.6.0 · Source § impl<'a> From < String > for Box <dyn Error + 'a> 1.0.0 · Source § impl<'a> From < String > for Box <dyn Error + Send + Sync + 'a> 1.22.0 · Source § impl<'a, 'b> From < Cow <'b, str >> for Box <dyn Error + 'a> 1.22.0 · Source § impl<'a, 'b> From < Cow <'b, str >> for Box <dyn Error + Send + Sync + 'a> 1.45.0 · Source § impl<'a, B> From < Cow <'a, B>> for Rc <B> where B: ToOwned + ? Sized , Rc <B>: From < &'a B > + From <<B as ToOwned >:: Owned >, 1.45.0 · Source § impl<'a, B> From < Cow <'a, B>> for Arc <B> where B: ToOwned + ? Sized , Arc <B>: From < &'a B > + From <<B as ToOwned >:: Owned >, 1.0.0 · Source § impl<'a, E> From <E> for Box <dyn Error + 'a> where E: Error + 'a, 1.0.0 · Source § impl<'a, E> From <E> for Box <dyn Error + Send + Sync + 'a> where E: Error + Send + Sync + 'a, 1.30.0 (const: unstable ) · Source § impl<'a, T> From <&'a Option <T>> for Option < &'a T > 1.8.0 · Source § impl<'a, T> From <&'a [T] > for Cow <'a, [T] > where T: Clone , 1.28.0 · Source § impl<'a, T> From <&'a Vec <T>> for Cow <'a, [T] > where T: Clone , 1.30.0 (const: unstable ) · Source § impl<'a, T> From <&'a mut Option <T>> for Option < &'a mut T > 1.14.0 · Source § impl<'a, T> From < Cow <'a, [T] >> for Vec <T> where [T] : ToOwned <Owned = Vec <T>>, 1.8.0 · Source § impl<'a, T> From < Vec <T>> for Cow <'a, [T] > where T: Clone , 1.77.0 · Source § impl<'a, T, const N: usize > From <&'a [T; N] > for Cow <'a, [T] > where T: Clone , Source § impl<'data> From <&'data mut [ u8 ]> for BorrowedBuf <'data> Creates a new BorrowedBuf from a fully initialized slice. Source § impl<'data> From <&'data mut [ MaybeUninit < u8 >]> for BorrowedBuf <'data> Creates a new BorrowedBuf from an uninitialized buffer. Use set_init if part of the buffer is known to be already initialized. Source § impl<'data> From < BorrowedCursor <'data>> for BorrowedBuf <'data> Creates a new BorrowedBuf from a cursor. Use BorrowedCursor::with_unfilled_buf instead for a safer alternative. 1.19.0 · Source § impl<A> From < Box < str , A>> for Box <[ u8 ], A> where A: Allocator , Source § impl<E> From <E> for Report <E> where E: Error , 1.17.0 (const: unstable ) · Source § impl<I> From <(I, u16 )> for SocketAddr where I: Into < IpAddr >, 1.56.0 · Source § impl<K, V, const N: usize > From <[ (K, V) ; N ]> for BTreeMap <K, V> where K: Ord , 1.56.0 · Source § impl<K, V, const N: usize > From <[ (K, V) ; N ]> for HashMap <K, V, RandomState > where K: Eq + Hash , 1.17.0 · Source § impl<T> From <& [T] > for Box < [T] > where T: Clone , 1.21.0 · Source § impl<T> From <& [T] > for Rc < [T] > where T: Clone , 1.21.0 · Source § impl<T> From <& [T] > for Arc < [T] > where T: Clone , 1.0.0 · Source § impl<T> From <& [T] > for Vec <T> where T: Clone , 1.84.0 · Source § impl<T> From <&mut [T] > for Box < [T] > where T: Clone , 1.84.0 · Source § impl<T> From <&mut [T] > for Rc < [T] > where T: Clone , 1.84.0 · Source § impl<T> From <&mut [T] > for Arc < [T] > where T: Clone , 1.19.0 · Source § impl<T> From <&mut [T] > for Vec <T> where T: Clone , 1.45.0 · Source § impl<T> From < Cow <'_, [T] >> for Box < [T] > where T: Clone , 1.71.0 · Source § impl<T> From < [T; N] > for (T₁, T₂, …, Tₙ) This trait is implemented for tuples up to twelve items long. 1.34.0 (const: unstable ) · Source § impl<T> From < ! > for T Stability note: This impl does not yet exist, but we are “reserving space” to add it in the future. See rust-lang/rust#64715 for details. 1.23.0 (const: unstable ) · Source § impl<T> From < *mut T > for AtomicPtr <T> 1.25.0 (const: unstable ) · Source § impl<T> From < &T > for NonNull <T> where T: ? Sized , 1.25.0 (const: unstable ) · Source § impl<T> From < &mut T > for NonNull <T> where T: ? Sized , 1.71.0 · Source § impl<T> From < (T₁, T₂, …, Tₙ) > for [T; N] This trait is implemented for tuples up to twelve items long. 1.31.0 (const: unstable ) · Source § impl<T> From < NonZero <T>> for T where T: ZeroablePrimitive , Source § impl<T> From < Range <T>> for std::range:: Range <T> Source § impl<T> From < RangeFrom <T>> for std::range:: RangeFrom <T> Source § impl<T> From < RangeInclusive <T>> for std::range:: RangeInclusive <T> Source § impl<T> From < Range <T>> for std::ops:: Range <T> Source § impl<T> From < RangeFrom <T>> for std::ops:: RangeFrom <T> Source § impl<T> From < RangeInclusive <T>> for std::ops:: RangeInclusive <T> Source § impl<T> From < SendError <T>> for SendTimeoutError <T> 1.24.0 · Source § impl<T> From < SendError <T>> for TrySendError <T> 1.0.0 · Source § impl<T> From < PoisonError <T>> for TryLockError <T> 1.63.0 · Source § impl<T> From < JoinHandle <T>> for OwnedHandle Available on Windows only. 1.12.0 (const: unstable ) · Source § impl<T> From <T> for Option <T> 1.36.0 (const: unstable ) · Source § impl<T> From <T> for Poll <T> 1.6.0 · Source § impl<T> From <T> for Box <T> 1.12.0 (const: unstable ) · Source § impl<T> From <T> for Cell <T> 1.70.0 (const: unstable ) · Source § impl<T> From <T> for OnceCell <T> 1.12.0 (const: unstable ) · Source § impl<T> From <T> for RefCell <T> Source § impl<T> From <T> for SyncUnsafeCell <T> 1.12.0 (const: unstable ) · Source § impl<T> From <T> for UnsafeCell <T> Source § impl<T> From <T> for UnsafePinned <T> 1.6.0 · Source § impl<T> From <T> for Rc <T> Source § impl<T> From <T> for std::sync::nonpoison:: Mutex <T> Source § impl<T> From <T> for std::sync::nonpoison:: RwLock <T> 1.6.0 · Source § impl<T> From <T> for Arc <T> Source § impl<T> From <T> for Exclusive <T> 1.24.0 · Source § impl<T> From <T> for std::sync:: Mutex <T> 1.70.0 · Source § impl<T> From <T> for OnceLock <T> Source § impl<T> From <T> for ReentrantLock <T> 1.24.0 · Source § impl<T> From <T> for std::sync:: RwLock <T> 1.0.0 (const: unstable ) · Source § impl<T> From <T> for T 1.18.0 · Source § impl<T, A> From < Box < [T] , A>> for Vec <T, A> where A: Allocator , 1.33.0 · Source § impl<T, A> From < Box <T, A>> for Pin < Box <T, A>> where A: Allocator + 'static, T: ? Sized , 1.21.0 · Source § impl<T, A> From < Box <T, A>> for Rc <T, A> where A: Allocator , T: ? Sized , 1.21.0 · Source § impl<T, A> From < Box <T, A>> for Arc <T, A> where A: Allocator , T: ? Sized , 1.5.0 · Source § impl<T, A> From < BinaryHeap <T, A>> for Vec <T, A> where A: Allocator , 1.10.0 · Source § impl<T, A> From < VecDeque <T, A>> for Vec <T, A> where A: Allocator , 1.20.0 · Source § impl<T, A> From < Vec <T, A>> for Box < [T] , A> where A: Allocator , 1.5.0 · Source § impl<T, A> From < Vec <T, A>> for BinaryHeap <T, A> where T: Ord , A: Allocator , 1.10.0 · Source § impl<T, A> From < Vec <T, A>> for VecDeque <T, A> where A: Allocator , 1.21.0 · Source § impl<T, A> From < Vec <T, A>> for Rc < [T] , A> where A: Allocator , 1.21.0 · Source § impl<T, A> From < Vec <T, A>> for Arc < [T] , A> where A: Allocator + Clone , 1.74.0 · Source § impl<T, const N: usize > From <& [T; N] > for Vec <T> where T: Clone , 1.74.0 · Source § impl<T, const N: usize > From <&mut [T; N] > for Vec <T> where T: Clone , 1.45.0 · Source § impl<T, const N: usize > From < [T; N] > for Box < [T] > 1.56.0 · Source § impl<T, const N: usize > From < [T; N] > for BTreeSet <T> where T: Ord , 1.56.0 · Source § impl<T, const N: usize > From < [T; N] > for BinaryHeap <T> where T: Ord , 1.56.0 · Source § impl<T, const N: usize > From < [T; N] > for HashSet <T, RandomState > where T: Eq + Hash , 1.56.0 · Source § impl<T, const N: usize > From < [T; N] > for LinkedList <T> 1.56.0 · Source § impl<T, const N: usize > From < [T; N] > for VecDeque <T> 1.74.0 · Source § impl<T, const N: usize > From < [T; N] > for Rc < [T] > Source § impl<T, const N: usize > From < [T; N] > for Simd <T, N> where LaneCount <N>: SupportedLaneCount , T: SimdElement , 1.74.0 · Source § impl<T, const N: usize > From < [T; N] > for Arc < [T] > 1.44.0 · Source § impl<T, const N: usize > From < [T; N] > for Vec <T> Source § impl<T, const N: usize > From < Mask <T, N>> for [ bool ; N ] where T: MaskElement , LaneCount <N>: SupportedLaneCount , Source § impl<T, const N: usize > From < Simd <T, N>> for [T; N] where LaneCount <N>: SupportedLaneCount , T: SimdElement , Source § impl<T, const N: usize > From <Mask<T, N>> for Simd <T, N> where T: MaskElement , LaneCount <N>: SupportedLaneCount , Source § impl<T, const N: usize > From <[ bool ; N ]> for Mask <T, N> where T: MaskElement , LaneCount <N>: SupportedLaneCount , 1.0.0 · Source § impl<T: ? Sized + AsRef < OsStr >> From < &T > for OsString 1.0.0 · Source § impl<T: ? Sized + AsRef < OsStr >> From < &T > for PathBuf 1.0.0 · Source § impl<W> From < IntoInnerError <W>> for Error Source § impl<W> From < Rc <W>> for LocalWaker where W: LocalWake + 'static, Source § impl<W> From < Rc <W>> for RawWaker where W: LocalWake + 'static, 1.51.0 · Source § impl<W> From < Arc <W>> for RawWaker where W: Wake + Send + Sync + 'static, 1.51.0 · Source § impl<W> From < Arc <W>> for Waker where W: Wake + Send + Sync + 'static, Source § impl<const N: usize > From < Mask < i8 , N>> for Mask < i16 , N> where LaneCount <N>: SupportedLaneCount , Source § impl<const N: usize > From < Mask < i8 , N>> for Mask < i32 , N> where LaneCount <N>: SupportedLaneCount , Source § impl<const N: usize > From < Mask < i8 , N>> for Mask < i64 , N> where LaneCount <N>: SupportedLaneCount , Source § impl<const N: usize > From < Mask < i8 , N>> for Mask < isize , N> where LaneCount <N>: SupportedLaneCount , Source § impl<const N: usize > From < Mask < i16 , N>> for Mask < i8 , N> where LaneCount <N>: SupportedLaneCount , Source § impl<const N: usize > From < Mask < i16 , N>> for Mask < i32 , N> where LaneCount <N>: SupportedLaneCount , Source § impl<const N: usize > From < Mask < i16 , N>> for Mask < i64 , N> where LaneCount <N>: SupportedLaneCount , Source § impl<const N: usize > From < Mask < i16 , N>> for Mask < isize , N> where LaneCount <N>: SupportedLaneCount , Source § impl<const N: usize > From < Mask < i32 , N>> for Mask < i8 , N> where LaneCount <N>: SupportedLaneCount , Source § impl<const N: usize > From < Mask < i32 , N>> for Mask < i16 , N> where LaneCount <N>: SupportedLaneCount , Source § impl<const N: usize > From < Mask < i32 , N>> for Mask < i64 , N> where LaneCount <N>: SupportedLaneCount , S | 2026-01-13T09:29:14 |
https://doc.rust-lang.org/std/iter/trait.Iterator.html#method.partition | Iterator in std::iter - Rust This old browser is unsupported and will most likely display funky things. Iterator std 1.92.0 (ded5c06cf 2025-12-08) Iterator Required Associated Types Item Required Methods next Provided Methods advance_by all any array_chunks by_ref chain cloned cmp cmp_by collect collect_into copied count cycle enumerate eq eq_by filter filter_map find find_map flat_map flatten fold for_each fuse ge gt inspect intersperse intersperse_with is_partitioned is_sorted is_sorted_by is_sorted_by_key last le lt map map_while map_windows max max_by max_by_key min min_by min_by_key ne next_chunk nth partial_cmp partial_cmp_by partition partition_in_place peekable position product reduce rev rposition scan size_hint skip skip_while step_by sum take take_while try_collect try_find try_fold try_for_each try_reduce unzip zip Implementors In std:: iter std :: iter Trait Iterator Copy item path 1.0.0 · Source pub trait Iterator { type Item ; Show 76 methods // Required method fn next (&mut self) -> Option <Self:: Item >; // Provided methods fn next_chunk <const N: usize >( &mut self, ) -> Result <[Self:: Item ; N ], IntoIter <Self:: Item , N>> where Self: Sized { ... } fn size_hint (&self) -> ( usize , Option < usize >) { ... } fn count (self) -> usize where Self: Sized { ... } fn last (self) -> Option <Self:: Item > where Self: Sized { ... } fn advance_by (&mut self, n: usize ) -> Result < () , NonZero < usize >> { ... } fn nth (&mut self, n: usize ) -> Option <Self:: Item > { ... } fn step_by (self, step: usize ) -> StepBy <Self> ⓘ where Self: Sized { ... } fn chain <U>(self, other: U) -> Chain <Self, <U as IntoIterator >:: IntoIter > ⓘ where Self: Sized , U: IntoIterator <Item = Self:: Item > { ... } fn zip <U>(self, other: U) -> Zip <Self, <U as IntoIterator >:: IntoIter > ⓘ where Self: Sized , U: IntoIterator { ... } fn intersperse (self, separator: Self:: Item ) -> Intersperse <Self> ⓘ where Self: Sized , Self:: Item : Clone { ... } fn intersperse_with <G>(self, separator: G) -> IntersperseWith <Self, G> ⓘ where Self: Sized , G: FnMut () -> Self:: Item { ... } fn map <B, F>(self, f: F) -> Map <Self, F> ⓘ where Self: Sized , F: FnMut (Self:: Item ) -> B { ... } fn for_each <F>(self, f: F) where Self: Sized , F: FnMut (Self:: Item ) { ... } fn filter <P>(self, predicate: P) -> Filter <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool { ... } fn filter_map <B, F>(self, f: F) -> FilterMap <Self, F> ⓘ where Self: Sized , F: FnMut (Self:: Item ) -> Option <B> { ... } fn enumerate (self) -> Enumerate <Self> ⓘ where Self: Sized { ... } fn peekable (self) -> Peekable <Self> ⓘ where Self: Sized { ... } fn skip_while <P>(self, predicate: P) -> SkipWhile <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool { ... } fn take_while <P>(self, predicate: P) -> TakeWhile <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool { ... } fn map_while <B, P>(self, predicate: P) -> MapWhile <Self, P> ⓘ where Self: Sized , P: FnMut (Self:: Item ) -> Option <B> { ... } fn skip (self, n: usize ) -> Skip <Self> ⓘ where Self: Sized { ... } fn take (self, n: usize ) -> Take <Self> ⓘ where Self: Sized { ... } fn scan <St, B, F>(self, initial_state: St, f: F) -> Scan <Self, St, F> ⓘ where Self: Sized , F: FnMut ( &mut St , Self:: Item ) -> Option <B> { ... } fn flat_map <U, F>(self, f: F) -> FlatMap <Self, U, F> ⓘ where Self: Sized , U: IntoIterator , F: FnMut (Self:: Item ) -> U { ... } fn flatten (self) -> Flatten <Self> ⓘ where Self: Sized , Self:: Item : IntoIterator { ... } fn map_windows <F, R, const N: usize >(self, f: F) -> MapWindows <Self, F, N> ⓘ where Self: Sized , F: FnMut (&[Self:: Item ; N ]) -> R { ... } fn fuse (self) -> Fuse <Self> ⓘ where Self: Sized { ... } fn inspect <F>(self, f: F) -> Inspect <Self, F> ⓘ where Self: Sized , F: FnMut (&Self:: Item ) { ... } fn by_ref (&mut self) -> &mut Self where Self: Sized { ... } fn collect <B>(self) -> B where B: FromIterator <Self:: Item >, Self: Sized { ... } fn try_collect <B>( &mut self, ) -> <<Self:: Item as Try >:: Residual as Residual <B>>:: TryType where Self: Sized , Self:: Item : Try , <Self:: Item as Try >:: Residual : Residual <B>, B: FromIterator <<Self:: Item as Try >:: Output > { ... } fn collect_into <E>(self, collection: &mut E ) -> &mut E where E: Extend <Self:: Item >, Self: Sized { ... } fn partition <B, F>(self, f: F) -> (B, B) where Self: Sized , B: Default + Extend <Self:: Item >, F: FnMut (&Self:: Item ) -> bool { ... } fn partition_in_place <'a, T, P>(self, predicate: P) -> usize where T: 'a, Self: Sized + DoubleEndedIterator <Item = &'a mut T >, P: FnMut ( &T ) -> bool { ... } fn is_partitioned <P>(self, predicate: P) -> bool where Self: Sized , P: FnMut (Self:: Item ) -> bool { ... } fn try_fold <B, F, R>(&mut self, init: B, f: F) -> R where Self: Sized , F: FnMut (B, Self:: Item ) -> R, R: Try <Output = B> { ... } fn try_for_each <F, R>(&mut self, f: F) -> R where Self: Sized , F: FnMut (Self:: Item ) -> R, R: Try <Output = () > { ... } fn fold <B, F>(self, init: B, f: F) -> B where Self: Sized , F: FnMut (B, Self:: Item ) -> B { ... } fn reduce <F>(self, f: F) -> Option <Self:: Item > where Self: Sized , F: FnMut (Self:: Item , Self:: Item ) -> Self:: Item { ... } fn try_reduce <R>( &mut self, f: impl FnMut (Self:: Item , Self:: Item ) -> R, ) -> <<R as Try >:: Residual as Residual < Option <<R as Try >:: Output >>>:: TryType where Self: Sized , R: Try <Output = Self:: Item >, <R as Try >:: Residual : Residual < Option <Self:: Item >> { ... } fn all <F>(&mut self, f: F) -> bool where Self: Sized , F: FnMut (Self:: Item ) -> bool { ... } fn any <F>(&mut self, f: F) -> bool where Self: Sized , F: FnMut (Self:: Item ) -> bool { ... } fn find <P>(&mut self, predicate: P) -> Option <Self:: Item > where Self: Sized , P: FnMut (&Self:: Item ) -> bool { ... } fn find_map <B, F>(&mut self, f: F) -> Option <B> where Self: Sized , F: FnMut (Self:: Item ) -> Option <B> { ... } fn try_find <R>( &mut self, f: impl FnMut (&Self:: Item ) -> R, ) -> <<R as Try >:: Residual as Residual < Option <Self:: Item >>>:: TryType where Self: Sized , R: Try <Output = bool >, <R as Try >:: Residual : Residual < Option <Self:: Item >> { ... } fn position <P>(&mut self, predicate: P) -> Option < usize > where Self: Sized , P: FnMut (Self:: Item ) -> bool { ... } fn rposition <P>(&mut self, predicate: P) -> Option < usize > where P: FnMut (Self:: Item ) -> bool , Self: Sized + ExactSizeIterator + DoubleEndedIterator { ... } fn max (self) -> Option <Self:: Item > where Self: Sized , Self:: Item : Ord { ... } fn min (self) -> Option <Self:: Item > where Self: Sized , Self:: Item : Ord { ... } fn max_by_key <B, F>(self, f: F) -> Option <Self:: Item > where B: Ord , Self: Sized , F: FnMut (&Self:: Item ) -> B { ... } fn max_by <F>(self, compare: F) -> Option <Self:: Item > where Self: Sized , F: FnMut (&Self:: Item , &Self:: Item ) -> Ordering { ... } fn min_by_key <B, F>(self, f: F) -> Option <Self:: Item > where B: Ord , Self: Sized , F: FnMut (&Self:: Item ) -> B { ... } fn min_by <F>(self, compare: F) -> Option <Self:: Item > where Self: Sized , F: FnMut (&Self:: Item , &Self:: Item ) -> Ordering { ... } fn rev (self) -> Rev <Self> ⓘ where Self: Sized + DoubleEndedIterator { ... } fn unzip <A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend <A>, FromB: Default + Extend <B>, Self: Sized + Iterator <Item = (A, B) > { ... } fn copied <'a, T>(self) -> Copied <Self> ⓘ where T: Copy + 'a, Self: Sized + Iterator <Item = &'a T > { ... } fn cloned <'a, T>(self) -> Cloned <Self> ⓘ where T: Clone + 'a, Self: Sized + Iterator <Item = &'a T > { ... } fn cycle (self) -> Cycle <Self> ⓘ where Self: Sized + Clone { ... } fn array_chunks <const N: usize >(self) -> ArrayChunks <Self, N> ⓘ where Self: Sized { ... } fn sum <S>(self) -> S where Self: Sized , S: Sum <Self:: Item > { ... } fn product <P>(self) -> P where Self: Sized , P: Product <Self:: Item > { ... } fn cmp <I>(self, other: I) -> Ordering where I: IntoIterator <Item = Self:: Item >, Self:: Item : Ord , Self: Sized { ... } fn cmp_by <I, F>(self, other: I, cmp: F) -> Ordering where Self: Sized , I: IntoIterator , F: FnMut (Self:: Item , <I as IntoIterator >:: Item ) -> Ordering { ... } fn partial_cmp <I>(self, other: I) -> Option < Ordering > where I: IntoIterator , Self:: Item : PartialOrd <<I as IntoIterator >:: Item >, Self: Sized { ... } fn partial_cmp_by <I, F>(self, other: I, partial_cmp: F) -> Option < Ordering > where Self: Sized , I: IntoIterator , F: FnMut (Self:: Item , <I as IntoIterator >:: Item ) -> Option < Ordering > { ... } fn eq <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialEq <<I as IntoIterator >:: Item >, Self: Sized { ... } fn eq_by <I, F>(self, other: I, eq: F) -> bool where Self: Sized , I: IntoIterator , F: FnMut (Self:: Item , <I as IntoIterator >:: Item ) -> bool { ... } fn ne <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialEq <<I as IntoIterator >:: Item >, Self: Sized { ... } fn lt <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialOrd <<I as IntoIterator >:: Item >, Self: Sized { ... } fn le <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialOrd <<I as IntoIterator >:: Item >, Self: Sized { ... } fn gt <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialOrd <<I as IntoIterator >:: Item >, Self: Sized { ... } fn ge <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialOrd <<I as IntoIterator >:: Item >, Self: Sized { ... } fn is_sorted (self) -> bool where Self: Sized , Self:: Item : PartialOrd { ... } fn is_sorted_by <F>(self, compare: F) -> bool where Self: Sized , F: FnMut (&Self:: Item , &Self:: Item ) -> bool { ... } fn is_sorted_by_key <F, K>(self, f: F) -> bool where Self: Sized , F: FnMut (Self:: Item ) -> K, K: PartialOrd { ... } } Expand description A trait for dealing with iterators. This is the main iterator trait. For more about the concept of iterators generally, please see the module-level documentation . In particular, you may want to know how to implement Iterator . Required Associated Types § 1.0.0 · Source type Item The type of the elements being iterated over. Required Methods § 1.0.0 · Source fn next (&mut self) -> Option <Self:: Item > Advances the iterator and returns the next value. Returns None when iteration is finished. Individual iterator implementations may choose to resume iteration, and so calling next() again may or may not eventually start returning Some(Item) again at some point. § Examples let a = [ 1 , 2 , 3 ]; let mut iter = a.into_iter(); // A call to next() returns the next value... assert_eq! ( Some ( 1 ), iter.next()); assert_eq! ( Some ( 2 ), iter.next()); assert_eq! ( Some ( 3 ), iter.next()); // ... and then None once it's over. assert_eq! ( None , iter.next()); // More calls may or may not return `None`. Here, they always will. assert_eq! ( None , iter.next()); assert_eq! ( None , iter.next()); Provided Methods § Source fn next_chunk <const N: usize >( &mut self, ) -> Result <[Self:: Item ; N ], IntoIter <Self:: Item , N>> where Self: Sized , 🔬 This is a nightly-only experimental API. ( iter_next_chunk #98326 ) Advances the iterator and returns an array containing the next N values. If there are not enough elements to fill the array then Err is returned containing an iterator over the remaining elements. § Examples Basic usage: #![feature(iter_next_chunk)] let mut iter = "lorem" .chars(); assert_eq! (iter.next_chunk().unwrap(), [ 'l' , 'o' ]); // N is inferred as 2 assert_eq! (iter.next_chunk().unwrap(), [ 'r' , 'e' , 'm' ]); // N is inferred as 3 assert_eq! (iter.next_chunk::< 4 >().unwrap_err().as_slice(), & []); // N is explicitly 4 Split a string and get the first three items. #![feature(iter_next_chunk)] let quote = "not all those who wander are lost" ; let [first, second, third] = quote.split_whitespace().next_chunk().unwrap(); assert_eq! (first, "not" ); assert_eq! (second, "all" ); assert_eq! (third, "those" ); 1.0.0 · Source fn size_hint (&self) -> ( usize , Option < usize >) Returns the bounds on the remaining length of the iterator. Specifically, size_hint() returns a tuple where the first element is the lower bound, and the second element is the upper bound. The second half of the tuple that is returned is an Option < usize > . A None here means that either there is no known upper bound, or the upper bound is larger than usize . § Implementation notes It is not enforced that an iterator implementation yields the declared number of elements. A buggy iterator may yield less than the lower bound or more than the upper bound of elements. size_hint() is primarily intended to be used for optimizations such as reserving space for the elements of the iterator, but must not be trusted to e.g., omit bounds checks in unsafe code. An incorrect implementation of size_hint() should not lead to memory safety violations. That said, the implementation should provide a correct estimation, because otherwise it would be a violation of the trait’s protocol. The default implementation returns (0, None ) which is correct for any iterator. § Examples Basic usage: let a = [ 1 , 2 , 3 ]; let mut iter = a.iter(); assert_eq! (( 3 , Some ( 3 )), iter.size_hint()); let _ = iter.next(); assert_eq! (( 2 , Some ( 2 )), iter.size_hint()); A more complex example: // The even numbers in the range of zero to nine. let iter = ( 0 .. 10 ).filter(|x| x % 2 == 0 ); // We might iterate from zero to ten times. Knowing that it's five // exactly wouldn't be possible without executing filter(). assert_eq! (( 0 , Some ( 10 )), iter.size_hint()); // Let's add five more numbers with chain() let iter = ( 0 .. 10 ).filter(|x| x % 2 == 0 ).chain( 15 .. 20 ); // now both bounds are increased by five assert_eq! (( 5 , Some ( 15 )), iter.size_hint()); Returning None for an upper bound: // an infinite iterator has no upper bound // and the maximum possible lower bound let iter = 0 ..; assert_eq! ((usize::MAX, None ), iter.size_hint()); 1.0.0 · Source fn count (self) -> usize where Self: Sized , Consumes the iterator, counting the number of iterations and returning it. This method will call next repeatedly until None is encountered, returning the number of times it saw Some . Note that next has to be called at least once even if the iterator does not have any elements. § Overflow Behavior The method does no guarding against overflows, so counting elements of an iterator with more than usize::MAX elements either produces the wrong result or panics. If overflow checks are enabled, a panic is guaranteed. § Panics This function might panic if the iterator has more than usize::MAX elements. § Examples let a = [ 1 , 2 , 3 ]; assert_eq! (a.iter().count(), 3 ); let a = [ 1 , 2 , 3 , 4 , 5 ]; assert_eq! (a.iter().count(), 5 ); 1.0.0 · Source fn last (self) -> Option <Self:: Item > where Self: Sized , Consumes the iterator, returning the last element. This method will evaluate the iterator until it returns None . While doing so, it keeps track of the current element. After None is returned, last() will then return the last element it saw. § Examples let a = [ 1 , 2 , 3 ]; assert_eq! (a.into_iter().last(), Some ( 3 )); let a = [ 1 , 2 , 3 , 4 , 5 ]; assert_eq! (a.into_iter().last(), Some ( 5 )); Source fn advance_by (&mut self, n: usize ) -> Result < () , NonZero < usize >> 🔬 This is a nightly-only experimental API. ( iter_advance_by #77404 ) Advances the iterator by n elements. This method will eagerly skip n elements by calling next up to n times until None is encountered. advance_by(n) will return Ok(()) if the iterator successfully advances by n elements, or a Err(NonZero<usize>) with value k if None is encountered, where k is remaining number of steps that could not be advanced because the iterator ran out. If self is empty and n is non-zero, then this returns Err(n) . Otherwise, k is always less than n . Calling advance_by(0) can do meaningful work, for example Flatten can advance its outer iterator until it finds an inner iterator that is not empty, which then often allows it to return a more accurate size_hint() than in its initial state. § Examples #![feature(iter_advance_by)] use std::num::NonZero; let a = [ 1 , 2 , 3 , 4 ]; let mut iter = a.into_iter(); assert_eq! (iter.advance_by( 2 ), Ok (())); assert_eq! (iter.next(), Some ( 3 )); assert_eq! (iter.advance_by( 0 ), Ok (())); assert_eq! (iter.advance_by( 100 ), Err (NonZero::new( 99 ).unwrap())); // only `4` was skipped 1.0.0 · Source fn nth (&mut self, n: usize ) -> Option <Self:: Item > Returns the n th element of the iterator. Like most indexing operations, the count starts from zero, so nth(0) returns the first value, nth(1) the second, and so on. Note that all preceding elements, as well as the returned element, will be consumed from the iterator. That means that the preceding elements will be discarded, and also that calling nth(0) multiple times on the same iterator will return different elements. nth() will return None if n is greater than or equal to the length of the iterator. § Examples Basic usage: let a = [ 1 , 2 , 3 ]; assert_eq! (a.into_iter().nth( 1 ), Some ( 2 )); Calling nth() multiple times doesn’t rewind the iterator: let a = [ 1 , 2 , 3 ]; let mut iter = a.into_iter(); assert_eq! (iter.nth( 1 ), Some ( 2 )); assert_eq! (iter.nth( 1 ), None ); Returning None if there are less than n + 1 elements: let a = [ 1 , 2 , 3 ]; assert_eq! (a.into_iter().nth( 10 ), None ); 1.28.0 · Source fn step_by (self, step: usize ) -> StepBy <Self> ⓘ where Self: Sized , Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Note 1: The first element of the iterator will always be returned, regardless of the step given. Note 2: The time at which ignored elements are pulled is not fixed. StepBy behaves like the sequence self.next() , self.nth(step-1) , self.nth(step-1) , …, but is also free to behave like the sequence advance_n_and_return_first(&mut self, step) , advance_n_and_return_first(&mut self, step) , … Which way is used may change for some iterators for performance reasons. The second way will advance the iterator earlier and may consume more items. advance_n_and_return_first is the equivalent of: fn advance_n_and_return_first<I>(iter: &mut I, n: usize) -> Option <I::Item> where I: Iterator, { let next = iter.next(); if n > 1 { iter.nth(n - 2 ); } next } § Panics The method will panic if the given step is 0 . § Examples let a = [ 0 , 1 , 2 , 3 , 4 , 5 ]; let mut iter = a.into_iter().step_by( 2 ); assert_eq! (iter.next(), Some ( 0 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), Some ( 4 )); assert_eq! (iter.next(), None ); 1.0.0 · Source fn chain <U>(self, other: U) -> Chain <Self, <U as IntoIterator >:: IntoIter > ⓘ where Self: Sized , U: IntoIterator <Item = Self:: Item >, Takes two iterators and creates a new iterator over both in sequence. chain() will return a new iterator which will first iterate over values from the first iterator and then over values from the second iterator. In other words, it links two iterators together, in a chain. 🔗 once is commonly used to adapt a single value into a chain of other kinds of iteration. § Examples Basic usage: let s1 = "abc" .chars(); let s2 = "def" .chars(); let mut iter = s1.chain(s2); assert_eq! (iter.next(), Some ( 'a' )); assert_eq! (iter.next(), Some ( 'b' )); assert_eq! (iter.next(), Some ( 'c' )); assert_eq! (iter.next(), Some ( 'd' )); assert_eq! (iter.next(), Some ( 'e' )); assert_eq! (iter.next(), Some ( 'f' )); assert_eq! (iter.next(), None ); Since the argument to chain() uses IntoIterator , we can pass anything that can be converted into an Iterator , not just an Iterator itself. For example, arrays ( [T] ) implement IntoIterator , and so can be passed to chain() directly: let a1 = [ 1 , 2 , 3 ]; let a2 = [ 4 , 5 , 6 ]; let mut iter = a1.into_iter().chain(a2); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), Some ( 3 )); assert_eq! (iter.next(), Some ( 4 )); assert_eq! (iter.next(), Some ( 5 )); assert_eq! (iter.next(), Some ( 6 )); assert_eq! (iter.next(), None ); If you work with Windows API, you may wish to convert OsStr to Vec<u16> : #[cfg(windows)] fn os_str_to_utf16(s: & std::ffi::OsStr) -> Vec<u16> { use std::os::windows::ffi::OsStrExt; s.encode_wide().chain(std::iter::once( 0 )).collect() } 1.0.0 · Source fn zip <U>(self, other: U) -> Zip <Self, <U as IntoIterator >:: IntoIter > ⓘ where Self: Sized , U: IntoIterator , ‘Zips up’ two iterators into a single iterator of pairs. zip() returns a new iterator that will iterate over two other iterators, returning a tuple where the first element comes from the first iterator, and the second element comes from the second iterator. In other words, it zips two iterators together, into a single one. If either iterator returns None , next from the zipped iterator will return None . If the zipped iterator has no more elements to return then each further attempt to advance it will first try to advance the first iterator at most one time and if it still yielded an item try to advance the second iterator at most one time. To ‘undo’ the result of zipping up two iterators, see unzip . § Examples Basic usage: let s1 = "abc" .chars(); let s2 = "def" .chars(); let mut iter = s1.zip(s2); assert_eq! (iter.next(), Some (( 'a' , 'd' ))); assert_eq! (iter.next(), Some (( 'b' , 'e' ))); assert_eq! (iter.next(), Some (( 'c' , 'f' ))); assert_eq! (iter.next(), None ); Since the argument to zip() uses IntoIterator , we can pass anything that can be converted into an Iterator , not just an Iterator itself. For example, arrays ( [T] ) implement IntoIterator , and so can be passed to zip() directly: let a1 = [ 1 , 2 , 3 ]; let a2 = [ 4 , 5 , 6 ]; let mut iter = a1.into_iter().zip(a2); assert_eq! (iter.next(), Some (( 1 , 4 ))); assert_eq! (iter.next(), Some (( 2 , 5 ))); assert_eq! (iter.next(), Some (( 3 , 6 ))); assert_eq! (iter.next(), None ); zip() is often used to zip an infinite iterator to a finite one. This works because the finite iterator will eventually return None , ending the zipper. Zipping with (0..) can look a lot like enumerate : let enumerate: Vec< _ > = "foo" .chars().enumerate().collect(); let zipper: Vec< _ > = ( 0 ..).zip( "foo" .chars()).collect(); assert_eq! (( 0 , 'f' ), enumerate[ 0 ]); assert_eq! (( 0 , 'f' ), zipper[ 0 ]); assert_eq! (( 1 , 'o' ), enumerate[ 1 ]); assert_eq! (( 1 , 'o' ), zipper[ 1 ]); assert_eq! (( 2 , 'o' ), enumerate[ 2 ]); assert_eq! (( 2 , 'o' ), zipper[ 2 ]); If both iterators have roughly equivalent syntax, it may be more readable to use zip : use std::iter::zip; let a = [ 1 , 2 , 3 ]; let b = [ 2 , 3 , 4 ]; let mut zipped = zip( a.into_iter().map(|x| x * 2 ).skip( 1 ), b.into_iter().map(|x| x * 2 ).skip( 1 ), ); assert_eq! (zipped.next(), Some (( 4 , 6 ))); assert_eq! (zipped.next(), Some (( 6 , 8 ))); assert_eq! (zipped.next(), None ); compared to: let mut zipped = a .into_iter() .map(|x| x * 2 ) .skip( 1 ) .zip(b.into_iter().map(|x| x * 2 ).skip( 1 )); Source fn intersperse (self, separator: Self:: Item ) -> Intersperse <Self> ⓘ where Self: Sized , Self:: Item : Clone , 🔬 This is a nightly-only experimental API. ( iter_intersperse #79524 ) Creates a new iterator which places a copy of separator between adjacent items of the original iterator. In case separator does not implement Clone or needs to be computed every time, use intersperse_with . § Examples Basic usage: #![feature(iter_intersperse)] let mut a = [ 0 , 1 , 2 ].into_iter().intersperse( 100 ); assert_eq! (a.next(), Some ( 0 )); // The first element from `a`. assert_eq! (a.next(), Some ( 100 )); // The separator. assert_eq! (a.next(), Some ( 1 )); // The next element from `a`. assert_eq! (a.next(), Some ( 100 )); // The separator. assert_eq! (a.next(), Some ( 2 )); // The last element from `a`. assert_eq! (a.next(), None ); // The iterator is finished. intersperse can be very useful to join an iterator’s items using a common element: #![feature(iter_intersperse)] let words = [ "Hello" , "World" , "!" ]; let hello: String = words.into_iter().intersperse( " " ).collect(); assert_eq! (hello, "Hello World !" ); Source fn intersperse_with <G>(self, separator: G) -> IntersperseWith <Self, G> ⓘ where Self: Sized , G: FnMut () -> Self:: Item , 🔬 This is a nightly-only experimental API. ( iter_intersperse #79524 ) Creates a new iterator which places an item generated by separator between adjacent items of the original iterator. The closure will be called exactly once each time an item is placed between two adjacent items from the underlying iterator; specifically, the closure is not called if the underlying iterator yields less than two items and after the last item is yielded. If the iterator’s item implements Clone , it may be easier to use intersperse . § Examples Basic usage: #![feature(iter_intersperse)] #[derive(PartialEq, Debug)] struct NotClone(usize); let v = [NotClone( 0 ), NotClone( 1 ), NotClone( 2 )]; let mut it = v.into_iter().intersperse_with(|| NotClone( 99 )); assert_eq! (it.next(), Some (NotClone( 0 ))); // The first element from `v`. assert_eq! (it.next(), Some (NotClone( 99 ))); // The separator. assert_eq! (it.next(), Some (NotClone( 1 ))); // The next element from `v`. assert_eq! (it.next(), Some (NotClone( 99 ))); // The separator. assert_eq! (it.next(), Some (NotClone( 2 ))); // The last element from `v`. assert_eq! (it.next(), None ); // The iterator is finished. intersperse_with can be used in situations where the separator needs to be computed: #![feature(iter_intersperse)] let src = [ "Hello" , "to" , "all" , "people" , "!!" ].iter().copied(); // The closure mutably borrows its context to generate an item. let mut happy_emojis = [ " ❤️ " , " 😀 " ].into_iter(); let separator = || happy_emojis.next().unwrap_or( " 🦀 " ); let result = src.intersperse_with(separator).collect::<String>(); assert_eq! (result, "Hello ❤️ to 😀 all 🦀 people 🦀 !!" ); 1.0.0 · Source fn map <B, F>(self, f: F) -> Map <Self, F> ⓘ where Self: Sized , F: FnMut (Self:: Item ) -> B, Takes a closure and creates an iterator which calls that closure on each element. map() transforms one iterator into another, by means of its argument: something that implements FnMut . It produces a new iterator which calls this closure on each element of the original iterator. If you are good at thinking in types, you can think of map() like this: If you have an iterator that gives you elements of some type A , and you want an iterator of some other type B , you can use map() , passing a closure that takes an A and returns a B . map() is conceptually similar to a for loop. However, as map() is lazy, it is best used when you’re already working with other iterators. If you’re doing some sort of looping for a side effect, it’s considered more idiomatic to use for than map() . § Examples Basic usage: let a = [ 1 , 2 , 3 ]; let mut iter = a.iter().map(|x| 2 * x); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), Some ( 4 )); assert_eq! (iter.next(), Some ( 6 )); assert_eq! (iter.next(), None ); If you’re doing some sort of side effect, prefer for to map() : // don't do this: ( 0 .. 5 ).map(|x| println! ( "{x}" )); // it won't even execute, as it is lazy. Rust will warn you about this. // Instead, use a for-loop: for x in 0 .. 5 { println! ( "{x}" ); } 1.21.0 · Source fn for_each <F>(self, f: F) where Self: Sized , F: FnMut (Self:: Item ), Calls a closure on each element of an iterator. This is equivalent to using a for loop on the iterator, although break and continue are not possible from a closure. It’s generally more idiomatic to use a for loop, but for_each may be more legible when processing items at the end of longer iterator chains. In some cases for_each may also be faster than a loop, because it will use internal iteration on adapters like Chain . § Examples Basic usage: use std::sync::mpsc::channel; let (tx, rx) = channel(); ( 0 .. 5 ).map(|x| x * 2 + 1 ) .for_each( move |x| tx.send(x).unwrap()); let v: Vec< _ > = rx.iter().collect(); assert_eq! (v, vec! [ 1 , 3 , 5 , 7 , 9 ]); For such a small example, a for loop may be cleaner, but for_each might be preferable to keep a functional style with longer iterators: ( 0 .. 5 ).flat_map(|x| (x * 100 )..(x * 110 )) .enumerate() .filter(| & (i, x)| (i + x) % 3 == 0 ) .for_each(|(i, x)| println! ( "{i}:{x}" )); 1.0.0 · Source fn filter <P>(self, predicate: P) -> Filter <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool , Creates an iterator which uses a closure to determine if an element should be yielded. Given an element the closure must return true or false . The returned iterator will yield only the elements for which the closure returns true . § Examples Basic usage: let a = [ 0i32 , 1 , 2 ]; let mut iter = a.into_iter().filter(|x| x.is_positive()); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), None ); Because the closure passed to filter() takes a reference, and many iterators iterate over references, this leads to a possibly confusing situation, where the type of the closure is a double reference: let s = & [ 0 , 1 , 2 ]; let mut iter = s.iter().filter(|x| ** x > 1 ); // needs two *s! assert_eq! (iter.next(), Some ( & 2 )); assert_eq! (iter.next(), None ); It’s common to instead use destructuring on the argument to strip away one: let s = & [ 0 , 1 , 2 ]; let mut iter = s.iter().filter(| & x| * x > 1 ); // both & and * assert_eq! (iter.next(), Some ( & 2 )); assert_eq! (iter.next(), None ); or both: let s = & [ 0 , 1 , 2 ]; let mut iter = s.iter().filter(|&&x| x > 1 ); // two &s assert_eq! (iter.next(), Some ( & 2 )); assert_eq! (iter.next(), None ); of these layers. Note that iter.filter(f).next() is equivalent to iter.find(f) . 1.0.0 · Source fn filter_map <B, F>(self, f: F) -> FilterMap <Self, F> ⓘ where Self: Sized , F: FnMut (Self:: Item ) -> Option <B>, Creates an iterator that both filters and maps. The returned iterator yields only the value s for which the supplied closure returns Some(value) . filter_map can be used to make chains of filter and map more concise. The example below shows how a map().filter().map() can be shortened to a single call to filter_map . § Examples Basic usage: let a = [ "1" , "two" , "NaN" , "four" , "5" ]; let mut iter = a.iter().filter_map(|s| s.parse().ok()); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 5 )); assert_eq! (iter.next(), None ); Here’s the same example, but with filter and map : let a = [ "1" , "two" , "NaN" , "four" , "5" ]; let mut iter = a.iter().map(|s| s.parse()).filter(|s| s.is_ok()).map(|s| s.unwrap()); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 5 )); assert_eq! (iter.next(), None ); 1.0.0 · Source fn enumerate (self) -> Enumerate <Self> ⓘ where Self: Sized , Creates an iterator which gives the current iteration count as well as the next value. The iterator returned yields pairs (i, val) , where i is the current index of iteration and val is the value returned by the iterator. enumerate() keeps its count as a usize . If you want to count by a different sized integer, the zip function provides similar functionality. § Overflow Behavior The method does no guarding against overflows, so enumerating more than usize::MAX elements either produces the wrong result or panics. If overflow checks are enabled, a panic is guaranteed. § Panics The returned iterator might panic if the to-be-returned index would overflow a usize . § Examples let a = [ 'a' , 'b' , 'c' ]; let mut iter = a.into_iter().enumerate(); assert_eq! (iter.next(), Some (( 0 , 'a' ))); assert_eq! (iter.next(), Some (( 1 , 'b' ))); assert_eq! (iter.next(), Some (( 2 , 'c' ))); assert_eq! (iter.next(), None ); 1.0.0 · Source fn peekable (self) -> Peekable <Self> ⓘ where Self: Sized , Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information. Note that the underlying iterator is still advanced when peek or peek_mut are called for the first time: In order to retrieve the next element, next is called on the underlying iterator, hence any side effects (i.e. anything other than fetching the next value) of the next method will occur. § Examples Basic usage: let xs = [ 1 , 2 , 3 ]; let mut iter = xs.into_iter().peekable(); // peek() lets us see into the future assert_eq! (iter.peek(), Some ( & 1 )); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); // we can peek() multiple times, the iterator won't advance assert_eq! (iter.peek(), Some ( & 3 )); assert_eq! (iter.peek(), Some ( & 3 )); assert_eq! (iter.next(), Some ( 3 )); // after the iterator is finished, so is peek() assert_eq! (iter.peek(), None ); assert_eq! (iter.next(), None ); Using peek_mut to mutate the next item without advancing the iterator: let xs = [ 1 , 2 , 3 ]; let mut iter = xs.into_iter().peekable(); // `peek_mut()` lets us see into the future assert_eq! (iter.peek_mut(), Some ( &mut 1 )); assert_eq! (iter.peek_mut(), Some ( &mut 1 )); assert_eq! (iter.next(), Some ( 1 )); if let Some (p) = iter.peek_mut() { assert_eq! ( * p, 2 ); // put a value into the iterator * p = 1000 ; } // The value reappears as the iterator continues assert_eq! (iter.collect::<Vec< _ >>(), vec! [ 1000 , 3 ]); 1.0.0 · Source fn skip_while <P>(self, predicate: P) -> SkipWhile <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool , Creates an iterator that skip s elements based on a predicate. skip_while() takes a closure as an argument. It will call this closure on each element of the iterator, and ignore elements until it returns false . After false is returned, skip_while() ’s job is over, and the rest of the elements are yielded. § Examples Basic usage: let a = [- 1i32 , 0 , 1 ]; let mut iter = a.into_iter().skip_while(|x| x.is_negative()); assert_eq! (iter.next(), Some ( 0 )); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), None ); Because the closure passed to skip_while() takes a reference, and many iterators iterate over references, this leads to a possibly confusing situation, where the type of the closure argument is a double reference: let s = & [- 1 , 0 , 1 ]; let mut iter = s.iter().skip_while(|x| ** x < 0 ); // need two *s! assert_eq! (iter.next(), Some ( & 0 )); assert_eq! (iter.next(), Some ( & 1 )); assert_eq! (iter.next(), None ); Stopping after an initial false : let a = [- 1 , 0 , 1 , - 2 ]; let mut iter = a.into_iter().skip_while(| & x| x < 0 ); assert_eq! (iter.next(), Some ( 0 )); assert_eq! (iter.next(), Some ( 1 )); // while this would have been false, since we already got a false, // skip_while() isn't used any more assert_eq! (iter.next(), Some (- 2 )); assert_eq! (iter.next(), None ); 1.0.0 · Source fn take_while <P>(self, predicate: P) -> TakeWhile <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool , Creates an iterator that yields elements based on a predicate. take_while() takes a closure as an argument. It will call this closure on each element of the iterator, and yield elements while it returns true . After false is returned, take_while() ’s job is over, and the rest of the elements are ignored. § Examples Basic usage: let a = [- 1i32 , 0 , 1 ]; let mut iter = a.into_iter().take_while(|x| x.is_negative()); assert_eq! (iter.next(), Some (- 1 )); assert_eq! (iter.next(), None ); Because the closure passed to take_while() takes a reference, and many iterators iterate over references, this leads to a possibly confusing situation, where the type of the closure is a double reference: let s = & [- 1 , 0 , 1 ]; let mut iter = s.iter().take_while(|x| ** x < 0 ); // need two *s! assert_eq! (iter.next(), Some ( & - 1 )); assert_eq! (iter.next(), None ); Stopping after an initial false : let a = [- 1 , 0 , 1 , - 2 ]; let mut iter = a.into_iter().take_while(| & x| x < 0 ); assert_eq! (iter.next(), Some (- 1 )); // We have more elements that are less than zero, but since we already // got a false, take_while() ignores the remaining elements. assert_eq! (iter.next(), None ); Because take_while() needs to look at the value in order to see if it should be included or not, consuming iterators will see that it is removed: let a = [ 1 , 2 , 3 , 4 ]; let mut iter = a.into_iter(); let result: Vec<i32> = iter.by_ref().take_while(| & n| n != 3 ).collect(); assert_eq! (result, [ 1 , 2 ]); let result: Vec<i32> = iter.collect(); assert_eq! (result, [ 4 ]); The 3 is no longer there, because it was consumed in order to see if the iteration should stop, but wasn’t placed back into the iterator. 1.57.0 · Source fn map_while <B, P>(self, predicate: P) -> MapWhile <Self, P> ⓘ where Self: Sized , P: FnMut (Self:: Item ) -> Option <B>, Creates an iterator that both yields elements based on a predicate and maps. map_while() takes a closure as an argument. It will call this closure on each element of the iterator, and yield elements while it returns Some(_) . § Examples Basic usage: let a = [- 1i32 , 4 , 0 , 1 ]; let mut iter = a.into_iter().map_while(|x| 16i32 .checked_div(x)); assert_eq! (iter.next(), Some (- 16 )); assert_eq! (iter.next(), Some ( 4 )); assert_eq! (iter.next(), None ); Here’s the same example, but with take_while and map : let a = [- 1i32 , 4 , 0 , 1 ]; let mut iter = a.into_iter() .map(|x| 16i32 .checked_div(x)) .take_while(|x| x.is_some()) .map(|x| x.unwrap()); assert_eq! (iter.next(), Some (- 16 )); assert_eq! (iter.next(), Some ( 4 )); assert_eq! (iter.next(), None ); Stopping after an initial None : let a = [ 0 , 1 , 2 , - 3 , 4 , 5 , - 6 ]; let iter = a.into_iter().map_while(|x| u32::try_from(x).ok()); let vec: Vec< _ > = iter.collect(); // We have more elements that could fit in u32 (such as 4, 5), but `map_while` returned `None` for `-3` // (as the `predicate` returned `None`) and `collect` stops at the first `None` encountered. assert_eq! (vec, [ 0 , 1 , 2 ]); Because map_while() needs to look at the value in order to see if it should be included or not, consuming iterators will see that it is removed: let a = [ 1 , 2 , - 3 , 4 ]; let mut iter = a.into_iter(); let result: Vec<u32> = iter.by_ref() .map_while(|n| u32::try_from(n).ok()) .collect(); assert_eq! (result, [ 1 , 2 ]); let result: Vec<i32> = iter.collect(); assert_eq! (result, [ 4 ]); The -3 is no longer there, because it was consumed in order to see if the iteration should stop, but wasn’t placed back into the iterator. Note that unlike take_while this iterator is not fused. It is also not specified what this iterator returns after the first None is returned. If you need a fused iterator, use fuse . 1.0.0 · Source fn skip (self, n: usize ) -> Skip <Self> ⓘ where Self: Sized , Creates an iterator that skips the first n elements. skip(n) skips elements until n elements are skipped or the end of the iterator is reached (whichever happens first). After that, all the remaining elements are yielded. In particular, if the original iterator is too short, then the returned iterator is empty. Rather than overriding this method directly, instead override the nth method. § Examples let a = [ 1 , 2 , 3 ]; let mut iter = a.into_iter().skip( 2 ); assert_eq! (iter.next(), Some ( 3 )); assert_eq! (iter.next(), None ); 1.0.0 · Source fn take (self, n: usize ) -> Take <Self> ⓘ where Self: Sized , Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner. take(n) yields elements until n elements are yielded or the end of the iterator is reached (whichever happens first). The returned iterator is a prefix of length n if the original iterator contains at least n elements, otherwise it contains all of the (fewer than n ) elements of the original iterator. § Examples Basic usage: let a = [ 1 , 2 , 3 ]; let mut iter = a.into_iter().take( 2 ); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), None ); take() is often used with an infinite iterator, to make it finite: let mut iter = ( 0 ..).take( 3 ); assert_eq! (iter.next(), Some ( 0 )); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), None ); If less than n elements are available, take will limit itself to the size of the underlying iterator: let v = [ 1 , 2 ]; let mut iter = v.into_iter().take( 5 ); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), None ); Use by_ref to take from the iterator without consuming it, and then continue using the original iterator: let mut words = [ "hello" , "world" , "of" , "Rust" ].into_iter(); // Take the first two words. let hello_world: Vec< _ > = words.by_ref().take( 2 ).collect(); assert_eq! (hello_world, vec! [ "hello" , "world" ]); // Collect the rest of the words. // We can only do this because we used `by_ref` earlier. let of_rust: Vec< _ > = words.collect(); assert_eq! (of_rust, vec! [ "of" , "Rust" ]); 1.0.0 · Source fn scan <St, B, F>(self, initial_state: St, f: F) -> Scan <Self, St, F> ⓘ where Self: Sized , F: FnMut ( &mut St , Self:: Item ) -> Option <B>, An iterator adapter which, like fold , holds internal state, but unlike fold , produces a new iterator. scan() takes two arguments: an initial value which seeds the internal state, and a closure with two arguments, the first being a mutable reference to the internal state and the second an iterator element. The closure can assign to the internal state to share state between iterations. On iteration, the closure will be applied to each element of the iterator and the return value from the closure, an Option , is returned by the next method. Thus the closure can return Some(value) to yield value , or None to end the iteration. § Examples let a = [ 1 , 2 , 3 , 4 ]; let mut iter = a.into_iter().scan( 1 , |state, x| { // each iteration, we'll multiply the state by the element ... * state = * state * x; // ... and terminate if the state exceeds 6 if * state > 6 { return None ; } // ... else yield the negation of the state Some (- * state) }); assert_eq! (iter.next(), Some (- 1 )); assert_eq! (iter.next(), Some (- 2 )); assert_eq! (iter.next(), Some (- 6 )); assert_eq! (iter.next(), None ); 1.0.0 · Source fn flat_map <U, F>(self, f: F) -> FlatMap <Self, U, F> ⓘ where Self: Sized , U: IntoIterator , F: FnMut (Self:: Item ) -> U, Creates an iterator that works like map, but flattens nested structure. The map adapter is very useful, but only when the closure argument produces values. If it produces an iterator instead, there’s an extra layer of indirection. flat_map() will remove this extra layer on its own. You can think of flat_map(f) as the semantic equivalent of map ping, and then flatten ing as in map(f).flatten() . Another way of thinking about flat_map() : map ’s closure returns one item for each element, and flat_map() ’s closure returns an iterator for each element. § Examples let words = [ "alpha" , "beta" , "gamma" ]; // chars() returns an iterator let merged: String = words.iter() .flat_map(|s| s.chars()) .collect(); assert_eq! (merged, "alphabetagamma" ); 1.29.0 · Source fn flatten (self) -> Flatten <Self> ⓘ where Self: Sized , Self:: Item : IntoIterator , Creates an iterator that flattens nested structure. This is useful when you have an iterator of iterators or an iterator of things that can be turned into iterators and you want to remove one level of indirection. § Examples Basic usage: let data = vec! [ vec! [ 1 , 2 , 3 , 4 ], vec! [ 5 , 6 ]]; let flattened: Vec< _ > = data.into_iter().flatten().collect(); assert_eq! (flattened, [ 1 , 2 , 3 , 4 , 5 , 6 ]); Mapping and then flattening: let words = [ "alpha" , "beta" , "gamma" ]; // chars() returns an iterator let merged: String = words.iter() .map(|s| s.chars()) .flatten() .collect(); assert_eq! (merged, "alphabetagamma" ); You can also rewrite this in terms of flat_map() , which is preferable in this case since it conveys intent more clearly: let words = [ "alpha" , "beta" , "gamma" ]; // chars() returns an iterator let merged: String = words.iter() .flat_map(|s| s.chars()) .collect(); assert_eq! (merged, "alphabetagamma" ); Flattening works on any IntoIterator type, including Option and Result : let options = vec! [ Some ( 123 ), Some ( 321 ), None , Some ( 231 )]; let flattened_options: Vec< _ > = options.into_iter().flatten().collect(); assert_eq! (flattened_options, [ 123 , 321 , 231 ]); let results = vec! [ Ok ( 123 ), Ok ( 321 ), Err ( 456 ), Ok ( 231 )]; let flattened_results: Vec< _ > = results.into_iter().flatten().collect(); assert_eq! (flattened_results, [ 123 , 321 , 231 ]); Flattening only removes one level of nesting at a time: let d3 = [[[ 1 , 2 ], [ 3 , 4 ]], [[ 5 , 6 ], [ 7 , 8 ]]]; let d2: Vec< _ > = d3.into_iter().flatten().collect(); assert_eq! (d2, [[ 1 , 2 ], [ 3 , 4 ], [ 5 , 6 ], [ 7 , 8 ]]); let d1: Vec< _ > = d3.into_iter().flatten().flatten().collect(); assert_eq! (d1, [ 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 ]); Here we see that flatten() does not perform a “deep” flatten. Instead, only one level of nesting is removed. That is, if you flatten() a three-dimensional array, the result will be two-dimensional and not one-dimensional. To get a one-dimensional structure, you have to flatten() again. Source fn map_windows <F, R, const N: usize >(self, f: F) -> MapWindows <Self, F, N> ⓘ where Self: Sized , F: FnMut (&[Self:: Item ; N ]) -> R, 🔬 This is a nightly-only experimental API. ( iter_map_windows #87155 ) Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f . Like slice::windows() , the windows during mapping overlap as well. In the following example, the closure is called three times with the arguments &['a', 'b'] , &['b', 'c'] and &['c', 'd'] respectively. #![feature(iter_map_windows)] let strings = "abcd" .chars() .map_windows(|[x, y]| format! ( "{}+{}" , x, y)) .collect::<Vec<String>>(); assert_eq! (strings, vec! [ "a+b" , "b+c" , "c+d" ]); Note that the const parameter N is usually inferred by the destructured argument in the closure. The returned iterator yields 𝑘 − N + 1 items (where 𝑘 is the number of items yielded by self ). If 𝑘 is less than N , this method yields an empty iterator. The returned iterator implements FusedIterator , because once self returns None , even if it returns a Some(T) again in the next iterations, we cannot put it into a contiguous array buffer, and thus the returned iterator should be fused. § Panics Panics if N is zero. This check will most probably get changed to a compile time error before this method gets stabilized. ⓘ #![feature(iter_map_windows)] let iter = std::iter::repeat( 0 ).map_windows(| & []| ()); § Examples Building the sums of neighboring numbers. #![feature(iter_map_windows)] let mut it = [ 1 , 3 , 8 , 1 ].iter().map_windows(| & [a, b]| a + b); assert_eq! (it.next(), Some ( 4 )); // 1 + 3 assert_eq! (it.next(), Some ( 11 )); // 3 + 8 assert_eq! (it.next(), Some ( 9 )); // 8 + 1 assert_eq! (it.next(), None ); Since the elements in the following example implement Copy , we can just copy the array and get an iterator over the windows. #![feature(iter_map_windows)] let mut it = "ferris" .chars().map_windows(|w: &a | 2026-01-13T09:29:14 |
https://www.linkedin.com/products/cloudflare-clouflare-load-balancing/ | Cloudflare Load Balancing | LinkedIn Skip to main content LinkedIn Cloudflare in Asan Expand search This button displays the currently selected search type. When expanded it provides a list of search options that will switch the search inputs to match the current selection. Jobs People Learning Clear text Clear text Clear text Clear text Clear text Join now Sign in Cloudflare Load Balancing Load Balancing Software by Cloudflare See who's skilled in this Add as skill Learn more Report this product About Overutilized or geographically distant servers add latency and degrade the user experience. Such mistakes can prove costly, resulting in lost customers, missed revenue, and reputational damage. With Cloudflare Load Balancing, you can improve application performance and availability by steering traffic away from unhealthy origin servers and dynamically distributing it to the most available and responsive server pools. Media Products media viewer No more previous content Cloudflare Load Balancing: Product Demo Cloudflare Load Balancing improves application performance and availability by steering traffic away from unhealthy servers and dynamically distributing the traffic to most available and responsive server pools, with no downtime. This video will highlight key features of the Cloudflare’s Load Balancing, including how to: Create a load balancer, (0:00 - 5:19) Manage health monitors and pools, and (5:20 - 6:01) Review load balancing analytics for insights. (6:02 - 7:49) No more next content Featured customers of Cloudflare Load Balancing Shopify Software Development 1,051,946 followers 株式会社トラストバンク IT Services and IT Consulting 134 followers orderbird IT Services and IT Consulting 5,084 followers SurePrep, part of Thomson Reuters Software Development 9,598 followers Similar products Progress Kemp LoadMaster Progress Kemp LoadMaster Load Balancing Software Radware Alteon Radware Alteon Load Balancing Software F5 F5 Load Balancing Software Fastly Load Balancer Fastly Load Balancer Load Balancing Software ADC Management ADC Management Load Balancing Software Kemp Kemp Load Balancing Software Sign in to see more Show more Show less Cloudflare products Argo Smart Routing Argo Smart Routing Network Management Software Cloudflare DDoS Protection Cloudflare DDoS Protection DDoS Protection Software Cloudflare DNS Cloudflare DNS Managed DNS Services Software Cloudflare Registrar Cloudflare Registrar Managed DNS Services Software Cloudflare Spectrum Cloudflare Spectrum DDoS Protection Software Cloudflare SSL / TLS Cloudflare SSL / TLS SSL Certificates Software Cloudflare WAF Cloudflare WAF Web Application Firewalls (WAF) Cloudflare Web Analytics Cloudflare Web Analytics Digital Analytics Software Cloudflare Workers Cloudflare Workers Server Virtualization Software Show more Show less LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines English (English) Language | 2026-01-13T09:29:14 |
https://www.linkedin.com/products/categories/server-virtualization-software | Best Server Virtualization Software | Products | LinkedIn Skip to main content LinkedIn Expand search This button displays the currently selected search type. When expanded it provides a list of search options that will switch the search inputs to match the current selection. Jobs People Learning Clear text Clear text Clear text Clear text Clear text Join now Sign in Clear text Used by Used by Information Technology Manager (7) Director of Information Technology (5) System Administrator (5) Virtualization Engineer (2) Information Technology Project Manager (2) See all products Find top products in Server Virtualization Software category Software used to emulate computer systems by partitioning resources from physical hosts. - Use hypervisors to run multiple virtual machines from a single physical server - Run platform-independent environments with optimized resource distribution - Consolidate server usage with shared memory and processing - Control independent instances of guest operating systems 40 results Cloudflare Workers Server Virtualization Software by Cloudflare Build your next application with Cloudflare Workers View product Cloud Virtual Machine (CVM) Server Virtualization Software by Tencent Tencent Cloud Virtual Machine offers stable, secure, resilient, and high-performance cloud computing service View product Proxmox Virtual Environment Server Virtualization Software by Proxmox Server Solutions Proxmox Virtual Environment (Proxmox VE) is is the leading open-source platform for all-inclusive enterprise virtualization. With the central web interface, you can easily run VMs and containers, manage software-defined storage and networking functionality, high-availability clustering, and multiple integrated out-of-the-box tools like backup/restore, live migration, replication, and the firewall. Enterprises use the powerful all-in-one solution to meet the core requirements of today’s modern data centers. View product SC//Fleet Manager Server Virtualization Software by Scale Computing We combined servers, storage, and virtualization into a single solution to make IT infrastructure easier for organizations of every size. Whether you have one IT administrator or hundreds, our award winning hyperconverged infrastructure eliminates complexity, lowers costs, and frees up management time. Using an appliance-based approach to virtualization, our Scale Computing Platform infrastructure solution is faster to deploy, easier to manage, and allows you to scale seamlessly as your organization grows. Even in an emergency with the failure of hardware components or entire appliances, Scale Computing infrastructure lets you keep critical apps – and your entire organization – up and running. View product SC//Platform Server Virtualization Software by Scale Computing With edge computing, you can run applications and process data outside centralized data centers, at the edge of your network closest to where that data is created and utilized. Centrally monitor and manage hundreds or thousands of distributed edge infrastructure deployments with few or no on-site IT personnel. The award winning Scale Computing brings on-premises edge computing with high availability and disaster recovery to remote locations at an affordable entry level cost. All edge appliances can be deployed quickly, managed locally or remotely, and can self-heal almost instantly. Enjoy affordable edge computing infrastructure that is reliable, easy to deploy, and easy to use. View product Find products trusted by professionals in your network See which products are used by connections in your network and those that share similar job titles Sign in to view full insights BTS Sybelle Virtualization Platform Server Virtualization Software by BTS Group BTS Sybelle Virtualization Platform is a system virtualization platform that optimizes the management of virtualization infrastructure for organizations of all sizes. With high availability, scalability, advanced networking, and flexible storage capabilities at its core, it delivers reliable, enterprise-grade performance tailored to modern IT environments. View product Oracle Virtualization Server Virtualization Software by Oracle Linux Backed by affordable enterprise support for hybrid environments, Oracle Virtualization reduces operation and support costs while increasing IT efficiency and agility—on premises and in the cloud. View product StarWind SAN & NAS Server Virtualization Software by StarWind Inc. StarWind SAN & NAS is a ready-to-go Linux-based virtual machine (VM) that allows you to repurpose existing hypervisor servers into shared storage. Leveraging the power of ZFS, Linux, and StarWind SDS, the solution can transform your hypervisor servers into HCL-certified high-performance storage appliance, shared storage, or backup target. Just deploy it on top of your hypervisor and you’re good to go. View product StarWind NVMe-oF Initiator Server Virtualization Software by StarWind Inc. StarWind NVMe-oF Initiator is the only software solution on the market that brings NVMe-oF connectivity over TCP and RoCE v2 networks to performance-demanding Windows applications. It’s certified with Windows and makes NVMe-oF available for SQL and M&E workloads without the need for fibre channel, rNICs on every host, or wait for a Windows-native solution to get released and mature. View product ZStack ZSphere Server Virtualization Server Virtualization Software by ZStack International ZStack ZSphere offers a VMware vSphere‑like user experience, ready to use without additional training. It scales from 1 to 1,000 servers per cluster and includes a three‑month free trial with full features and unlimited server deployment. Key Features and Capabilities: Compatibility & Reuse: Works with multi‑architecture CPUs and multi‑brand servers, protecting existing investments. SAN Storage Support: Integrates with proprietary storage for specific SLA scenarios. AI‑Ready: Supports GPU passthrough and vGPU for AI and high‑compute workloads. Cross‑Version Hot Upgrade: Maintains business continuity during system upgrades. High Performance: SR‑IOV delivers near bare‑metal networking for demanding I/O, with VM storage performance up to millions of IOPS. View product See more How it works Explore Discover the best product for your need from a growing catalog of 25,000 products and categories trusted by LinkedIn professionals Learn Evaluate new tools, explore trending products in your industry and see who in your network is skilled in the product Grow Join communities of product users to learn best practices, celebrate your progress and accelerate your career LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines English Language | 2026-01-13T09:29:14 |
http://creativecommons.org/licenses/by/4.0/legalcode.id#main-content-marker | Lisensi Lengkap - Atribusi 4.0 Internasional - Creative Commons Skip to content Creative Commons Menu Who We Are What We Do Licenses and Tools Blog Support Us Languages available Bahasa Indonesia Basque dansk Deutsch eesti English español français frysk Hrvatski italiano latviešu Lietuviškai Māori Nederlands norsk polski Português Română Slovensky Slovenščina suomi svenska Türkçe česky Ελληνικά Русский Українська العربيّة 日本語 简体中文 繁體中文 한국어 Search Donate Explore CC Global Network Join a global community working to strengthen the Commons Certificate Become an expert in creating and engaging with openly licensed materials Global Summit Attend our annual event, promoting the power of open licensing Chooser Get help choosing the appropriate license for your work Search Portal Find engines to search openly licensed material for creative and educational reuse Open Source Help us build products that maximize creativity and innovation Help us protect the commons. Make a tax deductible gift to fund our work. Donate today! Atribusi 4.0 Internasional CC BY 4.0 Lisensi Lengkap Atribusi 4.0 Internasional Bagian 1 – Definisi. Bagian 2 – Ruang Lingkup. Bagian 3 – Ketentuan Lisensi. Bagian 4 – Hak Basis Data Sui Generis. Bagian 5 – Pernyataan Jaminan dan Batasan Tanggung Jawab. Bagian 6 – Jangka Waktu dan Penghentian. Bagian 7 – Syarat dan Ketentuan Lain. Bagian 8 – Interpretasi. Canonical URL https://creativecommons.org/licenses/by/4.0/ Other formats Plain Text RDF/XML See the deed Versi 4.0 • See the errata page for any corrections and the date of change About the license and Creative Commons Creative Commons Corporation ("Creative Commons") bukanlah suatu firma hukum dan tidak memberikan layanan hukum. Distribusi lisensi publik Creative Commons tidak mengisyaratkan hubungan layaknya pengacara-klien maupun jenis hubungan lainnya. Creative Commons menyediakan lisensi dan informasi terkait berdasarkan ketentuan "apa adanya ( as-is )". Creative Commons tidak memberikan jaminan atas lisensi ini, setiap materi berlisensi di bawah syarat dan ketentuan lisensi, atau setiap informasi yang terkait. Creative Commons menolak semua tanggung jawab atas kerugian yang muncul karena penggunaannya. Menggunakan Lisensi Publik Creative Commons Lisensi publik Creative Commons memberikan rangkaian syarat dan ketentuan standar yang dapat digunakan oleh pencipta dan pemegang Hak-hak Serupa untuk menyebarluaskan ciptaan asli dan materi berhak cipta lainnya serta Hak-hak Serupa lainnya yang ditentukan dalam lisensi publik di bawah ini. Bagian pertimbangan di bawah ini hanya merupakan tambahan informasi, tidak mengikat, dan tidak menjadi bagian dari lisensi kami. Pertimbangan untuk pemberi lisensi Lisensi publik Creative Commons ditujukan untuk digunakan oleh setiap orang yang berhak memberikan izin kepada pengguna untuk menggunakan materi berhak cipta dengan cara-cara yang dibatasi oleh hak cipta dan Hak-hak Serupa. Lisensi kami tidak dapat dibatalkan. Pemberi lisensi wajib membaca dan memahami syarat dan ketentuan lisensi yang dipilih sebelum menggunakannya. Pemberi lisensi juga wajib memiliki izin penggunaan Hak-hak Serupa sebelum menggunakan lisensi kami sehingga pengguna dapat menggunakan kembali materi ini sebagaimana seharusnya. Pemberi lisensi wajib menandai setiap materi yang tidak menggunakan lisensi ini. Hal ini termasuk materi yang menggunakan lisensi Creative Commons lainnya, atau materi yang digunakan di bawah pengecualian atau pembatasan hak cipta. Pertimbangan lebih lanjut untuk pemberi lisensi. Pertimbangan untuk pengguna Dengan menggunakan salah satu lisensi kami, pemberi lisensi memberikan izin kepada pengguna untuk menggunakan materi berlisensi di bawah syarat dan ketentuan tertentu. Apabila izin pemberi lisensi tidak diperlukan karena adanya alasan tertentu--sebagai contoh, penggunaan di bawah pengecualian atau pembatasan hak cipta--maka penggunaan tersebut tidak tunduk pada aturan lisensi ini. Lisensi kami hanya memberikan izin di bawah hak cipta dan Hak-hak Serupa yang dipegang oleh pemberi lisensi. Penggunaan materi berlisensi dapat dibatasi oleh ketentuan lain, seperti dalam hal pihak lain memiliki hak cipta atau Hak-hak Serupa atas materi tersebut. Pemberi lisensi dapat membuat permintaan tertentu, seperti meminta pengguna untuk menandai dan mendeskripsikan perubahan yang dibuat. Walau tidak ditentukan di bawah lisensi kami, Anda diharapkan untuk menghargai permintaan tersebut jika sesuai. Pertimbangan lebih lanjut untuk pengguna. Atribusi 4.0 Internasional Dengan menggunakan Hak Lisensi (penjelasan di bawah), Anda menerima dan setuju untuk terikat dengan syarat dan ketentuan dari Lisensi Publik Creative Commons Atribusi 4.0 Internasional (“Lisensi Publik”). Sejauh Lisensi Publik ini dapat dipandang sebagai kontrak, Anda menerima Hak Lisensi dengan mempertimbangkan persetujuan Anda atas syarat dan ketentuan berikut, dan Pemberi Lisensi memberikan Anda hak-hak tersebut dengan mempertimbangkan manfaat yang diterima Pemberi Lisensi dengan menyebarluaskan Materi Berlisensi di bawah syarat dan ketentuan berikut. Bagian 1 – Definisi. Materi Adaptasi adalah materi yang memiliki Hak Cipta dan Hak-hak Serupa yang diambil dari atau dibuat berdasarkan Materi Berlisensi dan Materi Berlisensi harus diterjemahkan, diubah, disusun ulang, dialihwujudkan, atau dimodifikasi dengan cara lainnya dengan izin Pemberi Lisensi atas Hak Cipta dan Hak-hak Serupa. Untuk tujuan Lisensi Publik ini, dalam hal Materi Berlisensi adalah ciptaan musikal, pertunjukan, atau rekaman suara, Materi Adaptasi juga tercipta saat Materi Berlisensi dipadukan dengan gambar bergerak. Lisensi Pengadaptasi adalah lisensi yang Anda berikan pada Hak Cipta dan Hak-hak Serupa Anda pada kontribusi Anda dalam Materi Adaptasi sesuai dengan syarat dan ketentuan dalam Lisensi Publik ini. Hak Cipta dan Hak-hak Serupa adalah hak cipta dan/atau Hak-hak Serupa yang berkaitan dengan hak cipta termasuk, tanpa terbatas pada, hak untuk mempertunjukan, menyiarkan, merekam suara, dan Hak Basis Data Sui Generis, tanpa mengurangi tanda atau kategori hak-hak tersebut. Untuk tujuan Lisensi Publik ini, hak-hak yang disebutkan dalam Bagian 2(b)(1)-(2) tidak termasuk Hak Cipta dan Hak-hak Serupa. Sarana Kontrol Teknologi adalah tindakan yang, dalam hal tidak adanya otoritas yang berkewajiban, tidak boleh dirusak di bawah ketentuan peraturan perundang-undangan yang memenuhi kewajiban Pasal 11 Perjanjian Hak Cipta WIPO yang berlaku sejak 20 Desember 1996 dan/atau perjanjian internasional yang serupa. Pengecualian dan Pembatasan adalah penggunaan yang wajar dan/atau pengecualian atau pembatasan lain atas Hak Cipta dan Hak-hak Serupa yang berlaku pada penggunaan Anda atas Materi Berlisensi. Materi Berlisensi adalah ciptaan di bidang seni dan sastra, basis data, atau materi lain yang menggunakan Lisensi Publik ini. Hak Lisensi adalah hak-hak yang diberikan kepada Anda berdasarkan syarat dan ketentuan pada Lisensi Publik ini, yang terbatas pada seluruh Hak Cipta dan Hak-hak Serupa yang berlaku pada penggunaan Anda atas Materi Berlisensi dan terbatas pada bagian yang dapat dilisensikan oleh Pemberi Lisensi. Pemberi Lisensi adalah setiap individu atau entitas yang memberikan hak-hak di bawah Lisensi Publik. Membagikan adalah menyediakan materi kepada publik dengan cara atau proses apapun yang membutuhkan izin di bawah Hak Lisensi, seperti memperbanyak, memamerkan, mempertunjukan, menyebarluaskan, mengomunikasikan, atau mengimpor, dan untuk menyediakan materi kepada publik termasuk melalui cara-cara yang memungkinkan publik untuk mengakses materi dari tempat dan waktu yang mereka pilih sendiri. Hak Basis Data Sui Generis adalah hak selain hak cipta yang muncul dari Direktif Parlemen dan Dewan Uni Eropa 11 Maret 1996 No. 96/9/EC tentang tentang perlindungan hukum atas basis data, sebagaimana diamandemen dan/atau digantikan, juga hak-hak setara lainnya yang berlaku. Anda adalah setiap individu atau entitas hukum yang menggunakan Hak Lisensi di bawah Lisensi Publik ini. Bagian 2 – Ruang Lingkup. Ruang lingkup lisensi . Sesuai dengan syarat dan ketentuan di dalam Lisensi Publik ini, Pemberi Lisensi memberikan Anda lisensi yang berlaku di seluruh dunia, bebas royalti, tidak dapat dilisensikan kembali, non-eksklusif, dan tidak dapat dicabut untuk menggunakan Hak Lisensi pada Materi Berlisensi untuk: memperbanyak dan Membagikan Materi Berlisensi, dalam bentuk utuh maupun sebagian; dan menciptakan, memperbanyak, dan Membagikan Materi Adaptasi. Pengecualian dan Pembatasan . Untuk menghindari keraguan, saat Pengecualian dan Pembatasan berlaku atas penggunaan Anda, Lisensi Publik ini tidak berlaku, dan Anda tidak wajib melaksanakan syarat dan ketentuan di dalamnya. Jangka waktu . Jangka waktu Lisensi Publik ini dijelaskan pada Bagian 6(a) . Media dan format; modifikasi teknis diperbolehkan . Pemberi Lisensi mengizinkan Anda untuk menggunakan Hak Lisensi pada seluruh media dan format baik yang telah diketahui saat ini maupun yang akan diciptakan, dan untuk melakukan modifikasi teknis yang diperlukan. Pemberi Lisensi melepaskan dan/atau setuju untuk tidak menggunakan hak atau kewenangan apapun untuk melarang Anda melakukan modifikasi teknis yang diperlukan untuk menggunakan Hak Lisensi, termasuk modifikasi teknis yang diperlukan untuk menghilangkan Sarana Kontrol Teknologi. Untuk tujuan Lisensi Publik ini, pembuatan modifikasi yang diizinkan Bagian 2(a)(4) ini tidak berarti menghasilkan Materi Adaptasi. Pengguna lain . Tawaran dari Pemberi Lisensi – Materi Berlisensi . Setiap pengguna Materi Berlisensi secara otomatis menerima tawaran dari Pemberi Lisensi untuk menggunakan Hak Lisensi di bawah syarat dan ketentuan dalam Lisensi Publik ini. Tidak ada halangan tambahan . Anda tidak boleh menawarkan atau memberikan syarat dan ketentuan tambahan pada, atau menggunakan Sarana Kontrol Teknologi pada, Materi Berlisensi apabila tindakan tersebut menghalangi penggunaan Hak Lisensi oleh setiap pengguna lain dari Materi Berlinsensi. Tanpa dukungan . Tidak satupun hal di bawah Lisensi Publik ini memunculkan atau dapat memunculkan izin untuk menyatakan secara langsung maupun tidak langsung bahwa Anda, atau penggunaan Anda atas Hak Lisensi, adalah terkait dengan, atau didukung oleh, atau secara resmi diberikan oleh, Pemberi Lisensi atau pihak lain yang harus menerima atribusi sebagaimana tercantum dalam Bagian 3(a)(1)(A)(i) . Hak lainnya . Hak moral, seperti hak atas integritas, tidak dilisensikan di bawah Lisensi Publik ini, juga hak atas potret, kerahasiaan, dan/atau hak personal serupa lainnya; walau demikian, sejauh yang dimungkinkan, Pemberi Lisensi melepaskan dan/atau setuju untuk tidak menggunakan hak lainnya yang dipegang oleh Pemberi Lisensi hingga batasan tertentu untuk mengizinkan Anda menggunakan Hak Lisensi, dan bukan sebaliknya. Hak paten dan merek dagang tidak dilisensikan di bawah Lisensi Publik. Sejauh yang dimungkinkan, Pemberi Lisensi melepaskan hak untuk mendapatkan royalti dari Anda dengan menggunakan Hak Lisensi, baik secara langsung maupun melalui lembaga manajemen kolektif di bawah ketentuan skema lisensi sukarela atau yang dapat dilepaskan maupun skema lisensi wajib. Dalam kondisi lainnya Pemberi Lisensi memiliki hak untuk mendapatkan royalti tersebut. Bagian 3 – Ketentuan Lisensi. Penggunaan Anda atas Hak Lisensi bergantung pada ketentuan di bawah ini. Atribusi . Apabila Anda Membagikan Materi Berlisensi (termasuk yang telah dimodifikasi), Anda wajib: mencantumkan hal-hal di bawah ini apabila dinyatakan oleh Pemberi Lisensi di dalam Materi Berlisensi: identitas para pencipta Materi Berlisensi dan pihak lain yang harus menerima atribusi, dengan cara yang sesuai dengan permintaan Pemberi Lisensi (termasuk penggunaan nama samaran jika ada); pemberitahuan hak cipta; pemberitahuan mengenai Lisensi Publik ini; pemberitahuan mengenai pernyataan jaminan; PSS (pengidentifikasi sumber seragam) atau tautan kepada Materi Berlisensi jika memungkinkan; menunjukkan bahwa Anda telah memodifikasi Materi Berlisensi dan menunjukkan setiap modifikasi yang sebelumnya pernah dibuat; dan menunjukkan bahwa Materi Berlisensi dilisensikan di bawah Lisensi Publik ini, termasuk teks, atau PSS dan tautan kepada, dari Lisensi Publik ini. Anda dapat melaksanakan ketentuan pada Bagian 3(a)(1) dengan cara yang sesuai dengan perantara, cara, dan konteks penggunaan Anda dalam Membagikan Materi Berlisensi. Sebagai contoh, Anda dapat melaksanakan ketentuan ini dengan memberikan PSS atau tautan kepada sumber yang menyediakan informasi yang dibutuhkan. Apabila dimintakan demikian oleh Pemberi Lisensi, Anda harus menghilangkan setiap informasi yang dinyatakan dalam Bagian 3(a)(1)(A) jika memungkinkan. Apabila Anda Membagikan Materi Adaptasi yang Anda buat, Lisensi Pengadaptasi yang harus Anda gunakan tidak dapat menghalangi penerima Materi Adaptasi untuk melaksanakan Lisensi Publik ini. Bagian 4 – Hak Basis Data Sui Generis. Apabila Hak Lisensi mencakup Hak Basis Data Sui Generis yang berlaku untuk penggunaan Anda atas Materi Berlisensi: untuk menghindari keraguan, Bagian 2(a)(1) memberikan hak kepada Anda untuk mengambil, menggunakan kembali, memperbanyak, dan Membagikan seluruh atau sebagian besar dari isi basis data; apabila Anda mencantumkan seluruh atau sebagian besar dari isi basis data di dalam basis data dengan Hak Basis Data Sui Generis yang dapat Anda gunakan, maka basis data dengan Hak Basis Data Sui Generis yang dapat Anda gunakan (namun bukan isinya secara terpisah) adalah Materi Adaptasi; dan Anda harus melaksanakan ketentuan dalam Bagian 3(a) apabila Anda Membagikan seluruh atau sebagian besar dari isi basis data. Untuk menghindari keraguan, Bagian 4 ini menambahkan dan tidak menggantikan kewajiban Anda di bawah Lisensi Publik di mana Hak Lisensi termasuk Hak Cipta dan Hak-hak Serupa lainnya. Bagian 5 – Pernyataan Jaminan dan Batasan Tanggung Jawab. Kecuali dilaksanakan dengan cara lain secara terpisah oleh Pemberi Lisensi, sejauh yang dimungkinkan, Pemberi Lisensi memberikan Materi Berlisensi “apa adanya” dan “sebagaimana tersedia”, dan tidak memberikan pernyataan atau jaminan apapun terkait Materi Berlisensi, baik secara tegas, secara tersirat, berdasarkan hukum, atau lainnya. Hal ini termasuk, tanpa terbatas pada, jaminan atas hak, jual beli, kecocokan untuk tujuan tertentu, tidak adanya pelanggaran, tidak adanya pengelabuan atau cacat lainnya, keakuratan, atau adanya atau tidak adanya kesalahan, baik yang diketahui maupun tidak. Dalam hal pernyataan jaminan tidak dapat dilaksanakan secara penuh atau sebagian, pernyataan ini tidak berlaku terhadap Anda. Sejauh yang dimungkinkan, Pemberi Lisensi tidak dapat dianggap bertanggung jawab kepada Anda untuk tindakan hukum apapun (termasuk, tanpa terbatas pada, kelalaian) atau untuk setiap kehilangan, kerugian, pengeluaran, atau kerusakan yang terjadi secara langsung, khusus, tidak langsung, sebagai kecelakaan, akibat, hukuman, pembebasan, atau lainnya yang muncul dari Lisensi Publik ini atau penggunaan Materi Berlisensi, walau pemberi lisensi telah memberitahukan kemungkinan terjadinya kehilangan, kerugian, pengeluaran, atau kerusakan tersebut. Dalam hal pembatasan tanggung jawab tidak dapat dilaksanakan secara penuh atau sebagian, batasan ini tidak berlaku terhadap Anda. Pernyataan jaminan dan batasan tanggung jawab di atas ini dapat diinterpretasikan dengan cara, sejauh yang dimungkinkan, yang paling dekat dengan pernyataan dan pelepasan dari seluruh tanggung jawab sepenuhnya. Bagian 6 – Jangka Waktu dan Penghentian. Lisensi Publik ini berlaku sepanjang jangka waktu Hak Cipta dan Hak-hak Serupa yang dilisensikan di bawahnya. Walau demikian, apabila Anda lalai dalam melaksanakan ketentuan Lisensi Publik ini, maka hak Anda di bawah Lisensi Publik ini akan secara otomatis berakhir. Dalam hal hak Anda untuk menggunakan Materi Berlisensi telah berakhir sesuai Bagian 6(a), Lisensi Publik ini dapat berlaku kembali: secara otomatis pada tanggal ditanggulanginya kelalaian yang dilakukan, atau dalam waktu 30 hari setelah Anda mengetahui kelalaian yang dilakukan; atau berdasarkan pemberlakukan kembali oleh Pemberi Lisensi. Untuk menghindari keraguan, Bagian 6(b) tidak berpengaruh pada setiap pelanggaran atas hak yang dimiliki oleh Pemberi Lisensi yang terjadi akibat kelalaian Anda melaksanakan ketentuan dalam Lisensi Publik ini. Untuk menghindari keraguan, Pemberi Lisensi dapat menawarkan Materi Berlisensi di bawah syarat dan ketentuan yang terpisah atau berhenti menyebarluaskan Materi Berlisensi di setiap waktu; namun, hal ini tidak akan menghentikan keberlakuan Lisensi Publik ini. Bagian 1 , 5 , 6 , 7 , dan 8 akan terus berlaku setelah Lisensi Publik ini berakhir. Bagian 7 – Syarat dan Ketentuan Lain. Pemberi Lisensi tidak terikat di bawah setiap syarat atau ketentuan tambahan atau syarat atau ketentuan yang berbeda yang Anda sarankan kecuali secara tegas disetujui demikian. Setiap aturan, kesepakatan, atau perjanjian terkait Materi Berlisensi yang tidak tercantum di sini berlaku secara terpisah dan tidak bergantung pada syarat dan ketentuan di bawah Lisensi Publik ini. Bagian 8 – Interpretasi. Untuk menghindari keraguan, Lisensi Publik ini tidak bertujuan untuk, dan tidak dapat dianggap bertujuan untuk, mengurangi, membatasi, menghalangi, atau memaksakan ketentuan dari setiap penggunaan Materi Berlisensi yang secara hukum dapat diciptakan tanpa izin di bawah Lisensi Publik ini. Sejauh yang dimungkinkan, apabila ketentuan di bawah Lisensi Publik ini dinilai tidak dapat dilaksanakan, maka kewajiban pelaksanaan ketentuan harus dilakukan dengan cara yang sesuai. Apabila ketentuan yang ada tidak dapat dilaksanakan sama sekali, maka ketentuan tersebut ditiadakan dari Lisensi Publik ini namun tidak berpengaruh pada pelaksanaan syarat dan ketentuan lainnya. Syarat atau ketentuan di bawah Lisensi Publik ini tidak dapat dilepaskan dan tidak ada kelalaian yang diizinkan kecuali secara tegas disetujui demikian oleh Pemberi Lisensi. Lisensi Publik ini tidak memunculkan atau dapat dianggap sebagai pembatasan dari, atau pelepasan atas, setiap hak dan kekebalan yang berlaku untuk Pemberi Lisensi atau Anda, termasuk dari proses hukum menurut jurisdiksi atau kewenangan apapun. About Creative Commons Creative Commons bukanlah pihak dalam lisensi publik. Walau demikian, Creative Commons dapat memilih untuk menggunakan salah satu dari lisensi publik yang ada untuk materi yang dipublikasikan oleh kami dan dalam hal demikian dianggap sebagai "Pemberi Lisensi." Teks dari lisensi publik Creative Commons disebarluaskan di bawah Dedikasi Domain Publik CC0 . Kecuali untuk tujuan tertentu dalam hal menyatakan bahwa materi tersebut disebarluaskan di bawah lisensi publik Creative Commons atau sebagaimana diizinkan oleh aturan Creative Commons yang dicantumkan pada creativecommons.org/policies , Creative Commons tidak mengizinkan penggunaan merek dagang "Creative Commons" atau setiap merek dagang atau logo Creative Commons tanpa izin tertulis termasuk, tanpa terbatas pada, dalam hubungannya dengan setiap modifikasi tanpa izin yang dilakukan terhadap lisensi publik atau setiap aturan, kesepakatan, atau perjanjian lainnya terkait penggunaan materi berlisensi. Untuk menghindari keraguan, paragraf ini tidak menjadi bagian dari lisensi publik. Creative Commons dapat dihubungi melalui creativecommons.org . Creative Commons is the nonprofit behind the open licenses and other legal tools that allow creators to share their work. Our legal tools are free to use. Learn more about our work Learn more about CC Licensing Support our work Use the license for your own material. Licenses List Public Domain List Creative Commons Contact Newsletter Privacy Policies Terms Contact Us Creative Commons PO Box 1866, Mountain View, CA 94042 info@creativecommons.org +1-415-429-6753 Instagram --> Bluesky Mastodon LinkedIn Subscribe to our Newsletter Support Our Work Our work relies on you! Help us keep the Internet free and open. Donate Now Except where otherwise noted , content on this site is licensed under a Creative Commons Attribution 4.0 International license . Icons by Font Awesome . | 2026-01-13T09:29:14 |
https://doc.rust-lang.org/std/cmp/trait.PartialEq.html | PartialEq in std::cmp - Rust This old browser is unsupported and will most likely display funky things. PartialEq std 1.92.0 (ded5c06cf 2025-12-08) Partial Eq Sections Cross-crate considerations Derivable How can I implement PartialEq ? How can I compare two different types? Examples Required Methods eq Provided Methods ne Implementors In std:: cmp std :: cmp Trait Partial Eq Copy item path 1.0.0 (const: unstable ) · Source pub trait PartialEq<Rhs = Self> where Rhs: ? Sized , { // Required method fn eq (&self, other: &Rhs ) -> bool ; // Provided method fn ne (&self, other: &Rhs ) -> bool { ... } } Expand description Trait for comparisons using the equality operator. Implementing this trait for types provides the == and != operators for those types. x.eq(y) can also be written x == y , and x.ne(y) can be written x != y . We use the easier-to-read infix notation in the remainder of this documentation. This trait allows for comparisons using the equality operator, for types that do not have a full equivalence relation. For example, in floating point numbers NaN != NaN , so floating point types implement PartialEq but not Eq . Formally speaking, when Rhs == Self , this trait corresponds to a partial equivalence relation . Implementations must ensure that eq and ne are consistent with each other: a != b if and only if !(a == b) . The default implementation of ne provides this consistency and is almost always sufficient. It should not be overridden without very good reason. If PartialOrd or Ord are also implemented for Self and Rhs , their methods must also be consistent with PartialEq (see the documentation of those traits for the exact requirements). It’s easy to accidentally make them disagree by deriving some of the traits and manually implementing others. The equality relation == must satisfy the following conditions (for all a , b , c of type A , B , C ): Symmetry : if A: PartialEq<B> and B: PartialEq<A> , then a == b implies b == a ; and Transitivity : if A: PartialEq<B> and B: PartialEq<C> and A: PartialEq<C> , then a == b and b == c implies a == c . This must also work for longer chains, such as when A: PartialEq<B> , B: PartialEq<C> , C: PartialEq<D> , and A: PartialEq<D> all exist. Note that the B: PartialEq<A> (symmetric) and A: PartialEq<C> (transitive) impls are not forced to exist, but these requirements apply whenever they do exist. Violating these requirements is a logic error. The behavior resulting from a logic error is not specified, but users of the trait must ensure that such logic errors do not result in undefined behavior. This means that unsafe code must not rely on the correctness of these methods. § Cross-crate considerations Upholding the requirements stated above can become tricky when one crate implements PartialEq for a type of another crate (i.e., to allow comparing one of its own types with a type from the standard library). The recommendation is to never implement this trait for a foreign type. In other words, such a crate should do impl PartialEq<ForeignType> for LocalType , but it should not do impl PartialEq<LocalType> for ForeignType . This avoids the problem of transitive chains that criss-cross crate boundaries: for all local types T , you may assume that no other crate will add impl s that allow comparing T == U . In other words, if other crates add impl s that allow building longer transitive chains U1 == ... == T == V1 == ... , then all the types that appear to the right of T must be types that the crate defining T already knows about. This rules out transitive chains where downstream crates can add new impl s that “stitch together” comparisons of foreign types in ways that violate transitivity. Not having such foreign impl s also avoids forward compatibility issues where one crate adding more PartialEq implementations can cause build failures in downstream crates. § Derivable This trait can be used with #[derive] . When derive d on structs, two instances are equal if all fields are equal, and not equal if any fields are not equal. When derive d on enums, two instances are equal if they are the same variant and all fields are equal. § How can I implement PartialEq ? An example implementation for a domain in which two books are considered the same book if their ISBN matches, even if the formats differ: enum BookFormat { Paperback, Hardback, Ebook, } struct Book { isbn: i32, format: BookFormat, } impl PartialEq for Book { fn eq( & self , other: & Self ) -> bool { self .isbn == other.isbn } } let b1 = Book { isbn: 3 , format: BookFormat::Paperback }; let b2 = Book { isbn: 3 , format: BookFormat::Ebook }; let b3 = Book { isbn: 10 , format: BookFormat::Paperback }; assert! (b1 == b2); assert! (b1 != b3); § How can I compare two different types? The type you can compare with is controlled by PartialEq ’s type parameter. For example, let’s tweak our previous code a bit: // The derive implements <BookFormat> == <BookFormat> comparisons #[derive(PartialEq)] enum BookFormat { Paperback, Hardback, Ebook, } struct Book { isbn: i32, format: BookFormat, } // Implement <Book> == <BookFormat> comparisons impl PartialEq<BookFormat> for Book { fn eq( & self , other: & BookFormat) -> bool { self .format == * other } } // Implement <BookFormat> == <Book> comparisons impl PartialEq<Book> for BookFormat { fn eq( & self , other: & Book) -> bool { * self == other.format } } let b1 = Book { isbn: 3 , format: BookFormat::Paperback }; assert! (b1 == BookFormat::Paperback); assert! (BookFormat::Ebook != b1); By changing impl PartialEq for Book to impl PartialEq<BookFormat> for Book , we allow BookFormat s to be compared with Book s. A comparison like the one above, which ignores some fields of the struct, can be dangerous. It can easily lead to an unintended violation of the requirements for a partial equivalence relation. For example, if we kept the above implementation of PartialEq<Book> for BookFormat and added an implementation of PartialEq<Book> for Book (either via a #[derive] or via the manual implementation from the first example) then the result would violate transitivity: ⓘ #[derive(PartialEq)] enum BookFormat { Paperback, Hardback, Ebook, } #[derive(PartialEq)] struct Book { isbn: i32, format: BookFormat, } impl PartialEq<BookFormat> for Book { fn eq( & self , other: & BookFormat) -> bool { self .format == * other } } impl PartialEq<Book> for BookFormat { fn eq( & self , other: & Book) -> bool { * self == other.format } } fn main() { let b1 = Book { isbn: 1 , format: BookFormat::Paperback }; let b2 = Book { isbn: 2 , format: BookFormat::Paperback }; assert! (b1 == BookFormat::Paperback); assert! (BookFormat::Paperback == b2); // The following should hold by transitivity but doesn't. assert! (b1 == b2); // <-- PANICS } § Examples let x: u32 = 0 ; let y: u32 = 1 ; assert_eq! (x == y, false ); assert_eq! (x.eq( & y), false ); Required Methods § 1.0.0 · Source fn eq (&self, other: &Rhs ) -> bool Tests for self and other values to be equal, and is used by == . Provided Methods § 1.0.0 · Source fn ne (&self, other: &Rhs ) -> bool Tests for != . The default implementation is almost always sufficient, and should not be overridden without very good reason. Implementors § Source § impl PartialEq for AsciiChar 1.65.0 · Source § impl PartialEq for BacktraceStatus Source § impl PartialEq for TryReserveErrorKind 1.34.0 (const: unstable ) · Source § impl PartialEq for Infallible 1.0.0 · Source § impl PartialEq for VarError 1.64.0 · Source § impl PartialEq for FromBytesWithNulError 1.28.0 · Source § impl PartialEq for std::fmt:: Alignment Source § impl PartialEq for DebugAsHex Source § impl PartialEq for Sign Source § impl PartialEq for AtomicOrdering 1.0.0 · Source § impl PartialEq for ErrorKind 1.0.0 · Source § impl PartialEq for SeekFrom 1.7.0 · Source § impl PartialEq for IpAddr Source § impl PartialEq for Ipv6MulticastScope 1.0.0 · Source § impl PartialEq for Shutdown 1.0.0 · Source § impl PartialEq for SocketAddr 1.0.0 · Source § impl PartialEq for FpCategory 1.55.0 · Source § impl PartialEq for IntErrorKind Source § impl PartialEq for BacktraceStyle 1.86.0 · Source § impl PartialEq for GetDisjointMutError Source § impl PartialEq for SearchStep 1.0.0 · Source § impl PartialEq for std::sync::atomic:: Ordering 1.12.0 · Source § impl PartialEq for RecvTimeoutError 1.0.0 · Source § impl PartialEq for TryRecvError 1.0.0 (const: unstable ) · Source § impl PartialEq for std::cmp:: Ordering 1.0.0 (const: unstable ) · Source § impl PartialEq for bool 1.0.0 (const: unstable ) · Source § impl PartialEq for char 1.0.0 (const: unstable ) · Source § impl PartialEq for f16 1.0.0 (const: unstable ) · Source § impl PartialEq for f32 1.0.0 (const: unstable ) · Source § impl PartialEq for f64 1.0.0 (const: unstable ) · Source § impl PartialEq for f128 1.0.0 (const: unstable ) · Source § impl PartialEq for i8 1.0.0 (const: unstable ) · Source § impl PartialEq for i16 1.0.0 (const: unstable ) · Source § impl PartialEq for i32 1.0.0 (const: unstable ) · Source § impl PartialEq for i64 1.0.0 (const: unstable ) · Source § impl PartialEq for i128 1.0.0 (const: unstable ) · Source § impl PartialEq for isize Source § impl PartialEq for ! 1.0.0 (const: unstable ) · Source § impl PartialEq for str 1.0.0 (const: unstable ) · Source § impl PartialEq for u8 1.0.0 (const: unstable ) · Source § impl PartialEq for u16 1.0.0 (const: unstable ) · Source § impl PartialEq for u32 1.0.0 (const: unstable ) · Source § impl PartialEq for u64 1.0.0 (const: unstable ) · Source § impl PartialEq for u128 1.0.0 (const: unstable ) · Source § impl PartialEq for () 1.0.0 (const: unstable ) · Source § impl PartialEq for usize 1.27.0 · Source § impl PartialEq for CpuidResult Source § impl PartialEq for AllocError 1.28.0 · Source § impl PartialEq for Layout 1.50.0 · Source § impl PartialEq for LayoutError 1.0.0 (const: unstable ) · Source § impl PartialEq for TypeId Source § impl PartialEq for ByteStr Source § impl PartialEq for ByteString 1.34.0 · Source § impl PartialEq for CharTryFromError 1.9.0 · Source § impl PartialEq for DecodeUtf16Error 1.20.0 · Source § impl PartialEq for ParseCharError 1.59.0 · Source § impl PartialEq for TryFromCharError Source § impl PartialEq for UnorderedKeyError 1.57.0 · Source § impl PartialEq for TryReserveError 1.64.0 · Source § impl PartialEq for CStr 1.64.0 · Source § impl PartialEq for CString 1.69.0 · Source § impl PartialEq for FromBytesUntilNulError 1.64.0 · Source § impl PartialEq for FromVecWithNulError 1.64.0 · Source § impl PartialEq for IntoStringError 1.64.0 · Source § impl PartialEq for NulError 1.0.0 · Source § impl PartialEq for OsStr 1.0.0 · Source § impl PartialEq for OsString 1.0.0 · Source § impl PartialEq for Error Source § impl PartialEq for FormattingOptions 1.1.0 · Source § impl PartialEq for FileType 1.0.0 · Source § impl PartialEq for Permissions 1.33.0 · Source § impl PartialEq for PhantomPinned Source § impl PartialEq for Assume 1.0.0 · Source § impl PartialEq for AddrParseError 1.0.0 · Source § impl PartialEq for Ipv4Addr 1.0.0 · Source § impl PartialEq for Ipv6Addr 1.0.0 · Source § impl PartialEq for SocketAddrV4 1.0.0 · Source § impl PartialEq for SocketAddrV6 1.0.0 · Source § impl PartialEq for ParseFloatError 1.0.0 · Source § impl PartialEq for ParseIntError 1.34.0 · Source § impl PartialEq for TryFromIntError 1.0.0 · Source § impl PartialEq for RangeFull Source § impl PartialEq for UCred Available on Unix only. 1.63.0 · Source § impl PartialEq for InvalidHandleError Available on Windows only. 1.63.0 · Source § impl PartialEq for NullHandleError Available on Windows only. 1.10.0 · Source § impl PartialEq for Location <'_> Source § impl PartialEq for NormalizeError 1.0.0 · Source § impl PartialEq for Path 1.0.0 · Source § impl PartialEq for PathBuf 1.7.0 · Source § impl PartialEq for StripPrefixError 1.61.0 · Source § impl PartialEq for ExitCode 1.0.0 · Source § impl PartialEq for ExitStatus Source § impl PartialEq for ExitStatusError 1.0.0 · Source § impl PartialEq for Output Source § impl PartialEq for std::ptr:: Alignment 1.0.0 · Source § impl PartialEq for ParseBoolError 1.0.0 · Source § impl PartialEq for Utf8Error 1.0.0 · Source § impl PartialEq for FromUtf8Error 1.0.0 · Source § impl PartialEq for String 1.0.0 · Source § impl PartialEq for RecvError 1.5.0 · Source § impl PartialEq for WaitTimeoutResult 1.36.0 · Source § impl PartialEq for RawWaker 1.36.0 · Source § impl PartialEq for RawWakerVTable 1.26.0 · Source § impl PartialEq for AccessError 1.19.0 · Source § impl PartialEq for ThreadId 1.3.0 · Source § impl PartialEq for Duration 1.8.0 · Source § impl PartialEq for Instant 1.8.0 · Source § impl PartialEq for SystemTime 1.66.0 · Source § impl PartialEq for TryFromFloatSecsError 1.29.0 · Source § impl PartialEq <& str > for OsString 1.90.0 · Source § impl PartialEq <& CStr > for Cow <'_, CStr > 1.90.0 · Source § impl PartialEq <& CStr > for CStr 1.90.0 · Source § impl PartialEq <& CStr > for CString 1.90.0 · Source § impl PartialEq < Cow <'_, CStr >> for CStr 1.90.0 · Source § impl PartialEq < Cow <'_, CStr >> for CString 1.16.0 · Source § impl PartialEq < IpAddr > for Ipv4Addr 1.16.0 · Source § impl PartialEq < IpAddr > for Ipv6Addr 1.0.0 · Source § impl PartialEq < str > for OsStr 1.0.0 · Source § impl PartialEq < str > for OsString 1.91.0 · Source § impl PartialEq < str > for Path 1.91.0 · Source § impl PartialEq < str > for PathBuf 1.90.0 · Source § impl PartialEq < CStr > for Cow <'_, CStr > 1.90.0 · Source § impl PartialEq < CStr > for CString 1.90.0 · Source § impl PartialEq < CString > for Cow <'_, CStr > 1.90.0 · Source § impl PartialEq < CString > for CStr 1.0.0 · Source § impl PartialEq < OsStr > for str 1.8.0 · Source § impl PartialEq < OsStr > for Path 1.8.0 · Source § impl PartialEq < OsStr > for PathBuf 1.0.0 · Source § impl PartialEq < OsString > for str 1.8.0 · Source § impl PartialEq < OsString > for Path 1.8.0 · Source § impl PartialEq < OsString > for PathBuf 1.16.0 · Source § impl PartialEq < Ipv4Addr > for IpAddr 1.16.0 · Source § impl PartialEq < Ipv6Addr > for IpAddr 1.91.0 · Source § impl PartialEq < Path > for str 1.8.0 · Source § impl PartialEq < Path > for OsStr 1.8.0 · Source § impl PartialEq < Path > for OsString 1.6.0 · Source § impl PartialEq < Path > for PathBuf 1.91.0 · Source § impl PartialEq < Path > for String 1.91.0 · Source § impl PartialEq < PathBuf > for str 1.8.0 · Source § impl PartialEq < PathBuf > for OsStr 1.8.0 · Source § impl PartialEq < PathBuf > for OsString 1.6.0 · Source § impl PartialEq < PathBuf > for Path 1.91.0 · Source § impl PartialEq < PathBuf > for String 1.91.0 · Source § impl PartialEq < String > for Path 1.91.0 · Source § impl PartialEq < String > for PathBuf 1.0.0 · Source § impl<'a> PartialEq for Component <'a> 1.0.0 · Source § impl<'a> PartialEq for Prefix <'a> Source § impl<'a> PartialEq for Utf8Pattern <'a> Source § impl<'a> PartialEq for PhantomContravariantLifetime <'a> Source § impl<'a> PartialEq for PhantomCovariantLifetime <'a> Source § impl<'a> PartialEq for PhantomInvariantLifetime <'a> 1.0.0 · Source § impl<'a> PartialEq for Components <'a> 1.0.0 · Source § impl<'a> PartialEq for PrefixComponent <'a> 1.79.0 · Source § impl<'a> PartialEq for Utf8Chunk <'a> Source § impl<'a> PartialEq <&'a ByteStr > for Cow <'a, str > Source § impl<'a> PartialEq <&'a ByteStr > for Cow <'a, ByteStr > Source § impl<'a> PartialEq <&'a ByteStr > for Cow <'a, [ u8 ]> 1.8.0 · Source § impl<'a> PartialEq <&'a OsStr > for Path 1.8.0 · Source § impl<'a> PartialEq <&'a OsStr > for PathBuf 1.8.0 · Source § impl<'a> PartialEq <&'a Path > for OsStr 1.8.0 · Source § impl<'a> PartialEq <&'a Path > for OsString 1.6.0 · Source § impl<'a> PartialEq <&'a Path > for PathBuf Source § impl<'a> PartialEq <& str > for ByteStr Source § impl<'a> PartialEq <& str > for ByteString Source § impl<'a> PartialEq <& ByteStr > for ByteString Source § impl<'a> PartialEq <&[ u8 ]> for ByteStr Source § impl<'a> PartialEq <&[ u8 ]> for ByteString Source § impl<'a> PartialEq < Cow <'_, str >> for ByteString Source § impl<'a> PartialEq < Cow <'_, ByteStr >> for ByteString Source § impl<'a> PartialEq < Cow <'_, [ u8 ]>> for ByteString Source § impl<'a> PartialEq < Cow <'a, str >> for &'a ByteStr Source § impl<'a> PartialEq < Cow <'a, ByteStr >> for &'a ByteStr 1.8.0 · Source § impl<'a> PartialEq < Cow <'a, OsStr >> for Path 1.8.0 · Source § impl<'a> PartialEq < Cow <'a, OsStr >> for PathBuf 1.8.0 · Source § impl<'a> PartialEq < Cow <'a, Path >> for OsStr 1.8.0 · Source § impl<'a> PartialEq < Cow <'a, Path >> for OsString 1.6.0 · Source § impl<'a> PartialEq < Cow <'a, Path >> for Path 1.6.0 · Source § impl<'a> PartialEq < Cow <'a, Path >> for PathBuf Source § impl<'a> PartialEq < Cow <'a, [ u8 ]>> for &'a ByteStr Source § impl<'a> PartialEq < str > for ByteStr Source § impl<'a> PartialEq < str > for ByteString Source § impl<'a> PartialEq < ByteStr > for & str Source § impl<'a> PartialEq < ByteStr > for &[ u8 ] Source § impl<'a> PartialEq < ByteStr > for str Source § impl<'a> PartialEq < ByteStr > for ByteString Source § impl<'a> PartialEq < ByteStr > for String Source § impl<'a> PartialEq < ByteStr > for Vec < u8 > Source § impl<'a> PartialEq < ByteStr > for [ u8 ] Source § impl<'a> PartialEq < ByteString > for & str Source § impl<'a> PartialEq < ByteString > for & ByteStr Source § impl<'a> PartialEq < ByteString > for &[ u8 ] Source § impl<'a> PartialEq < ByteString > for Cow <'_, str > Source § impl<'a> PartialEq < ByteString > for Cow <'_, ByteStr > Source § impl<'a> PartialEq < ByteString > for Cow <'_, [ u8 ]> Source § impl<'a> PartialEq < ByteString > for str Source § impl<'a> PartialEq < ByteString > for ByteStr Source § impl<'a> PartialEq < ByteString > for String Source § impl<'a> PartialEq < ByteString > for Vec < u8 > Source § impl<'a> PartialEq < ByteString > for [ u8 ] 1.8.0 · Source § impl<'a> PartialEq < OsStr > for &'a Path 1.8.0 · Source § impl<'a> PartialEq < OsStr > for Cow <'a, Path > 1.29.0 · Source § impl<'a> PartialEq < OsString > for &'a str 1.8.0 · Source § impl<'a> PartialEq < OsString > for &'a Path 1.8.0 · Source § impl<'a> PartialEq < OsString > for Cow <'a, Path > 1.8.0 · Source § impl<'a> PartialEq < Path > for &'a OsStr 1.8.0 · Source § impl<'a> PartialEq < Path > for Cow <'a, OsStr > 1.6.0 · Source § impl<'a> PartialEq < Path > for Cow <'a, Path > 1.8.0 · Source § impl<'a> PartialEq < PathBuf > for &'a OsStr 1.6.0 · Source § impl<'a> PartialEq < PathBuf > for &'a Path 1.8.0 · Source § impl<'a> PartialEq < PathBuf > for Cow <'a, OsStr > 1.6.0 · Source § impl<'a> PartialEq < PathBuf > for Cow <'a, Path > Source § impl<'a> PartialEq < String > for ByteStr Source § impl<'a> PartialEq < String > for ByteString Source § impl<'a> PartialEq < Vec < u8 >> for ByteStr Source § impl<'a> PartialEq < Vec < u8 >> for ByteString Source § impl<'a> PartialEq <[ u8 ]> for ByteStr Source § impl<'a> PartialEq <[ u8 ]> for ByteString 1.0.0 · Source § impl<'a, 'b> PartialEq <&'a str > for String 1.8.0 · Source § impl<'a, 'b> PartialEq <&'a OsStr > for OsString 1.8.0 · Source § impl<'a, 'b> PartialEq <&'a Path > for Cow <'b, OsStr > 1.0.0 · Source § impl<'a, 'b> PartialEq <&'b str > for Cow <'a, str > 1.8.0 · Source § impl<'a, 'b> PartialEq <&'b OsStr > for Cow <'a, OsStr > 1.8.0 · Source § impl<'a, 'b> PartialEq <&'b OsStr > for Cow <'a, Path > 1.6.0 · Source § impl<'a, 'b> PartialEq <&'b Path > for Cow <'a, Path > 1.0.0 · Source § impl<'a, 'b> PartialEq < Cow <'a, str >> for &'b str 1.0.0 · Source § impl<'a, 'b> PartialEq < Cow <'a, str >> for str 1.0.0 · Source § impl<'a, 'b> PartialEq < Cow <'a, str >> for String 1.8.0 · Source § impl<'a, 'b> PartialEq < Cow <'a, OsStr >> for &'b OsStr 1.8.0 · Source § impl<'a, 'b> PartialEq < Cow <'a, OsStr >> for OsStr 1.8.0 · Source § impl<'a, 'b> PartialEq < Cow <'a, OsStr >> for OsString 1.8.0 · Source § impl<'a, 'b> PartialEq < Cow <'a, Path >> for &'b OsStr 1.6.0 · Source § impl<'a, 'b> PartialEq < Cow <'a, Path >> for &'b Path 1.8.0 · Source § impl<'a, 'b> PartialEq < Cow <'b, OsStr >> for &'a Path 1.0.0 · Source § impl<'a, 'b> PartialEq < str > for Cow <'a, str > 1.0.0 · Source § impl<'a, 'b> PartialEq < str > for String 1.8.0 · Source § impl<'a, 'b> PartialEq < OsStr > for Cow <'a, OsStr > 1.8.0 · Source § impl<'a, 'b> PartialEq < OsStr > for OsString 1.8.0 · Source § impl<'a, 'b> PartialEq < OsString > for &'a OsStr 1.8.0 · Source § impl<'a, 'b> PartialEq < OsString > for Cow <'a, OsStr > 1.8.0 · Source § impl<'a, 'b> PartialEq < OsString > for OsStr 1.0.0 · Source § impl<'a, 'b> PartialEq < String > for &'a str 1.0.0 · Source § impl<'a, 'b> PartialEq < String > for Cow <'a, str > 1.0.0 · Source § impl<'a, 'b> PartialEq < String > for str 1.0.0 · Source § impl<'a, 'b, B, C> PartialEq < Cow <'b, C>> for Cow <'a, B> where B: PartialEq <C> + ToOwned + ? Sized , C: ToOwned + ? Sized , 1.0.0 (const: unstable ) · Source § impl<A, B> PartialEq < &B > for &A where A: PartialEq <B> + ? Sized , B: ? Sized , 1.0.0 (const: unstable ) · Source § impl<A, B> PartialEq < &B > for &mut A where A: PartialEq <B> + ? Sized , B: ? Sized , 1.0.0 (const: unstable ) · Source § impl<A, B> PartialEq < &mut B > for &A where A: PartialEq <B> + ? Sized , B: ? Sized , 1.0.0 (const: unstable ) · Source § impl<A, B> PartialEq < &mut B > for &mut A where A: PartialEq <B> + ? Sized , B: ? Sized , 1.55.0 (const: unstable ) · Source § impl<B, C> PartialEq for ControlFlow <B, C> where B: PartialEq , C: PartialEq , Source § impl<Dyn> PartialEq for DynMetadata <Dyn> where Dyn: ? Sized , 1.4.0 · Source § impl<F> PartialEq for F where F: FnPtr , 1.29.0 · Source § impl<H> PartialEq for BuildHasherDefault <H> 1.0.0 · Source § impl<Idx> PartialEq for std::ops:: Range <Idx> where Idx: PartialEq , 1.0.0 · Source § impl<Idx> PartialEq for std::ops:: RangeFrom <Idx> where Idx: PartialEq , 1.26.0 · Source § impl<Idx> PartialEq for std::ops:: RangeInclusive <Idx> where Idx: PartialEq , 1.0.0 · Source § impl<Idx> PartialEq for RangeTo <Idx> where Idx: PartialEq , 1.26.0 · Source § impl<Idx> PartialEq for std::ops:: RangeToInclusive <Idx> where Idx: PartialEq , Source § impl<Idx> PartialEq for std::range:: Range <Idx> where Idx: PartialEq , Source § impl<Idx> PartialEq for std::range:: RangeFrom <Idx> where Idx: PartialEq , Source § impl<Idx> PartialEq for std::range:: RangeInclusive <Idx> where Idx: PartialEq , Source § impl<Idx> PartialEq for std::range:: RangeToInclusive <Idx> where Idx: PartialEq , 1.0.0 · Source § impl<K, V, A> PartialEq for BTreeMap <K, V, A> where K: PartialEq , V: PartialEq , A: Allocator + Clone , 1.0.0 · Source § impl<K, V, S> PartialEq for HashMap <K, V, S> where K: Eq + Hash , V: PartialEq , S: BuildHasher , 1.41.0 · Source § impl<Ptr, Q> PartialEq < Pin <Q>> for Pin <Ptr> where Ptr: Deref , Q: Deref , <Ptr as Deref >:: Target : PartialEq <<Q as Deref >:: Target >, 1.17.0 · Source § impl<T> PartialEq for Bound <T> where T: PartialEq , 1.0.0 (const: unstable ) · Source § impl<T> PartialEq for Option <T> where T: PartialEq , 1.36.0 · Source § impl<T> PartialEq for Poll <T> where T: PartialEq , 1.0.0 · Source § impl<T> PartialEq for *const T where T: ? Sized , Pointer equality is by address, as produced by the <*const T>::addr method. 1.0.0 · Source § impl<T> PartialEq for *mut T where T: ? Sized , Pointer equality is by address, as produced by the <*mut T>::addr method. 1.0.0 (const: unstable ) · Source § impl<T> PartialEq for (T₁, T₂, …, Tₙ) where T: PartialEq , This trait is implemented for tuples up to twelve items long. 1.0.0 · Source § impl<T> PartialEq for Cell <T> where T: PartialEq + Copy , 1.70.0 · Source § impl<T> PartialEq for OnceCell <T> where T: PartialEq , 1.0.0 · Source § impl<T> PartialEq for RefCell <T> where T: PartialEq + ? Sized , Source § impl<T> PartialEq for PhantomContravariant <T> where T: ? Sized , Source § impl<T> PartialEq for PhantomCovariant <T> where T: ? Sized , 1.0.0 · Source § impl<T> PartialEq for PhantomData <T> where T: ? Sized , Source § impl<T> PartialEq for PhantomInvariant <T> where T: ? Sized , 1.21.0 · Source § impl<T> PartialEq for Discriminant <T> 1.20.0 · Source § impl<T> PartialEq for ManuallyDrop <T> where T: PartialEq + ? Sized , 1.28.0 (const: unstable ) · Source § impl<T> PartialEq for NonZero <T> where T: ZeroablePrimitive + PartialEq , 1.74.0 · Source § impl<T> PartialEq for Saturating <T> where T: PartialEq , 1.0.0 · Source § impl<T> PartialEq for Wrapping <T> where T: PartialEq , 1.25.0 · Source § impl<T> PartialEq for NonNull <T> where T: ? Sized , 1.19.0 (const: unstable ) · Source § impl<T> PartialEq for Reverse <T> where T: PartialEq , 1.0.0 · Source § impl<T, A> PartialEq for Box <T, A> where T: PartialEq + ? Sized , A: Allocator , 1.0.0 · Source § impl<T, A> PartialEq for BTreeSet <T, A> where T: PartialEq , A: Allocator + Clone , 1.0.0 · Source § impl<T, A> PartialEq for LinkedList <T, A> where T: PartialEq , A: Allocator , 1.0.0 · Source § impl<T, A> PartialEq for VecDeque <T, A> where T: PartialEq , A: Allocator , 1.0.0 · Source § impl<T, A> PartialEq for Rc <T, A> where T: PartialEq + ? Sized , A: Allocator , Source § impl<T, A> PartialEq for UniqueRc <T, A> where T: PartialEq + ? Sized , A: Allocator , 1.0.0 · Source § impl<T, A> PartialEq for Arc <T, A> where T: PartialEq + ? Sized , A: Allocator , Source § impl<T, A> PartialEq for UniqueArc <T, A> where T: PartialEq + ? Sized , A: Allocator , 1.0.0 (const: unstable ) · Source § impl<T, E> PartialEq for Result <T, E> where T: PartialEq , E: PartialEq , 1.0.0 · Source § impl<T, S> PartialEq for HashSet <T, S> where T: Eq + Hash , S: BuildHasher , 1.0.0 · Source § impl<T, U> PartialEq <& [U] > for Cow <'_, [T] > where T: PartialEq <U> + Clone , 1.0.0 · Source § impl<T, U> PartialEq <&mut [U] > for Cow <'_, [T] > where T: PartialEq <U> + Clone , 1.0.0 (const: unstable ) · Source § impl<T, U> PartialEq < [U] > for [T] where T: PartialEq <U>, Source § impl<T, U> PartialEq < Exclusive <U>> for Exclusive <T> where T: Sync + PartialEq <U> + ? Sized , U: Sync + ? Sized , 1.0.0 · Source § impl<T, U, A1, A2> PartialEq < Vec <U, A2>> for Vec <T, A1> where A1: Allocator , A2: Allocator , T: PartialEq <U>, 1.17.0 · Source § impl<T, U, A> PartialEq <& [U] > for VecDeque <T, A> where A: Allocator , T: PartialEq <U>, 1.0.0 · Source § impl<T, U, A> PartialEq <& [U] > for Vec <T, A> where A: Allocator , T: PartialEq <U>, 1.17.0 · Source § impl<T, U, A> PartialEq <&mut [U] > for VecDeque <T, A> where A: Allocator , T: PartialEq <U>, 1.0.0 · Source § impl<T, U, A> PartialEq <&mut [U] > for Vec <T, A> where A: Allocator , T: PartialEq <U>, 1.48.0 · Source § impl<T, U, A> PartialEq < [U] > for Vec <T, A> where A: Allocator , T: PartialEq <U>, 1.46.0 · Source § impl<T, U, A> PartialEq < Vec <U, A>> for & [T] where A: Allocator , T: PartialEq <U>, 1.46.0 · Source § impl<T, U, A> PartialEq < Vec <U, A>> for &mut [T] where A: Allocator , T: PartialEq <U>, 1.0.0 · Source § impl<T, U, A> PartialEq < Vec <U, A>> for Cow <'_, [T] > where A: Allocator , T: PartialEq <U> + Clone , 1.48.0 · Source § impl<T, U, A> PartialEq < Vec <U, A>> for [T] where A: Allocator , T: PartialEq <U>, 1.17.0 · Source § impl<T, U, A> PartialEq < Vec <U, A>> for VecDeque <T, A> where A: Allocator , T: PartialEq <U>, 1.17.0 · Source § impl<T, U, A, const N: usize > PartialEq <& [U; N] > for VecDeque <T, A> where A: Allocator , T: PartialEq <U>, 1.0.0 · Source § impl<T, U, A, const N: usize > PartialEq <& [U; N] > for Vec <T, A> where A: Allocator , T: PartialEq <U>, 1.17.0 · Source § impl<T, U, A, const N: usize > PartialEq <&mut [U; N] > for VecDeque <T, A> where A: Allocator , T: PartialEq <U>, 1.17.0 · Source § impl<T, U, A, const N: usize > PartialEq < [U; N] > for VecDeque <T, A> where A: Allocator , T: PartialEq <U>, 1.0.0 · Source § impl<T, U, A, const N: usize > PartialEq < [U; N] > for Vec <T, A> where A: Allocator , T: PartialEq <U>, 1.0.0 (const: unstable ) · Source § impl<T, U, const N: usize > PartialEq <& [U] > for [T; N] where T: PartialEq <U>, 1.0.0 (const: unstable ) · Source § impl<T, U, const N: usize > PartialEq <&mut [U] > for [T; N] where T: PartialEq <U>, 1.0.0 (const: unstable ) · Source § impl<T, U, const N: usize > PartialEq < [U; N] > for & [T] where T: PartialEq <U>, 1.0.0 (const: unstable ) · Source § impl<T, U, const N: usize > PartialEq < [U; N] > for &mut [T] where T: PartialEq <U>, 1.0.0 (const: unstable ) · Source § impl<T, U, const N: usize > PartialEq < [U; N] > for [T; N] where T: PartialEq <U>, 1.0.0 (const: unstable ) · Source § impl<T, U, const N: usize > PartialEq < [U; N] > for [T] where T: PartialEq <U>, 1.0.0 (const: unstable ) · Source § impl<T, U, const N: usize > PartialEq < [U] > for [T; N] where T: PartialEq <U>, Source § impl<T, const N: usize > PartialEq for Mask <T, N> where T: MaskElement + PartialEq , LaneCount <N>: SupportedLaneCount , Source § impl<T, const N: usize > PartialEq for Simd <T, N> where LaneCount <N>: SupportedLaneCount , T: SimdElement + PartialEq , Source § impl<T: PartialEq > PartialEq for SendTimeoutError <T> 1.0.0 · Source § impl<T: PartialEq > PartialEq for TrySendError <T> 1.0.0 · Source § impl<T: PartialEq > PartialEq for Cursor <T> 1.0.0 · Source § impl<T: PartialEq > PartialEq for SendError <T> 1.70.0 · Source § impl<T: PartialEq > PartialEq for OnceLock <T> Source § impl<Y, R> PartialEq for CoroutineState <Y, R> where Y: PartialEq , R: PartialEq , Source § impl<const N: usize > PartialEq <&[ u8 ; N ]> for ByteStr Source § impl<const N: usize > PartialEq <&[ u8 ; N ]> for ByteString Source § impl<const N: usize > PartialEq < ByteStr > for &[ u8 ; N ] Source § impl<const N: usize > PartialEq < ByteStr > for [ u8 ; N ] Source § impl<const N: usize > PartialEq < ByteString > for &[ u8 ; N ] Source § impl<const N: usize > PartialEq < ByteString > for [ u8 ; N ] Source § impl<const N: usize > PartialEq <[ u8 ; N ]> for ByteStr Source § impl<const N: usize > PartialEq <[ u8 ; N ]> for ByteString | 2026-01-13T09:29:14 |
https://ben.balter.com/2015/11/23/why-open-source/ | Why open source | Ben Balter Ben Balter Posts About Contact Technology leadership, collaboration, and open source Why open source TL;DR : Twenty five microeconomic , macroeconomic , moral , transparency , participatory , and personal motivations why you and your organization should consume, publish, contribute to, and support open source. 13 minute read Open source is awesome. There are many reasons why you might consider consuming, publishing, collaborating on, or supporting open source. 1 Here are a few of them: Microeconomic motivations Open source is in your best interest, whether you’re an individual, a corporation, a small business, a non-profit, or a government agency: Shift developers from low-value work to high-value work - We like to say in open source that all the easy problems have already been solved . Blogging, content management, and operating systems are all problems with established (and mainstream) open source solutions, to name a few. While your developers could spend their time reinventing wheels that the open source community have already perfected, it’s far preferable to use the worlds best wheel, especially when that wheel comes at no cost to you. This frees developers up to work on yet-unsolved challenges, the types of challenges that are unique to and add value to your organization’s mission. Why not stand on the shoulders of technology giants? Lower total cost of ownership (TCO) - Using open source software yields a lower total cost of ownership when compared to closed source and proprietary alternatives. Adopting open source software generally has a lower up-front cost (because the software often comes at no cost or relatively low cost), and shifts the cost center from licensing (an operating expense) to customization and implementation (a capital expense). Additional costs like training, maintenance, and support are sunk costs. You’re going to be paying for both regardless of if the software is open or closed source, the cost often being baked into the license in the case of commercial, off-the-shelf software (COTS). What makes open source unique is that you’re not paying for the right to use the underlying intellectual property. Cost Open source Proprietary Licensing Implementation Maintenance Support Given enough eyeballs, all bugs are shallow (Linus’s Law) - Empirically, open source tends to produce better quality software than its proprietary or alternative counterparts . When you write closed source software, the only developers that can potentially detect, diagnose, triage, and resolve software bugs are those that happen to be employed by the company that publishes the software (or more likely, the arms-length contractor they pay to build it). Open source provides three advantages: first, you have the opportunity to tap the knowledge of the world’s best developers, not just those on one organization’s payroll. Second, the number of potentially contributing developers and thus the potential knowledge pool is orders of magnitude larger. Finally, open source software gets adapted to a variety of use cases, not just the one the publisher originally intended, surfacing bugs and edge cases much more rapidly than traditional, predictive QA processes. Modern software development practices - Open source software is more than simply “published” code. You’d be hard-pressed to find an open source project that follows outdated, waterfall, or rigid command-and-control development philosophies, still common in many large, bureaucratic organizations. By virtue of being distributed and unbridled by policy or technical debt, open source projects all but necessitate modern software development workflows. These workflows are electronic (meaning process is naturally captured and exposed), asynchronous (meaning decisions are time and location agnostic), and lock-free (meaning contributors can rapidly experiment without prior approval). These three workflow characteristics means more rapid development cycles and more frequent releases without sacrificing quality. Open source is the future - You’d be hard pressed to find a startup today worth it’s venture capital funding not based, at least in part (if not largely) on open source. Open source isn’t a fad, or a bunch of hippies out in California passing around tie-dye laptops like they would illicit substances. Open source is how modern organizations, and increasingly more traditional organizations build software. It’s becoming exceedingly challenging to make the argument that five-or-ten years from now the technology landscape is going to be less collaborative and more closed. Heck, even Microsoft, traditionally one of the most stark opponents to open source , has open sourced their primary development framework (along with Apple and Swift ). Today, all the largest names in technology, from IBM , to SAP , to Adobe actively participate in the open source community. It’s slightly inaccurate to say that “open source is the future”. Open source has already won. Patch on your own schedule - So long as software is written by humans, bugs and security vulnerabilities are inevitable. When a vulnerability is discovered in a proprietary software project, you have to wait for the workday to begin in the company’s timezone, for meetings to be held, tasks delegated, and code written, all before G&A teams like legal, sales, and marketing have to coordinate how to get the fix into the next regularly scheduled release. For proprietary software, bugs and vulnerabilities affect the bottom line, and thus there’s a disincentive to make their details widely publicized. With open source, not only can leaner, more agile, non-profit-oriented organization move faster, since you have access to the source code, you can often apply fixes, both large and small, at your own convenience, not at the convenience of the publishing organization’s release cycle. Upstream improvements - If you consume open source software, it’s in your best interest to contribute back. Contributions can be in the form of reporting bugs, or even submitting proposed fixes. Since software is written by humans, it’s highly unlikely to be perfect, and even if so, likely doesn’t satisfy every use case. Rather than forking the project and implementing changes into your own version (closed source), submitting bug reports and improvements upstream (open source) allows you to more easily continue to benefit from the subsequent fixes and improvements submitted by others. GitHub Cofounder Tom Preston-Werner lays out some additional arguments in his post Open Source (Almost) Everything : Force multiplier - Open source is a force multiplier for your developers. This happens in three ways: First, when communities form around shared challenges, the diversity of ideas that naturally emerges surfaces better solutions than if the marketplace of ideas was limited to just your organization, meaning developers are working smarter. Second, exposing the problem space to other interested organizations provides additional human capital to tackle your challenge, meaning the solution has more developer hours thrown at it, at no additional cost to you. Finally, “more users means more use cases being explored, which means more robust code.” Modular - Open source projects tend to be more modularly architected, improving both the flexibility, and the robustness of the code. When you’re building software for a single use case, you’re able to take some technical short cuts. The problem comes when you’d like to use that software in a different use case, or when your requirements change. Open source, by its nature, is built for a variety of use cases, environments, and users. This means more options (rather than hardcoding defaults for a particular use), and a tendency to encourage more modularity (rather than assuming a one-size-fits-all feature set), resulting in greater flexibility and lower customization costs in the long run. Put another way, open source necessitates cleaner, more maintainable code. “Even internal code should pretend to be open source code” . Reduce duplication of effort - You should focus on your core competency. What makes you unique or gives you an advantage? Everything else is the work everyone else is also doing, or put another way, the work you need to do so that you can do the work that you want to do. It doesn’t have to be that way. Open source reduces duplication of efforts, both within an organization and across organizations, by allowing for individual components to be shared. Coca-Cola’s secret sauce is the formula for its syrup, not its ability publish blog posts or post press releases. Using an open source CMS, or sharing their built-in-house blog components with the world, doesn’t make Pepsi taste any better. “Less duplication means more work towards things that matter.” Great advertising - Maintainers of successful open source projects are often seen as industry leaders, providing themselves with the ability to shape the conversation around a particular software problem and associating their brand with the preferred solution. 37Signals is known for creating Ruby on Rails. GitHub is known for creating Hubot (“Within two days it had 500 watchers on GitHub and 409 upvotes on Hacker News. This translates into goodwill for GitHub and more superfans than ever before”). Attract talent - Developers want to work on yet-unsolved problems. Open source allows you to showcase to the developer community, the interesting challenges you face, and how you think about solving them. Open source developers can casually contribute to projects, to learn how you work, and what it’s like developing software for a particular set of challenges. If they like what they see, there’s a much better chance that they’ll apply for a job, than if your organization was a black box when it comes to what it’s like to work there. “Smart developers like to hang out with smart code.” Best technical interview possible - Technical interviews traditionally involve working on a simulated problem that can be tackled in a set amount of time with little additional context. Such simulations, by definition, aren’t real world use cases, nor do they show what working with an applicant would be like. Open source provides visibility into both how a candidate solves problems, and how they work with others. You can hire much more confidently if, for the past six months, the candidate has been contributing to the project you want them work on, and you like their work. “[T]he best technical interview possible is the one you don’t have to do because the candidate is already kicking ass on one of your open source projects.” Macroeconomic motivations By combining and augmenting parallel or related efforts, open source makes a society more efficient at producing higher quality software: Efficiency - Many of the Microeconomic arguments above, in the aggregate, have a macroeconomic impact. When firms work more efficiently, the economy produces more (and better) software, software that can in turn, improve lives. If you believe that all the easy problems have already been solved, then on a macroeconomic level, open source allows you to move firms from lower-level work to higher level, yet-unsolved challenges. The results of this higher level work tends to be disruptive, rather than iterative, creating the churn that invigorates the economy. If every technology company must devote a few years of R & D solving the same 5–10 problems, that delays (or at the very least shifts capital from) the company’s ability to be productive and produce technology that’s valuable to society, not to mention, it raises the barrier for new market entrants to offer alternatives to established firms. Stand on the shoulders of giants - Today, innovative technology, the type of technology that improves quality of life, isn’t created in a vacuum. Even closed source technology, from the cell phone in your pocket to the car you drive to the Fortune 500 company that produced them, rely heavily on open source (don’t believe me? Take a look at your phone’s “settings → about” page). Just as algebra and trigonometry being unencumbered by private sector copyright gave way to everything from calculus to quantum physics, open source allows developers to take already-solved problems as a given, to rely on the knowledge of experts beyond their own domain of expertise, and unlocks their potential to create new inventions, otherwise not possible. Fuel the marketplace of ideas - Software is nothing more than technical knowledge. There was once a time when alchemists would withhold the results of their work, claiming their discoveries as proprietary. Each had to learn the hard way the result on the human body of drinking lead. When those alchemists began sharing their work, we began calling them scientists, and the scientific revolution was born. The same is true of mathematics, literature, and computer software. Two developers working individually may come up with two solutions to a given problem, but through dialog and collaboration, each bringing their own knowledge and experience, may discover three, five, or ten solutions to the same, and society is better as a result. Moral motivations The formal name for open source is free/libre open source software . As such, open source motivations have a strong moral component: Free as in speech, not as in beer - Open source software is not without cost. When open source software is called “free”, it is a reference to the rights the software consumers receive, not the cost they must pay. Adobe’s Flash player, for example, is free software in the economic sense, but is still at the core of proprietary (non-free) software (and formats). Specifically, free software refers to four core freedoms : the freedom to run the software, the freedom to study and modify the software, the freedom to redistribute the software, and the freedom to distribute your modifications. As the Free Software Movement argues , non-free software risks software that can control the user (with the publisher controlling the software). This creates the potential for the software becoming an instrument of unjust power. Today, it’s not uncommon for proprietary software to spy on users (for example, phoning home), to restrict them (for example, DRM), to censor them (for example, corporate firewalls), or to take advantage of them (for example, unskippable commercials). This becomes even more important as the internet of things emerges, and risks turning the world into “the internet of telemarketers” or “the internet of snoopers”. Free software places power back in the hands of users and ensures users control the software they use, not the other way around. Obligation to give back - Open source is the give-a-penny-take-a-penny jar of software. If you consume open source, be it a server, a desktop publishing application, or a software library, you have an obligation to give back to the community. After all, without the contribution of others, the micro- and macroeconomic motivations would no longer hold true, and open source as we know it would cease to exist. This is the Golden Rule , or in traditional philosophical terms, a categorical imperative . Governments should give what they’ve developed to the people who pay for their development - If the development costs are paid by a government, then there’s an additional argument for giving back. Governments take money (taxes) to perform services for their populace. For example, the US federal government was established through its Constitution by we the people to perform a number of important tasks. If the populace (we the people) are paying for the development of software, it stands to reason that we should receive what we paid to develop, including the software we paid to develop. Teaching the next generation - Many of the industry’s most prominent engineers today cut their teeth by learning from open source. When software’s underlying code is made available for inspection, consumers can learn how their favorite software works and computer science courses can analyze how the industry’s cutting edge technology is built. This goes a long way to train the next generation of software engineers (who without open source would be left guessing at the inner-workings of prior iterations). Transparency motivations Open source allows for greater transparency of process, whether that’s the transparency necessary to check a government action or the quasi-governmental function of a private company’s software. Showing your work - As the government increasingly relies on technology to regulate industries and deliver citizen services, being able to see the underlying algorithms and processes are essential to checking the government’s work. If a closed-source software package is used to calculate my taxes or allocate broadcast frequencies, how do I know that the process, our process , is fair and accurate? Whereas human processes can’t be copyrighted, when close source, such processes become a black box, minimizing the potential for a citizen counterbalance. Positions of public trust - As the software produced by private corporations are increasingly placed in positions of public trust, the transparency obligation extends into the private sector as well. Did the voting machine accurately count my vote? When given a lose-lose choice, does the self-driving car conform to community norms? For example, if a closed-source software package is used to compare DNA at a crime scene, unlike a medical expert who can be cross examined, that proprietary algorithm is shielded from scrutiny by copyright (or patent) law. Open source, at least partial open source of particular components, will become essential as private companies automate quasi-government functions. Participatory motivations Open source affords software stakeholders, both technical and non-technical, the opportunity to shape any given software development project: Direct democracy - True direct democracy (where every citizen votes on every issue) isn’t tenable given the size of most democracies. Nor have citizen been able to participate directly in most issues, due to technical constraints. Open source changes that by allowing software stakeholders to participate directly in the software development process (as software is increasingly relied on to codify regulatory and service-delivery preferences and norms). Think the process of buying health care is confusing? Open an issue. Believe the government should use more open source, submit a pull request. The White House is already doing this for many IT-centric policies like the Digital Services Playbook, HTTPS, and open data policies. Customer feedback - Open source empowers consumers to have a combined, powerful voice in the private sector development process. Think of it like Yelp for software. Without Yelp, a restaurants is free to upset a single customer. At most, that dissatisfied patrons could dissuade 5–10 other potential patrons. In a post-Yelp world, customers read the reviews of strangers before they choose where to go. Open source amplifies the voice of software consumers within the consumer-publisher relationship. Not to mention, the feedback the private company receives can go towards better informing product decisions and improve the overall product. Open source gives companies a direct line to their most passionate customers. Personal motivations If you’re a developer (or an aspiring developer), open source can provide an easy (and free) onramp to and path for personal growth within the software development community: Learn to code - Open source is a great way to learn how to code. Want to know how your favorite site works? Hitting “view source” in your web browser can go a long way to point you in the right direction. You can read the documentation of the software that powers it, and potentially even stand up your own clone. Want to learn more? Join the local meetup for the framework or language. Better still, submit a pull request to the project to fix a small bug or add a new feature. While there are certainly time and opportunity costs involved, all of this comes without any direct cost to the aspiring developer, at least not in terms of software, and is infinitely more inclusive than doing the same within a proprietary community, especially as an outsider. There’s a reason nearly every coding school today outside traditional academia teaches open source. It’s fun - According to Wikipedia, open source is a hobby . In fact, open source has traditionally had the reputation of being the product of hobbyists (although I’d argue that’s less true today). Open source is fun. If you’re a hacker it provides an endless set of ever-changing set of Rubix cubes for you to solve on weekends. Just as puzzles (both crossword and jigsaw) provide bite-sized intellectual escapes, the order and symmetry of open source can often be a rock garden of code (especially for those for which football is an embarrassing non-starter). There are many reasons why you should prefer consuming, publishing, collaborating on, and supporting open source, and if yours isn’t listed here, I’d love to hear (and add) it. Whatever your reason, it’s clear open source isn’t the next big thing. Open source is already here. For a much longer, much more comprehensive, much more thoroughly researched list, I highly recommend David Wheeler’s canonical paper, “Why Open Source Software” , originally published some 15 years ago (and still very much accurate). ↩ Originally published November 23, 2015 | View revision history If you enjoyed this post, you might also enjoy: Open source, not just software anymore The missed opportunity that is the White House Open Source Policy Eight reasons why government contractors should embrace open source software Open source is (not) insecure A White House open source policy written by a geek Bringing open source workflows to the enterprise Five best practices in open source: internal collaboration Why isn't all government software open source? Why you shouldn't write your own open source license Five best practices in open source: external engagement Advice for managing open source communities at scale Ben Balter is the Director of Hubber Enablement within the Office of the COO at GitHub , the world’s largest software development platform, ensuring all Hubbers can do their best (remote) work. Previously, he served as the Director of Technical Business Operations, and as Chief of Staff for Security, he managed the office of the Chief Security Officer, improving overall business effectiveness of the Security organization through portfolio management, strategy, planning, culture, and values. As a Staff Technical Program manager for Enterprise and Compliance, Ben managed GitHub’s on-premises and SaaS enterprise offerings, and as the Senior Product Manager overseeing the platform’s Trust and Safety efforts, Ben shipped more than 500 features in support of community management, privacy, compliance, content moderation, product security, platform health, and open source workflows to ensure the GitHub community and platform remained safe, secure, and welcoming for all software developers. Before joining GitHub’s Product team, Ben served as GitHub’s Government Evangelist, leading the efforts to encourage more than 2,000 government organizations across 75 countries to adopt open source philosophies for code, data, and policy development. More about the author → This page is open source. Please help improve it . Edit Other recommended reading Fine Print | 2026-01-13T09:29:14 |
https://es-la.facebook.com/reg/?entry_point=login&amp%3Bnext=https%3A%2F%2Fwww.facebook.com%2Fshare_channel%2F%3Ftype%3Dreshare%26link%3Dhttps%253A%252F%252Fdev.to%252Ftauri%252Ftauri-10-release-candidate-53jk%26app_id%3D966242223397117%26source_surface%3Dexternal_reshare%26display%26hashtag | Facebook Explora lo que más te gusta . Iniciar sesión en Facebook Correo electrónico o número de celular Contraseña Iniciar sesión ¿Olvidaste tu contraseña? Crear cuenta nueva Español 한국어 English (US) Tiếng Việt Bahasa Indonesia ภาษาไทย 中文(简体) Más idiomas… Registrarte Iniciar sesión Messenger Facebook Lite Video Meta Pay Tienda de Meta Meta Quest Ray-Ban Meta Meta AI Más contenido de Meta AI Instagram Threads Centro de información de votación Política de privacidad Centro de privacidad Información Crear anuncio Crear página Desarrolladores Empleo Cookies Opciones de anuncios Condiciones Ayuda Importación de contactos y no usuarios Meta © 2026 | 2026-01-13T09:29:14 |
http://creativecommons.org/licenses/by/4.0/legalcode.ko | 이용허락규약 - 저작자표시 4.0 국제 - Creative Commons Skip to content Creative Commons Menu Who We Are What We Do Licenses and Tools Blog Support Us Languages available Bahasa Indonesia Basque dansk Deutsch eesti English español français frysk Hrvatski italiano latviešu Lietuviškai Māori Nederlands norsk polski Português Română Slovensky Slovenščina suomi svenska Türkçe česky Ελληνικά Русский Українська العربيّة 日本語 简体中文 繁體中文 한국어 Search Donate Explore CC Global Network Join a global community working to strengthen the Commons Certificate Become an expert in creating and engaging with openly licensed materials Global Summit Attend our annual event, promoting the power of open licensing Chooser Get help choosing the appropriate license for your work Search Portal Find engines to search openly licensed material for creative and educational reuse Open Source Help us build products that maximize creativity and innovation Help us protect the commons. Make a tax deductible gift to fund our work. Donate today! 저작자표시 4.0 국제 CC BY 4.0 이용허락규약 저작자표시 4.0 국제 1조 - 정의. 2조 - 범위. 3조 – 라이선스의 조건. 4조 - 데이터베이스권. 5조 - 면책 및 책임 한계의 고지. 6조 - 기간과 종료. 7조 – 기타 조건. 8조 – 해석. Canonical URL https://creativecommons.org/licenses/by/4.0/ Other formats Plain Text RDF/XML See the deed Version 4.0 • See the errata page for any corrections and the date of change About the license and Creative Commons ‘크리에이티브 커먼즈(Creative Commons)’는 법률사무소가 아니며 법률 서비스나 법률 자문을 제공하지 않습니다. 크리에이티브 커먼즈 공중 라이선스의 배포가 법률 서비스를 의미하는 것은 아니며, 단지 라이선스 및 관련 정보를 있는 그대로 제공할 뿐입니다. ‘크리에이티브 커먼즈’는 라이선스, 이용허락된 모든 저작물, 또는 모든 관련 정보에 대하여 어떠한 보증도 하지 않습니다. ‘크리에이티브 커먼즈'는 그 이용으로 인하여 야기되는 손해에 대하여 어떠한 책임도 부담하지 않습니다. 크리에이티브 커먼즈 공중 라이선스의 사용 크리에이티브 커먼즈 공중 라이선스는 창작자와 그 밖의 권리자가 아래의 공중 라이선스에 명시된 저작권과 그 밖의 특정 권리들에 의하여 보호되는 독창적인 창작물 및 그 밖의 저작물을 공유하기 위하여 사용할 수 있는 일련의 표준 약관을 제공합니다. 아래의 유의사항은 정보 제공 목적으로 제공되는 것일 뿐 그에 한정되지 않으며, 라이선스의 내용이 되는 것도 아닙니다. 이용허락자 유의사항 크리에이티브 커먼즈 공중 라이선스는 저작권 및 기타 특정 권리의 보호를 받는 저작물을 공중이 이용할 수 있도록 허락할 권한이 있는 자만 적용할 수 있습니다. 크리에이티브 커먼즈 공중 라이선스는 철회가 불가능하므로 적용하기 전에 선택하고자 하는 라이선스의 조건을 꼼꼼히 읽고 이해하여야 합니다. 공중이 해당 저작물을 허락받은 대로 재사용할 수 있도록 이용허락에 필요한 모든 권리를 보유해야 합니다. 다른 CC 라이선스가 적용되었거나 저작권의 제한 또는 예외 조건에 따라 사용되는 저작물 등, 해당 크리에이티브 커먼즈 라이선스가 적용되지 않는 대상을 명확하게 표시하여야 합니다. 자세한 이용허락자 유의사항 보기. 이용시 유의사항 크리에이티브 커먼즈 공중 라이선스 중 하나를 적용함으로써 이용허락자는 자신의 저작물을 일정한 조건에 따라 누구든지 이용하도록 허락합니다. 만일 저작권의 예외 또는 제한 사유 등에 해당하여 이용허락을 받을 필요가 없는 경우에는 크리에이티브 커먼즈 라이선스가 적용되지 않습니다. 크리에이티브 커먼즈 라이선스는 이용허락자가 허락할 권한을 갖는 저작권 또는 그 밖의 특정 권리에 대해서만 효력이 있습니다. 해당 저작물에 대해 타인이 저작권 또는 그 밖의 권리를 갖는 등의 다른 사유가 있을 경우에는 이용이 제한될 수 있습니다. 이용허락자는 모든 변경 사항의 표시나 기재 등 특별한 요청을 할 수도 있습니다. 크리에이티브 커먼즈 공중 라이선스에 규정된 것이 아니라 하더라도 합리적인 요청일 경우 존중해 주시기 바랍니다. 자세한 이용자 유의사항 보기. 저작자표시 4.0 국제 귀하는, 아래에 정의된 이용허락된 권리를 행사함으로써, 본 크리에이티브 커먼즈 저작자표시 4.0 국제 공중 라이선스(이하 ‘공중 라이선스’)의 조건을 수용하고 이에 동의한 것으로 됩니다. 본 공중 라이선스가 계약으로 해석될 수 있는 범위 내에서, 귀하는 본 공중 라이선스의 조건을 수용함으로써 이용허락된 권리를 부여받게 되며, 이용허락자는 본 조건에 따른 이용허락으로 얻게 되는 이익을 고려해서 귀하에게 그러한 권리를 부여하게 됩니다. 1조 - 정의. 2차적저작물 은 이용허락된 저작물에서 파생된 또는 그에 기초하여 제작되어 저작권 및 유사 권리의 적용을 받는 저작물로서, 원저작물을 번역, 변경, 편곡, 변형하거나 그 밖에 이용허락자의 저작권 및 유사 권리에 따른 허락이 필요한 방식으로 수정한 경우를 의미합니다. 본 공중 라이선스의 목적상, 이용허락된 저작물이 음악 저작물, 실연, 음원인 경우, 이를 동영상과 동기화하는 것은 2차적저작물을 작성한 것으로 간주합니다. 2차 저작자 라이선스 는 귀하가 2차적저작물의 작성으로 기여 부분에 대해 취득한 저작권 및 유사 권리에 대하여 본 공중 라이선스의 조건에 따라 적용하는 라이선스를 의미합니다. 저작권 및 유사 권리 는 저작권 또는 그 명칭이나 분류에 관계없이 실연, 방송, 음원, 데이터베이스권 등 저작권과 밀접한 관련이 있는 일체의 권리를 의미합니다. 본 공중 라이선스의 목적상, 2(b)(1)~(2) 호에 명시된 권리는 저작권 및 유사 권리에 해당하지 않습니다. 효과적인 기술조치 는 1996년 12월 20일 채택된 WIPO 저작권 조약 11조 또는 이와 유사한 국제 협약에 따라 제정된 법률로 그 무력화가 금지되는 기술조치를 의미합니다. 예외와 제한 은 공정이용, 공정거래, 기타 저작물을 자유롭게 이용할 수 있는 저작권 및 유사 권리에 대한 예외 및 제한사유를 의미합니다. 이용허락된 저작물 은 이용허락자가 본 공중 라이선스를 적용한 예술 또는 어문 저작물, 데이터베이스 및 그 밖의 저작물을 의미합니다. 이용허락된 권리 는 본 공중 라이선스에 따라 귀하에게 부여된 권리로서, 저작물 이용에 필요한 모든 저작권 및 유사 권리 중 이용허락자가 라이선스를 부여할 권한을 갖는 저작권 및 유사 권리를 의미합니다. 이용허락자 는 본 공중 라이선스에 따른 권리를 부여하는 개인 또는 단체를 의미합니다. 공유 는 복제, 전시, 공연, 배포, 방송, 송신, 수입 등 이용허락된 권리에 따른 허락이 필요한 일체의 수단이나 과정을 통해 저작물 등을 공중에게 제공하거나, 공중의 구성원이 개별적으로 선택한 장소와 시간에서 해당 저작물 등에 접근할 수 있도록 하는 등 저작물 등을 공중이 이용할 수 있도록 하는 것을 의미합니다. 데이터베이스권 은 저작권 외의 권리로서 데이터베이스의 법적 보호에 관한 1996년 3월 11일 EU 의회와 EU 위원회의 96/9/EC 지침과 그 이후의 개정 및 승계에서 정의된 권리 및 그 밖에 각국에서 인정된 이와 본질적으로 동일한 권리들을 의미합니다. 귀하 는 본 공중 라이선스에 따라 이용허락된 권리를 행사하는 개인 또는 주체를 의미합니다. 귀하의 는 그에 상응하는 의미를 갖습니다. 2조 - 범위. 라이선스의 부여 . 본 공중 이용허락의 조건에 따라, 이용허락자는 이용허락된 저작물을 다음과 같은 방법으로 이용할 수 있는 전세계적이고, 무료의, 재이용허락이 금지된, 비독점적이고 철회 불가능한 라이선스를 귀하에게 부여합니다. 이용허락된 저작물의 전체 또는 부분의 복제 및 공유 2차적저작물의 작성, 복제 및 공유 예외와 제한 . 예외와 제한에 해당하는 이용에 대해서는 본 공중 라이선스는 적용되지 아니하며, 따라서 귀하는 본 라이선스의 조건을 따르지 않아도 됩니다. 조건 . 본 공중 라이선스의 조건은 6(a) 항에 명시되어 있습니다. 매체와 형식, 허용되는 기술적 변경 . 귀하는 현재 알려져 있거나 장래 개발되는 모든 매체와 포맷으로 이용허락된 권리를 행사할 수 있으며, 그에 필요한 기술적 수정을 할 수 있습니다. 이용허락자는, 효과적인 기술조치를 우회하기 위한 기술적 수정을 포함하여, 이용허락된 권리 행사에 필요한 기술적 수정을 금지할 수 있는 권리나 권한을 포기 또는 행사하지 않는 것에 동의합니다. 본 공중 라이선스의 목적상, 2(a)(4) 호에 따른 수정은 2차적저작물 작성에 해당하지 않는 것으로 봅니다. 하위 이용자 . 이용허락자의 허가 – 이용허락된 저작물 . 이용허락된 저작물을 제공받는 모든 이용자는 본 공중 이용허락의 조건에 따라 이용허락된 권리를 행사할 수 있습니다. 이용제한의 부가 금지 . 귀하는 이용허락된 저작물에 조건을 추가하거나 다른 조건을 부과하여, 또는 효과적인 기술적 조치를 적용함으로써 이용허락된 저작물을 제공받는 하위 이용자의 이용허락된 권리 행사를 제한할 수 없습니다. 보증 부인 . 본 공중 이용허락의 어떠한 요소도 귀하 또는 귀하에 의한 이용허락된 저작물의 이용이 이용허락자 또는 그 밖에 3(a)(1)(A)(i) 에 따라 저작자로 지정된 자와 어떠한 관계가 있다거나 그로부터 후원, 보증 또는 공식적 지위를 부여받은 것으로 주장 또는 암시할 수 있도록 허락한 바 없으며, 그렇게 해석되어서도 안 됩니다. 기타 권리 . 동일성유지권과 같은 저작인격권, 퍼블리시티권, 프라이버시권, 기타 유사한 인격권에는 본 공중 라이선스가 적용되지 않습니다. 그러나 법적으로 가능한 범위 내에서, 이용허락자는 귀하가 이용허락된 권리를 행사할 수 있도록 자신이 보유한 위 권리들을 포기하거나 행사하지 않는 것에 동의합니다. 특허권과 상표권에는 본 공중 라이선스가 적용되지 않습니다. 이용허락자는, 법적으로 가능한 범위 내에서, 본 라이선스에 따른 이용에 대해서는 직접, 혹은 자발적이거나 포기가능한 법정허락 또는 강제허락 제도에 따라 신탁관리단체를 통해 이용료를 징수할 수 있는 일체의 권리를 포기합니다. 이용허락자는 다른 모든 이용에 대해서는 그러한 이용료를 징수할 권리를 명 시적으로 유보합니다. 3조 – 라이선스의 조건. 귀하는 이용허락된 권리를 행사할 경우 다음의 조건들을 준수해야 합니다. 저작자표시 . 이용허락된 저작물(변경된 경우 포함)을 공유하는 경우 다음 조건들을 준수해야 합니다. 이용허락된 저작물과 함께 다음의 정보들이 제공된 경우 이를 표시해야 합니다. 이용허락자가 요청한 합리적 방식에 따른, 이용허락된 저작물의 창작자와 그 밖에 저작자로 지정된 자의 표시(가명이 지정된 경우 포함) 저작권 고지 본 공중 라이선스에 대한 고지 면책 고지 합리적으로 실행가능한 범위 내에서, 이용허락된 저작물에 대한 URI 또는 하이퍼링크 이용허락된 저작물을 변경하였는지 여부를 밝히고 이전의 변경 내용에 대한 표시를 유지해야 합니다. 이용허락된 저작물이 본 공중 라이선스에 따라 이용허락되었음을 표시하고, 본 공중 라이선스의 내용 또는 내용을 확인할 수 있는 URI 내지 하이퍼링크를 표시해야 합니다. 귀하는 이용허락된 저작물이 공유되는 매체, 방법, 상황에 기초한 합리적인 방법으로 3(a)(1) 호의 조건을 충족할 수 있습니다. 예를 들어, 요구되는 정보가 포함된 URI이나 하이퍼링크를 제공하는 것은 조건 충족을 위한 합리적인 방법이 될 수 있습니다. 이용허락자의 요청이 있을 경우, 귀하는 3(a)(1)(A) 에 따라 요구되는 모든 정보를 합리적으로 실행가능한 범위 내에서 제거해야 합니다. 귀하가 작성한 2차적저작물을 공유하는 경우, 귀하가 적용하는 2차 저작자 라이선스로 인해 해당 2차적저작물의 이용자가 본 공중 라이선스를 따르지 못하게 되어서는 안 됩니다. 4조 - 데이터베이스권. 이용허락된 권리가 이용허락된 저작물의 사용에 적용되는 데이터베이스권을 포함할 경우 다음이 적용됩니다. 제 2(a)(1) 호에 따라 귀하는 데이터베이스의 전체 혹은 상당 부분을 추출, 재사용, 복제, 공유할 권리를 가집니다. 데이터베이스의 전체 혹은 상당 부분을 귀하가 데이터베이스권을 갖는 다른 데이터 베이스에 포함할 경우, 귀하가 데이터베이스권을 갖는 데이터베이스(개별 구성물은 아님)는 2차적저작물에 해당합니다. 데이터베이스의 전부 혹은 상당 부분을 공유할 경우 귀하는 반드시 3(a) 항의 조건을 준수해야 합니다. 4 조는 이용허락된 권리가 다른 저작권과 그 밖의 유사 권리를 포함하는 본 공중 라이선스에 따른 귀하의 의무를 보완할 뿐 대체하지 않습니다. 5조 - 면책 및 책임 한계의 고지. 이용허락자가 별도로 달리 정하지 않는 한, 가능한 범위 내에서, 이용허락자는 이용허락된 저작물을 있는 그대로 제공하며, 이용허락된 저작물에 관하여 명시적, 묵시적, 법적 또는 그 밖의 어떠한 방식으로도 일체의 표시나 보증을 하지 않습니다. 여기에는 제목, 상품성, 특정 목적 부합성, 비침해, 잠재적 혹은 그 밖의 결함의 부재, 정확성, 이미 알려져 있거나 밝힐 수 있는 오류의 존재 여부에 대한 보증 등이 포함됩니다. 면책 고지의 전부 혹은 일부가 허용되지 않는 경우에는, 본 면책 고지는 귀하에게 적용되지 않을 수 있습니다. 가능한 범위 내에서, 이용허락자는 어떠한 법 이론(과실책임 등)이나 기타 근거에 의하여도 본 공중 라이선스 또는 이용허락된 저작물의 사용으로부터 발생하는 직접적, 특수한, 간접적, 결과적, 징벌적, 예시적, 또는 그 밖의 손실, 비용, 손해에 대하여 일체의 책임을 지지 않습니다. 설사 그러한 손실, 비용, 손해의 발생 가능성에 대하여 통지받은 경우라 하더라도 책임이 없습니다. 책임제한이 전부 혹은 일부 허용되지 않는 경우에는, 본 제한 조항은 귀하에게 적용되지 않을 수 있습니다. 위에 명시된 면책 및 책임제한은, 가능한 범위 내에서, 절대적 면책 또는 모든 책임의 면제와 거의 같은 방식으로 해석되어야 합니다. 6조 - 기간과 종료. 본 공중 라이선스는 이용허락된 저작권 및 유사 권리의 보호 기간 동안 적용됩니다. 그러나 본 공중 라이선스를 위반할 경우, 본 공중 라이선스에 따른 귀하의 권리는 자동으로 소멸됩니다. 다음 각 경우에는 6(a)항에 따라 소멸된 귀하의 권리가 다시 회복됩니다. 귀하가 위반을 인지한지 30일 이내에 위반 행위가 치유된 경우 자동으로 회복됩니다. 이용허락자에 의한 명시적 복권이 있을 경우 회복됩니다. 6(b) 항은 본 공중 라이선스의 위반에 따라 이용허락자가 갖는 구제수단에 대한 권리에 아무런 영향을 주지 않습니다. 이용허락자는 이용허락된 저작물을 별도의 조건에 따라 제공할 수 있고, 이용허락된 저작물의 배포를 언제든 중지할 수도 있습니다. 그러나 그렇게 하더라도 본 공중 라이선스는 종료되지 않습니다. 1 , 5 , 6 , 7 , 8 조는 본 공중 라이선스가 종료되더라도 효력을 갖습니다. 7조 – 기타 조건. 명시적 동의가 없을 경우, 이용허락자는 귀하가 제시한 추가 조건이나 다른 조건에 구속되지 않습니다. 이용허락된 저작물에 관하여 본 라이선스에 언급되지 않은 협의, 합의, 동의는 본 공중 라이선스의 조건과는 별개의 독립적인 것입니다. 8조 – 해석. 본 공중 라이선스는 본 공중 라이선스에 의하지 않고 합법적으로 이루어질 수 있는 저작물의 이용을 축소, 제한, 제약하거나 조건을 부과하는 것으로 해석되지 않으며 해석되어서도 안됩니다. 가능한 범위 내에서, 본 공중 라이선스의 특정 조항이 실행될 수 없는 경우, 해당 조항은 실행가능하도록 하기 위해 필요한 최소한의 범위 내에서 자동으로 개정됩니다. 개정이 불가능한 경우에는 해당 조항은 본 공중 라이선스로부터 제거되며, 나머지 조항은 아무런 영향을 받지 않습니다. 본 공중 라이선스의 조건은 면제되지 않으며, 조건을 준수하지 않은 경우라 하더라도 이용허락자에 의한 명시적 동의가 없을 경우 동의하는 것으로 간주되지 않습니다. 본 공중 라이선스의 어떠한 조항도 이용허락자나 귀하에게 적용되는 관할국가의 법적 절차에서 인정되는 것을 포함한 모든 특권과 면책에 대한 제한 또는 포기를 의미하지 않으며 그렇게 해석될 수 없습니다. About Creative Commons 크리에이티브 커먼즈는 공중 라이선스의 당사자가 아닙니다. 다만 크리에이티브 커먼즈도 자신이 출판한 저작물에 크리에이티브 커먼즈 공중 라이선스 중 하나를 적용할 수 있으며 그런 경우에는 ‘이용허락자’로 취급됩니다. 크리에이티브 커먼즈 공중 라이선스의 텍스트는 CC0 퍼블릭 도메인 기증 에 따라 퍼블릭 도메인에 기증되었습니다. 크리에이티브 커먼즈는, 크리에이티브 커먼즈 공중 라이선스에 따라 저작물이 공유되거나 creativecommons.org/policies 에 공표된 크리에이티브 커먼즈 정책에 의해서 허가되었음을 나타내는 제한된 목적 외에는, 사전에 서면동의를 받지 않는 한, 이용허락된 저작물의 이용에 관한 공중 라이선스 또는 합의, 이해 또는 동의에 대한 임의적인 변경과 관련된 경우를 포함한 모든 경우에 있어서, ‘Creative Commons’ 상표 또는 크리에이티브 커먼즈의 다른 상표나 로고의 이용을 허락하지 않습니다. 본 문구는 공중 라이선스의 일부를 구성하지 않습니다. 크리에이티브 커먼즈 관련 문의는 creativecommons.org 를 통해 할 수 있습니다. Creative Commons is the nonprofit behind the open licenses and other legal tools that allow creators to share their work. Our legal tools are free to use. Learn more about our work Learn more about CC Licensing Support our work Use the license for your own material. Licenses List Public Domain List Creative Commons Contact Newsletter Privacy Policies Terms Contact Us Creative Commons PO Box 1866, Mountain View, CA 94042 info@creativecommons.org +1-415-429-6753 Instagram --> Bluesky Mastodon LinkedIn Subscribe to our Newsletter Support Our Work Our work relies on you! Help us keep the Internet free and open. Donate Now Except where otherwise noted , content on this site is licensed under a Creative Commons Attribution 4.0 International license . Icons by Font Awesome . | 2026-01-13T09:29:14 |
https://www.facebook.com/login/?next=https%3A%2F%2Fl.facebook.com%2Fl.php%3Fu%3Dhttps%253A%252F%252Fwww.instagram.com%252F%26amp%253Bh%3DAT1v_OJQfV5Zcu-cblOHFXfPicMkZBPGWKUMR8y2VtHCkhFimX0DXmuO_lS7lSOvuxvJGvNENLC3hXctnK0aEhIreuGRGjRkAY5nzNTCCWlumoLGOzuQm7GYuIQhI_WWXvHN-cB9_Akw-iZt | Facebook 취향 저격 콘텐츠를 만나는 곳 Facebook에 로그인 이메일 또는 휴대폰 번호 비밀번호 로그인 비밀번호를 잊으셨나요? 새 계정 만들기 한국어 English (US) Tiếng Việt Bahasa Indonesia ภาษาไทย Español 中文(简体) 언어 더 보기... 가입하기 로그인 Messenger Facebook Lite 동영상 Meta Pay Meta 스토어 Meta Quest Ray-Ban Meta Meta AI Meta AI 콘텐츠 더 보기 Instagram Threads 투표 정보 센터 개인정보처리방침 개인정보 보호 센터 정보 광고 만들기 페이지 만들기 개발자 채용 정보 쿠키 AdChoices 약관 고객 센터 연락처 업로드 및 비사용자 Meta © 2026 | 2026-01-13T09:29:14 |
https://www.linkedin.com/products/cloudflare-ssl-tls/ | Cloudflare SSL / TLS | LinkedIn Skip to main content LinkedIn Cloudflare in Asan Expand search This button displays the currently selected search type. When expanded it provides a list of search options that will switch the search inputs to match the current selection. Jobs People Learning Clear text Clear text Clear text Clear text Clear text Join now Sign in Cloudflare SSL / TLS SSL Certificates Software by Cloudflare See who's skilled in this Add as skill Learn more Report this product About Encrypting as much web traffic as possible to prevent data theft and other tampering is a critical step toward building a safer, better Internet. We’re proud to be the first Internet performance and security company to offer SSL protection free of charge. Media Products media viewer No more previous content Getting Started Quickly: Security Overview Cloudflare offers world-class security solutions that are easy to use. This video gives viewers the basics of HTTP and HTTPS and shows them how to quickly secure and protect their site using the Cloudflare SSL/TLS tab. No more next content Featured customers of Cloudflare SSL / TLS Maropost Commerce Cloud Software Development 3,187 followers Quintype Technologies Inc. Software Development 32,538 followers RaiseDonors Software Development 244 followers Similar products DigiCert Enterprise PKI Manager DigiCert Enterprise PKI Manager SSL Certificates Software IONOS SSL Certificates IONOS SSL Certificates SSL Certificates Software DigiCert Secure Site Pro SSL DigiCert Secure Site Pro SSL SSL Certificates Software Certificate Management Certificate Management SSL Certificates Software DigiCert SSL/TLS Certificates Listing DigiCert SSL/TLS Certificates Listing SSL Certificates Software Sectigo EV SSL Certificates Sectigo EV SSL Certificates SSL Certificates Software Sign in to see more Show more Show less Cloudflare products Argo Smart Routing Argo Smart Routing Network Management Software Cloudflare DDoS Protection Cloudflare DDoS Protection DDoS Protection Software Cloudflare DNS Cloudflare DNS Managed DNS Services Software Cloudflare Load Balancing Cloudflare Load Balancing Load Balancing Software Cloudflare Registrar Cloudflare Registrar Managed DNS Services Software Cloudflare Spectrum Cloudflare Spectrum DDoS Protection Software Cloudflare WAF Cloudflare WAF Web Application Firewalls (WAF) Cloudflare Web Analytics Cloudflare Web Analytics Digital Analytics Software Cloudflare Workers Cloudflare Workers Server Virtualization Software Show more Show less LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines English (English) Language | 2026-01-13T09:29:14 |
https://www.linkedin.com/products/cloudflare-argo-smart-routing/ | Argo Smart Routing | LinkedIn Skip to main content LinkedIn Cloudflare in Asan Expand search This button displays the currently selected search type. When expanded it provides a list of search options that will switch the search inputs to match the current selection. Jobs People Learning Clear text Clear text Clear text Clear text Clear text Join now Sign in Argo Smart Routing Network Management Software by Cloudflare See who's skilled in this Add as skill Contact us Report this product About The public Internet does its best to deliver your content — but it can’t account for network congestion, leading to slow load times and a degraded end-user experience. The Cloudflare network is different. It routes over 10 trillion global requests per month — providing Argo Smart Routing with a unique vantage point to detect real-time congestion and route web traffic across the fastest and most reliable network paths. On average, web assets perform 30% faster. This product is intended for Engineering Manager Vice President of Engineering Media Products media viewer No more previous content How Cloudflare finds the fastest Internet paths for application traffic With the all-new Cloudflare for Teams dashboard, you can manage security policies for your people, network, and devices, all in one place. This demo will show you how to set up Cloudflare Access and Cloudflare Gateway to protect your internal applications and the corporate network. To learn more about Cloudflare for Teams, visit https://teams.cloudflare.com Dynamic Content Delivery Almost half of the online consumers will abandon a page that takes more than 2 seconds to load End-user experience needs to be immersive, interactive, and real-time – regardless of their location, device, or current network conditions. No more next content Featured customers of Argo Smart Routing Zendesk Software Development 648,235 followers Discord Software Development 467,975 followers Panagora Strategic Management Services 2,451 followers Similar products LG Electronics Private Network Solutions LG Electronics Private Network Solutions Network Management Software Juniper Sky Enterprise Juniper Sky Enterprise Network Management Software A2P SMS A2P SMS Network Management Software Network 360 Network 360 Network Management Software Progress WhatsUp Gold Progress WhatsUp Gold Network Management Software Entuity Entuity Network Management Software Sign in to see more Show more Show less Cloudflare products Cloudflare DDoS Protection Cloudflare DDoS Protection DDoS Protection Software Cloudflare DNS Cloudflare DNS Managed DNS Services Software Cloudflare Load Balancing Cloudflare Load Balancing Load Balancing Software Cloudflare Registrar Cloudflare Registrar Managed DNS Services Software Cloudflare Spectrum Cloudflare Spectrum DDoS Protection Software Cloudflare SSL / TLS Cloudflare SSL / TLS SSL Certificates Software Cloudflare WAF Cloudflare WAF Web Application Firewalls (WAF) Cloudflare Web Analytics Cloudflare Web Analytics Digital Analytics Software Cloudflare Workers Cloudflare Workers Server Virtualization Software Show more Show less LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines English (English) Language | 2026-01-13T09:29:14 |
https://docs.serde.rs/serde/trait.Deserialize.html | Deserialize in serde - Rust Docs.rs serde-1.0.228 serde 1.0.228 Permalink Docs.rs crate page MIT OR Apache-2.0 Links Homepage Repository crates.io Source Owners dtolnay github:serde-rs:publish Dependencies serde_core =1.0.228 normal serde_derive ^1 normal optional Versions 100% of the crate is documented Platform x86_64-unknown-linux-gnu Feature flags docs.rs About docs.rs Badges Builds Metadata Shorthand URLs Download Rustdoc JSON Build queue Privacy policy Rust Rust website The Book Standard Library API Reference Rust by Example The Cargo Guide Clippy Documentation This old browser is unsupported and will most likely display funky things. Deserialize serde 1.0.228 Deserialize Sections Lifetime Required Methods deserialize Implementations on Foreign Types ! &'a Path &'a [u8] &'a str () (T,) Arc<T> ArcWeak<T> AtomicBool AtomicI8 AtomicI16 AtomicI32 AtomicI64 AtomicIsize AtomicU8 AtomicU16 AtomicU32 AtomicU64 AtomicUsize BTreeMap<K, V> BTreeSet<T> BinaryHeap<T> Bound<T> Box<CStr> Box<OsStr> Box<Path> Box<T> Box<[T]> Box<str> CString Cell<T> Cow<'a, T> Duration HashMap<K, V, S> HashSet<T, S> IpAddr Ipv4Addr Ipv6Addr LinkedList<T> Mutex<T> NonZeroI8 NonZeroI16 NonZeroI32 NonZeroI64 NonZeroI128 NonZeroIsize NonZeroU8 NonZeroU16 NonZeroU32 NonZeroU64 NonZeroU128 NonZeroUsize Option<T> OsString PathBuf PhantomData<T> Range<Idx> RangeFrom<Idx> RangeInclusive<Idx> RangeTo<Idx> Rc<T> RcWeak<T> RefCell<T> Reverse<T> RwLock<T> Saturating<i8> Saturating<i16> Saturating<i32> Saturating<i64> Saturating<i128> Saturating<isize> Saturating<u8> Saturating<u16> Saturating<u32> Saturating<u64> Saturating<u128> Saturating<usize> SocketAddr SocketAddrV4 SocketAddrV6 String SystemTime Vec<T> VecDeque<T> Wrapping<T> [T; 0] [T; 1] [T; 2] [T; 3] [T; 4] [T; 5] [T; 6] [T; 7] [T; 8] [T; 9] [T; 10] [T; 11] [T; 12] [T; 13] [T; 14] [T; 15] [T; 16] [T; 17] [T; 18] [T; 19] [T; 20] [T; 21] [T; 22] [T; 23] [T; 24] [T; 25] [T; 26] [T; 27] [T; 28] [T; 29] [T; 30] [T; 31] [T; 32] bool char f32 f64 i8 i16 i32 i64 i128 isize u8 u16 u32 u64 u128 usize Dyn Compatibility Implementors In crate serde serde Trait Deserialize Copy item path Source pub trait Deserialize<'de>: Sized { // Required method fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de> ; } Expand description A data structure that can be deserialized from any data format supported by Serde. Serde provides Deserialize implementations for many Rust primitive and standard library types. The complete list is here . All of these can be deserialized using Serde out of the box. Additionally, Serde provides a procedural macro called serde_derive to automatically generate Deserialize implementations for structs and enums in your program. See the derive section of the manual for how to use this. In rare cases it may be necessary to implement Deserialize manually for some type in your program. See the Implementing Deserialize section of the manual for more about this. Third-party crates may provide Deserialize implementations for types that they expose. For example the linked-hash-map crate provides a LinkedHashMap<K, V> type that is deserializable by Serde because the crate provides an implementation of Deserialize for it. § Lifetime The 'de lifetime of this trait is the lifetime of data that may be borrowed by Self when deserialized. See the page Understanding deserializer lifetimes for a more detailed explanation of these lifetimes. Required Methods § Source fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Deserialize this value from the given Serde deserializer. See the Implementing Deserialize section of the manual for more information about how to implement this method. Dyn Compatibility § This trait is not dyn compatible . In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe. Implementations on Foreign Types § Source § impl<'de> Deserialize <'de> for IpAddr Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for SocketAddr Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for bool Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for char Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for f32 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for f64 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for i8 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for i16 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for i32 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for i64 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for i128 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for isize Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for ! Available on crate feature unstable only. Source § fn deserialize <D>(_deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for u8 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for u16 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for u32 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for u64 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for u128 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for () Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for usize Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Box < str > Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Box < CStr > Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Box < OsStr > Available on crate feature std and (Unix or Windows) only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Box < Path > Available on crate feature std only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for CString Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for String Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Ipv4Addr Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Ipv6Addr Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for SocketAddrV4 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for SocketAddrV6 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < i8 > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < i16 > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < i32 > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < i64 > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < i128 > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < isize > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < u8 > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < u16 > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < u32 > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < u64 > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < u128 > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Saturating < usize > Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for AtomicBool Available on crate feature std and target_has_atomic=8 only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for AtomicI8 Available on crate feature std and target_has_atomic=8 only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for AtomicI16 Available on crate feature std and target_has_atomic=16 only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for AtomicI32 Available on crate feature std and target_has_atomic=32 only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for AtomicI64 Available on crate feature std and target_has_atomic=64 only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for AtomicIsize Available on crate feature std and target_has_atomic=ptr only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for AtomicU8 Available on crate feature std and target_has_atomic=8 only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for AtomicU16 Available on crate feature std and target_has_atomic=16 only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for AtomicU32 Available on crate feature std and target_has_atomic=32 only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for AtomicU64 Available on crate feature std and target_has_atomic=64 only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for AtomicUsize Available on crate feature std and target_has_atomic=ptr only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for Duration Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for OsString Available on crate feature std and (Unix or Windows) only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for PathBuf Available on crate feature std only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for SystemTime Available on crate feature std only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroI8 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroI16 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroI32 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroI64 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroI128 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroIsize Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroU8 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroU16 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroU32 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroU64 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroU128 Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de> Deserialize <'de> for NonZeroUsize Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, 'a, T> Deserialize <'de> for Cow <'a, T> where T: ? Sized + ToOwned , T:: Owned : Deserialize <'de>, Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, Idx> Deserialize <'de> for Range <Idx> where Idx: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, Idx> Deserialize <'de> for RangeFrom <Idx> where Idx: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, Idx> Deserialize <'de> for RangeInclusive <Idx> where Idx: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, Idx> Deserialize <'de> for RangeTo <Idx> where Idx: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, K, V> Deserialize <'de> for BTreeMap <K, V> where K: Deserialize <'de> + Ord , V: Deserialize <'de>, Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, K, V, S> Deserialize <'de> for HashMap <K, V, S> where K: Deserialize <'de> + Eq + Hash , V: Deserialize <'de>, S: BuildHasher + Default , Available on crate feature std only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for Bound <T> where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for Option <T> where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 0] Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 1] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 2] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 3] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 4] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 5] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 6] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 7] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 8] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 9] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 10] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 11] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 12] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 13] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 14] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 15] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 16] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 17] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 18] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 19] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 20] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 21] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 22] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 23] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 24] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 25] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 26] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 27] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 28] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 29] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 30] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 31] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for [T; 32] where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for (T₁, T₂, …, Tₙ) where T: Deserialize <'de>, This trait is implemented for tuples up to 16 items long. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for BinaryHeap <T> where T: Deserialize <'de> + Ord , Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for BTreeSet <T> where T: Deserialize <'de> + Eq + Ord , Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for LinkedList <T> where T: Deserialize <'de>, Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for VecDeque <T> where T: Deserialize <'de>, Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for Rc <T> where T: ? Sized , Box <T>: Deserialize <'de>, Available on crate feature rc and (crate features std or alloc ) only. This impl requires the "rc" Cargo feature of Serde. Deserializing a data structure containing Rc will not attempt to deduplicate Rc references to the same data. Every deserialized Rc will end up with a strong count of 1. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for RcWeak <T> where T: Deserialize <'de>, Available on crate feature rc and (crate features std or alloc ) only. This impl requires the "rc" Cargo feature of Serde. The resulting Weak<T> has a reference count of 0 and cannot be upgraded. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for Arc <T> where T: ? Sized , Box <T>: Deserialize <'de>, Available on crate feature rc and (crate features std or alloc ) only. This impl requires the "rc" Cargo feature of Serde. Deserializing a data structure containing Arc will not attempt to deduplicate Arc references to the same data. Every deserialized Arc will end up with a strong count of 1. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for ArcWeak <T> where T: Deserialize <'de>, Available on crate feature rc and (crate features std or alloc ) only. This impl requires the "rc" Cargo feature of Serde. The resulting Weak<T> has a reference count of 0 and cannot be upgraded. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for Vec <T> where T: Deserialize <'de>, Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for Cell <T> where T: Deserialize <'de> + Copy , Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for PhantomData <T> where T: ? Sized , Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T> Deserialize <'de> for Wrapping <T> where T: Deserialize <'de>, Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T, S> Deserialize <'de> for HashSet <T, S> where T: Deserialize <'de> + Eq + Hash , S: BuildHasher + Default , Available on crate feature std only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T: Deserialize <'de>> Deserialize <'de> for Box < [T] > Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T: Deserialize <'de>> Deserialize <'de> for Box <T> Available on crate features std or alloc only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T: Deserialize <'de>> Deserialize <'de> for RefCell <T> Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T: Deserialize <'de>> Deserialize <'de> for Reverse <T> Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T: Deserialize <'de>> Deserialize <'de> for Mutex <T> Available on crate feature std only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de, T: Deserialize <'de>> Deserialize <'de> for RwLock <T> Available on crate feature std only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de: 'a, 'a> Deserialize <'de> for &'a str Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de: 'a, 'a> Deserialize <'de> for &'a Path Available on crate feature std only. Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Source § impl<'de: 'a, 'a> Deserialize <'de> for &'a [ u8 ] Source § fn deserialize <D>(deserializer: D) -> Result <Self, D:: Error > where D: Deserializer <'de>, Implementors § Source § impl<'de> Deserialize <'de> for IgnoredAny | 2026-01-13T09:29:14 |
https://ben.balter.com/about/ | About | Ben Balter Ben Balter Posts About Contact Technology leadership, collaboration, and open source About Ben Balter is the Director of Hubber Enablement within the Office of the COO at GitHub , the world’s largest software development platform, ensuring all Hubbers can do their best (remote) work. Previously, he served as the Director of Technical Business Operations, and as Chief of Staff for Security, he managed the office of the Chief Security Officer, improving overall business effectiveness of the Security organization through portfolio management, strategy, planning, culture, and values. As a Staff Technical Program manager for Enterprise and Compliance, Ben managed GitHub’s on-premises and SaaS enterprise offerings, and as the Senior Product Manager overseeing the platform’s Trust and Safety efforts, Ben shipped more than 500 features in support of community management, privacy, compliance, content moderation, product security, platform health, and open source workflows to ensure the GitHub community and platform remained safe, secure, and welcoming for all software developers. Before joining GitHub’s Product team, Ben served as GitHub’s Government Evangelist, leading the efforts to encourage more than 2,000 government organizations across 75 countries to adopt open source philosophies for code, data, and policy development. Described by the US Chief Technology Officer as one of “the baddest of the badass innovators,” prior to GitHub, Ben was a member of the inaugural class of Presidential Innovation Fellows where he served as entrepreneur in residence reimagining the role of technology in brokering the relationship between citizens and government. Ben has also served as a Fellow in the Office of the US Chief Information Officer within the Executive Office of the President where he was instrumental in drafting President Obama’s Digital Strategy and Open Data Policy, and on the SoftWare Automation and Technology (SWAT) Team, the White House’s first agile development team. His paper, Towards a More Agile Government was published in the Public Contract Law Journal, arguing that Federal IT Procurement should be more amenable to modern, agile development methods. As an attorney passionate about the disruptive potential of technology, Ben holds a J.D. and an M.B.A. from the George Washington University and is a member of the DC Bar. When not trying to change the world, he enjoys tackling otherwise-impossible challenges to sharing information using nothing more than duct tape, version control, and occasionally a pack of bubblegum. Full resume . Feel free to email him at [email protected] or you can find him on these social networks: Email Add to contacts Bluesky LinkedIn GitHub PGP: 07C6 73FB F30E 01C0 C342 7AB8 DBB6 7C24 6AD3 56C4 Other recommended reading Fine Print | 2026-01-13T09:29:14 |
https://www.linkedin.com/products/tencentglobal-cloud-virtual-machine-cvm/?trk=products_seo_search | Cloud Virtual Machine (CVM) | LinkedIn Skip to main content LinkedIn Tencent in Asan Expand search This button displays the currently selected search type. When expanded it provides a list of search options that will switch the search inputs to match the current selection. Jobs People Learning Clear text Clear text Clear text Clear text Clear text Join now Sign in Cloud Virtual Machine (CVM) Server Virtualization Software by Tencent See who's skilled in this Add as skill Learn more Report this product About Tencent Cloud Virtual Machine offers stable, secure, resilient, and high-performance cloud computing service Similar products Cloudflare Workers Cloudflare Workers Server Virtualization Software Proxmox Virtual Environment Proxmox Virtual Environment Server Virtualization Software SC//Fleet Manager SC//Fleet Manager Server Virtualization Software SC//Platform SC//Platform Server Virtualization Software BTS Sybelle Virtualization Platform BTS Sybelle Virtualization Platform Server Virtualization Software Oracle Virtualization Oracle Virtualization Server Virtualization Software Sign in to see more Show more Show less Tencent products Cloud Native Database TDSQL-C Cloud Native Database TDSQL-C Relational Database Management Systems Cloud Object Storage (COS) Cloud Object Storage (COS) Object Storage Software Simple Email Service (SES) Simple Email Service (SES) Email Marketing Software Tencent Cloud Automation Tools Tencent Cloud Automation Tools Build Automation Tools Tencent Cloud Block Storage Tencent Cloud Block Storage Block Storage Software Tencent Cloud Instant Messaging (IM) Tencent Cloud Instant Messaging (IM) Cloud Communications Platforms Tencent Cloud Lighthouse Tencent Cloud Lighthouse Enterprise Cloud Platforms Tencent Effect SDK Tencent Effect SDK Software Development Kits (SDK) Tencent Real-Time Communication (TRTC) Tencent Real-Time Communication (TRTC) Live Streaming Software Show more Show less LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines English (English) Language | 2026-01-13T09:29:14 |
https://ben.balter.com/contact/ | Contact | Ben Balter Ben Balter Posts About Contact Technology leadership, collaboration, and open source Contact Looking to get in touch? Email [email protected] or I’m @benbalter most places: Email Add to contacts Bluesky LinkedIn GitHub PGP: 07C6 73FB F30E 01C0 C342 7AB8 DBB6 7C24 6AD3 56C4 Other recommended reading Fine Print | 2026-01-13T09:29:14 |
https://ben.balter.com/2012/10/15/open-source-is-not-a-verb/ | Open Source is not a verb | Ben Balter Ben Balter Posts About Contact Technology leadership, collaboration, and open source Open Source is not a verb TL;DR : Open source, at its core, is actually not about code, but about connecting people around a shared vision to encourage collaborative problem solving. 2 minute read I’m always intrigued by developers who use the term “open source” as a verb. As if a switch could magically be thrown, and via a quick mouse click in the Danger Zone , a proprietary or purpose-built project quickly morphs into one that’s “open source”. Open source is not simply about publishing code. That’d be like saying democracy’s simply about the ability to vote. Sure, you can vote, but if your vote doesn’t matter because the act is solely symbolic, it’s not really democracy. It’s just a ruse. Like publishing code, voting is necessary but not sufficient. Open source, at its core, is actually not about code, but about connecting people around a shared vision. It’s about community building. It’s about collaboration. It’s about getting a bunch of enthusiastic, like-minded folks in a metaphorical room together, and giving them the resources they need to solve a shared problem and create something of benefit to others, something that none of them would have been able to do alone. It’s about building and sharing, not about publishing. Put another way, open source is not an alternative workflow or development method. It’s not as if you can choose between waterfall, agile, and open source means of producing software in a workplace. Instead, it’s an overriding philosophy that guides a project. Like forward thinking, simple, interoperable, system oriented, or open standards. It’s how you approach a problem from the start, not what you do after you’ve already solved it. To say “hey, we’ve got something decent here, let’s take this closed-sourced project and just hit publish” misses the mark. Your motivation can’t be to seek free labor, as in “hey, if developers want to give us their time, great, let’s put this out there and see what happens we have nothing to lose”, or about sporadically seeking to garner good will from a niche community of dedicated fans. Trust me, an open source developer can smell AstroTurf a mile a way, and that’s exactly how far they’ll stay. What makes an open source project truly open source and not simply “published” Shared Vision - Open source developers want to get behind a cause. Think of it as analogous to volunteering for a political campaign. They want to know what the project stands for, and where it is going. If they contribute, what will their code be used for in a six months or a year? Clear Goals - What’s the goal of the project? What’s the roadmap look like? Do you trust the community enough to share it? Can they shape that roadmap or is it set in stone? Active Development - When’s the last public commit? Are you committing privately, bundling together a release and then blessing the community with your efforts or is development occurring in the open? Us/Them Mentality - Is there a class system between paid/unpaid contributors? Are outside contributions handled with equal footing? Are any outside developers delegated authority or given commit access? Mechanics - Is it in version control or just a static download? Is the bug tracker public? Can I comment and submit? What about documentation? Is it maintained in a wiki? Communication - Can developers communicate directly or must they go through the parent organization? (for example, announcement verses conversation models) Purpose-built Code - Is the code written for open source? Is it sufficiently documented? Is it modular? Is it specific to the initial use case or abstracted out to the underlying logic? All of the above are underlying principles that drive development from day one, and yet not incompatible with a philosophy that dictates code remains under lock and key until a minimum viable product (MVP) has been reached. They do remain incompatible, however, with a philosophy that says that business as usual can be easily switched mid-stream to a successful open source project by simply not keeping the code secret. In the end, it’s about developing a community , not about developing software. You’re selling an experience — whether it’s scratching a developer’s personal itch or giving them the opportunity to change the world. Next time you seek to build something useful, unless it’s the recipe for your secret sauce or something so specific as to render it worthless outside the organization’s walls, consider making it open source from the start , and instead seeking to grow a vibrant community around a cause, rather than simply coding a piece of software that happens to not be secret. Originally published October 15, 2012 | View revision history If you enjoyed this post, you might also enjoy: Five best practices in open source: internal collaboration Open source, not just software anymore Five best practices in open source: external engagement A White House open source policy written by a geek Why open source Disclosed source is not the same as open source Merge by committee What's Missing from CFPB's Awesome New Source Code Policy Twelve tips for growing communities around your open source project Why isn't all government software open source? Bringing open source workflows to the enterprise Ben Balter is the Director of Hubber Enablement within the Office of the COO at GitHub , the world’s largest software development platform, ensuring all Hubbers can do their best (remote) work. Previously, he served as the Director of Technical Business Operations, and as Chief of Staff for Security, he managed the office of the Chief Security Officer, improving overall business effectiveness of the Security organization through portfolio management, strategy, planning, culture, and values. As a Staff Technical Program manager for Enterprise and Compliance, Ben managed GitHub’s on-premises and SaaS enterprise offerings, and as the Senior Product Manager overseeing the platform’s Trust and Safety efforts, Ben shipped more than 500 features in support of community management, privacy, compliance, content moderation, product security, platform health, and open source workflows to ensure the GitHub community and platform remained safe, secure, and welcoming for all software developers. Before joining GitHub’s Product team, Ben served as GitHub’s Government Evangelist, leading the efforts to encourage more than 2,000 government organizations across 75 countries to adopt open source philosophies for code, data, and policy development. More about the author → This page is open source. Please help improve it . Edit Other recommended reading Fine Print | 2026-01-13T09:29:14 |
https://ben.balter.com/2015/06/03/copyright-notices-for-websites-and-open-source-projects/ | Copyright notices for open source projects | Ben Balter Ben Balter Posts About Contact Technology leadership, collaboration, and open source Copyright notices for open source projects TL;DR : What is the appropriate copyright notice for opens source projects? Who is the copyright holder? What year(s) should you put? Do you even need a copyright notice in the first place? 5 minute read The question’s come up several times, as to what’s the appropriate copyright notice for the footer of documentation sites or in an open source project’s license. In short, assuming your project’s under active development, it should be: Copyright [year project started] - [current year], [project founder] and the [project name] contributors . In practice, there are three things to consider: the date, the copyright holder, and the need to have a copyright notice in the first place. Let’s take a quick look at each. Do you even need a copyright notice No, not to get a copyright - but notices are helpful for other reasons, and they are easy to add. Historically, the primary point of putting copyright on anything is because in ye olden days (before 1979), it was a legal requirement that a publisher visually mark their work to secure their copyright under the United States Copyright Act . After the US became a signatory of the Berne convention (along with 167 other countries ), that requirement was dropped, and copyright now automatically vests in the author at the time of publication in the vast majority of countries, notice or no notice. Today, explicit copyright notices in licenses, footers (or really in general), are not necessary for getting a copyright. They still have some uses, though. First, someone may want to use your work in ways not allowed by your license; notices help them determine who to ask for permission. Explicit notices can help you prove that you and your collaborators really are the copyright holders. They can serve to put a potential infringer on notice by providing an informal sniff test to counter the “Oh yeah, well I didn’t know it was copyrighted” defense. For some users the copyright notice may suggest higher quality, as they expect that good software will include a notice. A notice may also help people determine when copyright might expire, but the date is ambiguous at best, and I’d suspect we’ll have better ways to determine the date of publication 80+ years from now, if your code is still worth protecting. Git can track these things, but people may receive software outside Git or where the Git history has not been retained. Simply put, a notice isn’t strictly necessary legally speaking. But a notice is nice to have, has some advantages, and is easy to do. The date If you chose to include a copyright notice, you’ll see that the first half of any copyright notice (after either the word “Copyright” or “©”) is a year. Is it the current year? The year you first had the idea? The year you hit publish? As implied above, when you choose to include a copyright notice, it’s traditionally the year of (first) publication. For things like books, the year of publication is really easy to determine. If you write a book in 2014, and it hits the shelves in 2015, the title page will most likely reflect a copyright date of 2015. That’s the date the original work was reduced to a physical embodiment and publicly distributed. That’s the year it was “published”, at least in the eyes of the law. And if a revised edition comes out in 2016, correcting some typos or adding a new forward, the title page would likely include both 2015 and 2016. When is a digital work “published” But when it comes to digital works, the idea of publication isn’t quite the same. When is an open source project (or a site, as that’s the most common means of publishing an open source project, for example, via GitHub’s web interface) “published”? In this case, of a site like choosealicense.com , to take a simple example, the site was “published” when the site launched in 2013. But unlike books, that are published yearly, in set editions, with open source, things are both never finished and constantly changing — the hallmark of a healthy open source project. If in 2014, someone submits a pull request to add some new content to the site (or in the case of software, to add a new feature to the project), that pull request would contain new content first “published” in 2014. In that case, a copyright notice like “Copyright 2013 − 2014” would be more appropriate, as the project contains works of original authorship, first published in both 2013 and 2014. So what date should you use There’s precedent for this practice. If you ever look at the copyright page of a book, it will likely say copyright 2001, 2004, 2006–2007, and so on, noting each year of publication. Here, the same legal theory is at play, with the digital project being unbridled from the confines of the physical world, and thus publishing a bit more often, likely being “published”, the year the project was started, and every year thereafter. In terms of sites, if you have a page that updates daily (think the front page of nytimes.com ), then the current year is sufficient, because everything on that page was “published” that year, and thus received copyright that year (excluding the design and branding elements for a moment). If you have a page where some content was “published” in 2013, and some in 2014 (think our choosealicense.com example), then to really properly put a potential infringer on notice (see the sniff-test rationale above) you’d want [original publish date] - [last published date] . Again, just like books, each year it was published, concatenating consecutive years. The copyright holder As noted above, when an author creates an original work (be they a writer or developer), copyright automatically vests in the author. Think of that roughly like owning a building. If the author then want others to be able to use that work, they may choose to grant them a license. Think of that license roughly like renting out an apartment in that building. The author retains ownership (the building), and the tenant has a lease saying they have the right to use it (a license). When you use an open source project, you are analogous to the renter, but who’s the building owner (copyright holder)? If the project only has a single author, things are clear: the copyright holder is the project creator. When you have multiple contributors, all authoring code for the same project, absent an explicit agreement to the contrary, they each retain copyright to their own contribution. So whose name should you use Again, there’s a precedence. Going back to our book example, if you look at the copyright page, it’ll likely say Copyright [year] [author] (or the publisher, depending on their arrangement). One contributor, one copyright holder. But in the case of open source, there will likely be multiple contributors, each retaining their own copyright. You might write something like Copyright [year] Alison, Ben, and Charlie , but as the number of developers grow, things will quickly get out of hand. So lets simplify things and just write, Copyright [year] the [project] contributors . The founder-contributor distinction While there’s nothing wrong with that copyright notice, to be super technical, that statement doesn’t accurately represent the distribution of contributions across most projects. Likely the project creator (the BDFL ) with have started the project off with a bunch of commits, and may continue to be the largest contributor for some time. While legally the long tail of contributors technically retain copyright, their share of the total intellectual property might be 1% or less. As a mater of practicality, as a project founder, you’re fully entitled to take credit for the project, even as the project begins to garner contributions from other users. Think of it like many projects continuing to live in the founder’s personal GitHub account, giving their name a prominent positions, despite others contributing. So to be super technical, there’s no reason you couldn’t say [project founder] and the [project name] contributors . In either case, just putting the project founder or maintainer is strictly speaking wrong, assuming others have contributed. Putting it all together Assuming your project’s under active development, you should write Copyright [year project started] - [current year], [project founder] and the [project name] contributors . While not strictly necessary to obtain a copyright, if you’re going to add a copyright notice, that’ll accurately represent the years of publication and all copyright holders. Of course there are many edge cases, and the above is a simplification of what goes into a copyright notice. Things like contributor license agreements (CLAss), contributing while on the clock (work for hire), or derivative works complicate copyright considerations. Heck, with open source almost always being developed within a version control system — a system designed to track and make known who made what change when — as @bkeepers pointed out , the copyright notice may be even more of an anachronism than it already is. As they say on the internet, IANYL, so, as always, please consult your own legal counsel before making decisions regarding how you license your own works. If you’re looking for information about software copyright in government, here’s everything a government attorney needs to know about open source software licensing . Originally published June 3, 2015 | View revision history If you enjoyed this post, you might also enjoy: Everything an open source maintainer might need to know about open source licensing Everything a government attorney needs to know about open source software licensing Government's Release of Federally Funded Source Code: Public Domain or Open Source? Yes. Why you probably shouldn't add a CLA to your open source project Twelve tips for growing communities around your open source project How to identify a strong open source project Advice for managing open source communities at scale Five best practices in open source: external engagement Why you shouldn't write your own open source license Five best practices in open source: internal collaboration Open source, not just software anymore Ben Balter is the Director of Hubber Enablement within the Office of the COO at GitHub , the world’s largest software development platform, ensuring all Hubbers can do their best (remote) work. Previously, he served as the Director of Technical Business Operations, and as Chief of Staff for Security, he managed the office of the Chief Security Officer, improving overall business effectiveness of the Security organization through portfolio management, strategy, planning, culture, and values. As a Staff Technical Program manager for Enterprise and Compliance, Ben managed GitHub’s on-premises and SaaS enterprise offerings, and as the Senior Product Manager overseeing the platform’s Trust and Safety efforts, Ben shipped more than 500 features in support of community management, privacy, compliance, content moderation, product security, platform health, and open source workflows to ensure the GitHub community and platform remained safe, secure, and welcoming for all software developers. Before joining GitHub’s Product team, Ben served as GitHub’s Government Evangelist, leading the efforts to encourage more than 2,000 government organizations across 75 countries to adopt open source philosophies for code, data, and policy development. More about the author → This page is open source. Please help improve it . Edit Other recommended reading Fine Print | 2026-01-13T09:29:14 |
https://ben.balter.com/2017/11/28/everything-an-open-source-maintainer-might-need-to-know-about-open-source-licensing/ | Everything an open source maintainer might need to know about open source licensing | Ben Balter Ben Balter Posts About Contact Technology leadership, collaboration, and open source Everything an open source maintainer might need to know about open source licensing TL;DR : There’s lots of internet lore around open source licensing. As an attorney and an open source developer, here’s my answers to common open source licensing questions. 8 minute read Without an open source license, open source is just published code. Open source licenses are what allow users to use your software, and more importantly, to modifying it (and hopefully propose improvements). There’s lots of internet lore around open source licensing. As an attorney and an open source developer, I’ve answered many questions over the years about open source licensing, and figured it was time to give my answers a URL , in hopes that they might help other maintainers. Copyright versus the right to use As soon as a developer writes a line of code, they automatically possess certain rights. 1 Think about it logically: if you write a line of code, you naturally have the right to use it, to modify it, and to distribute it to others. This is called the code’s copyright, and you would be the copyright holder. Keep in mind, however, copyright is distinct from the right to use the code. While you may retain the copyright, you might also grant others some or all of those automatic rights by stating your intent to do so in a license. Think of this somewhat like a lease for real property. Your building owner still owns the building, but you have the right to live there. What rights you grant is up to you. For example, if you write closed source code, you may grant users the right to use it (but not modify or redistribute it), and if you write open source code you may grant the right to use or modify it. In either case, you still retain both rights. When a developer licenses their code under an open source license, they are granting downstream users one or more rights, but in most cases, copyright doesn’t transfer. The same is true for when a contributor submits a contribution to your project. Absent an agreement to the contrary, the developer retains the copyright, but grants (to the world), the right to use, modify, distribute, and sublicense the software. Put another way, in most cases, code “ownership” doesn’t change hands. As a user, when I download an open source project, one developer may hold the copyright in one line, another developer may technically hold the copyright in another, but as long as both developers granted me the same rights to use the code (via the open source license), I don’t really care. What an open source license does An open source license is a contract between the person who writes code (often a developer, but potentially a designer, translator, etc.), and any person who uses it. It’s a contract just like your apartment lease or cell phone contract, except that the contract language is standardized into about a dozen mainstream and three primary licenses like the MIT, Apache, and GPL licenses (named after the organizations or open source projects that originally wrote and used them). While the wording and specific terms may vary from license to license, most licenses include the following three things: It gives users the right to use, modify, and (re)distribute the software A promise from users not to sue the developer if the software doesn’t work as intended The requirement that the author’s name, the license, or both be included if distributed Additionally, some licenses may also include: The requirement that any contributions to the project be licensed under the same license The right for users to use any patented technology contained in the software (see below ) The requirement that any changes to the software be described when distributed Different requirements depending on whether the software is distributed in its human-readable or machine-readable form Copyleft and the GPL All open source licenses use copyright law to make the software more widely available. Some licenses, notably the “GPL” family of licenses, also use copyright law to ensure the software remains available, a practice known creatively as “copyleft”. While there’s some nuance that’s beyond this post, in short, any software based on copyleft-licensed software must be licensed under the same, or a similar (compatible) license, if distributed. For code to be copyleft, two things must happen: The code depends on copyleft code, such as a Drupal theme or a WordPress plugin (a “derivative work” in copyright terms, but the species depend on the license and often how the two bodies of code are wired up) The code is distributed. Modifying it for your own use is often okay, but in some cases, putting it in a for-sale closed-source project, or using it in an internet-based service may be considered distribution. While there are many philosophical and political reasons in support of copyleft software, you must be especially careful when using copyleft code within a project, especially in a for-profit business (and consider that added burden when licensing your own code, depending on how you want it to be used). Contributor License Agreements In addition an open source license, many large, often-corporate-backed projects also use a second type of legal contract called a Contributor License Agreement. Unlike licenses, contributor license agreements, or CLAss, are not standardized, meaning if you’re a contributor, you’ll have to read each CLA to determine what legal rights you’re giving away, before contributing (and hope you can parse what’s often dense legalese if you’re not a lawyer). Whereas open source licenses can be thought of as the copyright grant for users to use the project, a contributor license agreement, at its core, is the right for the project to incorporate a contributor’s code. While absent a CLA, most contributions are assumed to be under the terms of the project’s license, for high-risk projects or risk-averse maintainers, a CLA makes that understanding explicit. Contributors may also be required to attest that they have the right to submit the code, or the CLA may include an explicit patent grant (see below ). Some CLAss go so far as to actually assign the developers copyright to the project. Regardless of the specific clauses, CLAss are generally a form of CYA, to prevent maintainers (or the project) from landing in hot water due to the community contributions it accepts. Unless your employer tells you that you need one, most open source projects will not need a CLA, and even then, I’d push back against your corporate counsel a bit, especially if your project is on GitHub . CLAss add significant friction to the developer experience and can make it so that a one-line change can take weeks (and countless internal emails) to merge. Learning software development and open source is hard enough. You shouldn’t need a law degree (or favor owed from your general counsel’s office) on top of that. Copyright on GitHub If a project is on GitHub, in addition the open source license (if any), there’s a second legal document at play, GitHub’s Terms of Service. Specifically, GitHub recently updated its terms of service to explicitly include the otherwise-assumed inbound=outbound rule , meaning that by submitting a pull request on GitHub, contributors agree to contribute under that code under the same license as your project (making a CLA unnecessary in most cases). Additionally, even if your project doesn’t have a license, just by posting your code on GitHub, you grant certain rights to other users such as the right to view the code, or to fork it. Logically, you also give GitHub the right to display your code, if the repository’s public. That said, if you want others to use your code, you should really add an open source license . Patents For most projects, you won’t have to worry about patents. If you create an open source project that’s already been implemented in another language, or something that isn’t technically novel and non-obvious (for example, a sidebar widget, a small helper library, etc.), chances are it’s not patentable . Patents are a distinct legal right from copyright, but unlike copyright, you don’t get one just for creating a thing. Think of patented software as inventing an entirely new technology (like the first site to have an online “shopping cart”). The idea being, that the government wants to reward inventors who create new things, by granting them the exclusive right to use that technology for a certain period of time. As an inventor, you may want to register your invention, to secure that right, and as a developer, you’ll want to ensure your code does not infringe on a patent. In my mind, the vast majority of open source projects tackle easy technical, but hard human, user experience, or implementation problems. Pagination, for example, is a solved technical problem, but the value of an open source pagination project like will_paginate comes in the API, integration with other frameworks, flexibility, and so on All things that are not, at least on their face, novel, or patentable. If you’ve made something that’s not technically trivial to implement, you should probably talk to a lawyer (who in addition helping you conduct a patent search, might recommend a Patent-aware license like Apache over a simpler license like MIT). If you’re in the vast majority of left-pad- or Rails-addon-type projects, you’re probably fine, at least in terms of patent concerns. Copyright in a distinct legal entity Some more mature projects opt to form a distinct legal entity to hold the project’s copyright, often in the form of a non-profit, such as the WordPress foundation. In the case of WordPress, for example, copyright in the WordPress logo is owned by the foundation, meaning if I go to Café Press and print WordPress t-shirts to sell on the street for my own personal gain, WordPress can sue me. The same is true of code. If copyright is distributed among hundreds or thousands of developers and a conflict arises, the project may have to secure additional legal rights from hundreds or thousands of people across multiple countries, languages, and jurisdictions. In the case of WordPress, copyleft-licensed software , if I create and sell WordPress-Pro, and don’t make the code available to users, the WordPress foundation may rightfully sue me (although it may be practically difficult for them to do so). Many CLAss, in addition the explicit copyright grant also include either a transfer of copyright (meaning the foundation owns the code and the developer forfeits all rights), or some form of limited power of attorney, meaning the foundation can sue on the developers behalf to enforce their copyright. Because of this, CLAss are almost exclusively associated with project’s maintained by distinct legal entities (rather than an individual or small group of developers). Whether you’re willing to forfeit legal rights just to contribute to an open source project is a personal decision that you’ll have to make, and if you’re drafting or evaluating a CLA for use within your own project (despite my warning), hopefully you have sophisticated enough legal counsel to walk you through the various trade-offs and alternatives. When in doubt, follow the money The number one lesson I learned in law school was to always follow the money. For the vast majority of open source projects, if you add the MIT or Apache licenses, you will never have to think about copyright or patents and can focus on writing amazing software. The reason being, if you’re a college student and infringe on a corporation’s intellectual property, they may send you a harshly worded cease-and-desist letter, or DMCA notice, and tell you to take down your project, but it’s unlikely that they’ll sue you, as it’ll cost them more in legal fees than they’ll likely recover (since college students generally have few assets to their name). Not to mention, the negative PR of going after an aspiring developer would cost them more in good will than they would have likely incurred from the infringement as a function of lost profit, if any. That’s not to say you should ignore copyright and patents entirely, but unlike say, those scary pre-VHS-playback FBI warnings, if a mistake is made in good faith, and you respond reasonably, it’s unlikely you’ll be thrown in jail. That said, if you’re writing software for a major corporation or a promising startup, you may want to be more risk averse, as the copyright holder (you or your employer) has substantially more to their name (and substantially more for a potential legal adversary to gain, creating an incentive to sue). Not to mention, as a potential competitor, the law does not look favorably upon infringement, the very scenario intellectual property is intended to prevent. See also If you found this post helpful, there are two other resources you may be interested in reading: An overview of the best way to handle copyright notices for open source projects in for example, Licenses or the readme, and A similar overview of open source licensing geared towards government attorneys That said… Be sure to read the fine print , both here and elsewhere. Each situation is different. I’ve provided a high-level, highly simplified, highly generalized overview here for which I’m sure there are countless “well actually”s. If you are making a decision that affects your legal rights, you should really consult a licensed attorney in your state. I don’t know the specifics of your particular situation, and am not in a position to provide you with legal advice. </disclaimer> We’ve done a lot at GitHub to ensure you don’t need to be or hire a lawyer just to participate in the open-source community, but we’re not there yet. I hope the above overview can help to answer some common questions, but if there’s a general open source legal question I didn’t answer, please ask . In some cases, under what’s called the work for hire doctrine , the developer’s employer may be the copyright holder. This is true both of work done by a full-time employee, and often of a contractor given a specific task (unless otherwise specified). There’s also some nuances when it comes to government-created code . ↩ Originally published November 28, 2017 | View revision history If you enjoyed this post, you might also enjoy: Everything a government attorney needs to know about open source software licensing Copyright notices for open source projects Why you shouldn't write your own open source license Why you probably shouldn't add a CLA to your open source project Government's Release of Federally Funded Source Code: Public Domain or Open Source? Yes. Open source, not just software anymore Twelve tips for growing communities around your open source project Why open source Advice for managing open source communities at scale Five best practices in open source: external engagement How to identify a strong open source project Ben Balter is the Director of Hubber Enablement within the Office of the COO at GitHub , the world’s largest software development platform, ensuring all Hubbers can do their best (remote) work. Previously, he served as the Director of Technical Business Operations, and as Chief of Staff for Security, he managed the office of the Chief Security Officer, improving overall business effectiveness of the Security organization through portfolio management, strategy, planning, culture, and values. As a Staff Technical Program manager for Enterprise and Compliance, Ben managed GitHub’s on-premises and SaaS enterprise offerings, and as the Senior Product Manager overseeing the platform’s Trust and Safety efforts, Ben shipped more than 500 features in support of community management, privacy, compliance, content moderation, product security, platform health, and open source workflows to ensure the GitHub community and platform remained safe, secure, and welcoming for all software developers. Before joining GitHub’s Product team, Ben served as GitHub’s Government Evangelist, leading the efforts to encourage more than 2,000 government organizations across 75 countries to adopt open source philosophies for code, data, and policy development. More about the author → This page is open source. Please help improve it . Edit Other recommended reading Fine Print | 2026-01-13T09:29:14 |
https://www.linkedin.com/uas/login?session_redirect=%2Fservices%2Fproducts%2Fcloudflare-workers%2F&fromSignIn=true&trk=products_details_guest_nav-header-signin | LinkedIn Login, Sign in | LinkedIn Sign in Sign in with Apple Sign in with a passkey By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . or Email or phone Password Show Forgot password? Keep me logged in Sign in We’ve emailed a one-time link to your primary email address Click on the link to sign in instantly to your LinkedIn account. If you don’t see the email in your inbox, check your spam folder. Resend email Back New to LinkedIn? Join now Agree & Join LinkedIn By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . LinkedIn © 2026 User Agreement Privacy Policy Community Guidelines Cookie Policy Copyright Policy Send Feedback Language العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) | 2026-01-13T09:29:14 |
https://ben.balter.com/2017/11/28/everything-an-open-source-maintainer-might-need-to-know-about-open-source-licensing/ | Everything an open source maintainer might need to know about open source licensing | Ben Balter Ben Balter Posts About Contact Technology leadership, collaboration, and open source Everything an open source maintainer might need to know about open source licensing TL;DR : There’s lots of internet lore around open source licensing. As an attorney and an open source developer, here’s my answers to common open source licensing questions. 8 minute read Without an open source license, open source is just published code. Open source licenses are what allow users to use your software, and more importantly, to modifying it (and hopefully propose improvements). There’s lots of internet lore around open source licensing. As an attorney and an open source developer, I’ve answered many questions over the years about open source licensing, and figured it was time to give my answers a URL , in hopes that they might help other maintainers. Copyright versus the right to use As soon as a developer writes a line of code, they automatically possess certain rights. 1 Think about it logically: if you write a line of code, you naturally have the right to use it, to modify it, and to distribute it to others. This is called the code’s copyright, and you would be the copyright holder. Keep in mind, however, copyright is distinct from the right to use the code. While you may retain the copyright, you might also grant others some or all of those automatic rights by stating your intent to do so in a license. Think of this somewhat like a lease for real property. Your building owner still owns the building, but you have the right to live there. What rights you grant is up to you. For example, if you write closed source code, you may grant users the right to use it (but not modify or redistribute it), and if you write open source code you may grant the right to use or modify it. In either case, you still retain both rights. When a developer licenses their code under an open source license, they are granting downstream users one or more rights, but in most cases, copyright doesn’t transfer. The same is true for when a contributor submits a contribution to your project. Absent an agreement to the contrary, the developer retains the copyright, but grants (to the world), the right to use, modify, distribute, and sublicense the software. Put another way, in most cases, code “ownership” doesn’t change hands. As a user, when I download an open source project, one developer may hold the copyright in one line, another developer may technically hold the copyright in another, but as long as both developers granted me the same rights to use the code (via the open source license), I don’t really care. What an open source license does An open source license is a contract between the person who writes code (often a developer, but potentially a designer, translator, etc.), and any person who uses it. It’s a contract just like your apartment lease or cell phone contract, except that the contract language is standardized into about a dozen mainstream and three primary licenses like the MIT, Apache, and GPL licenses (named after the organizations or open source projects that originally wrote and used them). While the wording and specific terms may vary from license to license, most licenses include the following three things: It gives users the right to use, modify, and (re)distribute the software A promise from users not to sue the developer if the software doesn’t work as intended The requirement that the author’s name, the license, or both be included if distributed Additionally, some licenses may also include: The requirement that any contributions to the project be licensed under the same license The right for users to use any patented technology contained in the software (see below ) The requirement that any changes to the software be described when distributed Different requirements depending on whether the software is distributed in its human-readable or machine-readable form Copyleft and the GPL All open source licenses use copyright law to make the software more widely available. Some licenses, notably the “GPL” family of licenses, also use copyright law to ensure the software remains available, a practice known creatively as “copyleft”. While there’s some nuance that’s beyond this post, in short, any software based on copyleft-licensed software must be licensed under the same, or a similar (compatible) license, if distributed. For code to be copyleft, two things must happen: The code depends on copyleft code, such as a Drupal theme or a WordPress plugin (a “derivative work” in copyright terms, but the species depend on the license and often how the two bodies of code are wired up) The code is distributed. Modifying it for your own use is often okay, but in some cases, putting it in a for-sale closed-source project, or using it in an internet-based service may be considered distribution. While there are many philosophical and political reasons in support of copyleft software, you must be especially careful when using copyleft code within a project, especially in a for-profit business (and consider that added burden when licensing your own code, depending on how you want it to be used). Contributor License Agreements In addition an open source license, many large, often-corporate-backed projects also use a second type of legal contract called a Contributor License Agreement. Unlike licenses, contributor license agreements, or CLAss, are not standardized, meaning if you’re a contributor, you’ll have to read each CLA to determine what legal rights you’re giving away, before contributing (and hope you can parse what’s often dense legalese if you’re not a lawyer). Whereas open source licenses can be thought of as the copyright grant for users to use the project, a contributor license agreement, at its core, is the right for the project to incorporate a contributor’s code. While absent a CLA, most contributions are assumed to be under the terms of the project’s license, for high-risk projects or risk-averse maintainers, a CLA makes that understanding explicit. Contributors may also be required to attest that they have the right to submit the code, or the CLA may include an explicit patent grant (see below ). Some CLAss go so far as to actually assign the developers copyright to the project. Regardless of the specific clauses, CLAss are generally a form of CYA, to prevent maintainers (or the project) from landing in hot water due to the community contributions it accepts. Unless your employer tells you that you need one, most open source projects will not need a CLA, and even then, I’d push back against your corporate counsel a bit, especially if your project is on GitHub . CLAss add significant friction to the developer experience and can make it so that a one-line change can take weeks (and countless internal emails) to merge. Learning software development and open source is hard enough. You shouldn’t need a law degree (or favor owed from your general counsel’s office) on top of that. Copyright on GitHub If a project is on GitHub, in addition the open source license (if any), there’s a second legal document at play, GitHub’s Terms of Service. Specifically, GitHub recently updated its terms of service to explicitly include the otherwise-assumed inbound=outbound rule , meaning that by submitting a pull request on GitHub, contributors agree to contribute under that code under the same license as your project (making a CLA unnecessary in most cases). Additionally, even if your project doesn’t have a license, just by posting your code on GitHub, you grant certain rights to other users such as the right to view the code, or to fork it. Logically, you also give GitHub the right to display your code, if the repository’s public. That said, if you want others to use your code, you should really add an open source license . Patents For most projects, you won’t have to worry about patents. If you create an open source project that’s already been implemented in another language, or something that isn’t technically novel and non-obvious (for example, a sidebar widget, a small helper library, etc.), chances are it’s not patentable . Patents are a distinct legal right from copyright, but unlike copyright, you don’t get one just for creating a thing. Think of patented software as inventing an entirely new technology (like the first site to have an online “shopping cart”). The idea being, that the government wants to reward inventors who create new things, by granting them the exclusive right to use that technology for a certain period of time. As an inventor, you may want to register your invention, to secure that right, and as a developer, you’ll want to ensure your code does not infringe on a patent. In my mind, the vast majority of open source projects tackle easy technical, but hard human, user experience, or implementation problems. Pagination, for example, is a solved technical problem, but the value of an open source pagination project like will_paginate comes in the API, integration with other frameworks, flexibility, and so on All things that are not, at least on their face, novel, or patentable. If you’ve made something that’s not technically trivial to implement, you should probably talk to a lawyer (who in addition helping you conduct a patent search, might recommend a Patent-aware license like Apache over a simpler license like MIT). If you’re in the vast majority of left-pad- or Rails-addon-type projects, you’re probably fine, at least in terms of patent concerns. Copyright in a distinct legal entity Some more mature projects opt to form a distinct legal entity to hold the project’s copyright, often in the form of a non-profit, such as the WordPress foundation. In the case of WordPress, for example, copyright in the WordPress logo is owned by the foundation, meaning if I go to Café Press and print WordPress t-shirts to sell on the street for my own personal gain, WordPress can sue me. The same is true of code. If copyright is distributed among hundreds or thousands of developers and a conflict arises, the project may have to secure additional legal rights from hundreds or thousands of people across multiple countries, languages, and jurisdictions. In the case of WordPress, copyleft-licensed software , if I create and sell WordPress-Pro, and don’t make the code available to users, the WordPress foundation may rightfully sue me (although it may be practically difficult for them to do so). Many CLAss, in addition the explicit copyright grant also include either a transfer of copyright (meaning the foundation owns the code and the developer forfeits all rights), or some form of limited power of attorney, meaning the foundation can sue on the developers behalf to enforce their copyright. Because of this, CLAss are almost exclusively associated with project’s maintained by distinct legal entities (rather than an individual or small group of developers). Whether you’re willing to forfeit legal rights just to contribute to an open source project is a personal decision that you’ll have to make, and if you’re drafting or evaluating a CLA for use within your own project (despite my warning), hopefully you have sophisticated enough legal counsel to walk you through the various trade-offs and alternatives. When in doubt, follow the money The number one lesson I learned in law school was to always follow the money. For the vast majority of open source projects, if you add the MIT or Apache licenses, you will never have to think about copyright or patents and can focus on writing amazing software. The reason being, if you’re a college student and infringe on a corporation’s intellectual property, they may send you a harshly worded cease-and-desist letter, or DMCA notice, and tell you to take down your project, but it’s unlikely that they’ll sue you, as it’ll cost them more in legal fees than they’ll likely recover (since college students generally have few assets to their name). Not to mention, the negative PR of going after an aspiring developer would cost them more in good will than they would have likely incurred from the infringement as a function of lost profit, if any. That’s not to say you should ignore copyright and patents entirely, but unlike say, those scary pre-VHS-playback FBI warnings, if a mistake is made in good faith, and you respond reasonably, it’s unlikely you’ll be thrown in jail. That said, if you’re writing software for a major corporation or a promising startup, you may want to be more risk averse, as the copyright holder (you or your employer) has substantially more to their name (and substantially more for a potential legal adversary to gain, creating an incentive to sue). Not to mention, as a potential competitor, the law does not look favorably upon infringement, the very scenario intellectual property is intended to prevent. See also If you found this post helpful, there are two other resources you may be interested in reading: An overview of the best way to handle copyright notices for open source projects in for example, Licenses or the readme, and A similar overview of open source licensing geared towards government attorneys That said… Be sure to read the fine print , both here and elsewhere. Each situation is different. I’ve provided a high-level, highly simplified, highly generalized overview here for which I’m sure there are countless “well actually”s. If you are making a decision that affects your legal rights, you should really consult a licensed attorney in your state. I don’t know the specifics of your particular situation, and am not in a position to provide you with legal advice. </disclaimer> We’ve done a lot at GitHub to ensure you don’t need to be or hire a lawyer just to participate in the open-source community, but we’re not there yet. I hope the above overview can help to answer some common questions, but if there’s a general open source legal question I didn’t answer, please ask . In some cases, under what’s called the work for hire doctrine , the developer’s employer may be the copyright holder. This is true both of work done by a full-time employee, and often of a contractor given a specific task (unless otherwise specified). There’s also some nuances when it comes to government-created code . ↩ Originally published November 28, 2017 | View revision history If you enjoyed this post, you might also enjoy: Everything a government attorney needs to know about open source software licensing Copyright notices for open source projects Why you shouldn't write your own open source license Why you probably shouldn't add a CLA to your open source project Government's Release of Federally Funded Source Code: Public Domain or Open Source? Yes. Open source, not just software anymore Twelve tips for growing communities around your open source project Why open source Advice for managing open source communities at scale Five best practices in open source: external engagement How to identify a strong open source project Ben Balter is the Director of Hubber Enablement within the Office of the COO at GitHub , the world’s largest software development platform, ensuring all Hubbers can do their best (remote) work. Previously, he served as the Director of Technical Business Operations, and as Chief of Staff for Security, he managed the office of the Chief Security Officer, improving overall business effectiveness of the Security organization through portfolio management, strategy, planning, culture, and values. As a Staff Technical Program manager for Enterprise and Compliance, Ben managed GitHub’s on-premises and SaaS enterprise offerings, and as the Senior Product Manager overseeing the platform’s Trust and Safety efforts, Ben shipped more than 500 features in support of community management, privacy, compliance, content moderation, product security, platform health, and open source workflows to ensure the GitHub community and platform remained safe, secure, and welcoming for all software developers. Before joining GitHub’s Product team, Ben served as GitHub’s Government Evangelist, leading the efforts to encourage more than 2,000 government organizations across 75 countries to adopt open source philosophies for code, data, and policy development. More about the author → This page is open source. Please help improve it . Edit Other recommended reading Fine Print | 2026-01-13T09:29:14 |
https://www.linkedin.com/products/kaltura-video-platform/#main-content | Kaltura AI Video Experience Cloud | LinkedIn Skip to main content LinkedIn Kaltura in Asan Expand search This button displays the currently selected search type. When expanded it provides a list of search options that will switch the search inputs to match the current selection. Jobs People Learning Clear text Clear text Clear text Clear text Clear text Join now Sign in Kaltura AI Video Experience Cloud Live Streaming Software by Kaltura See who's skilled in this Add as skill Learn more Report this product About Driving virtual events, communication, learning, and TV experiences for millions of users daily. Similar products Cloudflare Stream Cloudflare Stream Live Streaming Software Tencent Real-Time Communication (TRTC) Tencent Real-Time Communication (TRTC) Live Streaming Software Tango Tango Live Streaming Software BOCC BOCC Live Streaming Software Media Services Live Media Services Live Live Streaming Software Liveu Liveu Live Streaming Software Sign in to see more Show more Show less LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines English (English) Language | 2026-01-13T09:29:14 |
https://www.linkedin.com/products/cloudflare-web-analytics/ | Cloudflare Web Analytics | LinkedIn Skip to main content LinkedIn Cloudflare in Asan Expand search This button displays the currently selected search type. When expanded it provides a list of search options that will switch the search inputs to match the current selection. Jobs People Learning Clear text Clear text Clear text Clear text Clear text Join now Sign in Cloudflare Web Analytics Digital Analytics Software by Cloudflare See who's skilled in this Add as skill Try now Report this product About Cloudflare Web Analytics provides free, privacy-first analytics without changing your DNS or using Cloudflare’s proxy. View your website’s page views and visits. Media Products media viewer No more previous content Understanding your Web Analytics Page views - A page view is defined as a successful HTTP response with a content-type of HTML. Visits - A visit is defined as a page view that originated from a different website, or direct link. Cloudflare checks where the HTTP referer does not match the hostname. One visit can consist of multiple page views. No more next content Similar products Business Analytics Business Analytics Digital Analytics Software HockeyStack HockeyStack Digital Analytics Software Compete Compete Digital Analytics Software Akamai Media Analytics Akamai Media Analytics Digital Analytics Software Adverity Adverity Digital Analytics Software WiFi WiFi Digital Analytics Software Sign in to see more Show more Show less Cloudflare products Argo Smart Routing Argo Smart Routing Network Management Software Cloudflare DDoS Protection Cloudflare DDoS Protection DDoS Protection Software Cloudflare DNS Cloudflare DNS Managed DNS Services Software Cloudflare Load Balancing Cloudflare Load Balancing Load Balancing Software Cloudflare Registrar Cloudflare Registrar Managed DNS Services Software Cloudflare Spectrum Cloudflare Spectrum DDoS Protection Software Cloudflare SSL / TLS Cloudflare SSL / TLS SSL Certificates Software Cloudflare WAF Cloudflare WAF Web Application Firewalls (WAF) Cloudflare Workers Cloudflare Workers Server Virtualization Software Show more Show less LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines English (English) Language | 2026-01-13T09:29:14 |
https://th-th.facebook.com/login/?next=https%3A%2F%2Fl.facebook.com%2Fl.php%3Fu%3Dhttps%253A%252F%252Fwww.instagram.com%252F%26amp%253Bh%3DAT2n2ad5edoxiZfbpoMEkNGCapqvjk3Zha8c1DS-IfhWMQRD-QXdRlQEcCYCl1RRAYHR0Mx37s1OKzcyqjS_88yFX-L67y4s2hGhnwpT3j1OIUkQ_EplDVcwoVuogpB-iRktRQbugSbxt_WX | Facebook สำรวจสิ่งที่ คุณชื่นชอบ เข้าสู่ระบบ Facebook อีเมลหรือหมายเลขโทรศัพท์มือถือ รหัสผ่าน เข้าสู่ระบบ ลืมรหัสผ่านใช่ไหม สร้างบัญชีใหม่ ภาษาไทย 한국어 English (US) Tiếng Việt Bahasa Indonesia Español 中文(简体) ภาษาอื่นๆ เพิ่มเติม… สมัคร เข้าสู่ระบบ Messenger Facebook Lite วิดีโอ Meta Pay Meta Store Meta Quest Ray-Ban Meta Meta AI เนื้อหาเพิ่มเติมจาก Meta AI Instagram Threads ศูนย์ข้อมูลการลงคะแนนเสียง นโยบายความเป็นส่วนตัว ศูนย์ความเป็นส่วนตัว เกี่ยวกับ สร้างโฆษณา สร้างเพจ ผู้พัฒนา ร่วมงานกับ Facebook คุกกี้ ตัวเลือกโฆษณา ข้อกำหนด ความช่วยเหลือ การอัพโหลดผู้ติดต่อและผู้ที่ไม่ได้ใช้บริการ Meta © 2026 | 2026-01-13T09:29:14 |
https://minimal-light-theme.yliu.me/ | Your Name | Your Affiliation Your Name Ph.D. Student Your Affiliation yourname (at) example.edu About Me I am a Ph.D. student at … Research Interests Computer Vision: image recognition, image generation, video captioning Machine Learning: meta-learning, incremental learning, transfer learning News [Feb. 2020] Our paper about incremental learning is accepted to CVPR 2020. [Feb. 2020] We will host the ACM Multimedia Asia 2020 conference in Singapore! [Sept. 2019] Our paper about few-shot learning is accepted to NeurIPS 2019. [Mar. 2019] Our paper about few-shot learning is accepted to CVPR 2019. Publications MICCAI Continual Learning for Abdominal Multi-Organ and Tumor Segmentation Yixiao Zhang, Xinyi Li, Huimiao Chen, Alan Yuille, Yaoyao Liu* , Zongwei Zhou* (*Corresponding authors) International Conference on Medical Image Computing and Computer-Assisted Intervention (MICCAI) , 2023. PDF Code BibTex Early Accept CVPR Mnemonics Training: Multi-Class Incremental Learning without Forgetting Yaoyao Liu , Yuting Su, An-An Liu, Bernt Schiele, Qianru Sun IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , 2020. PDF Code Project Page BibTex Oral Presentation Services Conference Reviewers IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) 2021-2023 IEEE/CVF International Conference on Computer Vision (ICCV) 2021 European Conference on Computer Vision (ECCV) 2022 Journal Reviewers IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) International Journal of Computer Vision (IJCV) Powered by Jekyll and Minimal Light theme. | 2026-01-13T09:29:14 |
https://docs.serde.rs/serde/trait.Serialize.html | Serialize in serde - Rust Docs.rs serde-1.0.228 serde 1.0.228 Permalink Docs.rs crate page MIT OR Apache-2.0 Links Homepage Repository crates.io Source Owners dtolnay github:serde-rs:publish Dependencies serde_core =1.0.228 normal serde_derive ^1 normal optional Versions 100% of the crate is documented Platform x86_64-unknown-linux-gnu Feature flags docs.rs About docs.rs Badges Builds Metadata Shorthand URLs Download Rustdoc JSON Build queue Privacy policy Rust Rust website The Book Standard Library API Reference Rust by Example The Cargo Guide Clippy Documentation This old browser is unsupported and will most likely display funky things. Serialize serde 1.0.228 Serialize Required Methods serialize Implementations on Foreign Types ! &'a T &'a mut T () (T,) Arc<T> ArcWeak<T> Arguments<'a> AtomicBool AtomicI8 AtomicI16 AtomicI32 AtomicI64 AtomicIsize AtomicU8 AtomicU16 AtomicU32 AtomicU64 AtomicUsize BTreeMap<K, V> BTreeSet<T> BinaryHeap<T> Bound<T> Box<T> CStr CString Cell<T> Cow<'a, T> Duration HashMap<K, V, H> HashSet<T, H> IpAddr Ipv4Addr Ipv6Addr LinkedList<T> Mutex<T> NonZeroI8 NonZeroI16 NonZeroI32 NonZeroI64 NonZeroI128 NonZeroIsize NonZeroU8 NonZeroU16 NonZeroU32 NonZeroU64 NonZeroU128 NonZeroUsize Option<T> OsStr OsString Path PathBuf PhantomData<T> Range<Idx> RangeFrom<Idx> RangeInclusive<Idx> RangeTo<Idx> Rc<T> RcWeak<T> RefCell<T> Reverse<T> RwLock<T> Saturating<T> SocketAddr SocketAddrV4 SocketAddrV6 String SystemTime Vec<T> VecDeque<T> Wrapping<T> [T; 0] [T; 1] [T; 2] [T; 3] [T; 4] [T; 5] [T; 6] [T; 7] [T; 8] [T; 9] [T; 10] [T; 11] [T; 12] [T; 13] [T; 14] [T; 15] [T; 16] [T; 17] [T; 18] [T; 19] [T; 20] [T; 21] [T; 22] [T; 23] [T; 24] [T; 25] [T; 26] [T; 27] [T; 28] [T; 29] [T; 30] [T; 31] [T; 32] [T] bool char f32 f64 i8 i16 i32 i64 i128 isize str u8 u16 u32 u64 u128 usize Dyn Compatibility Implementors In crate serde serde Trait Serialize Copy item path Source pub trait Serialize { // Required method fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer ; } Expand description A data structure that can be serialized into any data format supported by Serde. Serde provides Serialize implementations for many Rust primitive and standard library types. The complete list is here . All of these can be serialized using Serde out of the box. Additionally, Serde provides a procedural macro called serde_derive to automatically generate Serialize implementations for structs and enums in your program. See the derive section of the manual for how to use this. In rare cases it may be necessary to implement Serialize manually for some type in your program. See the Implementing Serialize section of the manual for more about this. Third-party crates may provide Serialize implementations for types that they expose. For example the linked-hash-map crate provides a LinkedHashMap<K, V> type that is serializable by Serde because the crate provides an implementation of Serialize for it. Required Methods § Source fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Serialize this value into the given Serde serializer. See the Implementing Serialize section of the manual for more information about how to implement this method. ⓘ use serde::ser::{Serialize, SerializeStruct, Serializer}; struct Person { name: String, age: u8, phones: Vec<String>, } // This is what #[derive(Serialize)] would generate. impl Serialize for Person { fn serialize<S>( & self , serializer: S) -> Result <S::Ok, S::Error> where S: Serializer, { let mut s = serializer.serialize_struct( "Person" , 3 ) ? ; s.serialize_field( "name" , & self .name) ? ; s.serialize_field( "age" , & self .age) ? ; s.serialize_field( "phones" , & self .phones) ? ; s.end() } } Dyn Compatibility § This trait is not dyn compatible . In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe. Implementations on Foreign Types § Source § impl Serialize for IpAddr Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for SocketAddr Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for bool Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for char Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for f32 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for f64 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for i8 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for i16 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for i32 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for i64 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for i128 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for isize Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for ! Available on crate feature unstable only. Source § fn serialize <S>(&self, _serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for str Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for u8 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for u16 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for u32 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for u64 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for u128 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for () Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for usize Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for CString Available on crate features std or alloc only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for String Available on crate features std or alloc only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for CStr Available on crate feature std only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for Ipv4Addr Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for Ipv6Addr Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for SocketAddrV4 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for SocketAddrV6 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for AtomicBool Available on crate feature std and target_has_atomic=8 only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for AtomicI8 Available on crate feature std and target_has_atomic=8 only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for AtomicI16 Available on crate feature std and target_has_atomic=16 only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for AtomicI32 Available on crate feature std and target_has_atomic=32 only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for AtomicI64 Available on crate feature std and target_has_atomic=64 only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for AtomicIsize Available on crate feature std and target_has_atomic=ptr only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for AtomicU8 Available on crate feature std and target_has_atomic=8 only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for AtomicU16 Available on crate feature std and target_has_atomic=16 only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for AtomicU32 Available on crate feature std and target_has_atomic=32 only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for AtomicU64 Available on crate feature std and target_has_atomic=64 only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for AtomicUsize Available on crate feature std and target_has_atomic=ptr only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for Duration Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for OsStr Available on crate feature std and (Unix or Windows) only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for OsString Available on crate feature std and (Unix or Windows) only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for Path Available on crate feature std only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for PathBuf Available on crate feature std only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for SystemTime Available on crate feature std only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroI8 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroI16 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroI32 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroI64 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroI128 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroIsize Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroU8 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroU16 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroU32 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroU64 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroU128 Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl Serialize for NonZeroUsize Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<'a> Serialize for Arguments <'a> Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<'a, T> Serialize for Cow <'a, T> where T: ? Sized + Serialize + ToOwned , Available on crate features std or alloc only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<'a, T> Serialize for &'a T where T: ? Sized + Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<'a, T> Serialize for &'a mut T where T: ? Sized + Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<Idx> Serialize for Range <Idx> where Idx: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<Idx> Serialize for RangeFrom <Idx> where Idx: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<Idx> Serialize for RangeInclusive <Idx> where Idx: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<Idx> Serialize for RangeTo <Idx> where Idx: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<K, V> Serialize for BTreeMap <K, V> where K: Serialize , V: Serialize , Available on crate features std or alloc only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<K, V, H> Serialize for HashMap <K, V, H> where K: Serialize , V: Serialize , Available on crate feature std only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for Bound <T> where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for Option <T> where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 0] Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 1] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 2] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 3] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 4] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 5] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 6] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 7] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 8] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 9] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 10] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 11] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 12] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 13] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 14] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 15] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 16] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 17] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 18] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 19] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 20] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 21] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 22] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 23] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 24] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 25] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 26] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 27] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 28] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 29] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 30] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 31] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T; 32] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for [T] where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for (T₁, T₂, …, Tₙ) where T: Serialize , This trait is implemented for tuples up to 16 items long. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for Box <T> where T: ? Sized + Serialize , Available on crate features std or alloc only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for BinaryHeap <T> where T: Serialize , Available on crate features std or alloc only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for BTreeSet <T> where T: Serialize , Available on crate features std or alloc only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for LinkedList <T> where T: Serialize , Available on crate features std or alloc only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for VecDeque <T> where T: Serialize , Available on crate features std or alloc only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for Rc <T> where T: ? Sized + Serialize , Available on crate feature rc and (crate features std or alloc ) only. This impl requires the "rc" Cargo feature of Serde. Serializing a data structure containing Rc will serialize a copy of the contents of the Rc each time the Rc is referenced within the data structure. Serialization will not attempt to deduplicate these repeated data. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for RcWeak <T> where T: ? Sized + Serialize , Available on crate feature rc and (crate features std or alloc ) only. This impl requires the "rc" Cargo feature of Serde. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for Arc <T> where T: ? Sized + Serialize , Available on crate feature rc and (crate features std or alloc ) only. This impl requires the "rc" Cargo feature of Serde. Serializing a data structure containing Arc will serialize a copy of the contents of the Arc each time the Arc is referenced within the data structure. Serialization will not attempt to deduplicate these repeated data. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for ArcWeak <T> where T: ? Sized + Serialize , Available on crate feature rc and (crate features std or alloc ) only. This impl requires the "rc" Cargo feature of Serde. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for Vec <T> where T: Serialize , Available on crate features std or alloc only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for Cell <T> where T: Serialize + Copy , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for RefCell <T> where T: ? Sized + Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for Reverse <T> where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for PhantomData <T> where T: ? Sized , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for Saturating <T> where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for Wrapping <T> where T: Serialize , Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for Mutex <T> where T: ? Sized + Serialize , Available on crate feature std only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T> Serialize for RwLock <T> where T: ? Sized + Serialize , Available on crate feature std only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Source § impl<T, H> Serialize for HashSet <T, H> where T: Serialize , Available on crate feature std only. Source § fn serialize <S>(&self, serializer: S) -> Result <S:: Ok , S:: Error > where S: Serializer , Implementors § | 2026-01-13T09:29:14 |
https://mlfoundations.github.io/advancedml-sp23/ | Advanced Machine Learning | AdvancedML Link Search Menu Expand Document AdvancedML Home Announcements Schedule Staff This site uses Just the Docs , a documentation theme for Jekyll. Ludwig Schmidt Course Ed Advanced Machine Learning University of Washington, Autumn 2023 About This course will cover advanced machine learning, from VC dimension to ChatGPT. It will be divided into two parts: theoretical and empirical. In the first we will cover topics such as VC dimension, Rademacher complexity, ERM, generalization bounds, and optimization basics. Next we will cover the components and development of advanced ML systems such as GPT-3. Lecture Tuesday / Thursday 10 - 11:20 am PT CSE2 G04 (Gates building). Lecture 1 Introduction ( slides ). Lecture 2 Introduction to learning theory – PAC learning of finite hypothesis classes in the realizable case (March 30) (Chapters 2 and 3 in Understaning Machine Learning – PDF ) Lecture 3 See edstem post . Lecture 4 See edstem post . Lecture 5 Convergence of Gradient Descent. Smooth and convex starts at Sec 2.3 here – Lemma 1 and 2 discussed in class are Lemmas 2.8 and 2.9. Lecture 6 Convergence of Gradient Descent continued. Smooth and strongly convex is here . See chapter 14 of the textbook for the analysis of GD in the Lipschitz setting and the analysis of SGD . Lecture 7 Continued analysis of SGD, modern optimizers. See here for the Adam slides . Lecture 8 Generalization bounds and online learning . Lecture 9 Generalization bounds . Rademacher complexity - See chapter 26 . Lecture 10 Introduction to language modelling . Lecture 11 Introduction to language modelling continued . Lecture 12 Introduction to language modelling continued . Lecture 13 Recent GPT-style language models . Lecture 14 Language modeling architecture: from zero to llama . Lecture 15 GPT-style language models, generalization bounds . Lecture 16 Generalization bounds, scaling, multimodal models . Lecture 17 Multimodal, continued . Lecture 18 Efficient deep learning . Lecture 19 Chain of thought prompting and instruction tuning . Lecture 20 Final project presentations and closing remarks . Assignments Link to gradescope. Homework 1 Version 4 ( PDF , source ). Due on Tuesday, May 2nd at 11:59pm. Homework 2 Version 1 ( PDF ). HW2 is due on Sunday, June 4th at 11:59pm. Submissions should be done by one person per group. Extra Reading Assignment Week 1 April 27 - May 4: GPT-2 . Due 11:59pm on May 4. For more detail see here . Week 2 May 4 - May 11: GPT-3 . Due 11:59pm on May 11. For more detail see here . Week 3 May 11 - May 18: Transformers . Due 11:59pm on May 18. For more detail see here . Week 4 May 18 - May 25: CLIP . Due 11:59pm on May 25. For more detail see here . Week 5 May 25 - Jun 1: Instruct GPT . Due 11:59pm on Jun 1. For more detail see here . Project The project will be about a replication of research, original empirical research, or a summarization of a line of theoretical work (and potential extension). There are three milestones for the project: (1) a proposal what you will work on, (2) version 1 which checks if you are on track to finish the project in time, (3) the final version which includes the full report. Resources : Project instructions Project latex template Team finding sheet Deadlines : Proposal: Monday, May 1, 11:59pm Version 1: Friday, May 12, 11:59pm Final version: Friday, June 2, 11:59pm Office hours for project milestones Proposal office hours: Thursday, April 27, 9am, Allen Center, CSE1 678 Milestone 1 and Final version office hours: Fridays May 5 to June 2, 10am, Allen Center, CSE1 678 Grading for the project is distributed as such: 10% for the proposal, 25% for version 1, and 65% for the final version. The project is 50% of total course project grade. Contact dettmers@cs.washington.edu if you have any issues with the project, such as finding a team, finding a project, or making progress on your project. Tim will also be available for office hours centered around the project. Office hours will be posted soon. Grading For students enrolled in CSE 493, your class grade will be determined by: 25% assignment 1 25% assignment 2 50% final project For students enrolled in CSE 599, your class grade will be determined by: 20% assignment 1 20% assignment 2 10% reading assignment 50% final project | 2026-01-13T09:29:14 |
https://docs.collab.land/help-docs/miniapps/apps/role-composition | Role Composition | Collab.Land Documentation Skip to main content Collab.Land Documentation Members & Admins ctrl K Introduction Key Features Setting Up the Bot Command Center Miniapps Getting started Miniapps Role Composition POAP Snapshot Sobol ChainPatrol Proof of Humanity Wallets Bot Errors FAQs Miniapps Miniapps Role Composition On this page Role Composition You can create complex role assignments that take into account multiple factors using the Role Composition miniapp; for example, requiring possession of both a fungible token and a non-fungible token for access to a role. Additionally, you can use multiple TGRs or manually assigned roles to create your final composed role. For example, you can require a member to hold NFTs from different collections and/or tokens on different blockchains. The Role Composition feature within the Composable Roles app allows you to assign a single role to members based on the combination of other roles they hold. This feature enables the use of AND/OR logic to combine Token Gating Requirements (TGRs) or manually assigned Discord roles. Setup and usage info View the Role Composition tutorial video on the Collab.Land youtube channel. To use the Role Composition feature, follow these steps: Login to the Command Center at https://cc.collab.land Click Miniapps Install the Role Composition app (only available for Premium plan subscribers and higher) Click on Role Composition on the left side of the screen Create a new Composable Role by selecting the role you want to assign Enter a role description Choose whether the role will be assigned (additive) or removed (subtractive) when the conditions are met Add the roles that are required to qualify for the composed role using the "Add Role" button Set the AND/OR condition for the role composition Specify whether each role must be assigned or not assigned using the checkboxes Review the logic of your Composable Role using the preview at the bottom of the setup page Click "Save" You have now concluded the process of setting up your first Composable Role. Get started now and see how you can leverage this powerful feature to manage your Discord community with ease! info The Role Composition miniapp is available exclusively as a Pro miniapp for our Premium plan . To access this feature, subscribe via the Collab.Land Command Center : https://cc.collab.land . Previous Getting started Next POAP Privacy Policy Terms of Service Collab.Land® 2025 | 2026-01-13T09:29:14 |
https://docs.collab.land/help-docs/miniapps/apps/role-composition | Role Composition | Collab.Land Documentation Skip to main content Collab.Land Documentation Members & Admins ctrl K Introduction Key Features Setting Up the Bot Command Center Miniapps Getting started Miniapps Role Composition POAP Snapshot Sobol ChainPatrol Proof of Humanity Wallets Bot Errors FAQs Miniapps Miniapps Role Composition On this page Role Composition You can create complex role assignments that take into account multiple factors using the Role Composition miniapp; for example, requiring possession of both a fungible token and a non-fungible token for access to a role. Additionally, you can use multiple TGRs or manually assigned roles to create your final composed role. For example, you can require a member to hold NFTs from different collections and/or tokens on different blockchains. The Role Composition feature within the Composable Roles app allows you to assign a single role to members based on the combination of other roles they hold. This feature enables the use of AND/OR logic to combine Token Gating Requirements (TGRs) or manually assigned Discord roles. Setup and usage info View the Role Composition tutorial video on the Collab.Land youtube channel. To use the Role Composition feature, follow these steps: Login to the Command Center at https://cc.collab.land Click Miniapps Install the Role Composition app (only available for Premium plan subscribers and higher) Click on Role Composition on the left side of the screen Create a new Composable Role by selecting the role you want to assign Enter a role description Choose whether the role will be assigned (additive) or removed (subtractive) when the conditions are met Add the roles that are required to qualify for the composed role using the "Add Role" button Set the AND/OR condition for the role composition Specify whether each role must be assigned or not assigned using the checkboxes Review the logic of your Composable Role using the preview at the bottom of the setup page Click "Save" You have now concluded the process of setting up your first Composable Role. Get started now and see how you can leverage this powerful feature to manage your Discord community with ease! info The Role Composition miniapp is available exclusively as a Pro miniapp for our Premium plan . To access this feature, subscribe via the Collab.Land Command Center : https://cc.collab.land . Previous Getting started Next POAP Privacy Policy Terms of Service Collab.Land® 2025 | 2026-01-13T09:29:14 |
https://www.fxn.xyz/ecosystem | Function | FBTC About Ecosystem Proof of Assets Acquire Swap & Bridge Bridge Explorer Points About Ecosystem Proof of Assets Acquire Points Ecosystem Join Function's ecosystem by partnering with us to expand FBTC utility. Add your app, become a merchant to provide more mint and burn access, or join our vault manager program to help build new yield strategies for FBTC holders. Add Your App Merchant Program Mint and burn FBTC for your users to enable immediate access to the FBTC ecosystem Become a Merchant Vault Managers Help create yield generation strategies that are directly accessible by FBTC holders. Become a Vault Manager Filters All Done Add Your App Risk Disclaimer As an omni-chain liquid Bitcoin asset, FBTC does not endorse any project listed above. Users are advised to understand the risk and practise due diligence. Company About Blog Protocol Ecosystem Proof of Assets Dune Dashboard Resources Documentation Audits Media Assets Legal Privacy Policy Terms of Service Risk Disclosure Statement Get in Touch Discord Medium Github Linkedin Telegram X © Function 2025. All rights reserved | 2026-01-13T09:29:14 |
http://choosealicense.com/licenses/mit/ | MIT License | Choose a License Home / Licenses MIT License A short and simple permissive license with conditions only requiring preservation of copyright and license notices. Licensed works, modifications, and larger works may be distributed under different terms and without source code. Permissions Conditions Limitations Commercial use Distribution Modification Private use License and copyright notice Liability Warranty MIT License Copyright (c) [year] [fullname] Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Copy license text to clipboard Suggest this license Make a pull request to suggest this license for a project that is not licensed . Please be polite: see if a license has already been suggested, try to suggest a license fitting for the project’s community , and keep your communication with project maintainers friendly. How to apply this license Create a text file (typically named LICENSE or LICENSE.txt) in the root of your source code and copy the text of the license into the file. Replace [year] with the current year and [fullname] with the name (or names) of the copyright holders. Optional steps Add MIT to your project’s package description, if applicable (e.g., Node.js , Ruby , and Rust ). This will ensure the license is displayed in package directories. Source Who’s using this license? Babel .NET Rails About Terms of Service Help improve this page The content of this site is licensed under the Creative Commons Attribution 3.0 Unported License . Curated with ❤️ by GitHub, Inc. and You! | 2026-01-13T09:29:14 |
https://www.linkedin.com/products/categories/ssl-certificates-software | Best SSL Certificates Software | Products | LinkedIn Skip to main content LinkedIn Expand search This button displays the currently selected search type. When expanded it provides a list of search options that will switch the search inputs to match the current selection. Jobs People Learning Clear text Clear text Clear text Clear text Clear text Join now Sign in Clear text Used by Used by Information Technology Manager (5) Cyber Security Specialist (4) Information Technology Specialist (4) System Administrator (3) Owner (2) See all products Find top products in SSL Certificates Software category Software used to provide certificates for Secure Sockets Layer (SSL) network connection encryptions. - Obtain server-side digital certificates for HTTPS authentication - Ensure secure connections between web server and visitors using cryptographic key - Enable installation, renewal, and policy-based decryption and encryption - Demonstrate certified ownership of domain in accordance with search engine standards 177 results Cloudflare SSL / TLS SSL Certificates Software by Cloudflare Encrypting as much web traffic as possible to prevent data theft and other tampering is a critical step toward building a safer, better Internet. We’re proud to be the first Internet performance and security company to offer SSL protection free of charge. View product DigiCert Enterprise PKI Manager SSL Certificates Software by DigiCert The DigiCert enterprise PKI certificate lifecycle management platform provides a cloud-based enterprise pki solution for digital ssl and tls certificates used to enable strong authentication and encryption. View product IONOS SSL Certificates SSL Certificates Software by IONOS Buy an SSL certificate (DV, EV, OV) now ✔ Up to 256-bit-SSL encryption ✔ Rapid activation ✔ Increased trustworthiness for your website ✔ » IONOS by 1&1. View product DigiCert Secure Site Pro SSL SSL Certificates Software by DigiCert DigiCert’s Secure Site Pro SSL Certificate solution brings cutting-edge features that protect your website against known and future threats with a comprehensive solution of advanced security. Buy Secure Site Pro OV or EV SSL certificates today! View product Certificate Management SSL Certificates Software by Sectigo Sectigo Certificate Manager (SCM) is a universal platform purpose-built to manage the lifecycles of digital certificates to secure every human and machine identity across your enterprise, all from a single interface. With SCM you can automate the issuance and management of Sectigo certificates, alongside those from other publicly trusted Certificate Authorities (CAs) and private CAs. View product Find products trusted by professionals in your network See which products are used by connections in your network and those that share similar job titles Sign in to view full insights DigiCert SSL/TLS Certificates Listing SSL Certificates Software by DigiCert SSL certificates by DigiCert secure unlimited servers with the strongest encryption and highest authentication available. View product Sectigo EV SSL Certificates SSL Certificates Software by Sectigo Maximize your website performance, boost consumer confidence, and increase online conversions. View product SSL Certificates SSL Certificates Software by Sectigo Industry-Leading SSL (TLS) certificates from the world's most chosen commercial Certificate Authority (CA). With more than 100 million certificates issued and the widest selection of options for any sized website, Sectigo is the best choice for your SSL needs. View product Sectigo DV SSL Certificates SSL Certificates Software by Sectigo Fast and affordable solutions to secure your website with the highest encryption levels. View product Certificate Automation Manager SSL Certificates Software by GlobalSign GlobalSign's Certificate Automation Manager is a customizable, flexible automated software solution that acts as a proxy between GlobalSign’s Atlas Digital Identity Platform and your Microsoft Active Directory or Microsoft Entra ID. It allows for frictionless certificate provisioning based on your group policies. key features: - Policy Driven Automation: Define policies to avoid delays in provisioning certificates and alleviate IT pressure. - Active Directory Integration: Accurately control certificate permissions with integration into your Active Directory for each user and machine. - Frictionless Provisioning: Drive efficiency with the seamless provisioning of certificates as requested, with no admin intervention. - Comprehensive Support: Supports SCEP, ACME, key archival, key roaming, and automated S/MIME configuration (on Windows Outlook only). Benefits: - Operational Efficiency - Resource Optimization - Network Security - Scheduled Reporting View product See more How it works Explore Discover the best product for your need from a growing catalog of 25,000 products and categories trusted by LinkedIn professionals Learn Evaluate new tools, explore trending products in your industry and see who in your network is skilled in the product Grow Join communities of product users to learn best practices, celebrate your progress and accelerate your career LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines English Language | 2026-01-13T09:29:14 |
http://creativecommons.org/licenses/by/4.0/legalcode.tr | Legal Kod - Atıf 4.0 Uluslararası - Creative Commons İçeriğe geç Creative Commons Menu Who We Are What We Do Licenses and Tools Blog Support Us Mevcut diller Bahasa Indonesia Basque dansk Deutsch eesti English español français frysk Hrvatski italiano latviešu Lietuviškai Māori Nederlands norsk polski Português Română Slovensky Slovenščina suomi svenska Türkçe česky Ελληνικά Русский Українська العربيّة 日本語 简体中文 繁體中文 한국어 Search Donate Explore CC Global Network Join a global community working to strengthen the Commons Certificate Become an expert in creating and engaging with openly licensed materials Global Summit Attend our annual event, promoting the power of open licensing Chooser Get help choosing the appropriate license for your work Search Portal Find engines to search openly licensed material for creative and educational reuse Open Source Help us build products that maximize creativity and innovation Help us protect the commons. Make a tax deductible gift to fund our work. Donate today! Atıf 4.0 Uluslararası CC BY 4.0 Legal Kod Atıf 4.0 Uluslararası Bölüm 1 - Tanımlar. Bölüm 2 - Kapsam. Bölüm 3 - Lisans Koşulları. Bölüm 4 - Nevi Şahsına Münhasır Veritabanı Hakları. Bölüm 5 - Garanti Reddi ve Sorumluluk Tahdidi. Bölüm 6 - Süre ve Fesih. Bölüm 7 - Diğer Şart ve Koşullar. Bölüm 8 - Yorum. Canonical URL https://creativecommons.org/licenses/by/4.0/ Other formats Plain Text RDF/XML Senede bakın Version 4.0 • See the errata page for any corrections and the date of change Lisans ve Creative Commons hakkında Creative Commons Corporation ("Creative Commons"), bir hukuk firması değildir ve avukatlık hizmetleri veya hukukî danışmanlık hizmeti vermemektedir. Creative Commons kamu lisanslarının dağıtımı, avukat-müvekkil ilişkisi veya başka türlü bir ilişki oluşturmamaktadır. Creative Commons, lisanslarını ve buna ait bilgileri "olduğu gibi" temin etmektedir. Creative Commons, söz konusu lisansları, şartları ve koşulları kapsamında lisanslanan hiçbir materyal veya diğer bilgiler ile ilgili hiçbir taahhütte bulunmamaktadır. Creative Commons, mümkün olan en geniş kapsamda, bunların kullanımından kaynaklanan zararlara ilişkin hiçbir sorumluluk kabul etmez. Creative Commons Kamu Lisanslarını Kullanma Creative Commons kamu lisansları, telif hakları ve aşağıda kamu lisansında belirtilmiş olan bazı diğer haklar ile korunan özgün içerik ve diğer materyalleri paylaşmak amacıyla, eser sahipleri ve diğer hak sahiplerinin kullanabileceği standart şart ve koşulları ortaya koymaktadır. Aşağıda belirtilmiş olan hususlar yalnızca bilgilendirme amacını taşımakta olup, sınırlayıcı değildir ve lisanslarımızın bir parçasını teşkil etmemektedir. Lisanslayıcılara Yönelik Hususlar Kamu lisanslarımız, telif hakkı ve bazı diğer haklar ile yasaklanmış kullanım şekli hariç, materyalin diğer biçimlerde kullanımına umumi izin verme yetkisine sahip olanlar tarafından kullanılması içindir. Lisanslarımız gayri kabili rücudur. Lisans verenler, lisansı kullanmadan önce ilgili şart ve koşulları okumalı ve anlamalıdırlar. Lisans verenler ayrıca, kamunun ilgili materyali beklendiği şekilde tekrar kullanabilmesi için lisanslarımızı kullanmadan / uygulamadan önce gerekli tüm hakları güvenceye almalıdır. Lisans verenler, lisansa tâbi olmayan her türlü materyali açık bir şekilde işaretlemelidir. Buna, diğer CC-lisanslı materyaller veya bir telif hakkı istisnası veya sınırlaması kapsamında kullanılan materyaller de dâhildir. Lisans verenler ile ilgili daha fazla hususlar. Kamuya Yönelik Hususlar Lisans veren, kamu lisanslarımızdan birini kullanmak suretiyle, belirlenmiş şartlar ve koşullar çerçevesinde lisanslı olan materyalin kullanımına ilişkin umumî izin vermektedir. Herhangi bir nedenle lisans verenin izni gerekmiyorsa - örneğin, telif hakkı ile ilgili herhangi bir istisna veya sınırlamadan dolayı- bu durumda, söz konusu kullanım lisansa tâbi değildir. Lisanlarımız yalnızca, lisans verenin lisans verme yetkisinin olduğu telif hakkı ve diğer bazı haklar çerçevesinde izin vermektedir. Lisanslı materyalin kullanımı, başkalarının da materyal üzerinde sahip olduğu telif hakkı veya diğer haklardan dolayı kısıtlanmış olabilir. Lisans veren, her türlü değişikliğin işaretlenmesi veya açıklanmasını istemek de dâhil özel taleplerde bulunabilir. Lisanslarımız için gerekli olmamakla beraber, makul olduğu ölçüde bu taleplere uymanız önerilir. Kamu ile ilgili daha ayrıntılı hususlar. Atıf 4.0 Uluslararası Lisansa Konu Hakları (tanımı aşağıda verilmiştir) kullanarak, işbu Creative Commons Atıf Uluslararası Kamu Lisansının ("Kamu Lisansı") şart ve koşullarına tâbi olmayı kabul ve beyan etmektesiniz İşbu Kamu Lisansının bir sözleşme olarak yorumlanabildiği ölçüde, işbu şart ve koşulları kabul etmeniz karşılığında size Lisansa Konu Haklar verilmekte ve Lisans Veren size söz konusu hakları, işbu şart ve koşullar çerçevesinde Lisans Verenin, Lisanslı Materyalin kullanıma sunulmasından elde ettiği faydalar / menfaatler karşılığında sunmaktadır. Bölüm 1 - Tanımlar. Uyarlanmış Materyal, Lisanslı Materyalden elde edilen veya Lisanslı Materyale Dayalı Telif Hakkı ve Benzeri Haklara tâbi bulunan ve Lisanslı Materyalin, Lisans Verene ait Telif Hakkı ve Benzeri Haklar çerçevesinde izin gerektirecek bir şekilde tercüme edildiği, değiştirildiği, düzenlendiği, dönüştürüldüğü veya tadil edildiği materyali ifade eder. İşbu Kamu Lisansı kapsamında, Lisanslı Materyalin bir müzik eseri, performans veya ses kaydı olması hâlinde, Uyarlanmış Materyal her zaman hareketli bir görüntü ile senkronize edildiği durumlarda üretilir / oluşur. Uyarlayan Kişi Lisansı, işbu Kamu Lisansı şart ve koşullarına uygun bir şekilde Uyarlanmış Materyale yapmış olduğunuz katkılar için sahip olduğunuz Telif Hakkı ve Benzer Haklara uyguladığınız lisansı ifade eder. Telif Hakkı ve Benzeri Haklar, herhangi bir sınırlama olmaksızın performans, yayın, ses kaydı ve Nevi Şahsına Münhasır Veritabanı Hakları da dâhil olmak üzere, hakların nasıl etiketlendiği veya kategorize edildiğine bakılmaksızın telif hakkını ve/veya telif hakkı ile yakından ilişkili benzeri hakları ifade eder. İşbu Kamu Lisansı kapsamında, Bölüm 2(b)(1)-(2) de belirtilen haklar Telif Hakkı veya Benzeri Haklar değildir. Etkin Teknolojik Önlemler, uygun bir merciin olmadığı durumda, 20 Aralık 1996 tarihinde kabul edilmiş olan Dünya Fikrî Mülkiyet Örgütü (WIPO) Telif Hakkı Sözleşmesinin 11. maddesinden ve/veya benzer uluslararası anlaşmalardan doğan yükümlülükleri yerine getiren yasalar kapsamına girmeyen önlemleri ifade etmektedir. İstisnalar ve Sınırlamalar, Lisanslı Materyalin Tarafınızca kullanımı için geçerli olan Telif Hakkı ve Benzeri Haklar ile ilgili adil kullanım (“fair use”), adil muamele (“fair dealing”) ve/veya diğer sınırlama veya istisnaları ifade eder. Lisanslı Materyal, Lisans Verenin işbu Kamu Lisansını uyguladığı sanat veya edebî eseri, veritabanı veya diğer materyali ifade etmektedir. Lisansa Konu Haklar, Lisanslı Materyalin Sizin tarafınızdan kullanımı için geçerli olan ve Lisans Verenin lisans verme yetkisinin olduğu tüm Telif Hakkı ve Benzer Haklar ile sınırlı olan, işbu Kamu Lisansı şart ve koşulları çerçevesinde size bahşedilen hakları ifade eder. Lisans Veren, işbu Kamu Lisansı çerçevesinde bu hakları veren kişiyi/kişileri veya kurumu/kurumları ifade etmektedir. Paylaşım, çoğaltma, kamuya açık sergileme, performans, dağıtma, yayma, iletim veya ithal etme gibi her nevi şekil veya işlem ile materyali kamuya temin etme veya kamu bireylerinin kendilerinin bireysel olarak seçeceği bir yerden ve yine kendilerinin seçecekleri bir zamanda materyale erişebileceği şekil ve yöntemler de dâhil olmak üzere materyalin kamunun kullanımına sunulması anlamına gelmektedir. Nevi Şahsına Münhasır Veritabanı Hakları, tadil edildiği ve/veya yenisiyle değiştirildiği şekliyle, veritabanlarının yasal muhafazası hakkındaki 96/9/EC sayılı ve 11 Mart 1996 tarihli Avrupa Parlamentosu ve Konseyi Direktifinden doğan telif hakkı dışındaki diğer hakları ve dünyanın herhangi bir yerinde geçerli buna eşdeğer hakları ifade etmektedir. Siz ve/veya Tarafınız, işbu Kamu Lisansı çerçevesinde Lisanslı Hakları kullanan kişi veya kuruluşu ifade eder. Sizin / Tarafınızın sözcüğü de benzer bir anlamı ifade etmektedir. Bölüm 2 - Kapsam. Lisansın verilmesi . İşbu Kamu Lisansı şart ve koşullarına tâbi olmak üzere Lisans Veren, Lisans Materyaline ait Lisansa Konu Haklarını, alttaki şartları gerçekleyen dünya çapında geçerli, telif ücreti olmayan, alt lisans tanıma hakkı barındırmayan mahiyette, münhasır olmayan, gayri kabili rücu bir lisans vermektedir: kısmen veya tamamen Lisanslı Materyali Çoğaltmak ve Paylaşmak; ve Uyarlanmış Materyali üretmek, çoğaltmak veya paylaşmak. İstisnalar ve Sınırlamalar. Herhangi bir şüpheye mahal vermemek adına, Sizin kullanımız ile ilgili herhangi bir İstisna ve Sınırlamanın geçerli olduğu durumlarda işbu Kamu Lisansı geçerli olmayacak olup, bu lisansın şart ve koşullarına riayet etmeniz gerekmemektedir. Süre . İşbu kamu Lisansının süresi Bölüm 6(a) da belirtilmiştir. Ortam ve formatlar; teknik değişikliklere izin verilmektedir. Lisans Veren, gerek hâlihazırda bilinen veya bundan sonra geliştirilecek tüm ortam ve formatlarda Lisansa Konu Hakları kullanmanız ve gerektiğinde teknik değişiklikler yapmanız için Size yetki vermektedir. Etkin teknolojik önlemleri alt etmek için gerekli olan teknik değişiklikler de dâhil olmak üzere Lisans Veren, Lisanslı Hakları kullanmak için sizin teknik değişiklikleri yapmanızı önleme hak ve yetkisinden feragat etmekte ve böyle bir hak ve/veya yetki iddiasında bulunmamayı kabul etmektedir. İşbu Kamu Lisansı çerçevesinde, Bölüm 2(a)(4) de izin ve yetki verilmiş değişikliklerin yapılması, Uyarlanmış Materyal doğurmaz / oluşturmaz. Aşağı yönlü alıcılar . Lisans Veren tarafından Teklif - Lisanslı Materyal . Lisanslı Materyali alanlar, işbu Kamu Lisansı şart ve koşulları çerçevesinde Lisanslı Hakları kullanmak üzere Lisans Verenden otomatik olarak bir teklif almaktadır. Aşağı yönlü sınırlamanın olmayışı . Bunun herhangi bir Lisanslı Materyal alıcısının Lisansa Konu Hakları kullanımını sınırlaması hâlinde, Lisanslı Materyal üzerinde hiçbir ek veya farklı şart veya koşullar teklif edemez veya dayatamaz veya Lisanslı Materyale Etkin Teknolojik Önlemler uygulayamazsınız. Onaylamama . İşbu Kamu Lisansındaki hiçbir husus, Lisans Veren veya Bölüm 3(a)(1)(A)(i) de öngörüldüğü şekilde atıfta bulunacak diğer kişiler ile sizin veya kullanımınızın bağlantılı olduğu, size veya kullanımınıza onlar tarafından sponsor olunduğu, sizin veya kullanımınızın desteklendiği veya size veya kullanımınıza resmi bir statü verildiğini iddia ve ima etmeye ilişkin bir izin olarak yorumlanmayacaktır. Diğer haklar . Eserde değişiklik yapılmasını menetme hakkı gibi manevî haklar, aleniyet, gizlilik ve/veya diğer benzer şahsî haklar için, işbu Kamu Lisansı kapsamında lisans verilmemektedir; ancak, mümkün olduğu ölçüde Lisans Veren, başka türlü olmamak kaydıyla, yalnızca Sizin Lisansa Konu Hakları kullanabilmeniz için gerekli olduğu ölçüde, kendisinin sahibi olduğu bu tür haklardan feragat etmekte ve/veya bu tür hak iddialarında bulunmamayı kabul etmektedir. İşbu Kamu Lisansı kapsamında patent ve markalar için lisans verilmemektedir. Mümkün olduğu ölçüde Lisans Veren, gerek doğrudan gerekse herhangi bir gönüllü veya feragati kabil yasal veya zorunlu lisanslama tasarısı çerçevesinde bir meslek birliği aracılığı ile, Lisansa Konu Hakların kullanımı ile ilgili Sizden herhangi bir telif hakkı ücreti tahsil etme hakkından feragat etmektedir. Tüm diğer hâllerde Lisans Verenin bu tür telif hakkı ücretlerini tahsil etme hakkı mahfuzdur. Bölüm 3 - Lisans Koşulları. Lisansa Konu Hakların tarafınızca kullanımı, aşağıdaki koşul ve şartlara tâbidir. Atıf . Lisanslı Materyali Paylaşmanız hâlinde (değiştirilmemiş şekilde paylaşmanız da dâhil): Lisans Veren tarafından Lisanslı Materyal ile temin edildi ise, aşağıdakileri muhafaza etmelisiniz: (belirtildi ise, takma isim de dâhil) Lisans Veren tarafından talep edilebilecek herhangi bir makul yolla, Lisanslı Materyalin sahibi/sahiplerinin ve belirtilmiş diğer alıntı yapılacak kişilerin kimliği; telif hakkı bildirimi; bu Kamu Lisansına atıfta bulunan bir bildirim; garanti reddine atıfta bulunan bir bildirim; mümkün olduğu ölçüde Lisanslı Materyal için URI veya bağlantı adresi; Lisanslı materyalde değişiklik yapıp yamadığınızı belirtmeli ve daha önce yapılmış değişikliklere ilişkin bilgileri korumalı; ve Lisanslı Materyalin işbu Kamu Lisansı kapsamında lisanslı olduğunu belirtmeli ve Kamu Lisansı metnini veya Kamu Lisansı URI veya bağlantı adresi vermelisiniz. Lisanslı Materyali Paylaştığınız ortam, araç veya bağlama bağlı olarak, makul herhangi bir surette Bölüm 3(a)(1) de belirtilmiş koşulları yerine getirebilirsiniz. Örneğin, gerekli bilgileri ihtiva eden bir kaynağın URI veya bağlantı adresi belirterek, koşulları yerine getirmek makul olabilir. Lisans Veren tarafından talep edilmesi hâlinde, makul surette uygulanabilir olduğu ölçüde, Bölüm 3(a)(1)(A) da gerekli kılınan bilgileri kaldırmalısınız. Eğer Tarafınızca üretilen Uyarlanmış Materyali paylaşırsanız, uyguladığınız Uyarlayan Kişi Lisansı, Uyarlanmış Materyalin alıcılarının İşbu Kamu Lisansına uygunluğunu engellememeli. Bölüm 4 - Nevi Şahsına Münhasır Veritabanı Hakları. Lisansa Konu Haklar, Lisanslı Materyali Kullanımınız için geçerli Nevi Şahsına Münhasır Veritabanı haklarını da kapsadığı durumlarda: herhangi bir şüpheye mahal vermemek adına, Bölüm 2(a)(1) de size, veritabanı içeriğinin tamamını veya mühim bir kısmını çıkartma, tekrar kullanma, çoğaltma ve Paylaşma hakkı bahşetmektedir; Veritabanı içeriğinin tümünü veya önemli bir kısmını Nevi Şahsına Münhasır Veritabanı Haklarınızın olduğu bir veritabanına dâhil etmeniz durumunda, Nevi Şahsına Münhasır Veritabanı Haklarınızın olduğu veritabanı (münferit içerikleri hariç) Uyarlanmış Materyal teşkil edecektir; Veritabanı içeriğinin tamamını veya önemli bir kısmını Paylaşmanız durumunda Bölüm 3(a) daki şartlara uymanız mecburidir. Herhangi bir şüpheye mahal vermemek adına, Bölüm 4 , Lisansa Konu Hakların diğer Telif Hakkı ve Benzer Hakları kapsadığı durumlarda Kamu Lisanslı çerçevesinde tâbi olduğunuz Yükümlülükleri tamamlayıcı mahiyette olup, bu Yükümlülüklerini yerini almamaktadır. Bölüm 5 - Garanti Reddi ve Sorumluluk Tahdidi. Lisans Veren tarafından ayrıca taahhüt edilmediği sürece, mümkün olduğu ölçüde Lisans Veren, Lisanslı Materyali olduğu gibi ve kullanılabilir olduğu şekilde sunmakta olup, zımnî, sarih, yasal veya diğer türlü Lisanslı Materyaller ile ilgili hiçbir beyan ve taahhütte bulunmamaktadır. Buna, herhangi bir sınırlama olmaksızın, mülkiyet hakkı, ticarete elverişlilik, belirli bir amaca uygunluk, ihlal durumunun olmaması, gizli veya diğer kusurların olmayışı, doğruluk veya gerek bilinen gerek fark edilebilir hatanın var olduğu veya olmadığına dair garanti ve taahhütler de dâhildir. Garanti reddine kısmen veya tamamen izin verilmediği durumlarda, işbu garanti reddi Sizin için geçerli olmayabilir. Mümkün olduğu ölçüde, Lisans Verene bu tür kayıp, masraf, gider, zarar ve/veya kusurların olabileceği hakkında bilgi verilmiş olsa dâhi, işbu Kamu Lisansından veya Lisanslı Materyalin kullanımından doğan hiçbir doğrudan özel, dolaylı, arızî, mütevellit, cezaî veya cezaî teminat veya hukuksal teori kapsamında veya diğer zayiat, masraf veya giderlerden dolayı (herhangi bir sınırlama olmaksızın ihmal de dâhil) Lisans Veren Size karşı hiçbir şekilde mesul olmayacaktır. Sorumluluk tahdidine kısmen veya tamamen izin verilmediği durumlarda, işbu tahdit / sınırlama Sizin için geçerli olmayabilir. Yukarıda öngörülen garanti reddi ve sorumluluk tahdidi, mümkün olduğu ölçüde, mutlak bir sorumluluk reddi veya sorumluluktan feragatte reddine en yakın şekilde yorumlanacaktır. Bölüm 6 - Süre ve Fesih. İşbu Kamu Lisansı, bu çerçevede lisans verilen Telif Hakkı ve Benzeri Hakların süresi boyunca geçerli olacaktır. Ancak, bu Kamu Lisansına uymadığınız takdirde, Kamu Lisansı çerçevesinde sahip olduğunuz haklar otomatik olarak feshedilecek ve sona erecektir. Lisanslı Materyali kullanma hakkınızın 6(a) numaralı Madde kapsamında feshedilmesi durumunda: İhlali tespitinizden sonra ihlalin 30 gün içerisinde düzeltilmesi koşuluyla, ihlalin düzeltildiği tarih itibariyle otomatik olarak veya Lisans Veren tarafından açıkça hakların iade edilmesi üzerine hakkınız iade edilecektir. Herhangi bir şüpheye mahal vermemek adına, 6(b) numaralı bu Bölüm, işbu Kamu Lisansının tarafınızca ihlal edilmesi ile ilgili Lisans Verenin sahip olabileceği düzeltme veya kanunî yollara başvurma haklarına halel getirmez. Herhangi bir şüpheye mahal vermemek adına Lisans Veren, ayrı şart veya koşullar altında da Lisanslı Materyali sunabilir veya her zaman Lisanslı Materyalin dağıtımını durdurabilir; ancak, öyle yapması işbu Kamu Lisansını feshetmeyecektir. 1 , 5 , 6 , 7 ve 8 numaralı Bölümler işbu Kamu Lisansının feshedilmesinden sonra da yürürlükte kalacaktır. Bölüm 7 - Diğer Şart ve Koşullar. Açıkça kabul edilmedikçe Lisans Veren, Sizin tarafınızdan iletilebilecek ek veya farklı şart ve koşullara tâbi olmayacaktır. Lisanslı Materyalin kullanımına dair burada belirtilmemiş her nevi bir düzenleme, mutabakat veya anlaşma, işbu kamu Lisansının şart ve koşullarından ayrı ve bağımsızdır. Bölüm 8 - Yorum. Herhangi bir şüpheye mahal vermemek adına işbu Kamu Lisansı, bu Kamu Lisansı kapsamında herhangi bir izin almaksızın yasal olarak mümkün olan Lisanslı Materyalin kullanımını herhangi bir şekilde azaltmamakta, sınırlamamakta, kısıtlamamakta veya herhangi bir şart getirmemekte olup, bu şekilde de yorumlanmayacaktır. Mümkün olduğu ölçüde, işbu Kamu Lisansının herhangi bir hükmünün icra mevkiinden yoksun sayılması durumunda, söz konusu hüküm, geçerli hale getirmek ve icra edilebilirlik kazandırmak için gereken asgari ölçüde otomatik olarak tadil edilecektir. Hükmün tadil edilememesi durumunda ise, kala şartlar ve koşulların uygulanabilirliğine halel getirmeksizin söz konusu hüküm işbu Kamu Lisansından çıkartılacaktır. Bu Kamu Lisansının hiçbir hükmü veya koşulundan feragat edilmeyecek olup, Lisans Veren tarafından açıkça kabul edilmedikçe, şart ve koşullara uyulmamasına rıza gösterilmeyecektir. Herhangi bir yargı dairesi veya merciinin yasal muamelelerinden doğanlar da dâhil olmak üzere, İşbu Kamu Lisansında anılan hiçbir husus, Lisans Veren veya Sizin için bağlayıcı ve geçerli olan hiçbir imtiyaz veya ayrıcalık ile ilgili bir sınırlama veya feragat teşkil etmemektedir veya bu şekilde yorumlanmayacaktır. About Creative Commons Creative Commons, kamu lisanslarına taraf değildir. Buna karşın Creative Commons, kamu lisanlarından birini yayınladığı materyallere uygulamayı seçebilir ve bu tür durumlarda, "Lisans Veren" sayılacaktır. Kamu lisanslarının metni, CC0 Public Domain Dedication altında kamu malına özeldir. Materyalin, bir Creative Commons kamu lisansı veya CC0 Public Domain Dedication . Materyalin, bir Creative Commons kamu lisansı veya creativecommons.org/policies internet adresinde yayınlanmış olan Creative Commons politikalarının izin verdiği başka şekilde paylaşıldığının kamuya bildirilmesi şeklindeki sınırlı amaç hariç, herhangi bir sınırlama olmaksızın, kamu lisanslarından herhangi birinde yapılan her nevi değişiklik veya lisanslı materyalin kullanımına dair diğer düzenleme, mutabakat ve anlaşmalar ile bağlantılı olarak kullanılması da dâhil olmak üzere Creative Commons, önceden kendi yazılı rızası olmaksızın "Creative Commons" ticarî markasının veya Creative Commons'a ait diğer ticarî marka veya logonun kullanımına izin veya yetki vermemektedir. Herhangi bir şüpheye mahal vermemek adına, mezkur paragraf, kamu lisanslarının bir parçasını teşkil etmemektedir. Creative Commons ile creativecommons.org üzerinden iletişim kurabilir. Creative Commons is the nonprofit behind the open licenses and other legal tools that allow creators to share their work. Our legal tools are free to use. Çalışmamız hakkında dahasını öğrenin CC Lisanslama hakkında dahasını öğrenin Çalışmamızı destekleyin Lisansı kendi materyaliniz için kullanın. Licenses List Public Domain List Creative Commons Contact Newsletter Privacy Policies Terms Contact Us Creative Commons PO Box 1866, Mountain View, CA 94042 info@creativecommons.org +1-415-429-6753 Instagram --> Bluesky Mastodon LinkedIn Subscribe to our Newsletter Support Our Work Our work relies on you! Help us keep the Internet free and open. Donate Now Except where otherwise noted , content on this site is licensed under a Creative Commons Attribution 4.0 International license . Icons by Font Awesome . | 2026-01-13T09:29:14 |
https://macos.telegram.org?setln=es#v11-13-01-07-2025 | Telegram para macOS ES English Bahasa Indonesia Bahasa Melayu Deutsch Español Français Italiano Nederlands O‘zbek Polski Português (Brasil) Türkçe Беларуская Русский Українська Қазақша العربية فارسی 한국어 Twitter Inicio FAQ Apps API Moderación Telegram para macOS Descargar para macOS Versión del Mac App Store Software licenciado bajo la GPL v2 . Código fuente disponible en GitHub . Versión beta Historial de versiones v11.13 01/07/2025 Corrección de errores, mejoras menores y más. Telegram Telegram es una app de mensajería en la nube para móviles y computadoras con foco en la seguridad y la velocidad. Acerca de FAQ Privacidad Prensa Apps móviles iPhone/iPad Android Web móvil Para computadora PC/Mac/Linux macOS Navegador web Plataforma API Traducciones Vista rápida Acerca de Blog Prensa Moderación | 2026-01-13T09:29:14 |
https://t.me/funnymoneyHQ | Telegram: View @funnymoneyHQ Download FUNNY.MONEY 1 075 subscribers official channel of funny.money news, updates, & join group View in Telegram Preview channel If you have Telegram , you can view and join FUNNY.MONEY right away. | 2026-01-13T09:29:14 |
https://opensource.guide/bn/leadership-and-governance/ | Leadership and Governance | Open Source Guides বিস্তারিত অবদান রাখুন العربية Български Bangla Deutsch Ελληνικά English Español Farsi Français Hindi Magyar Indonesia Italiano 日本語 한국어 Malay Nederlands Pidgin Polski Português Romanian Русский संस्कृतम् Swahili தமிழ் Türkçe 简体中文 繁體中文 Open Source Guides Leadership and Governance Growing open source projects can benefit from formal rules for making decisions. সূচিপত্র Understanding governance for your growing project What are examples of formal roles used in open source projects? How do I formalize these leadership roles? When should I give someone commit access? What are some of the common governance structures for open source projects? Do I need governance docs when I launch my project? What happens if corporate employees start submitting contributions? Understanding governance for your growing project Your project is growing, people are engaged, and you’re committed to keeping this thing going. At this stage, you may be wondering how to incorporate regular project contributors into your workflow, whether it’s giving someone commit access or resolving community debates. If you have questions, we’ve got answers. What are examples of formal roles used in open source projects? Many projects follow a similar structure for contributor roles and recognition. What these roles actually mean, though, is entirely up to you. Here are a few types of roles you may recognize: Maintainer Contributor Committer For some projects, “maintainers” are the only people in a project with commit access. In other projects, they’re simply the people who are listed in the README as maintainers. A maintainer doesn’t necessarily have to be someone who writes code for your project. It could be someone who’s done a lot of work evangelizing your project, or written documentation that made the project more accessible to others. Regardless of what they do day-to-day, a maintainer is probably someone who feels responsibility over the direction of the project and is committed to improving it. A “contributor” could be anyone who comments on an issue or pull request, people who add value to the project (whether it’s triaging issues, writing code, or organizing events), or anybody with a merged pull request (perhaps the narrowest definition of a contributor). [For Node.js,] every person who shows up to comment on an issue or submit code is a member of a project’s community. Just being able to see them means that they have crossed the line from being a user to being a contributor. — @mikeal, “Healthy Open Source” The term “committer” might be used to distinguish commit access, which is a specific type of responsibility, from other forms of contribution. While you can define your project roles any way you’d like, consider using broader definitions to encourage more forms of contribution. You can use leadership roles to formally recognize people who have made outstanding contributions to your project, regardless of their technical skill. You might know me as the “inventor” of Django…but really I’m the guy who got hired to work on a thing a year after it was already made. (…) People suspect that I’m successful because of my programming skill…but I’m at best an average programmer. — @jacobian, “PyCon 2015 Keynote” (video) How do I formalize these leadership roles? Formalizing your leadership roles helps people feel ownership and tells other community members who to look to for help. For a smaller project, designating leaders can be as simple as adding their names to your README or a CONTRIBUTORS text file. For a bigger project, if you have a website, create a team page or list your project leaders there. For example, Postgres has a comprehensive team page with short profiles for each contributor. If your project has a very active contributor community, you might form a “core team” of maintainers, or even subcommittees of people who take ownership of different issue areas (for example, security, issue triaging, or community conduct). Let people self-organize and volunteer for the roles they’re most excited about, rather than assigning them. [We] supplement the core team with several “subteams”. Each subteam is focused on a specific area, e.g., language design or libraries. (…) To ensure global coordination and a strong, coherent vision for the project as a whole, each subteam is led by a member of the core team. — “Rust Governance RFC” Leadership teams may want to create a designated channel (like on IRC) or meet regularly to discuss the project (like on Gitter or Google Hangout). You can even make those meetings public so other people can listen. Cucumber-ruby , for example, hosts office hours every week . Once you’ve established leadership roles, don’t forget to document how people can attain them! Establish a clear process for how someone can become a maintainer or join a subcommittee in your project, and write it into your GOVERNANCE.md. Tools like Vossibility can help you publicly track who is (or isn’t) making contributions to the project. Documenting this information avoids the community perception that maintainers are a clique that makes its decisions privately. Finally, if your project is on GitHub, consider moving your project from your personal account to an Organization and adding at least one backup admin. GitHub Organizations make it easier to manage permissions and multiple repositories and protect your project’s legacy through shared ownership . When should I give someone commit access? Some people think you should give commit access to everybody who makes a contribution. Doing so could encourage more people to feel ownership of your project. On the other hand, especially for bigger, more complex projects, you may want to only give commit access to people who have demonstrated their commitment. There’s no one right way of doing it - do what makes you most comfortable! If your project is on GitHub, you can use protected branches to manage who can push to a particular branch, and under which circumstances. Whenever somebody sends you a pull request, give them commit access to your project. While it may sound incredibly stupid at first, using this strategy will allow you to unleash the true power of GitHub. (…) Once people have commit access, they are no longer worried that their patch might go unmerged…causing them to put much more work into it. — @felixge, “The Pull Request Hack” What are some of the common governance structures for open source projects? There are three common governance structures associated with open source projects. BDFL: BDFL stands for “Benevolent Dictator for Life”. Under this structure, one person (usually the initial author of the project) has final say on all major project decisions. Python is a classic example. Smaller projects are probably BDFL by default, because there are only one or two maintainers. A project that originated at a company might also fall into the BDFL category. Meritocracy: (Note: the term “meritocracy” carries negative connotations for some communities and has a complex social and political history .) Under a meritocracy, active project contributors (those who demonstrate “merit”) are given a formal decision making role. Decisions are usually made based on pure voting consensus. The meritocracy concept was pioneered by the Apache Foundation ; all Apache projects are meritocracies. Contributions can only be made by individuals representing themselves, not by a company. Liberal contribution: Under a liberal contribution model, the people who do the most work are recognized as most influential, but this is based on current work and not historic contributions. Major project decisions are made based on a consensus seeking process (discuss major grievances) rather than pure vote, and strive to include as many community perspectives as possible. Popular examples of projects that use a liberal contribution model include Node.js and Rust . Which one should you use? It’s up to you! Every model has advantages and trade-offs. And although they may seem quite different at first, all three models have more in common than they seem. If you’re interested in adopting one of these models, check out these templates: BDFL model template Meritocracy model template Node.js’s liberal contribution policy Do I need governance docs when I launch my project? There is no right time to write down your project’s governance, but it’s much easier to define once you’ve seen your community dynamics play out. The best (and hardest) part about open source governance is that it is shaped by the community! Some early documentation will inevitably contribute to your project’s governance, however, so start writing down what you can. For example, you can define clear expectations for behavior, or how your contributor process works, even at your project’s launch. If you’re part of a company launching an open source project, it’s worth having an internal discussion before launch about how your company expects to maintain and make decisions about the project moving forward. You may also want to publicly explain anything particular to how your company will (or won’t!) be involved with the project. We assign small teams to manage projects on GitHub who are actually working on these at Facebook. For example, React is run by a React engineer. — @caabernathy, “An inside look at open source at Facebook” What happens if corporate employees start submitting contributions? Successful open source projects get used by many people and companies, and some companies may eventually have revenue streams eventually tied to the project. For example, a company may use the project’s code as one component in a commercial service offering. As the project gets more widely used, people who have expertise in it become more in-demand - you may be one of them! - and will sometimes get paid for work they do in the project. It’s important to treat commercial activity as normal and as just another source of development energy. Paid developers shouldn’t get special treatment over unpaid ones, of course; each contribution must be evaluated on its technical merits. However, people should feel comfortable engaging in commercial activity, and feel comfortable stating their use cases when arguing in favor of a particular enhancement or feature. “Commercial” is completely compatible with “open source”. “Commercial” just means there is money involved somewhere - that the software is used in commerce, which is increasingly likely as a project gains adoption. (When open source software is used as part of a non-open-source product, the overall product is still “proprietary” software, though, like open source, it might be used for commercial or non-commercial purposes.) Like anyone else, commercially-motivated developers gain influence in the project through the quality and quantity of their contributions. Obviously, a developer who is paid for her time may be able to do more than someone who is not paid, but that’s okay: payment is just one of many possible factors that could affect how much someone does. Keep your project discussions focused on the contributions, not on the external factors that enable people to make those contributions. Do I need a legal entity to support my project? You don’t need a legal entity to support your open source project unless you’re handling money. For example, if you want to create a commercial business, you’ll want to set up a C Corp or LLC (if you’re based in the US). If you’re just doing contract work related to your open source project, you can accept money as a sole proprietor, or set up an LLC (if you’re based in the US). If you want to accept donations for your open source project, you can set up a donation button (using PayPal or Stripe, for example), but the money won’t be tax-deductible unless you are a qualifying nonprofit (a 501c3, if you’re in the US). Many projects don’t wish to go through the trouble of setting up a nonprofit, so they find a nonprofit fiscal sponsor instead. A fiscal sponsor accepts donations on your behalf, usually in exchange for a percentage of the donation. Software Freedom Conservancy , Apache Foundation , Eclipse Foundation , Linux Foundation and Open Collective are examples of organizations that serve as fiscal sponsors for open source projects. Our goal is to provide an infrastructure that communities can use to be self sustainable, thus creating an environment where everyone — contributors, backers, sponsors — get concrete benefits out of it. — @piamancini, “Moving beyond the charity framework” If your project is closely associated with a certain language or ecosystem, there may also be a related software foundation you can work with. For example, the Python Software Foundation helps support PyPI , the Python package manager, and the Node.js Foundation helps support Express.js , a Node-based framework. সকল নির্দেশিকায় ফেরত যান একই সম্পর্কিত নির্দেশিকা রক্ষণাবেক্ষণকারিদের জন্য আর্দশ অনুশীলন নথিপত্র পক্রিয়াকরন থেকে শুরু করে সম্প্রদায়কে উন্নত করার ক্ষেত্রে, অপনার জীবনকে সহজ করুন একজন ওপেন সোর্স রক্ষণাবেক্ষণকারি হিসাবে। Open Source Metrics Make informed decisions to help your open source project thrive by measuring and tracking its success. Scroll to Top অবদান রাখুন আপনি কি পরামর্শ দিতে চান? এই বিষয়বস্তু ওপেন সোর্স। এটা উন্নত করতে আমাদের সাহায্য করুন। অবদান রাখুন সংযুক্ত থাকুন গিটহাব এর সর্বশেষ সংবাদ এবং সম্পদের খবর সবার আগে শুনুন। ইমেইল এর ঠিকানা fine print এর সাথে সঙ্গে এবং বন্ধুরা | 2026-01-13T09:29:14 |
https://www.linkedin.com/products/cloudflare-waf/ | Cloudflare WAF | LinkedIn Skip to main content LinkedIn Cloudflare in Asan Expand search This button displays the currently selected search type. When expanded it provides a list of search options that will switch the search inputs to match the current selection. Jobs People Learning Clear text Clear text Clear text Clear text Clear text Join now Sign in Cloudflare WAF Web Application Firewalls (WAF) by Cloudflare See who's skilled in this Add as skill Get started Report this product About Built for the modern enterprise architecture An intelligent, integrated, and scalable solution to protect your business-critical web applications from malicious attacks, with no changes to your existing infrastructure. Media Products media viewer No more previous content Cloudflare WAF: Product Demo The Cloudflare web application firewall, or WAF, is an OSI layer 7 intelligent, integrated, and scalable solution to secure your web applications, without changing your existing infrastructure or sacrificing performance. The Cloudflare WAF protects against a large number of web attack vectors including file inclusion, Cross-Site Scripting attacks, SQL injections, and many other vulnerabilities. This video will highlight key features of the Cloudflare WAF, including how to use the WAF rulesets t Cloudflare Web Application Firewall Cloudflare Web Application Firewall's intuitive dashboard enables users to build powerful rules through easy clicks and also provides Terraform integration. Every request to the WAF is inspected against the rule engine and the threat intelligence curated from protecting approximately 25 million websites. Suspicious requests can be blocked, challenged or logged as per the needs of the user while legitimate requests are routed to the destination, agnostic of whether it lives on-premise or in the c No more next content Featured customers of Cloudflare WAF Sony Music Entertainment Musicians 1,282,988 followers Zerodha Financial Services 580,035 followers Chrono24 Retail Luxury Goods and Jewelry 15,639 followers OneTrust Software Development 380,493 followers Blackmores Group Wellness and Fitness Services 61,966 followers Maropost Commerce Cloud Software Development 3,187 followers TMB (Trusted Media Brands) Media Production 132,785 followers ThredUp Retail Apparel and Fashion 73,324 followers Quintype Technologies Inc. Software Development 32,538 followers Kathmandu Retail 25,574 followers orderbird IT Services and IT Consulting 5,084 followers Oak National Academy E-Learning Providers 25,588 followers Carousell Group Software Development 129,533 followers Naranja X Financial Services 837,339 followers INSEAD Higher Education 739,009 followers Hemnet Real Estate 12,582 followers Trendyol Group Technology, Information and Internet 536,123 followers udaan.com Technology, Information and Internet 606,047 followers 早稲田大学 WASEDA University Higher Education 112,057 followers SurePrep, part of Thomson Reuters Software Development 9,598 followers Show more Show less Similar products Akamai Web Application Protector Akamai Web Application Protector Web Application Firewalls (WAF) Imperva Web Application Firewall (WAF) Imperva Web Application Firewall (WAF) Web Application Firewalls (WAF) Advanced API Security Advanced API Security Web Application Firewalls (WAF) Radware Cloud WAF Radware Cloud WAF Web Application Firewalls (WAF) Alibaba Web Application Firewall Alibaba Web Application Firewall Web Application Firewalls (WAF) DNSFilter DNSFilter Web Application Firewalls (WAF) Sign in to see more Show more Show less Cloudflare products Argo Smart Routing Argo Smart Routing Network Management Software Cloudflare DDoS Protection Cloudflare DDoS Protection DDoS Protection Software Cloudflare DNS Cloudflare DNS Managed DNS Services Software Cloudflare Load Balancing Cloudflare Load Balancing Load Balancing Software Cloudflare Registrar Cloudflare Registrar Managed DNS Services Software Cloudflare Spectrum Cloudflare Spectrum DDoS Protection Software Cloudflare SSL / TLS Cloudflare SSL / TLS SSL Certificates Software Cloudflare Web Analytics Cloudflare Web Analytics Digital Analytics Software Cloudflare Workers Cloudflare Workers Server Virtualization Software Show more Show less LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines English (English) Language | 2026-01-13T09:29:14 |
https://www.linkedin.com/signup/cold-join?session_redirect=%2Fservices%2Fproducts%2Fkaltura-video-platform%2F&trk=products_details_guest_nav-header-join | Sign Up | LinkedIn Make the most of your professional life Join LinkedIn now — it’s free! Not you? Remove photo Join LinkedIn To create a LinkedIn account, you must understand how LinkedIn processes your personal information by selecting learn more for each item listed. Agree to all terms We collect and use personal information. Learn more We share personal information with third parties to provide our services. Learn more Further information is available in our Korea Privacy Addendum . Privacy Policy Addendum 1 of 2 2 of 2 Agree to the term Continue Back Agree to all terms Email Password Show First name Last name Remember me By clicking Agree & Join, you agree to the LinkedIn User Agreement , Privacy Policy , and Cookie Policy . Agree & Join or Looks like you’re using Gmail, sign up faster with Google in one tap. Continue with ( not you? ) or Sign up with credential instead Security verification Already on LinkedIn? Sign in Looking to create a page for a business? Get help LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) Language Takes less than 2 minutes Join LinkedIn to connect with people, jobs and opportunities that matter Join now Leave | 2026-01-13T09:29:14 |
https://www.fxn.xyz/acquire/bridge-explorer | Function | FBTC About Ecosystem Proof of Assets Acquire Swap & Bridge Bridge Explorer Points About Ecosystem Proof of Assets Acquire Points Bridge Explorer Source chain Tx Destination chain Tx Transfer from Transfer to Amount State Date Company About Blog Protocol Ecosystem Proof of Assets Dune Dashboard Resources Documentation Audits Media Assets Legal Privacy Policy Terms of Service Risk Disclosure Statement Get in Touch Discord Medium Github Linkedin Telegram X © Function 2025. All rights reserved | 2026-01-13T09:29:14 |
https://docs.collab.land/help-docs/miniapps/getting-started | Getting started | Collab.Land Documentation Skip to main content Collab.Land Documentation Members & Admins ctrl K Introduction Key Features Setting Up the Bot Command Center Miniapps Getting started Miniapps Wallets Bot Errors FAQs Miniapps Getting started On this page Getting started Browse & Install apps Community administrators can see a comprehensive list of all the apps available in the Collab.Land Miniapps within the Command Center . The displayed apps contain useful information such as the title, icon, brief description, rating, cost and category (bot command or CC). tip View the Miniapps tutorial video on the Collab.Land youtube channel. Admins can search for a specific app using its name, or filter the available options. Additionally, admins can sort the apps by their alphabetical order, date added, and price. To install an app, an administrator clicks the "Install" button. A window appears displaying the price of the app and the available balance or indicating if it's a "Free Install". Upon completion of the installation, the install button will change to uninstall, and the app will be ready to use. Miniapp Subscriptions Navigating the Collab.Land miniapps, admins and members will find that some miniapps now carry a cost, while others are free to install. The paid miniapps are a monthly subscription, ensuring continued access and utility for your community. Should you choose to discontinue your subscription, it's important to know that access to the miniapp will only be available until the end of the current subscription month. To effectively discontinue your subscription, please proceed to Stripe. Worried about losing your settings? Fret not. You have the option to reinstate your subscription at any time, and all your previously set rules will remain untouched and intact. For those who had the advantage of installing the miniapp prior to the payment requirement, you will continue access without any charge. Please note that this privilege may be subject to change in the future. However, adequate notice will be provided, allowing you ample time to make necessary adjustments. In conclusion, as a platform ardently supporting customized communities that champion pro-social behavior, we appreciate community administrators for nurturing cooperative environments. Your satisfaction remain at the forefront as you explore the thoughtful offerings of the Collab.Land marketplace, underlining our commitment to community growth. Previous Miniapps Next Role Composition Browse & Install apps Miniapp Subscriptions Privacy Policy Terms of Service Collab.Land® 2025 | 2026-01-13T09:29:14 |
https://docs.collab.land/help-docs/FAQ/already-existing-tg-group | Adding Collab.Land Bot to an Existing Telegram Group | Collab.Land Documentation Skip to main content Collab.Land Documentation Members & Admins ctrl K Introduction Key Features Setting Up the Bot Command Center Miniapps Wallets Bot Errors FAQs Already Existing Telegram Group Collab.Land Project Contact Collab.Land Team Join a Telegram Group Report Scams Security & Privacy Support Ticket Dos and Don'ts Telegram Bot Commands FAQs Already Existing Telegram Group On this page Adding Collab.Land Bot to an Existing Telegram Group If you're planning to add the Collab.Land bot to an already existing Telegram group—especially one that's either not currently token-gated or using a different bot—please read this carefully to avoid unintended disruptions. Recommended: Create a New Group To ensure a smooth transition and protect your member experience, we strongly recommend creating a new Telegram group and inviting the Collab.Land bot from the start. Once your new group is ready, you can: Post the Collab.Land invite link (available in your Command Center) in your current group Also share the invite link on your socials to make sure all current and future members know where to go Notify members about the move and when the new group will become the primary chat This approach maintains your community's integrity and gives everyone a clear path to rejoin using Collab.Land's verification process. What Happens If You Add Collab.Land Bot to an Existing Group If you add Collab.Land directly to an existing group instead: The bot will monitor messages. When a member chats, Collab.Land will: ✅ Allow them to stay if they've already connected to Collab.Land and qualify ❌ Kick them if they've never connected to Collab.Land ❌ Kick them if they've connected but no longer qualify Members who do not chat will remain in the group—meaning unverified or ineligible users could still be present until they speak. TL;DR: To preserve your community structure and avoid surprise kicks: Create a new group, invite the Collab.Land bot, and share the invite link in your old group and on socials with clear migration instructions. You'll find your unique invite link in the Command Center under the group's setup page. For more help, see the Telegram Bot Commands or Join a Telegram Group FAQ pages. Previous Role not positioned correctly Next Collab.Land Project Recommended: Create a New Group What Happens If You Add Collab.Land Bot to an Existing Group Privacy Policy Terms of Service Collab.Land® 2025 | 2026-01-13T09:29:14 |
https://www.linkedin.com/products/cloudflare-workers/?trk=products_seo_search | Cloudflare Workers | LinkedIn Skip to main content LinkedIn Cloudflare in Asan Expand search This button displays the currently selected search type. When expanded it provides a list of search options that will switch the search inputs to match the current selection. Jobs People Learning Clear text Clear text Clear text Clear text Clear text Join now Sign in Cloudflare Workers Server Virtualization Software by Cloudflare See who's skilled in this Add as skill Try now Report this product About Build your next application with Cloudflare Workers Media Products media viewer No more previous content Announcing Deploy to Cloudflare Workers We think Cloudflare Workers is the best serverless tool on the market, so we wanted to make it easier for developers to deploy projects and get started building cool stuff on the platform! Our new Deploy to Cloudflare Workers site is just that — a way for both new and experienced Workers users to deploy new serverless projects directly from GitHub. In just a few clicks, we'll configure and deploy the project for you, giving you a new GitHub repo to start hacking on your next great project! What Cloudflare Workers do? Building serverless applications with Cloudflare Workers' Cron Job Scheduler and Key Value Store Learn how to build an application with the the newly announced cron job scheduler, Cron Triggers, from Cloudflare Workers. In this demo, we will explain what Cron Triggers are, how to quickly get started using them, and how to write and deploy your own. We will also review how to integrate with Workers KV, our key value store that allows you to store data at the edge and retrieve it inside your Workers' project instead of sending that data to alternative platforms such as Postgres or Firebase. No more next content Featured customers of Cloudflare Workers npm, Inc. Software Development 11,912 followers DoorDash Software Development 1,437,130 followers 23andMe Non-profit Organizations 81,297 followers Timely IT Services and IT Consulting 5,725 followers Adobe Marketo Software Development 178,692 followers Cordial Software Development 48,215 followers MaxMind Technology, Information and Internet 2,991 followers Optimizely Software Development 167,115 followers Discord Software Development 467,975 followers Broadcom Semiconductor Manufacturing 608,798 followers Glossier, Inc. Personal Care Product Manufacturing 492,298 followers ProPublica Media Production 72,236 followers Show more Show less Similar products Cloud Virtual Machine (CVM) Cloud Virtual Machine (CVM) Server Virtualization Software Proxmox Virtual Environment Proxmox Virtual Environment Server Virtualization Software SC//Fleet Manager SC//Fleet Manager Server Virtualization Software SC//Platform SC//Platform Server Virtualization Software BTS Sybelle Virtualization Platform BTS Sybelle Virtualization Platform Server Virtualization Software Oracle Virtualization Oracle Virtualization Server Virtualization Software Sign in to see more Show more Show less Cloudflare products Argo Smart Routing Argo Smart Routing Network Management Software Cloudflare DDoS Protection Cloudflare DDoS Protection DDoS Protection Software Cloudflare DNS Cloudflare DNS Managed DNS Services Software Cloudflare Load Balancing Cloudflare Load Balancing Load Balancing Software Cloudflare Registrar Cloudflare Registrar Managed DNS Services Software Cloudflare Spectrum Cloudflare Spectrum DDoS Protection Software Cloudflare SSL / TLS Cloudflare SSL / TLS SSL Certificates Software Cloudflare WAF Cloudflare WAF Web Application Firewalls (WAF) Cloudflare Web Analytics Cloudflare Web Analytics Digital Analytics Software Show more Show less LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines English (English) Language | 2026-01-13T09:29:14 |
https://ben.balter.com/ | Posts | Ben Balter Ben Balter Posts About Contact Technology leadership, collaboration, and open source How to run LanguageTool on macOS January 30, 2025 The “I don’t like what they’re saying, so they shouldn’t be allowed to say it” approach to crisis management January 8, 2024 Cathedral vs Bazaar People Management December 8, 2023 How to communicate like a GitHub engineer October 4, 2023 Transparent collaboration is the andon of your knowledge production system August 30, 2023 Remote work requires communicating more, less frequently August 4, 2023 Pull requests are a form of documentation May 19, 2023 Practice inclusive scheduling May 19, 2023 Meetings are a point of escalation, not the starting point of a conversation April 20, 2023 Intro to GitHub for non-technical roles March 2, 2023 How to write a great extended leave document January 13, 2023 Manage like an engineer January 10, 2023 Helpful 404s for Jekyll (and GitHub Pages) June 30, 2022 Why you should work asynchronously March 17, 2022 The seven things a corporate Chief of Staff does March 9, 2022 Leaders show their work February 16, 2022 Using GitHub Actions to get notified when an API response (or web page) changes December 15, 2021 How I re-over-engineered my home network for privacy and security September 1, 2021 Advice for managing open source communities at scale June 15, 2021 Moderating open source conversations to keep them productive June 15, 2021 Five (and a half) practical tips for governing your open source project June 14, 2021 Nine things a (technical) program manager does March 26, 2021 Octoversary - eight years of optimizing for developer happiness March 4, 2021 What to read before starting (or interviewing) at GitHub February 1, 2021 Analysis of federal .gov domains, pre-Biden edition January 11, 2021 How I over-engineered my home network for privacy and security December 4, 2020 The top 10 posts of the past 10 years September 12, 2020 Budget for the hidden “internet tax” August 31, 2020 How I manage GitHub notifications August 25, 2020 Tools of the trade: How I communicate at GitHub (and why) August 14, 2020 Automate common open source community management tasks August 10, 2020 Seven ways to set open source contributors up for success May 15, 2020 Eight tips for working remotely March 18, 2020 User blocking vs. user muting February 6, 2020 10 lessons learned fostering a community of communities at GitHub January 17, 2020 Resolutions for sustaining and growing open source communities January 2, 2020 A community of communities: Empowering maintainers to grow communities around their code July 18, 2019 Go near, go far, meet in the middle June 28, 2019 What lawyers can learn from open source February 6, 2019 Problems, not solutions July 16, 2018 Yes, No, Maybe May 4, 2018 Why you probably shouldn’t add a CLA to your open source project January 2, 2018 Everything an open source maintainer might need to know about open source licensing November 28, 2017 Twelve tips for growing communities around your open source project November 10, 2017 How not to prioritize a feature June 19, 2017 Seven ways to consistently ship great features May 23, 2017 Your project’s README is your project’s constitution April 14, 2017 Using protected branches to empower non-code contributors on GitHub April 14, 2017 Three easy ways to show employees they’re appreciated April 4, 2017 Bikeshed honeypots March 1, 2017 How I Atom (for prose) December 23, 2016 Eight things I wish I knew my first week at GitHub October 31, 2016 The seven habits of highly effective GitHubbers September 13, 2016 How to make a product great August 22, 2016 Why you shouldn’t write your own open source license August 1, 2016 Removing a feature is a feature July 21, 2016 Books for geeks July 11, 2016 Twelve things a product manager does June 6, 2016 Moderating a controversial pull request May 11, 2016 The missed opportunity that is the White House Open Source Policy April 11, 2016 Optimizing for power users and edge cases is the easy part March 8, 2016 How to derail any meeting January 15, 2016 The six types of pull requests you see on GitHub December 8, 2015 Open source as Yelp for software December 8, 2015 Why open source November 23, 2015 Four characteristics of modern collaboration tools November 18, 2015 Why everything should have a URL November 12, 2015 The three biggest challenges in government IT October 18, 2015 Bringing open source workflows to the enterprise September 21, 2015 How to add an “improve this content” button to your GitHub Pages site September 13, 2015 How GitHub uses automated testing to empower developers to write less-corporate blog posts September 10, 2015 Five principles to guide any government IT effort August 23, 2015 The Zen of GitHub August 12, 2015 Speak like a human: 12 ways tech companies can write less-corporate blog posts July 20, 2015 Open procurement: procurement in an increasingly open source world July 11, 2015 Merge by committee June 22, 2015 Using GitHub Pages to showcase your organization’s open source efforts June 11, 2015 Copyright notices for open source projects June 3, 2015 Test your content May 22, 2015 Analysis of federal .gov domains, 2015 edition May 11, 2015 Eight lessons learned hacking on GitHub Pages for six months April 27, 2015 The difference between 18F and USDS April 22, 2015 19 reasons why technologists don’t want to work at your government agency April 21, 2015 Five best practices in open source: external engagement March 17, 2015 Five best practices in open source: internal collaboration March 8, 2015 Explain like I’m five: Jekyll collections February 20, 2015 Why your agency’s first open source project is going to be a flop February 11, 2015 Diff (and collaborate on) Microsoft Word documents using GitHub February 6, 2015 What does your organization optimize for? January 27, 2015 The fine print nobody reads: what to do so government can use your service January 26, 2015 Hacking GitHub: 14 simple tools to help introduce open source to the uninitiated January 11, 2015 Why you should care about HTTPS, even if you have nothing to hide January 6, 2015 Geeks and suits December 18, 2014 The myth of government IT December 17, 2014 A White House open source policy written by a geek November 24, 2014 15 rules for communicating at GitHub November 6, 2014 What is a Government Evangelist? October 15, 2014 What’s next for federal IT policy, IMHO October 15, 2014 Eight reasons why government contractors should embrace open source software October 8, 2014 Everything a government attorney needs to know about open source software licensing October 8, 2014 If you liked it then you should have put a URL on it October 7, 2014 Disclosed source is not the same as open source September 29, 2014 Our code deserves better September 29, 2014 Open source is (not) insecure September 22, 2014 Three things you learn going from the most bureaucratic organization in the world to the least August 24, 2014 Why isn’t all government software open source? August 3, 2014 Why FedRAMP actually makes it harder for government agencies to move to the cloud July 29, 2014 Analysis of Federal Executive .govs (Part Deux) July 7, 2014 How to identify a strong open source project June 2, 2014 Open government is so ‘08, or why collaborative government is the next big thing June 2, 2014 Word versus Markdown: more than mere semantics March 31, 2014 Want to innovate government? Focus on culture March 21, 2014 Header hover anchor links on GitHub Pages using Jekyll March 13, 2014 Open source, not just software anymore January 27, 2014 Why no one uses your government data December 30, 2013 That’s not how the internet works November 21, 2013 Jekyll: Where content is truly king October 30, 2013 Ten Things You Learn as a Presidential Innovation Fellow September 30, 2013 Treat Data as Code September 16, 2013 Friction August 11, 2013 Everyone Contributes August 11, 2013 Bet on the little guy July 2, 2013 The technology’s the easy part July 1, 2013 How to convert Shapefiles to GeoJSON maps for use on GitHub (and why you should) June 26, 2013 An open letter to government CIOs June 12, 2013 We’ve Been Selling Open Source Wrong May 14, 2013 The store that sells only one thing. February 27, 2013 The next big thing is already here February 6, 2013 What is a ‘Hacker’? February 4, 2013 Securing the Status Quo December 26, 2012 Deprecate Management December 16, 2012 Why WordPress’s next version should just give it a REST already December 15, 2012 We’ve been trained to make paper October 19, 2012 Open Source is not a verb October 15, 2012 Welcome to the Post-CMS World October 1, 2012 Government’s Release of Federally Funded Source Code: Public Domain or Open Source? Yes. July 26, 2012 The Demise of the Personal Dashboard July 10, 2012 Why You Should Always Write Software as Open Source, Even When It’s Never Going to Be June 26, 2012 Publishing Government Data That Developers Will Actually Use June 2, 2012 WordPress as a Collaboration Platform May 8, 2012 Enterprise Open Source Usage Is Up, But Challenges Remain April 23, 2012 CFPB Accepts First Citizen-Submitted Code on Behalf of Federal Government April 15, 2012 What’s Missing from CFPB’s Awesome New Source Code Policy April 10, 2012 WordPress for Government - A Problem of Perception March 5, 2012 PHP is Insecure (and Other Enterprise Open-Source F.U.D.) March 2, 2012 GitHub for Journalism — What WordPress Post Forking could do to Editorial Workflows February 28, 2012 Open-Source Alternatives to Proprietary Enterprise Software February 27, 2012 Towards a More Agile Government November 29, 2011 Federal Agility: a Cultural Solution to a Technical Problem November 1, 2011 Why Digital Talent Doesn’t Want To Work At Your Company October 29, 2011 Advanced Workflow Management Tools for WP Document Revisions October 24, 2011 Analysis of Federal Executive .govs September 7, 2011 Why WordPress September 1, 2011 Enterprise, Open Source, and Why Better is not Enough August 31, 2011 WP Document Revisions — Document Management and Version Control for WordPress August 29, 2011 When all you have is a pair of bolt cutters… April 4, 2011 Other recommended reading Fine Print | 2026-01-13T09:29:14 |
https://docs.collab.land/help-docs/command-center/community-roles | Community Roles | Collab.Land Documentation Skip to main content Collab.Land Documentation Members & Admins ctrl K Introduction Key Features Setting Up the Bot Command Center Add your server Create a TGR Bot Config Community Roles Miniapps Wallets Bot Errors FAQs Command Center Community Roles On this page Community Roles What is it? The Community Roles tab is an important feature that allows administrators to ensure that users in their community have the correct roles assigned to them. By checking this tab, administrators can easily identify any role-related issues and resolve them promptly. How to use it Here's how to use the Community Roles tab: Enter the User ID for the user whose roles you want to check. This is an 18-digit number different from the Discord username and can be found by right-clicking the member's icon in Discord, and selecting "Copy ID", with Developer Mode on. Click on the "Check Discord Roles" button. This will show you the roles that are currently assigned to the user. If there is a problem with the roles, a "Resolve" button will appear. Clicking on this button will fix the issue. For example, if a role is missing that should be assigned, or vice versa, this button will help you resolve the issue. If the issue cannot be resolved, you will be notified with an error. In that case, go to the "Bot Config" tab and click "Check bot configuration" Previous Bot configuration Next Miniapps What is it? How to use it Privacy Policy Terms of Service Collab.Land® 2025 | 2026-01-13T09:29:14 |
https://www.fxn.xyz/about | Function | FBTC About Ecosystem Proof of Assets Acquire Swap & Bridge Bridge Explorer Points About Ecosystem Proof of Assets Acquire Points Activating Dormant Value Function is building the financial infrastructure that makes Bitcoin productive, unlocking yield, liquidity, and capital efficiency for holders across DeFi and traditional finance. FBTC turns Bitcoin into an asset that works. 𝑓(BTC) = liquidity + composability + capital efficiency Institutional Trust Backed by Antalpha, Galaxy, Mantle and others on its security council, FBTC offers robust infrastructure institutions demand with full transparency. Seamless Liquidity Direct minting/burning of FBTC across leading ecosystems including Ethereum, Mantle, Arbitrum, and more. Strong Distribution Unmatched distribution channels through Antalpha, Galaxy, and Mantle’s networks. Deep DeFi Integration Enabling yield products on Avalon, Babylon, Cian, and more. Our Mission Transform Bitcoin from a passive store of value to a functional, productive asset. Backed By View Docs → Your gateway to everything FBTC. Explore our architecture, security framework, smart contracts and more. View Whitepaper → Explore the Function vision. Read how FBTC transforms Bitcoin from a passive store of value into a secure, liquid, and productive asset powering global finance. Transparency → Access live proof-of-assets, custody addresses, and a real-time dashboard that ensures every FBTC is fully backed, auditable, and verifiable on-chain. Company About Blog Protocol Ecosystem Proof of Assets Dune Dashboard Resources Documentation Audits Media Assets Legal Privacy Policy Terms of Service Risk Disclosure Statement Get in Touch Discord Medium Github Linkedin Telegram X © Function 2025. All rights reserved | 2026-01-13T09:29:14 |
http://choosealicense.com/licenses/apache-2.0/ | Apache License 2.0 | Choose a License Home / Licenses Apache License 2.0 A permissive license whose main conditions require preservation of copyright and license notices. Contributors provide an express grant of patent rights. Licensed works, modifications, and larger works may be distributed under different terms and without source code. Permissions Conditions Limitations Commercial use Distribution Modification Patent use Private use License and copyright notice State changes Liability Trademark use Warranty Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. Copy license text to clipboard Suggest this license Make a pull request to suggest this license for a project that is not licensed . Please be polite: see if a license has already been suggested, try to suggest a license fitting for the project’s community , and keep your communication with project maintainers friendly. How to apply this license Create a text file (typically named LICENSE or LICENSE.txt) in the root of your source code and copy the text of the license into the file. Optional steps The Apache Software Foundation recommends taking the additional step of adding a boilerplate notice to the header of each source file. You can find the notice in the appendix at the very end of the license text. Add Apache-2.0 to your project’s package description, if applicable (e.g., Node.js , Ruby , and Rust ). This will ensure the license is displayed in package directories. Source Who’s using this license? Kubernetes PDF.js Swift About Terms of Service Help improve this page The content of this site is licensed under the Creative Commons Attribution 3.0 Unported License . Curated with ❤️ by GitHub, Inc. and You! | 2026-01-13T09:29:14 |
https://typedoc.org/#quick-start | TypeDoc TypeDoc Example API GitHub Preparing search index... TypeDoc TypeDoc converts comments in TypeScript's source code into HTML documentation or a JSON model. Quick Start TypeDoc generates documentation based on your exports. It will follow re-exports to document members declared in other files for each entry point. # Install npm install --save-dev typedoc # Build docs using package.json "exports" or "main" fields as entry points npx typedoc Copy If TypeDoc is unable to discover your entry points, they can be provided manually: # Build docs using exports from src/index.ts npx typedoc src/index.ts Copy If you are documenting an application rather than a library, which doesn't have a single entry point, you may want to document each file individually. # Generate docs for all TypeScript files under src npx typedoc --entryPointStrategy Expand src Copy TypeDoc supports a variety of options and themes . It is extensible via the plugin API . Settings Theme OS Light Dark On This Page Quick Start Example API GitHub TypeDoc Loading... Generated using TypeDoc | 2026-01-13T09:29:14 |
https://www.fxn.xyz/proof_of_assets | Function | FBTC About Ecosystem Proof of Assets Acquire Swap & Bridge Bridge Explorer Points About Ecosystem Proof of Assets Acquire Points Proof of Assets BTC Reserve 0.0000 $0 USD Total FBTC 0.0000 $0 USD By Chain By Protocol Bitcoin Reserve Address List The custodian performs audits on a regular basis to show transparency through publicly viewable and verifiable transactions. The bitcoin address below are controlled by the custodian. Bitcoin Custodian Address Balance Total Balance 0 Company About Blog Protocol Ecosystem Proof of Assets Dune Dashboard Resources Documentation Audits Media Assets Legal Privacy Policy Terms of Service Risk Disclosure Statement Get in Touch Discord Medium Github Linkedin Telegram X © Function 2025. All rights reserved | 2026-01-13T09:29:14 |
https://opensource.guide/pcm/starting-a-project/ | Starting an Open Source Project | Open Source Guides About Put hand العربية Български Bangla Deutsch Ελληνικά English Español Farsi Français Hindi Magyar Indonesia Italiano 日本語 한국어 Malay Nederlands Pidgin Polski Português Romanian Русский संस्कृतम् Swahili தமிழ் Türkçe 简体中文 繁體中文 Open Source Guides Starting an Open Source Project Learn more about the world of open source and get ready to launch your own project. Table of Contents The “what” and “why” of open source Should I launch my own open source project? Launching your own open source project Naming and branding your project Your pre-launch checklist The “what” and “why” of open source So you’re thinking about getting started with open source? Congratulations! The world appreciates your contribution. Let’s talk about what open source is and why people do it. What does “open source” mean? When a project is open source, that means anybody is free to use, study, modify, and distribute your project for any purpose. These permissions are enforced through an open source license . Open source is powerful because it lowers the barriers to adoption and collaboration, allowing people to spread and improve projects quickly. Also because it gives users a potential to control their own computing, relative to closed source. For example, a business using open source software has the option to hire someone to make custom improvements to the software, rather than relying exclusively on a closed source vendor’s product decisions. Free software refers to the same set of projects as open source . Sometimes you’ll also see these terms combined as “free and open source software” (FOSS) or “free, libre, and open source software” (FLOSS). Free and libre refer to freedom, not price . Why do people open source their work? One of the most rewarding experiences I get out of using and collaborating on open source comes from the relationships that I build with other developers facing many of the same problems I am. — @kentcdodds, “How getting into Open Source has been awesome for me” There are many reasons why a person or organization would want to open source a project. Some examples include: Collaboration: Open source projects can accept changes from anybody in the world. Exercism , for example, is a programming exercise platform with over 350 contributors. Adoption and remixing: Open source projects can be used by anyone for nearly any purpose. People can even use it to build other things. WordPress , for example, started as a fork of an existing project called b2 . Transparency: Anyone can inspect an open source project for errors or inconsistencies. Transparency matters to governments like Bulgaria or the United States , regulated industries like banking or healthcare, and security software like Let’s Encrypt . Open source isn’t just for software, either. You can open source everything from data sets to books. Check out GitHub Explore for ideas on what else you can open source. Does open source mean “free of charge”? One of open source’s biggest draws is that it does not cost money. “Free of charge”, however, is a byproduct of open source’s overall value. Because an open source license requires that anyone can use, modify, and share your project for nearly any purpose, projects themselves tend to be free of charge. If the project cost money to use, anyone could legally make a copy and use the free version instead. As a result, most open source projects are free, but “free of charge” is not part of the open source definition. There are ways to charge for open source projects indirectly through dual licensing or limited features, while still complying with the official definition of open source. Should I launch my own open source project? The short answer is yes, because no matter the outcome, launching your own project is a great way to learn how open source works. If you’ve never open sourced a project before, you might be nervous about what people will say, or whether anyone will notice at all. If this sounds like you, you’re not alone! Open source work is like any other creative activity, whether it’s writing or painting. It can feel scary to share your work with the world, but the only way to get better is to practice - even if you don’t have an audience. If you’re not yet convinced, take a moment to think about what your goals might be. Setting your goals Goals can help you figure out what to work on, what to say no to, and where you need help from others. Start by asking yourself, why am I open sourcing this project? There is no one right answer to this question. You may have multiple goals for a single project, or different projects with different goals. If your only goal is to show off your work, you may not even want contributions, and even say so in your README. On the other hand, if you do want contributors, you’ll invest time into clear documentation and making newcomers feel welcome. At some point I created a custom UIAlertView that I was using…and I decided to make it open source. So I modified it to be more dynamic and uploaded it to GitHub. I also wrote my first documentation explaining to other developers how to use it on their projects. Probably nobody ever used it because it was a simple project but I was feeling good about my contribution. — @mavris, “Self-taught Software Developers: Why Open Source is important to us” As your project grows, your community may need more than just code from you. Responding to issues, reviewing code, and evangelizing your project are all important tasks in an open source project. While the amount of time you spend on non-coding tasks will depend on the size and scope of your project, you should be prepared as a maintainer to address them yourself or find someone to help you. If you’re part of a company open sourcing a project, make sure your project has the internal resources it needs to thrive. You’ll want to identify who’s responsible for maintaining the project after launch, and how you’ll share those tasks with your community. If you need a dedicated budget or staffing for promotion, operations and maintaining the project, start those conversations early. As you begin to open source the project, it’s important to make sure that your management processes take into consideration the contributions and abilities of the community around your project. Don’t be afraid to involve contributors who are not employed in your business in key aspects of the project — especially if they are frequent contributors. — @captainsafia, “So you wanna open source a project, eh?” Contributing to other projects If your goal is to learn how to collaborate with others or understand how open source works, consider contributing to an existing project. Start with a project that you already use and love. Contributing to a project can be as simple as fixing typos or updating documentation. If you’re not sure how to get started as a contributor, check out our How to Contribute to Open Source guide . Launching your own open source project There is no perfect time to open source your work. You can open source an idea, a work in progress, or after years of being closed source. Generally speaking, you should open source your project when you feel comfortable having others view, and give feedback on, your work. No matter which stage you decide to open source your project, every project should include the following documentation: Open source license README Contributing guidelines Code of conduct As a maintainer, these components will help you communicate expectations, manage contributions, and protect everyone’s legal rights (including your own). They significantly increase your chances of having a positive experience. If your project is on GitHub, putting these files in your root directory with the recommended filenames will help GitHub recognize and automatically surface them to your readers. Choosing a license An open source license guarantees that others can use, copy, modify, and contribute back to your project without repercussions. It also protects you from sticky legal situations. You must include a license when you launch an open source project. Legal work is no fun. The good news is that you can copy and paste an existing license into your repository. It will only take a minute to protect your hard work. MIT , Apache 2.0 , and GPLv3 are the most popular open source licenses, but there are other options to choose from. When you create a new project on GitHub, you are given the option to select a license. Including an open source license will make your GitHub project open source. If you have other questions or concerns around the legal aspects of managing an open source project, we’ve got you covered . Writing a README READMEs do more than explain how to use your project. They also explain why your project matters, and what your users can do with it. In your README, try to answer the following questions: What does this project do? Why is this project useful? How do I get started? Where can I get more help, if I need it? You can use your README to answer other questions, like how you handle contributions, what the goals of the project are, and information about licenses and attribution. If you don’t want to accept contributions, or your project is not yet ready for production, write this information down. Better documentation means more users, less support requests, and more contributors. (…) Remember that your readers aren’t you. There are people who might come to a project who have completely different experiences. — @tracymakes, “Writing So Your Words Are Read (video)” Sometimes, people avoid writing a README because they feel like the project is unfinished, or they don’t want contributions. These are all very good reasons to write one. For more inspiration, try using @dguo’s “Make a README” guide or @PurpleBooth’s README template to write a complete README. When you include a README file in the root directory, GitHub will automatically display it on the repository homepage. Writing your contributing guidelines A CONTRIBUTING file tells your audience how to participate in your project. For example, you might include information on: How to file a bug report (try using issue and pull request templates ) How to suggest a new feature How to set up your environment and run tests In addition to technical details, a CONTRIBUTING file is an opportunity to communicate your expectations for contributions, such as: The types of contributions you’re looking for Your roadmap or vision for the project How contributors should (or should not) get in touch with you Using a warm, friendly tone and offering specific suggestions for contributions (such as writing documentation, or making a website) can go a long way in making newcomers feel welcomed and excited to participate. For example, Active Admin starts its contributing guide with: First off, thank you for considering contributing to Active Admin. It’s people like you that make Active Admin such a great tool. In the earliest stages of your project, your CONTRIBUTING file can be simple. You should always explain how to report bugs or file issues, and any technical requirements (like tests) to make a contribution. Over time, you might add other frequently asked questions to your CONTRIBUTING file. Writing down this information means fewer people will ask you the same questions over and over again. For more help with writing your CONTRIBUTING file, check out @nayafia’s contributing guide template or @mozilla’s “How to Build a CONTRIBUTING.md” . Link to your CONTRIBUTING file from your README, so more people see it. If you place the CONTRIBUTING file in your project’s repository , GitHub will automatically link to your file when a contributor creates an issue or opens a pull request. Establishing a code of conduct We’ve all had experiences where we faced what was probably abuse either as a maintainer trying to explain why something had to be a certain way, or as a user…asking a simple question. (…) A code of conduct becomes an easily referenced and linkable document that indicates that your team takes constructive discourse very seriously. — @mlynch, “Making Open Source a Happier Place” Finally, a code of conduct helps set ground rules for behavior for your project’s participants. This is especially valuable if you’re launching an open source project for a community or company. A code of conduct empowers you to facilitate healthy, constructive community behavior, which will reduce your stress as a maintainer. For more information, check out our Code of Conduct guide . In addition to communicating how you expect participants to behave, a code of conduct also tends to describe who these expectations apply to, when they apply, and what to do if a violation occurs. Much like open source licenses, there are also emerging standards for codes of conduct, so you don’t have to write your own. The Contributor Covenant is a drop-in code of conduct that is used by over 40,000 open source projects , including Kubernetes, Rails, and Swift. No matter which text you use, you should be prepared to enforce your code of conduct when necessary. Paste the text directly into a CODE_OF_CONDUCT file in your repository. Keep the file in your project’s root directory so it’s easy to find, and link to it from your README. Naming and branding your project Branding is more than a flashy logo or catchy project name. It’s about how you talk about your project, and who you reach with your message. Choosing the right name Pick a name that is easy to remember and, ideally, gives some idea of what the project does. For example: Sentry monitors apps for crash reporting Thin is a fast and simple Ruby web server If you’re building upon an existing project, using their name as a prefix can help clarify what your project does (for example, node-fetch brings window.fetch to Node.js). Consider clarity above all. Puns are fun, but remember that some jokes might not translate to other cultures or people with different experiences from you. Some of your potential users might be company employees: you don’t want to make them uncomfortable when they have to explain your project at work! Avoiding name conflicts Check for open source projects with a similar name , especially if you share the same language or ecosystem. If your name overlaps with a popular existing project, you might confuse your audience. If you want a website, Twitter handle, or other properties to represent your project, make sure you can get the names you want. Ideally, reserve those names now for peace of mind, even if you don’t intend to use them just yet. Make sure that your project’s name doesn’t infringe upon any trademarks. A company might ask you to take down your project later on, or even take legal action against you. It’s just not worth the risk. You can check the WIPO Global Brand Database for trademark conflicts. If you’re at a company, this is one of the things your legal team can help you with . Finally, do a quick Google search for your project name. Will people be able to easily find your project? Does something else appear in the search results that you wouldn’t want them to see? How you write (and code) affects your brand, too! Throughout the life of your project, you’ll do a lot of writing: READMEs, tutorials, community documents, responding to issues, maybe even newsletters and mailing lists. Whether it’s official documentation or a casual email, your writing style is part of your project’s brand. Consider how you might come across to your audience and whether that is the tone you wish to convey. I tried to be involved with every thread on the mailing list, and showing exemplary behaviour, being nice to people, taking their issues seriously and trying to be helpful overall. After a while, people stuck around not to only ask questions, but to help with the answering as well, and to my complete delight, they mimicked my style. — @janl on CouchDB , “Sustainable Open Source” Using warm, inclusive language (such as “them”, even when referring to the single person) can go a long way in making your project feel welcoming to new contributors. Stick to simple language, as many of your readers may not be native English speakers. Beyond how you write words, your coding style may also become part of your project’s brand. Angular and jQuery are two examples of projects with rigorous coding styles and guidelines. It isn’t necessary to write a style guide for your project when you’re just starting out, and you may find that you enjoy incorporating different coding styles into your project anyway. But you should anticipate how your writing and coding style might attract or discourage different types of people. The earliest stages of your project are your opportunity to set the precedent you wish to see. Your pre-launch checklist Ready to open source your project? Here’s a checklist to help. Check all the boxes? You’re ready to go! Click “publish” and pat yourself on the back. Documentation Project has a LICENSE file with an open source license Project has basic documentation (README, CONTRIBUTING, CODE_OF_CONDUCT) The name is easy to remember, gives some idea of what the project does, and does not conflict with an existing project or infringe on trademarks The issue queue is up-to-date, with issues clearly organized and labeled Code Project uses consistent code conventions and clear function/method/variable names The code is clearly commented, documenting intentions and edge cases There are no sensitive materials in the revision history, issues, or pull requests (for example, passwords or other non-public information) People If you’re an individual: You've talked to the legal department and/or understand the IP and open source policies of your company (if you're an employee somewhere) If you’re a company or organization: You've talked to your legal department You have a marketing plan for announcing and promoting the project Someone is committed to managing community interactions (responding to issues, reviewing and merging pull requests) At least two people have administrative access to the project You did it! Congratulations on open sourcing your first project. No matter the outcome, working in public is a gift to the community. With every commit, comment, and pull request, you’re creating opportunities for yourself and for others to learn and grow. Abeg, make I run go back to all those guides Related Guides How to find the people to helep your project You go helep your open source project grow if you bin put am with people waeh dey happy happy. Na Welcoming Communities we go Build Make you build one community wey go encourage people make them use, contribute, and promote your project. Scroll to Top fine print | 2026-01-13T09:29:14 |
http://choosealicense.com/ | Choose an open source license | Choose a License Choose an open source license An open source license protects contributors and users. Businesses and savvy developers won’t touch a project without this protection. { Which of the following best describes your situation? } I need to work in a community. Use the license preferred by the community you’re contributing to or depending on. Your project will fit right in. If you have a dependency that doesn’t have a license, ask its maintainers to add a license . I want it simple and permissive. The MIT License is short and to the point. It lets people do almost anything they want with your project, like making and distributing closed source versions. Babel , .NET , and Rails use the MIT License. I care about sharing improvements. The GNU GPLv3 also lets people do almost anything they want with your project, except distributing closed source versions. Ansible , Bash , and GIMP use the GNU GPLv3. { What if none of these work for me? } My project isn’t software. There are licenses for that . I want more choices. More licenses are available . I don’t want to choose a license. Here’s what happens if you don’t . About Terms of Service Help improve this page The content of this site is licensed under the Creative Commons Attribution 3.0 Unported License . Curated with ❤️ by GitHub, Inc. and You! | 2026-01-13T09:29:14 |
https://courses.cs.washington.edu/courses/cse446/22au/ | CSE 446 General information Course Logistics Instructor: Jamie Morgenstern and Ludwig Schmidt TAs: Jakub Filipek , Joshua Gardner , Thai Quoc Hoang , Chase King , Tim Li , Pemi Nguyen , Hugh Sun , Yuhao Wan , Kyle Zhang --> Course staff email: cse446-staff@cs.washington.edu Lecture time and place: Mondays, Wednesday 9:00 -- 10:20am, CSE2 G20 (Amazon Auditorium) on zoom (access through canvas) due to concerns with the covid and following the University guidelines The TA sections (Jan 6 Thursday -- Jan 27th Thursday) will also be on zoom (access through canvas). All office hours from Jan 3rd till Jan 28th will also be on zoom (access through canvas). EdStem discussion board ( link ). All questions that are not of a personal nature should be posted to the discussion board. It is all set up to sync daily around 5AM. Email the cse446-staff@cs.washington.edu if you do not have access in 24 hours after enrolling. Staff can be reached at the email address cse446-staff@cs.washington.edu . Submit anonymous feedback here --> About the Course, Prerequisites and Grading Machine learning explores the study and construction of algorithms that can learn from historical data and make inferences about future outcomes. This study is a marriage of algorithms, computation, and statistics so this class will have healthy doses of each. The goal of this course is to provide a thorough grounding in the fundamental methodologies and algorithms of machine learning. Prerequisites: Students entering the class should be comfortable with programming and should have a pre-existing working knowledge of linear algebra (MATH 308), vector calculus (MATH 126), probability and statistics (CSE 312/STAT390), and algorithms. For a brief refresher, we recommend that you consult the linear algebra and statistics/probability reference materials on the Textbooks page. Grading: Your grade will be based on 5 homework assignments: HW0 (8%), HW1 (13%), HW2 (13%), HW3 (13%), HW4 (13%). There will be one midterm worth 20% and a final worth another 20%. Sections You are not required to attend sections, but we highly encourage you to do so. It is a great place to get to know your TAs and learn beyond what is taught in lectures. Frequently Asked Questions What is the formula for curving the courses? Will it be posted? No. Curving each course will be based on an affine transformation of scores up to the discretion of the instructors alone and will not be publicly posted. | 2026-01-13T09:29:14 |
http://choosealicense.com | Choose an open source license | Choose a License Choose an open source license An open source license protects contributors and users. Businesses and savvy developers won’t touch a project without this protection. { Which of the following best describes your situation? } I need to work in a community. Use the license preferred by the community you’re contributing to or depending on. Your project will fit right in. If you have a dependency that doesn’t have a license, ask its maintainers to add a license . I want it simple and permissive. The MIT License is short and to the point. It lets people do almost anything they want with your project, like making and distributing closed source versions. Babel , .NET , and Rails use the MIT License. I care about sharing improvements. The GNU GPLv3 also lets people do almost anything they want with your project, except distributing closed source versions. Ansible , Bash , and GIMP use the GNU GPLv3. { What if none of these work for me? } My project isn’t software. There are licenses for that . I want more choices. More licenses are available . I don’t want to choose a license. Here’s what happens if you don’t . About Terms of Service Help improve this page The content of this site is licensed under the Creative Commons Attribution 3.0 Unported License . Curated with ❤️ by GitHub, Inc. and You! | 2026-01-13T09:29:14 |
https://courses.cs.washington.edu/courses/cse446/22sp/ | CSE 446/546 General information Course Logistics Instructors: Kevin Jamieson and Ludwig Schmidt TAs: Josh Gardner, jpgard@cs.washington.edu (Head TA) Gantcho Dimitrov, gantcho@cs.washington.edu Jakub Filipek, balbok@cs.washington.edu Alyssa La Fleur, lafleur1@cs.washington.edu Tim Li, jhli1116@cs.washington.edu Vlad Murad, ovmurad@cs.washington.edu Long Thanh Nguyen, long1104@cs.washington.edu Morgan Putnam, mputna@cs.washington.edu Esteban Safranchik, estebans@cs.washington.edu Jackson V Stokes, stokesjv@cs.washington.edu Kyle Guohao Zhang, guohaz@cs.washington.edu Lecture time and place: MWF 9:30 -- 10:20am, in CSE2 G20 Ed discussion board ( link ) All questions that are not of a personal nature should be posted to the discussion board. You will be automatically added to the course on Ed; please contact us if you have access issues. Staff can be reached at the email address cse446-staff@cs.washington.edu . Submit anonymous feedback here (we will not be able to respond) About the Course, Prerequisites and Grading Machine learning explores the study and construction of algorithms that can learn from historical data and make inferences about future outcomes. This study is a marriage of algorithms, computation, and statistics so this class will be have healthy doses of each. The goals of this course are to provide a thorough grounding in the fundamental methodologies and algorithms of machine learning. Prerequisites: Students entering the class should be comfortable with programming and should have a pre-existing working knowledge of linear algebra (MATH 308), vector calculus (MATH 126), probability and statistics (CSE 312/STAT390), and algorithms. For a brief refresher, we recommend that you consult the linear algebra and statistics/probability reference materials on the Textbooks page. Grading: Your grade will be based exclusively on 5 homework assignments: HW0 (10%), HW1 (20%), HW2 (20%), HW3 (20%), HW4 (30%). There are no exams or credit given in any way other than the homeworks (e.g., no credit given for attending lecture or section). However, depending on whether you are enrolled in 446 or 546, the way the assignments are graded or curved varies (see below). Course offerings In the past, CSE 446 was the undergraduate machine learning course, and CSE546 was the graduate version. Over the years these courses have gotten closer and many undergraduates have opted to take the graduate version for a more challenging course. At the graduate level, some graduate students have sought a less demanding course to focus on research. To address the needs of our students, this course offers three different versions of the course concurrently. A detailed overview of the difference between the courses and eligibility is below. Course Lecture Section Homework Grading 446 CSE2 G20, MWF 9:30 -- 10:20am Attend the section you are registered for on Zoom A problems only. No credit will be rewarded for completing B problems. You will be graded (e.g., curved) against your peers in 446 only (on a 4.0 scale). For example, if you you recieved a (curved) score of 0.9 on the A problems, then your full grade on your transcript will be (4.0)*(0.9) = 3.6. Any attempt of the B problems will not influence your grade in any way. 546 CSE2 G20, MWF 9:30 -- 10:20am Not applicable A and B problems. You will be graded (e.g., curved) against your peers in 546 only. Your grade on the A and B problems will be curved seperately, and then summed. For example, if you you recieved a (curved) score of 0.9 on the A problems, and a (curved) score of 0.8 on the B problems, then your full grade on your transcript will be (3.8)*(0.9) + (0.2)*(0.8) = 3.58, rounded to 3.6. If only the A problems on the homework are attempted, the highest score attainable is a 3.8. If only the B problems are attempted, the highest score attainable is a 0.2. 546 546B Zoom (MW 9:00 -- 10:20am) None A and B problems. None Your final grade will be the sum of your grade from the A problems (see 546A grading above) which is out of 3.8, and your grade on the B problems which is out of 0.2. --> Frequently Asked Questions I am registered for 446, is there any reason I should attempt a B problem? No. I am registered for 446, but I recognize that being enrolled in a graduate course may look good for graduate schools or employment in machine learning. Can I switch to 546? Yes! Please contact CSE advisors. I was registered for 446, decided to bump up to 546 and am now registered for 546. I now realize I regret the decision, can I switch back to being evaluated as a 446 student? No. You will be evaluated based on whatever course you are officially registered for. I am registered for 546. Can I attend a section of 446? Yes, but please do not monopolize the time as these these sections were intended for students enrolled in 446. So feel free to be a fly on the wall or lurker in the section. I am registered for 546. I started doing the B problems on the first couple homework assignments then stopped, will I be penalized for not attempting all of them? No. If you attempt any or none of the B problems at any time, your grade on the A problems is always unaffected. Attepting B problems can only help your grade above the 3.8 that is based on the A problems alone. I am registered for 546. Do I need to notify instructors that I intend to complete the B problems? No. Just include them on your homework. I'm a graduate student and busy with research so doing the A problems alone is attractive. But I need a 3.4 for the course to count, will I be unfairly judged for not attempting the B problems? No. The instructors are well aware of the grade requirements for graduate students and assign low grades with as much care as any course graded on a 4.0 scale. The only difference is that if you only attempt the A problems, the highest grade you can achieve is 3.8. I am enrolled in 446 and my friend is enrolled in 546 but only attempted the A problems. On the A problems we received identical grades on the homeworks. Will the grades on our transcripts be the same? Potentially not. The courses are curved seperately and no attempt will be made to make grades comparable or "fair" across courses in any way. What is the formula for curving the courses? Will it be posted? No. Curving each course will be based on an affine transformation of scores up to the discretion of the instructors alone and will not be publicly posted. | 2026-01-13T09:29:14 |
http://choosealicense.com/licenses/ | Licenses | Choose a License Home Licenses Open source licenses grant permission for anybody to use, modify, and share licensed software for any purpose, subject to conditions preserving the provenance and openness of the software. The following licenses are sorted by the number of conditions, from most (GNU AGPLv3) to none (Unlicense). Notice that the popular licenses featured on the home page (GNU GPLv3 and MIT) fall within this spectrum. If you’re looking for a reference table of every license on choosealicense.com, see the appendix . GNU AGPLv3 Permissions of this strongest copyleft license are conditioned on making available complete source code of licensed works and modifications, which include larger works using a licensed work, under the same license. Copyright and license notices must be preserved. Contributors provide an express grant of patent rights. When a modified version is used to provide a service over a network, the complete source code of the modified version must be made available. Permissions Conditions Limitations Commercial use Distribution Modification Patent use Private use Disclose source License and copyright notice Network use is distribution Same license State changes Liability Warranty View full GNU Affero General Public License v3.0 » GNU GPLv3 Permissions of this strong copyleft license are conditioned on making available complete source code of licensed works and modifications, which include larger works using a licensed work, under the same license. Copyright and license notices must be preserved. Contributors provide an express grant of patent rights. Permissions Conditions Limitations Commercial use Distribution Modification Patent use Private use Disclose source License and copyright notice Same license State changes Liability Warranty View full GNU General Public License v3.0 » GNU LGPLv3 Permissions of this copyleft license are conditioned on making available complete source code of licensed works and modifications under the same license or the GNU GPLv3. Copyright and license notices must be preserved. Contributors provide an express grant of patent rights. However, a larger work using the licensed work through interfaces provided by the licensed work may be distributed under different terms and without source code for the larger work. Permissions Conditions Limitations Commercial use Distribution Modification Patent use Private use Disclose source License and copyright notice Same license (library) State changes Liability Warranty View full GNU Lesser General Public License v3.0 » Mozilla Public License 2.0 Permissions of this weak copyleft license are conditioned on making available source code of licensed files and modifications of those files under the same license (or in certain cases, one of the GNU licenses). Copyright and license notices must be preserved. Contributors provide an express grant of patent rights. However, a larger work using the licensed work may be distributed under different terms and without source code for files added in the larger work. Permissions Conditions Limitations Commercial use Distribution Modification Patent use Private use Disclose source License and copyright notice Same license (file) Liability Trademark use Warranty View full Mozilla Public License 2.0 » Apache License 2.0 A permissive license whose main conditions require preservation of copyright and license notices. Contributors provide an express grant of patent rights. Licensed works, modifications, and larger works may be distributed under different terms and without source code. Permissions Conditions Limitations Commercial use Distribution Modification Patent use Private use License and copyright notice State changes Liability Trademark use Warranty View full Apache License 2.0 » MIT License A short and simple permissive license with conditions only requiring preservation of copyright and license notices. Licensed works, modifications, and larger works may be distributed under different terms and without source code. Permissions Conditions Limitations Commercial use Distribution Modification Private use License and copyright notice Liability Warranty View full MIT License » Boost Software License 1.0 A simple permissive license only requiring preservation of copyright and license notices for source (and not binary) distribution. Licensed works, modifications, and larger works may be distributed under different terms and without source code. Permissions Conditions Limitations Commercial use Distribution Modification Private use License and copyright notice for source Liability Warranty View full Boost Software License 1.0 » The Unlicense A license with no conditions whatsoever which dedicates works to the public domain. Unlicensed works, modifications, and larger works may be distributed under different terms and without source code. Permissions Conditions Limitations Commercial use Distribution Modification Private use Liability Warranty View full The Unlicense » The above licenses represent the entire spectrum of open source licenses, from highly protective to unconditional. One of these should work for most new open source projects. Many other open source licenses exist, including older versions of and close substitutes for some of the above. See the resources listed on our about page if you’d like to read more. About Terms of Service Help improve this page The content of this site is licensed under the Creative Commons Attribution 3.0 Unported License . Curated with ❤️ by GitHub, Inc. and You! | 2026-01-13T09:29:14 |
https://typedoc.org/index.html | TypeDoc TypeDoc Example API GitHub Preparing search index... TypeDoc TypeDoc converts comments in TypeScript's source code into HTML documentation or a JSON model. Quick Start TypeDoc generates documentation based on your exports. It will follow re-exports to document members declared in other files for each entry point. # Install npm install --save-dev typedoc # Build docs using package.json "exports" or "main" fields as entry points npx typedoc Copy If TypeDoc is unable to discover your entry points, they can be provided manually: # Build docs using exports from src/index.ts npx typedoc src/index.ts Copy If you are documenting an application rather than a library, which doesn't have a single entry point, you may want to document each file individually. # Generate docs for all TypeScript files under src npx typedoc --entryPointStrategy Expand src Copy TypeDoc supports a variety of options and themes . It is extensible via the plugin API . Settings Theme OS Light Dark On This Page Quick Start Example API GitHub TypeDoc Loading... Generated using TypeDoc | 2026-01-13T09:29:14 |
https://opensource.guide/de/leadership-and-governance/ | Führung und Lenkung | Open Source Guides Über Mitarbeiten العربية Български Bangla Deutsch Ελληνικά English Español Farsi Français Hindi Magyar Indonesia Italiano 日本語 한국어 Malay Nederlands Pidgin Polski Português Romanian Русский संस्कृतम् Swahili தமிழ் Türkçe 简体中文 繁體中文 Open Source Guides Führung und Lenkung Wachsende Open-Source-Projekte können von formellen Entscheidungsfindungsregeln profitieren. Inhaltsverzeichnis Die Lenkungen eines wachsenden Projektes verstehen Welche formalen Rollen kann es in Open-Source-Projekten geben? Wie formalisiere ich diese Führungsrollen? Wann sollte ich jemandem Commit-Rechte geben? Welche Verwaltungsstrukturen nutzen Open-Source-Projekte häufiger? Muss ich Projektleitung und -Steuerung schon zum Projektstart dokumentieren? Was passiert, wenn Firmenangehörige Beiträge einreichen? Die Lenkungen eines wachsenden Projektes verstehen Ihr Projekt wächst, Leute sind engagiert und Sie setzen sich dafür ein, dass alles läuft. In diesem Stadium fragen Sie sich vielleicht, wie Sie regelmäßig Mitwirkende in Ihren Arbeitsprozess einbinden können - sei es durch die Gewährung von direktem Commit-Zugang oder durch die Führung von Debatten in der Gemeinschaft. Wir liefern Antworten auf Ihre Fragen. Welche formalen Rollen kann es in Open-Source-Projekten geben? Viele Projekte folgen einer ähnlichen Struktur hinsichtlich Mitwirkung und Anerkennung. Was diese Rollen aber tatsächlich bedeuten, liegt ganz bei Ihnen. Nachfolgend sind einige Arten von Rollen aufgeführt, die Sie vielleicht schon kennen: Maintainer*in Mitwirkende*r Committer*in Bei einigen Projekten sind “Maintainer*innen” die einzigen Personen mit Commit-Rechten. In anderen Projekten sind es einfach die Leute, die in der README als Maintainer*innen aufgelistet sind. Ein*e Maintainer*in muss in Ihrem Projekt nicht zwangsläufig Code schreiben. Es kann auch eine Person sein, die viel Öffentlichkeitsarbeit für Ihr Projekt geleistet hat, viel Dokumentation geschrieben hat, oder das Projekt für andere zugänglicher gemacht hat. Unabhängig davon, was sie tagtäglich tun, fühlen sich Maintainer*innen wahrscheinlich für die Richtung des Projekts verantwortlich und setzen sich für dessen Verbesserung ein. “Mitwirkende” könnten alle Menschen sein, die ein Issue oder Pull Request kommentiert, die dem Projekt einen Mehrwert verleihen (sei es durch Problembehebungen, das Schreiben von Code oder die Organisation von Veranstaltungen) oder alle, deren Pull Requests akzeptiert wurden (vielleicht die engste Definition für einen Beitrag). [Für Node.js,] ist jede Person, die durch Kommentieren in einem Issue mithilft, oder Code einreicht, Mitglied der Projekt-Community. Dass sie einfach durch aktive Beteiligung sichtbar werden, bedeutet, dass sie die Benutzer-Kontributor-Grenze überschritten haben. [For Node.js,] every person who shows up to comment on an issue or submit code is a member of a project’s community. Just being able to see them means that they have crossed the line from being a user to being a contributor. — @mikeal, “Healthy Open Source” Der Begriff “Committer*in” könnte verwendet werden, um die höhere Verantwortung des Commit-Rechtes von anderen Formen der Mitarbeit zu unterscheiden. Sie können Ihre Projektrollen zwar nach Belieben definieren, aber Sie sollten die Verwendung von breiteren Definitionen in Betracht ziehen , um mehr Beitragsformen zu fördern. Mit Hilfe von Führungsrollen können Sie Personen, die unabhängig von ihren fachlichen Fähigkeiten herausragende Leistungen für Ihr Projekt erbracht haben, formell auszeichnen. Sie kennen mich vielleicht als den “Erfinder” von Django… Aber ich bin in Wirklichkeit der Typ, der angeheuert wurde, um an einer seit einem Jahr fertigen Sache zu arbeiten. (…) Die Leute vermuten, dass ich wegen meiner Programmierfähigkeiten erfolgreich bin… Aber ich bin bestenfalls ein durchschnittlicher Programmierer. You might know me as the “inventor” of Django…but really I’m the guy who got hired to work on a thing a year after it was already made. (…) People suspect that I’m successful because of my programming skill…but I’m at best an average programmer. — @jacobian, “PyCon 2015 Keynote” (video) Wie formalisiere ich diese Führungsrollen? Führungsrollen zu formalisieren, hilft den Menschen, ein eigenes Verantwortungsbewusstsein zu entwickeln und zeigt anderen Mitwirkenden, wen sie um Hilfe bitten sollen. In einem kleineren Projekt kann die Ernennung von Verantwortlichen einfach durch Hinzufügen Ihrer Namen zur README- oder CONTRIBUTORS-Datei geschehen. Für ein größeres Projekt mit einer Website, erstellen Sie eine Teamseite und listen die Verantwortlichen dort auf. Zum Beispiel hat Postgres eine umfassende Teamseite mit Kurzprofilen aller Mitwirkenden. Wenn Ihr Projekt eine sehr aktive Gemeinschaft von Mitwirkenden hat, können Sie ein Maintainer*innen-“Kernteam” bilden oder sogar Gremien, welche die Verantwortung für verschiedene Themengebiete übernehmen (z.B. Sicherheit, Issue-Bearbeitung oder Community-Management). Lassen Sie die Leute sich selbst organisieren! Anstatt ihnen Rollen zuzuweisen, lassen Sie Freiwillige das übernehmen, was diese am meisten begeistert. [Wir] ergänzen das Kernteam mit mehreren “Subteams”. Jedes Subteam ist auf einen bestimmten Bereich fokussiert, z.B. Sprachdesign oder Bibliotheken. Um eine globale Koordination und eine starke, kohärente Sichtweise für das Gesamtprojekt zu gewährleisten, wird jedes Subteam von einem Mitglied des Kernteams geleitet. [We] supplement the core team with several “subteams”. Each subteam is focused on a specific area, e.g., language design or libraries. (…) To ensure global coordination and a strong, coherent vision for the project as a whole, each subteam is led by a member of the core team. — “Rust Governance RFC” Führungsteams können einen Kommunikationskanal einrichten (z.B. mit IRC) oder sich regelmäßig treffen, um das Projekt zu besprechen (z.B. in Gitter oder Google Hangout). Sie können diese Meetings sogar öffentlich machen, damit andere Leute zuhören können. Cucumber-ruby zum Beispiel, lädt zu wöchentlichen Sprechstunden ein . Vergessen Sie nicht, nach der Festlegung von Führungsrollen zu dokumentieren, wie Menschen diese erreichen können! Richten Sie einen klaren Prozess ein, wie Leute Maintainer*in werden oder einem Gremium in Ihrem Projekt beitreten können, und beschreiben Sie diesen Prozess in einer GOVERNANCE.md. Tools wie Vossibility können Ihnen dabei helfen, öffentlich zu verfolgen, wer zum Projekt beiträgt (oder nicht). Die Dokumentation dieser Informationen beugt dem Eindruck vor, dass eine Maintainer*innen-Clique ihre Privatinteressen durchsetzen würde. Wenn sich Ihr Projekt auf GitHub befindet, können Sie Ihr Projekt von Ihrem persönlichen Konto in eine Organisation verschieben und mindestens einen Backup-Administrator einrichten. GitHub-Organisationen erleichtern die Verwaltung von mehreren Repositories und Berechtigungen, und schützen ihr Projektarchiv durch gemeinsame Verantwortung . Wann sollte ich jemandem Commit-Rechte geben? Einige Leute denken, dass Sie allen Commit-Zugang geben sollten, die einen Beitrag geleistet haben. Dies könnte dazu führen, dass sich mehr Menschen für Ihr Projekt interessieren. Andererseits (besonders bei größeren, komplexeren Projekten) möchten Sie vielleicht nur Personen zu Commits berechtigen, die ihr Engagement unter Beweis gestellt haben. Es gibt hier nicht den einen richtigen Weg. Tun Sie, was Ihnen behagt! Wenn sich Ihr Projekt auf GitHub befindet, können Sie unter protected branches verwalten, wer unter welchen Umständen auf einen bestimmten Branch committen darf. Wann immer Ihnen jemand einen Pull Request schickt, geben Sie ihm Commit-Zugriff auf Ihr Projekt. Auch wenn es auf den ersten Blick unglaublich dumm klingt, können Sie mit dieser Strategie die wahre Kraft von GitHub entfalten. (…) Sobald Leute Commit-Zugriff haben, haben sie keine Angst mehr, dass ihr Patch nicht mehr angenommen werden könnte… Dies veranlasst sie dazu, viel mehr Arbeit in Patches zu stecken. Whenever somebody sends you a pull request, give them commit access to your project. While it may sound incredibly stupid at first, using this strategy will allow you to unleash the true power of GitHub. (…) Once people have commit access, they are no longer worried that their patch might go unmerged…causing them to put much more work into it. — @felixge, “The Pull Request Hack” Welche Verwaltungsstrukturen nutzen Open-Source-Projekte häufiger? Es gibt drei Verwaltungsstrukturen, die häufig bei Open-Source-Projekten vorkommen. BDFL: BDFL steht für “Benevolent Dictator for Life” (gutmütige*r Diktator*in auf Lebenszeit). Bei dieser Struktur hat eine Person (in der Regel die oder der Erstautor*in des Projekts) das letzte Wort bei allen wichtigen Projektentscheidungen. Python ist ein klassisches Beispiel. Kleinere Projekte haben wahrscheinlich standardmäßig ein*e BDFL, da es nur einen oder zwei Maintainer*innen gibt. Aus Unternehmen stammende Projekte können ebenfalls in die Kategorie BDFL fallen. Meritokratie: (Hinweis: Der Begriff “Meritokratie” ist bei einigen Communitys negativ konnotiert und hat eine komplexe soziale und politische Geschichte .) Unter einer Meritokratie erhalten aktive Projektmitarbeiter*innen (diejenigen, die “sich die Meriten angelesen” haben) eine formelle Entscheidungsrolle. Entscheidungen werden in der Regel auf der Grundlage eines reinen Abstimmungskonsenses getroffen. Das Konzept der Meritokratie wurde von der Apache Foundation entwickelt; alle Apache-Projekte sind Meritokratien. Beiträge können nur von Personen geleistet werden, die sich selbst vertreten, nicht von einem Unternehmen. Liberales Beitragsmodell: Nach einem liberalen Beitragsmodell werden die Menschen, die aktuell die meiste Arbeit leisten, als die einflussreichsten anerkannt. Dabei wird aber ihre frühere Beitragshistorie außer Acht gelassen. Wichtige Projektentscheidungen werden auf der Grundlage eines Konsensfindungsprozesses (Besprechen der wichtigsten Missstände) und nicht auf Grundlage reiner Abstimmung getroffen. Dabei streben solche Projekte nach Einbeziehung möglichst vieler Perspektiven der Gemeinschaft. Beliebte Beispiele für Projekte, die ein liberales Beitragsmodell verwenden, sind Node.js und Rust . Welches Modell sollten Sie verwenden? Das obliegt Ihnen! Jedes Modell hat Vor- und Nachteile. Und obwohl sie zunächst sehr unterschiedlich erscheinen mögen, haben alle drei Modelle mehr gemeinsam als zu vermuten wäre. Wenn Sie daran interessiert sind, eines dieser Modelle zu übernehmen, schauen Sie sich diese Vorlagen an (alle auf Englisch): BDFL-Modellvorlage Meritokratische Modellvorlage Node.js’s liberale Beitragspolitik Muss ich Projektleitung und -Steuerung schon zum Projektstart dokumentieren? Es gibt nicht den einen richtigen Zeitpunkt, um die Leitungs- und Steuerungsrichtlinien Ihres Projekts aufzuschreiben. Allerdings sind sie einfacher zu definieren, sobald Sie die Entwicklung von Community-Dynamiken gesehen haben. Das Beste (und Schwierigste) an Open-Source-Projektsteuerung ist, dass sie von der Gemeinschaft geprägt wird! Frühzeitige Dokumentationen wird selbst auch dazu beitragen, wie sich Ihr Projekt entwickelt, also schreiben Sie ruhig früh auf, was Sie früh wissen. So können Sie beispielsweise schon zum Projektstart klare Erwartungen an die Funktionsweise Ihres Mitwirkungsprozesses definieren. Wenn Sie Teil eines Unternehmens sind, das ein Open-Source-Projekt startet, lohnt sich eine interne Diskussion vor dem Start. Wie erwartet Ihr Unternehmen, dass es das Projekt aufrechterhält und Entscheidungen trifft? Möglicherweise möchten Sie auch öffentlich erklären, ob oder wie Ihr Unternehmen in das Projekt eingebunden wird. Wir beauftragen kleine Teams mit der Leitung von Projekten auf GitHub, die aktuell bei Facebook an diesen arbeiten. Beispielsweise wird das React-Projekt von einer React-Ingenieurin betreut. We assign small teams to manage projects on GitHub who are actually working on these at Facebook. For example, React is run by a React engineer. — @caabernathy, “An inside look at open source at Facebook” Was passiert, wenn Firmenangehörige Beiträge einreichen? Erfolgreiche Open-Source-Projekte werden von vielen Menschen und Unternehmen genutzt, und einige davon verfügen möglicherweise über Einnahmen, die letztendlich durch das Projekt generiert wurden. Beispielsweise kann eine Firma den Projektcode als eine Komponente eines kommerziellen Serviceangebots verwenden. Mit zunehmender Verbreitung des Projekts werden Menschen, die über Fachwissen verfügen, immer gefragter (Sie könnten eine*r davon sein!) und wird manchmal für die Arbeit bezahlt, die sie im Projekt leisten. Es ist wichtig, kommerzielle Aktivitäten als normal und als eine weitere Motivation für die Entwicklungsarbeit zu betrachten. Bezahlte Entwickler*innen sollten natürlich keine Sonderbehandlung gegenüber unbezahlten erhalten. Jeder Beitrag muss nach seinen technischen Eigenschaften bewertet werden. Allerdings sollten die Leute zu kommerziellen Aktivitäten bereit sein, und sich damit wohl fühlen, wenn sie ihre Anwendungsfälle angeben oder sich für eine bestimmte Verbesserung oder Funktion aussprechen. “Kommerziell” ist vollständig kompatibel mit “Open-Source”. “Kommerziell” bedeutet nur, dass irgendwo Geld im Spiel ist, z.B. dass die Software unternehmerisch eingesetzt wird. Dies wird umso wahrscheinlicher, je weiter sich ein Projekt verbreitet. Wenn Open-Source-Software als Teil eines Nicht-Open-Source-Produkts verwendet wird, ist das Gesamtprodukt immer noch “proprietäre” Software, obwohl sie (wie Open-Source!) für kommerzielle oder nicht-kommerzielle Zwecke verwendet werden kann. Wie jeder andere auch, gewinnen kommerziell motivierte Entwickler*innen durch die Qualität und Quantität ihrer Beiträge Einfluss auf das Projekt. Natürlich kann ein*e Entwickler*in, die oder der für die Arbeitszeit bezahlt wird, mehr tun als unbezahlte Beitragende, aber das ist in Ordnung: Bezahlung beeinflusst nur als einer von vielen möglichen Faktoren, was jemand tut. Halten Sie Ihre Projektdiskussionen auf den Inhalt der Beiträge fokussiert, nicht auf die externen Faktoren, die es den Menschen ermöglichen, diese Beiträge zu leisten. Brauche ich für mein Projekt eine juristische Person? Sie benötigen keine juristische Person, um Ihr Open-Source-Projekt zu verwalten. Es sei denn, es kommt Geld ins Spiel. Wenn Sie beispielsweise ein kommerzielles Unternehmen gründen möchten, sollten Sie eine GmbH oder UG gründen (wenn Sie in Deutschland ansässig sind). Wenn Sie nur Auftragsarbeiten im Zusammenhang mit Ihrem Open-Source-Projekt durchführen, können Sie Geld als (Einzel)Unternehmergesellschaft akzeptieren oder eine GmbH gründen. Wenn Sie Spenden für Ihr Open-Source-Projekt annehmen möchten, können Sie einen Spendenkanal einrichten (z.B. über PayPal oder Stripe), aber das Geld ist nicht steuerlich absetzbar. Es sei denn, dieser Prozess läuft über einen anerkannten gemeinnützigen Verein. Viele Projekte wollen sich nicht die Mühe machen, einen gemeinnützigen Verein zu gründen, also finden sie stattdessen einen gemeinnützigen, steuerrechtlichen Sponsor. Ein solcher Sponsor nimmt Spenden in Ihrem Namen entgegen (teilweise im Austausch gegen einen prozentualen Anteil der Spende). Software Freedom Conservancy , Apache Foundation , Eclipse Foundation , Linux Foundation , Open Collective , und das deutsche Center for the Cultivation of Technology sind Beispiele für Organisationen, die als steuerrechtliche Sponsoren für Open-Source-Projekte fungieren. Unser Ziel ist es, eine Infrastruktur bereitzustellen, die Communitys nutzen können, um selbsttragend zu sein, und so ein Umfeld zu schaffen, in dem alle (Beitragende, Geldgeber*innen und Sponsor*innen) konkrete Vorteile daraus ziehen können. Our goal is to provide an infrastructure that communities can use to be self sustainable, thus creating an environment where everyone — contributors, backers, sponsors — get concrete benefits out of it. — @piamancini, “Moving beyond the charity framework” Wenn Ihr Projekt spezifisch für eine bestimmte Programmiersprache oder ein bestimmtes Ökosystem gedacht ist, kann es auch eine entsprechende Software-Stiftung geben, mit der Sie zusammenarbeiten können. So unterstützt beispielsweise die Python Software Foundation den Paketmanager PyPI , und die Node.js-Foundation unterstützt das Node-basierte Framework Express.js . Zurück zur Übersicht Verwandte Anleitungen Gute Maintainer-Praxis Erleichtern Sie Ihr Leben als Open-Source-Maintainer! Von der Dokumentation von Prozessen bis zum Einsatz Ihrer Community. Open-Source-Metriken Treffen Sie fundierte Entscheidungen und helfen Sie Ihrem Open-Source-Projekt, indem Sie dessen Erfolg messen und verfolgen. Scroll to Top Mitmachen Möchten Sie etwas vorschlagen? Unsere Anleitungen sind quelloffen. Helfen Sie uns, sie zu verbessern. Mitmachen Bleiben Sie in Kontakt Erfahren Sie als Erste*r von GitHubs neuesten Open-Source-Tipps und -Ressourcen. E-Mail-Adresse fine print mit von und Freunden | 2026-01-13T09:29:14 |
https://opensource.guide/ko/leadership-and-governance/ | 리더십과 관리 | Open Source Guides 소개 기여 العربية Български Bangla Deutsch Ελληνικά English Español Farsi Français Hindi Magyar Indonesia Italiano 日本語 한국어 Malay Nederlands Pidgin Polski Português Romanian Русский संस्कृतम् Swahili தமிழ் Türkçe 简体中文 繁體中文 Open Source Guides 리더십과 관리 결정을 위한 공식적인 규칙을 정하면 오픈소스 프로젝트의 성장에 이익을 얻을 수 있습니다. 목차 성장하는 프로젝트 관리 이해하기 오픈소스 프로젝트에서 공식적인 역할은 어떤 식으로 적용되나요? 어떻게 리더십 역할을 구성해야 할까요? 커밋 권한은 언제 부여해야 하나요? 오픈소스의 관리 구조로는 어떤 것이 있나요? 프로젝트를 출시하려면 관리 문서가 있어야 하나요? 기업 직원들이 기여하기 시작하면 어떤 일이 일어나나요? 성장하는 프로젝트 관리 이해하기 프로젝트는 성장하고, 사람들은 바쁘게 활동하고, 여러분은 계속 이끌어 나가고 싶습니다. 이 단계에서 여러분은 어떻게 일의 흐름에 기여자들을 모을지 알고자 합니다. 누군가에게 커밋 권한을 주거나 커뮤니티 토론을 해결하는 식으로 말입니다. 질문이 있다면 대답해드리겠습니다. 오픈소스 프로젝트에서 공식적인 역할은 어떤 식으로 적용되나요? 대부분 프로젝트는 비슷한 기여자 역할 구조를 갖습니다. 역할이 실제로 의미하는 것이 무엇인지는 전적으로 여러분에게 달렸습니다. 여러분이 이미 아실 만한 역할은 다음과 같습니다. 관리자(Maintainer) 기여자(Contributor) 커미터(Committer) 몇몇 프로젝트에서 “관리자” 는 커밋 권한을 가진 사람들만을 의미하지만, 어떤 프로젝트에서는 단순히 README 파일에 관리자로서 나열되어 있는 사람들을 가리킵니다. 관리자가 반드시 코드를 작성하는 사람일 필요는 없습니다. 프로젝트를 홍보하는 데 큰 몫을 한 사람일 수도 있고, 프로젝트 접근성을 높이기 위해 문서화를 맡은 사람일 수도 있습니다. 그들이 무슨 일을 하든, 관리자는 보통 프로젝트의 방향에 책임감을 가지고 이를 개선하고자 노력하는 사람일 것입니다. “기여자” 는 이슈나 풀 리퀘스트에 댓글을 작성하는 모든 사람이라고 볼 수 있습니다. 이슈에 우선 순위를 매기는 사람, 코드를 작성하는 사람, 행사를 조율하는 사람에서부터 (가장 좁은 의미로는) 병합된 풀 리퀘스트를 가진 사람까지 모두가 기여자인 셈입니다. [For Node.js,] every person who shows up to comment on an issue or submit code is a member of a project’s community. Just being able to see them means that they have crossed the line from being a user to being a contributor. — @mikeal, “Healthy Open Source” “커미터” 라는 용어는 다른 기여 유형에 대비해 커밋이라는 특정 권한과 책임을 가진 사람을 구분하고자 사용합니다. 프로젝트 역할은 여러분이 원하는 대로 정의할 수 있지만, 다양한 유형의 기여를 이끌어내기 위해 되도록 넓은 정의를 사용하세요 . 전문적인 기술 수준과 별개로 프로젝트에 대단한 기여를 한 사람들에게 리더십 역할을 부여하며 그들에게 답례를 표할 수 있습니다. You might know me as the “inventor” of Django…but really I’m the guy who got hired to work on a thing a year after it was already made. (…) People suspect that I’m successful because of my programming skill…but I’m at best an average programmer. — @jacobian, “PyCon 2015 Keynote” (video) 어떻게 리더십 역할을 구성해야 할까요? 리더십 역할을 잘 갖추고 형식화하면 사람들이 소유감을 느끼고, 다른 커뮤니티 구성원들에게 도움을 줄 수 있습니다. 작은 프로젝트에서는 README 파일이나 CONTRIBUTORS 파일에 이름을 추가하는 것 정도로 간단하게 리더를 지정할 수 있습니다. 큰 프로젝트에서는, 웹사이트가 있다면 팀 페이지를 만들거나 프로젝트 리더들을 사이트에 나열하세요. Postgres 는 각 기여자의 짧은 프로필을 담은 팀 페이지 를 가지고 있습니다. 매우 활성화된 기여자 커뮤니티를 가진 프로젝트라면 관리자들이나 각 분야(보안, 이슈 분류, 커뮤니티 관리 등)의 기여자들로 “핵심 팀”을 구성하는 방법이 있습니다. 사람들에게 역할을 부여하기보다 사람들이 스스로 역할을 구성하고 자원할 수 있게 하세요. [We] supplement the core team with several “subteams”. Each subteam is focused on a specific area, e.g., language design or libraries. (…) To ensure global coordination and a strong, coherent vision for the project as a whole, each subteam is led by a member of the core team. — “Rust Governance RFC” 리더 팀은 IRC 등 지정된 채널을 만들거나 Gitter나 Google Hangout 등에서 정기적으로 프로젝트 토론 시간을 가지는 것이 좋습니다. 다른 사람들도 참관할 수 있게 채널이나 토론을 공개해도 됩니다. 예컨대 Cucumber-ruby 는 매주 토론 시간을 갖습니다 . 리더십 역할을 구성한 후에는 사람들이 어떻게 그 역할을 부여받을 수 있는지 문서화하는 것을 잊지 마세요! 관리자나 특정 분야 전문 기여자가 되는 방법을 명확하게 정하고 GOVERNANCE 파일에 기록하세요. 누가 프로젝트에 기여하고 누가 그렇지 않은지 공개적으로 파악하는 데 Vossibility 같은 툴이 도움을 줍니다. 이런 정보를 문서화하면 관리자들이 불공평한 결정을 내린다는 인식을 피할 수 있습니다. 마지막으로, 여러분의 프로젝트가 GitHub에서 진행되고 있다면 프로젝트를 여러분의 개인 계정에서 조직 계정으로 이동하는 것을 고려해 보세요. 조직 계정 기능이 여러 저장소의 권한 관리, 공동 소유 를 통한 프로젝트 정책 보호를 쉽게 만들어 줍니다. 커밋 권한은 언제 부여해야 하나요? 몇몇 사람들은 여러분이 모든 기여자에게 커밋 권한을 줘야 한다고 생각합니다. 그렇게 한다면 더 많은 사람들이 프로젝트 소유감을 느끼게 할 수 있을 것입니다. 반면, 특히 크고 복잡한 프로젝트에서는 노력을 보인 사람들에게만 커밋 권한을 부여할 수도 있습니다. 정해진 방법은 없습니다. 가장 편한 방법을 선택하세요! 여러분의 프로젝트가 GitHub에서 진행되고 있다면 보호 브랜치 기능을 사용해 누가 어떠한 상황에 특정 브랜치에 푸시할 수 있는지 지정할 수 있습니다. Whenever somebody sends you a pull request, give them commit access to your project. While it may sound incredibly stupid at first, using this strategy will allow you to unleash the true power of GitHub. (…) Once people have commit access, they are no longer worried that their patch might go unmerged…causing them to put much more work into it. — @felixge, “The Pull Request Hack” 오픈소스의 관리 구조로는 어떤 것이 있나요? 오픈소스 프로젝트에서 적용되는 세 가지 일반적인 관리 구조가 있습니다. BDFL: BDFL은 “자비로운 종신독재자”(Benevolent Dictator for Life)의 약자입니다. 이 구조 아래에서는 (주로 프로젝트 창시자) 한 사람이 주요 사안의 최종 결정권을 갖습니다. Python 이 그 대표적인 예입니다. 작은 프로젝트는 한두 명의 관리자만이 존재하므로 BDFL이라 할 수 있습니다. 기업에 의해 시작된 프로젝트도 보통 BDFL의 범주에 들어갑니다. 능력주의(Meritocracy): (참고: “능력주의”라는 용어는 일부 커뮤니티에서는 부정적 의미를 내포하며, 복잡한 사회·정치적 역사 를 가지고 있습니다.) 능력주의 구조 아래에서는 (“능력”을 보이는) 활동적인 프로젝트 기여자들이 공식 결정권을 갖습니다. 사안 결정은 주로 투표를 통한 합의로 이루어집니다. 능력주의라는 개념은 Apache Foundation 에 의해 만들어졌습니다. 모든 Apache 프로젝트 가 능력주의 구조입니다. 기여는 반드시 기업이 아닌 각각의 개인에 의해 이루어집니다. 자유주의 기여(Liberal contribution): 자유주의 기여 구조에서는 가장 많은 일을 하는 사람이 가장 영향력 있는 사람으로 받아들여집니다. 하지만 이는 과거의 기여가 아닌 현재 작업 내용에 따라 판단합니다. 주요 사안은 투표보다는 (불만 사항에 대해 토론하는) 합의 도출 과정을 기반으로 하며, 가능한 많은 관점을 포함하려 합니다. 자유주의 기여 구조의 유명한 프로젝트로는 Node.js 와 Rust 가 있습니다. 어느 구조를 채택해야 할까요? 그건 여러분의 손에 달려 있습니다! 모든 구조는 각각의 장단점을 가지고 있습니다. 그리고 얼핏 보기에는 제법 달라 보여도 세 구조 모두 실제로는 보기보다 비슷합니다. 위 구조들 중 하나를 도입하고자 한다면 아래 템플릿을 참조하세요. BDFL 구조 템플릿 능력주의 구조 템플릿 Node.js의 자유주의 기여 정책 프로젝트를 출시하려면 관리 문서가 있어야 하나요? 프로젝트 관리 문서를 작성하는 데에 정해진 시기는 없습니다. 하지만 커뮤니티의 역학이 작용하는 모습을 직접 보고 나서 작성하면 더 쉽습니다. 오픈소스 관리의 가장 좋은 (그리고 어려운) 점은 그것이 커뮤니티에 의해 형성된다는 점입니다! 하지만 이른 문서화는 프로젝트 관리에 필연적으로 도움이 됩니다. 그러니 적을 수 있는 것부터 적으며 시작하세요. 프로젝트 출시 단계에서도 어떤 기여를 기대하는지 명시하거나 기여 과정이 어떻게 되는지 등을 정의할 수 있습니다. 여러분이 오픈소스 프로젝트를 출시하는 기업의 일원이라면, 출시 전에 앞으로 어떻게 프로젝트를 유지하고 사안을 결정할지에 대한 내부 토론 시간을 가지세요. 또한 기업이 프로젝트에 어떤 식으로 관여할지 (또는 관여하지 않을지!) 공개적으로 설명하는 것이 좋습니다. We assign small teams to manage projects on GitHub who are actually working on these at Facebook. For example, React is run by a React engineer. — @caabernathy, “An inside look at open source at Facebook” 기업 직원들이 기여하기 시작하면 어떤 일이 일어나나요? 성공적인 오픈소스 프로젝트는 많은 사람과 기업에서 사용됩니다. 그러다 보면 어떤 기업의 수익 흐름이 프로젝트와 엮이기도 합니다. 예컨대, 기업이 상업적 서비스 제공을 위한 한 요소로서 프로젝트 코드를 사용하는 경우가 있습니다. 프로젝트가 널리 쓰이면 해당 프로젝트에 전문적인 사람들(여러분일 수도 있습니다!)의 수요도 증가합니다. 때로는 프로젝트에서 맡는 작업에 대한 보수를 받기도 합니다. 영리 활동을 다른 개발 원동력과 같이 평범하게 여기는 것이 중요합니다. 보수를 받는 개발자들은 그렇지 않은 개발자들에 비해 특별한 대우를 받아서는 안 됩니다. 물론 그들이 만드는 기여는 기술적인 가치에 따라 평가받아야 하겠지만 말입니다. 사람들은 영리 활동에 대해 이야기하거나, 특정 기능 개선이 필요하다고 주장하며 용례를 다루는 데 불편이 없어야 합니다. “영리” 또는 “상용”이라는 단어는 “오픈소스”와 완벽히 어울리는 단어입니다. “영리”는 그저 어딘가에 돈이 연관되어 있다는 뜻입니다. 소프트웨어가 시장에서 사용되면 자연스럽게 프로젝트 채용률도 오릅니다. (오픈소스 소프트웨어가 비공개 소프트웨어의 일부분에 사용된다면 전체 소프트웨어는 여전히 “독점” 소프트웨어입니다. 이는 오픈소스처럼 영리적 용도로든 비영리적 용도로든 사용될 수 있습니다.) 다른 누구나와 마찬가지로, 이윤을 얻는 개발자들은 기여의 양과 질을 통해 프로젝트에서 영향력을 얻습니다. 투자한 시간에 대한 보상을 받는 개발자가 그렇지 않은 이들보다 많은 일을 할 수 있는 것은 분명한 사실이지만, 괜찮습니다. 보수는 누군가의 역량에 영향을 미치는 여러 요인 중 하나일 뿐입니다. 사람들이 기여하게 만들기 위한 외적 요인이 아닌 기여 자체에 토론을 집중하세요. 제 프로젝트를 지원하려면 법인이 필요한가요? 금전을 다루는 게 아니라면 오픈소스 프로젝트를 지원하는 데 법인은 필요하지 않습니다. 예컨대 영리 사업을 하고 싶다면 (미국 기준) C Corp이나 LLC를 설립해야 할 것입니다. 오픈소스 프로젝트에 관한 계약만 받고 있는 것이라면 독점 대표로서 돈을 수령하거나, 역시 (미국 기준) LLC를 설립할 수 있습니다. 오픈소스 프로젝트에 대한 기부를 받고 싶다면 PayPal이나 Stripe 등을 이용해 기부 버튼을 마련해둘 수 있습니다. 하지만 여러분이 비영리(미국 기준 501c3)를 증명하지 못한다면 세금 공제는 받지 못합니다. 대부분 프로젝트는 비영리 단체를 설립하는 번거로운 절차를 따르고 싶어하지 않습니다. 대신 비영리 회계 스폰서를 찾는 방법을 택합니다. 회계 스폰서는 보통 기부금의 일정 비율을 대가로 여러분을 대신하여 기부금을 수령합니다. 오픈소스 프로젝트를 위한 회계 스폰서 역할을 하는 조직은 Software Freedom Conservancy , Apache Foundation , Eclipse Foundation , Linux Foundation , Open Collective 등이 있습니다. Our goal is to provide an infrastructure that communities can use to be self sustainable, thus creating an environment where everyone — contributors, backers, sponsors — get concrete benefits out of it. — @piamancini, “Moving beyond the charity framework” 여러분의 프로젝트가 특정 언어 또는 생태계와 밀접하게 관련되어 있다면 협업할 수 있는 관련 소프트웨어 재단 또한 있을 것입니다. 예를 들어 Python Software Foundation 은 Python 패키지 관리자인 PyPI 프로젝트를 지원하고, Node.js Foundation 은 Node 기반 프레임워크인 Express.js 프로젝트를 지원합니다. 모든 가이드로 돌아가기 관련 가이드 관리자의 모범 문서화 과정에서 커뮤니티 활용에 이르기까지 오픈소스 관리자로서 여러분의 삶을 더 편하게 만들어 줍니다. 오픈소스 측정항목 성공을 측정하고 추적함으로써 오픈소스 프로젝트가 성공할 수 있도록 정보에 입각한 의사 결정을 하십시오. Scroll to Top 기여 제안을 하고 싶으신가요? 이 사이트는 오픈소스입니다. 개선할 수 있도록 도와주세요. 기여하기 구독 GitHub의 최신 오픈소스 팁과 리소스 관련 소식을 누구보다 먼저 들어보세요. 이메일 주소 fine print 와 친구 의 을 담은 | 2026-01-13T09:29:14 |
https://www.linkedin.com/uas/login?session_redirect=%2Fproducts%2Fcloudflare-workers%3FviewConnections%3Dtrue&trk=products_details_guest_face-pile-cta | LinkedIn Login, Sign in | LinkedIn Sign in Sign in with Apple Sign in with a passkey By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . or Email or phone Password Show Forgot password? Keep me logged in Sign in We’ve emailed a one-time link to your primary email address Click on the link to sign in instantly to your LinkedIn account. If you don’t see the email in your inbox, check your spam folder. Resend email Back New to LinkedIn? Join now Agree & Join LinkedIn By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . LinkedIn © 2026 User Agreement Privacy Policy Community Guidelines Cookie Policy Copyright Policy Send Feedback Language العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) | 2026-01-13T09:29:14 |
https://opensource.guide/pt/starting-a-project/ | Iniciando um Projeto Open Source | Open Source Guides Sobre Contribua العربية Български Bangla Deutsch Ελληνικά English Español Farsi Français Hindi Magyar Indonesia Italiano 日本語 한국어 Malay Nederlands Pidgin Polski Português Romanian Русский संस्कृतम् Swahili தமிழ் Türkçe 简体中文 繁體中文 Open Source Guides Iniciando um Projeto Open Source Saiba mais sobre o mundo do open source e se prepare para começar o seu próprio projeto Índice O “o que” e “porquê” do open source Eu deveria lançar o meu próprio projeto open source? Lançando o seu próprio projeto open source Nomeando e criando uma marca para o seu projeto Seu checklist pré-lançamento O “o que” e “porquê” do open source Então você está pensando em começar com open source? Parabéns! O mundo aprecia sua contribuição. Vamos falar sobre o que o open source é e porque as pessoas fazem isso. O que significa “open source”? Quando um projeto é open source, isso significa que Qualquer um pode ver, usar, modificar e distribuir o projeto por qualquer motivo . Essas permissões são reforçadas através de uma licença open source . O open source é poderoso porque diminui as barreiras para adoção, o que permite às ideias se espalhar rapidamente. Para entender como funciona, imagine que seu amigo está dando uma festa, e você leva uma torta de cereja. Todos experimentam a torta ( usa ) A torta é um sucesso! Eles te pedem a receita, que você disponibiliza ( vê ) Um amigo, Alex, que é um chefe de pastelaria, sugere reduzir o açúcar ( modifica ) Outra amiga, Lisa, pede para utilizá-la em um jantar na próxima semana ( distribui ) Em comparação, um processo de código fechado seria ir a um restaurante e pedir um pedaço de torta. Você tem que pagar uma taxa para comer a torta, e o restaurante provavelmente não te dará a receita. Se você copiasse a torta deles exatamente e a vendesse sob seu próprio nome, o restaurante poderia abrir uma ação contra você. Por que as pessoas tornam seu trabalho open source? Uma das experiências mais recompensadores que eu obtenho do uso e colaboração no open source vêm dos relacionamentos que eu construo com outros desenvolvedores enfrentando muitos dos mesmos problemas que eu. — @kentcdodds, “How getting into Open Source has been awesome for me” Há muitas razões pela qual uma pessoa ou organização iria querer tornar um projeto open source. Alguns exemplos incluem: Colaboração: Projetos open source podem aceitar mudanças de qualquer pessoa no mundo. Exercism , por exemplo, é uma plataforma de exercícios de programação com mais de 350 contribuidores. Adoção e remixing: Projetos open source podem ser utilizados por qualquer um para praticamente qualquer propósito. As pessoas podem até mesmo utilizá-lo para construir outras coisas. WordPress , por exemplo, começou como um fork de um projeto chamado b2 . Transparência: Qualquer um pode inspecionar um projeto open source por erros ou inconsistências. A transparência importa a governos como a Bulgaria ou os Estados Unidos , indústrias regulamentadas como bancos ou indústrias de saúde, e softwares de segurança como Let’s Encrypt . Open source não é só sobre software. Você pode tornar qualquer coisa open source, de conjuntos de dados a livros. Dê uma olhada no GitHub Explore por ideias do que você pode tornar open source. Open source significa “grátis”? Uma das maiores atrações do open source é que ele tem custo zero. “Grátis”, porém, é um subproduto do valor total do open source. Como uma licença open source requer que qualquer um possa usar, modificar e compartilhar o seu projeto por aproximadamente qualquer propósito, os projetos, por si só, tendem a ser livres de qualquer custo. Se o projeto cobra para ser utilizado, qualquer um poderia, em vez disso, legalmente fazer uma cópia e utilizar a versão grátis. Como resultado, a maior parte dos projetos open source são grátis, mas “grátis” não faz parte da definição do open source. Há maneiras de cobrar por um projeto open source indiretamente através de licenças duais ou features limitadas, enquanto ainda de acordo com a definição oficial de open source. Eu deveria lançar o meu próprio projeto open source? A resposta curta é sim, porque não importa o resultado, lançar o seu próprio projeto é uma ótima maneira de aprender como o open source funciona. Se você nunca tornou um projeto open source antes, você pode se sentir nervoso sobre o que as pessoas irão falar, ou mesmo se alguém vai dar a ele alguma atenção. Se isso soa familiar para você, saiba que não está sozinho! O open source funciona como qualquer outra atividade criativa, seja escrita ou pintura. Pode parecer assustador compartilhar o seu trabalho com o mundo, mas a única maneira de se aperfeiçoar é praticando - mesmo que você não possua uma audiência. Se você ainda não está convencido, reserve um momento para pensar sobre quais são seus objetivos. Definindo os seus objetivos Os objetivos podem te ajudar a descobrir no que trabalhar, para o que dizer não, e onde você precisa da ajuda de outros. Comece perguntando a si mesmo, por que estou tornando esse projeto open source? Não há uma resposta definitiva para essa questão. Você pode ter múltiplos objetivos para um dado projeto, ou diferentes projetos com diferentes objetivos. Se seu único objetivo é mostrar seu trabalho, você pode não querer contribuições e até mesmo deixar isso claro em seu README. Por outro lado, se você procura contribuidores, você investirá um certo tempo em produzir uma documentação clara e fazer com que os novatos se sintam bem vindos. Em um determinado momento, eu criei um componente customizado UIAlertView que eu estava utilizando… Então, decidi torná-lo open source. Eu o modifiquei para ser mais dinâmico e o coloquei no GitHub. Além disso, escrevi minha primeira documentação explicando a outros desenvolvedores como usá-lo em seus projetos. Provavelmente ninguém nunca o usou porque se tratava de um projeto simples mas eu estava me sentindo bem pela minha contribuição. — @mavris, “Self-taught Software Developers: Why Open Source is important to us” A medida que o seu projeto cresce, sua comunidade pode precisar de mais do que apenas código de você. Responder issues, revisar código e evangelizar o seu projeto são todas tarefas importantes em um projeto open source. Enquanto a quantidade de tempo que você gasta em tarefas que não envolvem código depende do tamanho e escopo do seu projeto, você deve estar preparado, como um mantenedor, a cuidar delas você mesmo ou a encontrar alguém para ajudá-lo. Se você faz parte de uma empresa tornando um projeto open source, certifique-se de que seu projeto tem os recursos internos que ele precisa para florescer. Você irá querer identificar quem é responsável por manter o projeto após o almoço e compartilhar essas tarefas com a comunidade. Se você precisar de uma renda dedicada ou pessoal para promoção, operações e manutenção do projeto, comece essas discussões cedo. Quando você começa a tornar o projeto open source, é importante se certificar de que os seus processos administrativos levam em consideração as contribuições e habilidades da comunidade em torno do seu projeto. Não tenha medo de envolver contribuidores que não são empregados da sua empresa em aspectos chave do projeto - especialmente se eles são contribuidores assíduos. — @captainsafia, “So you wanna open source a project, eh?” Contribuindo para outros projetos Se seu objetivo é aprender como contribuir com outras pessoas ou entender como o open source funciona, considere contribuir para um projeto existente. Comece com um projeto que você utiliza e ama. Contribuir para um projeto pode ser tão simples quanto consertar erros de escrita ou atualizar uma documentação. Se você não tem uma ideia clara de como iniciar enquanto contribuidor, dê uma olhada em How to Contribute to Open Source guide . Lançando o seu próprio projeto open source Não há um momento perfeito para tornar o seu trabalho open source. Você pode tornar uma ideia open source, um trabalho em andamento ou mesmo um trabalho que passou anos como código fechado. De um modo geral, você deve tornar o seu projeto open source quando se sentir confortável em ter outras pessoas vendo e dando feedback no seu trabalho. Independente do estágio em que você decida tornar o seu projeto open source, todo projeto deve incluir as seguintes documentações: Open source license README Contributing guidelines Code of conduct Como um mantenedor, esses componentes irão ajudá-lo a comunicar suas expectativas, administrar contribuições, e proteger o direito legal de todos (inclusive o seu). Eles aumentam suas chances de ter uma experência positiva significativamente. Se seu projeto está no GitHub, colocar esses arquivos no seu diretório root com os nomes recomendados ajudará o GitHub a reconhecê-los e automaticamente mostrá-los da maneira apropriada aos seus leitores. Escolhendo uma licença Uma licença open source garante que outros possam utilizar, copiar, modificar e contribuir com o seu projeto sem repercussões. Ela também lhe protege de situações legais problemáticas. Você deve incluir uma licença sempre que lançar um projeto open source. Trabalho legal não é divertido. A boa noticia é que você pode copiar e colar uma licença existente no seu repositório. Só levará um minuto e vai proteger seu trabalho duro. MIT , Apache 2.0 , e GPLv3 são as licenças open source mais populares, mas há outras opções disponíveis. Quando você cria um projeto do GitHub, é dada a opção de escolher uma licença. Incluir uma licença open source fará seu projeto GitHub open source. Se você possui outros questionamentos e preocupações acerca dos aspectos legais da administração de um projeto open source, podemos te ajudar . Escrevendo um README READMEs fazem mais do que explicar como usar o seu projeto. Eles também explicam porque o seu projeto importa, e o que os seus usuários podem fazer com ele. No seu README, tente responder as seguintes questões: O que esse projeto faz? Por que esse projeto é útil? Como começo? Onde posso conseguir ajuda, seu eu precisar? Você pode usar o seu README para responder outras questões, por exemplo como você lida com contribuições, quais são os objetivos do projeto e informações sobre licenças e atribuições. Se você não quer aceitar contribuições, ou seu projeto não está pronto para produção, escreva no README essa informação. Uma documentação melhor significa mais usuários, menos requisições de suporte, e mais contribuidores. (…) Lembre-se de que os seus leitores não são você. Há pessoas que chegarão ao projeto com experiências completamente diferentes. — @tracymakes, “Writing So Your Words Are Read (video)” Algumas vezes, as pessoas evitam escrever um README porque sentem que o projeto não está finalizado, ou não querem contribuições. Essas são todas boas razões para escrever um. Para mais inspiração, tente usar o “Making READMEs Readable” do @18F ou o README template do @PurpleBooth para escrever um README completo. Quando você inclui um arquivo de README no seu diretório raiz, o GitHub irá automaticamente renderizá-lo na página inicial do projeto. Escrevendo suas diretrizes de contribuição Um arquivo CONTRIBUTING diz a sua audiência como participar no seu projeto. Por exemplo, você pode incluir informações sobre: Como criar um relatório de bug (tente usar um template de issue ou pull request ) Como sugerir uma nova feature Como configurar o seu ambiente e rodar testes Além dos detalhes técnicos, um arquivo CONTRIBUTING é uma oportunidade de comunicar suas expectativas para contribuições, como: Os tipos de contribuições que você está procurando Seu roadmap ou visão para o projeto Como contribuidores devem (ou não devem) entrar em contato com você Usar um tom acolhedor, amigável e oferecer sugestões específicas para contribuições (como escrever uma documentação, ou fazer um website) pode fazer uma grande diferença em fazer com que novos contribuidores se sintam bem vindos e felizes em participar. Por exemplo, o Active Admin começa seu guia de contribuição com: Primeiramente, obrigado por considerar contribuir para o Active Admin. São pessoas como você que fazem o Active Admin esta grande ferramenta. Nos primeiros estágios do seu projeto, seu arquivo de CONTRIBUTING pode ser simples. Você deve sempre explicar como relatar bugs ou registrar issues, e qualquer requisito técnico (como testes) necessário para se fazer uma contribuição. Ao longo do tempo, você pode adicionar outras questões frequentemente respondidas ao seu arquivo CONTRIBUTING. Escrever essas informações significa que menos pessoas te farão as mesmas perguntas repetidas vezes. Para mais ajuda em como escrever seu arquivo CONTRIBUTING, dê uma olhada no contributing guide template de @nayafia ou o “How to Build a CONTRIBUTING.md” do @mozilla. Crie um link para seu arquivo CONTRIBUTING a partir do seu README, de modo que mais pessoas possam vê-lo. Se você colocar seu arquivo CONTRIBUTING no repositório do seu projeto , o GitHub irá automaticamente “linkar” para o seu arquivo quando um contribuidor criar uma issue ou abrir um pull request. Estabelecendo um código de conduta Todos nós já tivemos experiências em que encaramos um provável abuso, seja como um mantenedor tentando explicar porque alguma coisa tinha de ser feita de um certo modo, ou como um usuário… fazendo um simples questionamento. (…) Um código de conduta se torna um documento facilmente referenciável e ‘linkavel’ que indica como o seu time leva o discurso construtivo de modo bastante sério. — @mlynch, “Making Open Source a Happier Place” Finalmente, um código de conduta ajuda a criar regras básicas de comportamento para os participantes do seu projeto. Isso possui um valor especial se você está lançando um projeto open source para a comunidade ou alguma empresa. Um código de conduta te dá o poder de facilitar um comportamento saudável e construtivo da comunidade, o que irá reduzir seu estresse como mantenedor. Para mais informações, dê uma olhada no nosso guia do Código de Conduta . Além de comunicar como você espera que os participantes se comportem, um código de conduta também tende a descrever a quem essas expectativas se aplicam, quando se aplicam e o que fazer se uma violação ocorrer. De modo muito parecido com licenças open source, também há padrões emergentes para códigos de conduta, de modo que você não precisa escrever o seu. O Contributor Covenant é um código de conduta “pronto para o uso” que é usado por mais de 40,000 projetos open source , incluindo Kubernetes, Rails, e Swift. Não importa que texto você utilize, você deve estar sempre preparado para impor o seu código de conduta quando necessário. Cole o texto diretamente em um arquivo CODE_OF_CONDUCT no seu repositório. Mantenha o arquivo no diretório raiz do seu projeto, de modo que ele seja fácil de ser encontrado, e crie um link para ele a partir do seu README. Nomeando e criando uma marca para o seu projeto Uma marca é mais do que uma logo chamativa ou um nome atraente. É sobre como você fala sobre o seu projeto, e quem você atinge com sua mensagem. Escolhendo o nome certo Escolha um nome que é fácil de lembrar e, idealmente, dê alguma ideia sobre o que o projeto faz. Por exemplo: Sentry monitora aplicações para criar relatórios de falha Thin é um servidor web Ruby rápido e simples Se você está construindo algo sobre um projeto existente, usar o nome deles como prefixo pode ajudar a esclarecer o que o seu projeto faz (por exemplo, node-fetch traz o window.fetch para o Node.js). Considere clareza acima de tudo. Trocadilhos são engraçados, mas lembre-se de que algumas piadas podem não possuir tradução para outras culturas ou pessoas com experiências diferentes das suas. Alguns dos seus potenciais usuários podem ser funcionários de alguma empresa: você não quer fazê-los sentirem-se desconfortáveis ao explicar o seu projeto no trabalho! Evitando conflitos de nomes Procure projetos open source com um nome similar , especialmente se você compartilha a mesma linguagem ou ecossistema. Se seu nome se sobrepõe ao de um projeto popular existente, você pode confundir sua audiência. Se você quer um website, Twitter handle, ou outras propriedades para representar o seu projeto, assegure-se de que você pode ter os nomes que procura. Idealmente, reserve tais nomes agora para paz mental, mesmo que você não planeje utilizá-los no momento. Assegure-se de que o nome do seu projeto não infringe nenhuma marca registrada. Uma empresa pode pedir que você derrube seu projeto no futuro, ou até mesmo tomar alguma ação legal contra você. Simplesmente não vale o risco. Você pode conferir o WIPO Global Brand Database por conflitos com marcas registradas. Se você está em uma empresa, essa é uma das coisas em que o seu time legal pode ajudá-lo . Finalmente, realize uma busca rápida no Google pelo nome do seu projeto. As pessoas encontrarão o seu projeto com facilidade? Há algo que aparece nos resultados de busca que você não gostaria que eles vissem? Como você escreve (e “coda”) afeta sua marca, também! Ao longo da vida do seu projeto, você escreverá bastante: READMEs, tutoriais, documentos da comunidade, responder a issues, talvez até mesmo newsletters e listas de email. Quer seja documentação oficial ou um email casual, seu estilo de escrita é parte da marca do seu projeto. Considere como você se portará diante de sua audiência e se esse é o tom que você deseja transmitir. Eu procurei estar envolvido com todas as threads na lista de emails e mostrar comportamento exemplar, sendo legal com as pessoas, levando seus problemas a sério e tentando ser útil de um modo geral. Após um tempo, as pessoas permaneceram não somente para fazer questionamentos, mas para ajudar com as respostas também, e, para minha completa alegria, elas imitaram o meu estilo. — @janl on CouchDB , “Sustainable Open Source” Utilizar uma linguagem acolhedora e inclusiva (como “eles”, mesmo quando se referindo a uma única pessoa) pode fazer uma grande diferença em fazer com que seu projeto seja acolhedor para novos contribuidores. Permaneça com uma linguagem simples, já que muitos dos seus leitores podem não ser falantes nativos de inglês. Muito além de como você escreve palavras, seu estilo de código também pode se tornar parte da marca do seu projeto. Angular e jQuery são dois exemplos de projetos com estilos de códificação e guidelines rigorozas. Não é necessário escrever um guia de estilo para o seu projeto quando você está apenas começando, e você pode descobrir que você gosta de incorporar diferentes estilos de codificação no seu projeto, de qualquer forma. Porém você deve antecipar como seu estilo de escrita e codificação pode atrair ou desencorajar diferentes tipos de pessoas. Os estágios mais iniciais do seu projeto são sua oportunidade de definir o precedente que você deseja ver. Seu checklist pré-lançamento Pronto para tornar o seu projeto open source? Aqui está uma checklist para ajudar. Marcou todas as caixas? Você está pronto! Clique em “publish” e dê um tapinha em suas costas. Documentação O Projeto possui um arquivo LICENSE com uma licença open source O Projeto possui documentação básica (README, CONTRIBUTING, CODE_OF_CONDUCT) O nome é fácil de lembrar, dá alguma ideia do que o projeto faz e não entra em conflito com um projeto existente ou infringe alguma marca registrada A fila de issues está atualizada, com issues claramente organizadas e rotuladas Code O projeto utiliza convenções de código consistentes e nomes de funções/métodos/variáveis claros O código é comentado de forma clara, documentando intenções e edge cases Não há material sensível no histórico de revisões, issues, ou pull requests (por exemplo, senhas ou outras informações não-públicas) Pessoas Se você é um indivíduo: Você falou com o departamento legal e/ou entendeu o IP e políticas open source de sua empresa (se você é um funcionário em algum lugar) Se você está em uma empresa ou organização: Você falou com seu departamento legal Você possui um plano de marketing para anunciar e promover o projeto Alguém está engajado em administrar as interações com a comunidade (responder a issues, revisar e 'merjar' pull requests) Pelo menos duas pessoas têm acesso administrativo ao projeto Você conseguiu! Parabéns em tornar seu primeiro projeto open source. Não importa o resultado, trabalhar em público é um presente para a comunidade. Com cada commit, comentário, e pull request, você está criando oportunidades para você e para os outros de aprender e crescer. Voltar para todos os guias Guias relacionados Encontrando Usuários para Seu Projeto Ajude seu projeto open source a crescer, colocando-o nas mãos de usuários felizes. Construindo Comunidades Acolhedoras Como construir uma comunidade que encoraje pessoas a utilizarem, contribuirem e evangelizarem o seu projeto Scroll to Top Contribua Quer fazer um sugestão? Este conteúdo é open source. Ajude-nos a melhorá-lo. Contribua Fique ligado(a) Seja o(a) primeiro(a) a saber as últimas dicas e recursos open source do GitHub. Endereço de E-mail fine print com pelo e seus amigos | 2026-01-13T09:29:14 |
https://www.linkedin.com/login?session_redirect=https%3A%2F%2Fwww%2Elinkedin%2Ecom%2Fcompany%2Fdigitaleconomycouncil&fromSignIn=true&trk=top-card_top-card-secondary-button-top-card-secondary-cta | LinkedIn Login, Sign in | LinkedIn Sign in Sign in with Apple Sign in with a passkey By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . or Email or phone Password Show Forgot password? Keep me logged in Sign in We’ve emailed a one-time link to your primary email address Click on the link to sign in instantly to your LinkedIn account. If you don’t see the email in your inbox, check your spam folder. Resend email Back New to LinkedIn? Join now Agree & Join LinkedIn By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . LinkedIn © 2026 User Agreement Privacy Policy Community Guidelines Cookie Policy Copyright Policy Send Feedback Language العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) | 2026-01-13T09:29:14 |
https://www.lagrange.dev/zk-prover-network | ZK PRover Network Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY TECHNOLOGY Defense DeepProve ZK Prover Network ECOSYSTEM FOUNDATION DOCS ARTICLES Blog Engineering Technology DEFENSE DEEP PROVE ZK PROVER NETWORK ECOSYSTEM FOUNDATION DOCS Articles BLOG ENGINEERING ZK Prover Network Lagrange’s ZK Prover Network powers scalable proofs for AI, rollups, apps and ZK coprocessors. learn More About the ZK Prover Network Infinitely Scalable Lagrange’s ZK Prover Network has a unique architecture that enables it to scale proof generation dynamically and horizontally according to demand. Based on the needs of partners, they can tap into dedicated proving bandwidth, meaning bottlenecks that exist with traditional monolithic prover networks are no longer a concern. Proof Liveness & Efficiency Operators in Lagrange’s Prover Network commit to producing proofs within a given time period or risk non-payment, thus ensuring high liveness guarantees. Cost efficiency and incentive alignment are also inherent, due to using bare-metal instances, economies of scale, and Lagrange’s Double Auction Resource Allocation (DARA) mechanism. Production-Ready Proving Typically, working with distributed proving comes with many complexities and details to manage. Lagrange provides a straightforward interface and works directly with partners to design their system, so partners can simply focus on their business and count on reliable and performant proof generation for their needs. Interested in building with the ZK prover Network? Thank you! Your submission has been received! Oops! Something went wrong while submitting the form. Sign up for updates Thank you! Your submission has been received! Oops! Something went wrong while submitting the form. Resources Github DeepProve Defense Docs ZK Prover Network Ecosystem Blog ZK Coprocessor Engineering About Careers Press Kit Foundation Terms & Conditions Privacy Policy Follow © Lagrange 2025 | 2026-01-13T09:29:14 |
https://opensource.guide/sa/starting-a-project/ | परियोजनारम्भः | Open Source Guides परिचयः योगदानम् العربية Български Bangla Deutsch Ελληνικά English Español Farsi Français Hindi Magyar Indonesia Italiano 日本語 한국어 Malay Nederlands Pidgin Polski Português Romanian Русский संस्कृतम् Swahili தமிழ் Türkçe 简体中文 繁體中文 Open Source Guides परियोजनारम्भः मुक्तस्रोत परियोजनम् आरम्भाय लघु मार्गदर्शिका — समस्या चिन्व, सहकर्मिणः चयनय, उपयोगाय योग्यं किञ्च प्रकाशितु। अनुक्रमणिका किमर्थं परियोजनम् आरभेतुम्? त्वया चिन्तनीया समस्या चिन्व लघु तथा केन्द्रितं रक्षतु सहकर्मिणः अन्वेषयतु यत् लोकैः उपयोग्यं भवति तत् प्रकाशयतु किमर्थं परियोजनम् आरभेतुम्? किं कारणेन भवतः परियोजनम् आरभेतुम्? कदाचित् भवतः दृष्टे कश्चन समस्या अस्ति यत् अन्येऽपि समाधानं न दत्तवन्तः; कदाचित् स्वकिञ्चित् अनुशोभनार्थं वा अभ्यासार्थं परियोजनं आरभेतुम् इच्छसि; अथवा तव कार्यस्य प्रदर्शनेषु कोऽपि सन्दर्भार्थं किञ्च निर्माणं कर्तुम् इच्छसि। यत् कारणं भवेत्, परियोजनारम्भः ज्ञानं लभितुं च समुदायस्य योगदानं पालयितुं सुखप्रदः मार्गः अस्ति। त्वया चिन्तनीया समस्या चिन्व यदि त्वं समस्यायाः विषये चित्तं न दास्यसि तर्हि अन्येऽपि न दास्यन्ति। तस्यर्थम् त्वया रोचकं वा उपयोगकरं इति मन्यते तादृशं समस्या चिन्व। उत्तमानि परियोजनानि ते सन्ति यानि तन्मध्ये लेखकस्य वा उपयोगकर्तारः कृत्येषु साहाय्यं कुर्वन्ति। लघु तथा केन्द्रितं रक्षतु लघु-क्षेत्रे लक्षितं परियोजनं आरभ्य तस्य सफलस्य सम्भावना वर्धते। न्यूनतमं कार्यक्षमं रूपम् (MVP) निर्माता चानन्तरम् प्रवर्तय; तेन शीघ्रं उपयोगकर्तॄणां च योगदानकर्तॄणां आगमनं सम्भवति। स्पष्टं सीमितं लक्ष्यं स्थापयितुं प्रयत्नं कुरु। सहकर्मिणः अन्वेषयतु मुक्तस्रोतपरियोजनाः सामान्यतया अन्यानां सहयोगेन वृध्दिं याति। प्रारम्भिककार्ये मित्राणाम् वा सहकर्मिणाम् पृच्छतु यत् सहायतां दास्यन्ति। प्रारम्भिकयोगदानकर्तारः दस्तावेजनम्, परीक्षणम्, प्रचारः च कर्तुं शक्नुवन्ति। यत् लोकैः उपयोग्यं भवति तत् प्रकाशयतु मूल्यं प्रदातुम् केन्द्रं कुर्व। यदि भवतः परियोजनं कस्यापि कर्म कृत्वा सुलभतया सिद्ध्यति अथवा कश्चन समस्या निराकुर्यात्, तर्हि उपयोगकर्तृभः तं अनुकरणीयं मन्यन्ते। परियोजनस्य स्पष्टं दस्तावेजनं दत्तव्यम्, उदाहरणानि प्रदातव्यानि, आरम्भस्य मार्गदर्शिका च सुकरं कृत्वा प्रदातव्या। नित्यम् संवर्धय प्रतिक्रिया सङ्ग्रहय, पुनरावृत्तिं कुर्व, च उपयोगकर्तॄणां अपेक्षायाम् प्रत्युत्तरं दातुं सज्जः भव। व्यावहारिकपद्धत्या सानुकूल्यं कृत्वा नियमितं सुधाराः प्रकाशयेत् यत् परियोजनस्य ग्रহণशीलता वर्धयति। यदि इच्छसि, अन्यानि sa लेखान् अहं अपि संस्कृते अनुवादितुं आरभेयं। सर्व मार्गदर्शिकानाम् प्रति सम्बद्ध मार्गदर्शिकाः परिचालकानां श्रेष्ठः आचरणः मुक्तस्रोतपरियोजनायाः परिचालकः स्यात् चेत् प्रक्रियासु लेखनात् समुदायस्य उपयोगपर्यन्तं, तस्य जीवनं सुकरं भवति। सौम्यसमुदायस्य निर्माणम् यः समुदायः लोकान् परियोजनस्य उपयोगे, योगदाने, च प्रचारे प्रोत्साहयति तस्य निर्माणस्य मार्गदर्शिका। Scroll to Top योगदानम् किं तव सुझावः अस्ति? एषा सामग्री मुक्त-स्रोत् अस्ति। अस्मान् सुधारयितुं साहाय्यं कुर्व। योगदानम् संपर्के भव GitHub इत्यस्य नवीनतम् मुक्तस्रोत्-संदेशानाम् विषये प्रथमज्ञः भव। ईमेल् fine print सह द्वारा तथा मित्राणि | 2026-01-13T09:29:14 |
https://opensource.guide/nl/leadership-and-governance/ | Leiderschap en bestuur | Open Source Guides Over Bijdragen العربية Български Bangla Deutsch Ελληνικά English Español Farsi Français Hindi Magyar Indonesia Italiano 日本語 한국어 Malay Nederlands Pidgin Polski Português Romanian Русский संस्कृतम् Swahili தமிழ் Türkçe 简体中文 繁體中文 Open Source Guides Leiderschap en bestuur Groeiende open source-projecten kunnen profiteren van formele regels voor het nemen van beslissingen. Inhoudsopgave Inzicht in governance voor uw groeiende project Wat zijn voorbeelden van formele rollen die worden gebruikt in open source-projecten? Hoe formaliseer ik deze leiderschapsrollen? Wanneer moet ik iemand commit-toegang geven? Wat zijn enkele van de algemene bestuursstructuren voor open source-projecten? Heb ik beheersdocumenten nodig wanneer ik mijn project start? Wat gebeurt er als bedrijfsmedewerkers bijdragen beginnen in te dienen? Inzicht in governance voor uw groeiende project Je project groeit, mensen zijn betrokken en je bent vastbesloten om dit ding gaande te houden. In dit stadium vraagt u zich misschien af hoe u regelmatige projectmedewerkers in uw workflow kunt opnemen, of het nu gaat om iemand commit-toegang te geven of om discussies in de gemeenschap op te lossen. Als u vragen heeft, hebben we de antwoorden. Wat zijn voorbeelden van formele rollen die worden gebruikt in open source-projecten? Veel projecten volgen een vergelijkbare structuur voor rollen en erkenning van medewerkers. Wat deze rollen eigenlijk betekenen, is geheel aan jou. Hier zijn een paar soorten rollen die u wellicht herkent: Open source-beheerder / Maintainer Bijdrager / Contributor Committer Voor sommige projecten zijn “open source-beheerders” de enige mensen in een project met commit-toegang. In andere projecten zijn het gewoon de mensen die in de README worden vermeld als beheerders. Een onderhouder hoeft niet per se iemand te zijn die code voor uw project schrijft. Het kan iemand zijn die veel werk heeft verzet om uw project te evangeliseren, of schriftelijke documentatie die het project toegankelijker heeft gemaakt voor anderen. Ongeacht wat ze van dag tot dag doen, een onderhouder is waarschijnlijk iemand die verantwoordelijkheid voelt over de richting van het project en zich inzet om het te verbeteren. Een ‘bijdrager’ kan iedereen zijn die opmerkingen maakt over een probleem of pull-verzoek, mensen die waarde toevoegen aan het project (of het nu gaat om triaging-problemen, het schrijven van code of het organiseren van evenementen), of iemand met een samengevoegd pull-verzoek (misschien de engste definitie van een bijdrager). [Voor Node.js] is elke persoon die komt opdagen om commentaar te geven op een probleem of code in te dienen, lid van de community van een project. Alleen al om ze te kunnen zien, betekent dat ze de grens hebben overschreden van een gebruiker naar een bijdrager. [For Node.js,] every person who shows up to comment on an issue or submit code is a member of a project’s community. Just being able to see them means that they have crossed the line from being a user to being a contributor. — @mikeal, “Gezond Open Source” De term “committer” kan worden gebruikt om commit-toegang, wat een specifiek type verantwoordelijkheid is, te onderscheiden van andere vormen van bijdrage. Hoewel u uw projectrollen op elke gewenste manier kunt definiëren, overweeg het gebruik van bredere definities om meer vormen van bijdrage aan te moedigen. U kunt leiderschapsrollen gebruiken om formeel mensen te erkennen die een uitstekende bijdrage aan uw project hebben geleverd, ongeacht hun technische vaardigheden. Je kent me misschien als de “uitvinder” van Django… maar eigenlijk ben ik de man die werd aangenomen om aan iets te werken een jaar nadat het al gemaakt was. (…) Mensen vermoeden dat ik succesvol ben vanwege mijn programmeervaardigheid… maar ik ben op zijn best een gemiddelde programmeur. You might know me as the “inventor” of Django…but really I’m the guy who got hired to work on a thing a year after it was already made. (…) People suspect that I’m successful because of my programming skill…but I’m at best an average programmer. — @jacobian, “PyCon 2015 Keynote” (video) Hoe formaliseer ik deze leiderschapsrollen? Het formaliseren van uw leiderschapsrollen helpt mensen zich eigenaar te voelen en vertelt andere gemeenschapsleden naar wie ze moeten zoeken voor hulp. Voor een kleiner project kan het aanwijzen van leiders net zo eenvoudig zijn als het toevoegen van hun naam aan uw README of een CONTRIBUTORS tekstbestand. Voor een groter project, als u een website heeft, maak dan een teampagina aan of vermeld uw projectleiders daar. Postgres heeft bijvoorbeeld een uitgebreide teampagina met korte profielen voor elke bijdrager. Als uw project een zeer actieve bijdragersgemeenschap heeft, kunt u een “kernteam” van beheerders vormen, of zelfs subcommissies van mensen die de verantwoordelijkheid nemen voor verschillende probleemgebieden (bijvoorbeeld beveiliging, probleemopsporing of gedrag van de gemeenschap). Laat mensen zichzelf organiseren en vrijwilligerswerk doen voor de rollen waar ze het meest enthousiast over zijn, in plaats van ze toe te wijzen. [We] vullen het kernteam aan met verschillende “subteams”. Elk subteam is gericht op een specifiek gebied, bijvoorbeeld taalontwerp of bibliotheken. (…) Om wereldwijde coördinatie en een sterke, samenhangende visie voor het project als geheel te verzekeren, wordt elk subteam geleid door een lid van het kernteam. [We] supplement the core team with several “subteams”. Each subteam is focused on a specific area, e.g., language design or libraries. (…) To ensure global coordination and a strong, coherent vision for the project as a whole, each subteam is led by a member of the core team. — “Rust Bestuur RFC” Leiderschapsteams willen misschien een aangewezen kanaal creëren (zoals op IRC) of regelmatig bijeenkomen om het project te bespreken (zoals op Gitter of Google Hangout). U kunt die bijeenkomsten zelfs openbaar maken, zodat andere mensen kunnen luisteren. Cucumber-ruby , bijvoorbeeld host wekelijks kantooruren . Als u eenmaal leiderschapsrollen heeft vastgesteld, vergeet dan niet te documenteren hoe mensen deze kunnen bereiken! Stel een duidelijk proces vast voor hoe iemand een onderhouder kan worden of lid kan worden van een subcommissie in uw project, en schrijf het op uw GOVERNANCE.md. Tools zoals Vossibility kunnen je helpen om publiekelijk bij te houden wie (of niet) bijdraagt aan het project. Door deze informatie te documenteren, wordt de perceptie van de gemeenschap vermeden dat beheerders een kliek zijn die privé beslissingen neemt. Ten slotte, als uw project op GitHub staat, overweeg dan om uw project van uw persoonlijke account naar een organisatie te verplaatsen en ten minste één back-upbeheerder toe te voegen. GitHub Organisations maken het gemakkelijker om machtigingen en meerdere opslagplaatsen te beheren en de nalatenschap van je project te beschermen via gedeeld eigendom . Wanneer moet ik iemand commit-toegang geven? Sommige mensen vinden dat je commitment moet geven aan iedereen die een bijdrage levert. Dit zou meer mensen kunnen aanmoedigen om zich eigenaar te voelen van uw project. Aan de andere kant, vooral voor grotere, meer complexe projecten, wil je misschien alleen commitment geven aan mensen die hun betrokkenheid hebben getoond. Er is niet één goede manier om het te doen - doe wat je het prettigst vindt! Als je project op GitHub staat, kun je beschermde branches gebruiken om te beheren wie naar een bepaalde branch kan pushen, en onder welke omstandigheden. Elke keer dat iemand je een pull-request stuurt, geef hem dan commit-toegang tot je project. Hoewel het in het begin misschien ongelooflijk stom klinkt, kun je met deze strategie de ware kracht van GitHub ontketenen. (…) Als mensen eenmaal commit-toegang hebben, zijn ze niet langer bang dat hun patch niet zal worden samengevoegd… waardoor ze er veel meer werk in steken. Whenever somebody sends you a pull request, give them commit access to your project. While it may sound incredibly stupid at first, using this strategy will allow you to unleash the true power of GitHub. (…) Once people have commit access, they are no longer worried that their patch might go unmerged…causing them to put much more work into it. — @felixge, “The Pull Request Hack” Wat zijn enkele van de algemene bestuursstructuren voor open source-projecten? Er zijn drie algemene bestuursstructuren die verband houden met open source-projecten. BDFL: BDFL staat voor “Benevolent Dictator for Life”. Volgens deze structuur heeft één persoon (meestal de oorspronkelijke auteur van het project) het laatste woord over alle belangrijke projectbeslissingen. Python is een klassiek voorbeeld. Kleinere projecten zijn waarschijnlijk standaard BDFL, omdat er maar één of twee beheerders zijn. Een project dat is ontstaan bij een bedrijf kan ook in de categorie BDFL vallen. Meritocratie: (Opmerking: de term “meritocratie” heeft een negatieve connotatie voor sommige gemeenschappen en heeft een complexe sociale en politieke geschiedenis .) Onder een meritocratie krijgen actieve projectmedewerkers (degenen die “verdienste” aantonen) een formele besluitvormende rol. Beslissingen worden meestal genomen op basis van zuivere stemconsensus. Het concept van meritocratie is ontwikkeld door de Apache Foundation ; alle Apache-projecten zijn meritocratieën. Bijdragen kunnen alleen worden gedaan door individuen die zichzelf vertegenwoordigen, niet door een bedrijf. Liberale bijdrage ( Liberal contribution ): Volgens een liberaal contributiemodel worden de mensen die het meeste werk doen als meest invloedrijk erkend, maar dit is gebaseerd op huidig werk en niet op historische bijdragen. Beslissingen voor grote projecten worden genomen op basis van een proces van consensus zoeken (bespreek belangrijke grieven) in plaats van pure stemming, en het streven is om zoveel mogelijk gemeenschapsperspectieven op te nemen. Populaire voorbeelden van projecten die een liberaal contributiemodel gebruiken, zijn onder meer [Node.js] (https://foundation.nodejs.org/) en [Rust] (https://www.rust-lang.org/). Welke moet je gebruiken? Het is aan jou! Elk model heeft voordelen en afwegingen. En hoewel ze in eerste instantie misschien heel anders lijken, hebben alle drie de modellen meer gemeen dan ze lijken. Bekijk deze sjablonen als u geïnteresseerd bent in het adopteren van een van deze modellen: BDFL-modelsjabloon Modelmodel voor meritocratie Node.js’s liberale bijdragebeleid Heb ik beheersdocumenten nodig wanneer ik mijn project start? Er is geen goed moment om de governance van uw project op te schrijven, maar het is veel gemakkelijker te definiëren als u eenmaal de dynamiek van uw gemeenschap heeft gezien. Het beste (en moeilijkste) deel van open source governance is dat het wordt gevormd door de gemeenschap! Sommige vroege documentatie zal echter onvermijdelijk bijdragen aan het beheer van uw project, dus begin met opschrijven wat u kunt. U kunt bijvoorbeeld duidelijke verwachtingen voor gedrag definiëren, of hoe uw bijdragersproces werkt, zelfs bij de lancering van uw project. Als u deel uitmaakt van een bedrijf dat een open source-project lanceert, is het de moeite waard om vóór de lancering een interne discussie te hebben over hoe uw bedrijf verwacht te handhaven en beslissingen te nemen over het toekomstige project. Misschien wilt u ook in het openbaar uitleggen hoe uw bedrijf wel of niet bij het project betrokken zal zijn (of niet!). We wijzen kleine teams toe om projecten op GitHub te beheren die hier daadwerkelijk aan werken op Facebook. React wordt bijvoorbeeld gerund door een React-engineer. We assign small teams to manage projects on GitHub who are actually working on these at Facebook. For example, React is run by a React engineer. — @caabernathy, “Een kijkje in open source bij Facebook” Wat gebeurt er als bedrijfsmedewerkers bijdragen beginnen in te dienen? Succesvolle open source-projecten worden door veel mensen en bedrijven gebruikt, en sommige bedrijven kunnen uiteindelijk inkomstenstromen hebben die uiteindelijk aan het project zijn gekoppeld. Een bedrijf kan bijvoorbeeld de projectcode gebruiken als een onderdeel van een commerciële dienstverlening. Naarmate het project op grotere schaal wordt gebruikt, wordt er meer vraag naar mensen die er expertise in hebben - misschien bent u een van hen! - en worden soms betaald voor het werk dat ze in het project doen. Het is belangrijk om commerciële activiteiten als normaal te behandelen en als een nieuwe bron van ontwikkelingsenergie. Betaalde ontwikkelaars mogen natuurlijk geen speciale behandeling krijgen ten opzichte van onbetaalde ontwikkelaars; elke bijdrage moet op zijn technische merites worden beoordeeld. Mensen moeten zich echter op hun gemak voelen bij commerciële activiteiten en zich op hun gemak voelen bij het vermelden van hun gebruiksscenario’s wanneer ze pleiten voor een bepaalde verbetering of functie. “Commercial” is volledig compatibel met “open source”. “Commercieel” betekent gewoon dat er ergens geld mee gemoeid is - dat de software wordt gebruikt in de handel, wat steeds waarschijnlijker wordt naarmate een project wordt geaccepteerd. (Wanneer open source-software wordt gebruikt als onderdeel van een niet-open-sourceproduct, is het algehele product nog steeds “eigen” software, hoewel het, net als open source, voor commerciële of niet-commerciële doeleinden kan worden gebruikt.) Net als ieder ander krijgen commercieel gemotiveerde ontwikkelaars invloed in het project door de kwaliteit en kwantiteit van hun bijdragen. Het is duidelijk dat een ontwikkelaar die voor haar tijd wordt betaald, meer kan dan iemand die niet wordt betaald, maar dat is oké: betaling is slechts een van de vele mogelijke factoren die van invloed kunnen zijn op hoeveel iemand doet. Houd uw projectdiscussies gericht op de bijdragen, niet op de externe factoren waardoor mensen die bijdragen kunnen leveren. Heb ik een juridische entiteit nodig om mijn project te ondersteunen? U hebt geen juridische entiteit nodig om uw open source-project te ondersteunen, tenzij u met geld omgaat. Als u bijvoorbeeld een commercieel bedrijf wilt opzetten, wilt u een C Corp of LLC opzetten (als u in de VS bent gevestigd). Als u alleen contractwerk doet in verband met uw open source-project, kunt u geld accepteren als een eenmanszaak of een LLC opzetten (als u in de VS bent gevestigd). Als u donaties voor uw open source-project wilt accepteren, kunt u een donatieknop instellen (bijvoorbeeld met PayPal of Stripe), maar het geld is niet aftrekbaar voor de belasting, tenzij u een in aanmerking komende non-profitorganisatie bent (een 501c3, als je bent in de VS). Veel projecten willen niet de moeite nemen om een non-profitorganisatie op te zetten, dus zoeken ze in plaats daarvan een fiscale sponsor zonder winstoogmerk. Een fiscale sponsor accepteert namens u schenkingen, meestal in ruil voor een percentage van de schenking. Software Freedom Conservancy , Apache Foundation , Eclipse Foundation , Linux Foundation en Open Collective zijn voorbeelden van organisaties die als fiscale sponsors dienen voor open source-projecten. Our goal is to provide an infrastructure that communities can use to be self sustainable, thus creating an environment where everyone — contributors, backers, sponsors — get concrete benefits out of it. Our goal is to provide an infrastructure that communities can use to be self sustainable, thus creating an environment where everyone — contributors, backers, sponsors — get concrete benefits out of it. — @piamancini, “Verder gaan dan het liefdadigheidskader” Als uw project nauw verbonden is met een bepaalde taal of een bepaald ecosysteem, kan er ook een gerelateerde softwarefundament zijn waarmee u kunt werken. De Python Software Foundation helpt bijvoorbeeld bij het ondersteunen van PyPI , de Python-pakketbeheerder en de Node.js Foundation helpt bij het ondersteunen van Express.js , een op knooppunten gebaseerd raamwerk. Terug naar het overzicht Gerelateerde gidsen Tips voor een open source-beheerder Uw leven gemakkelijker maken als open source-beheerder, van het documenteren van processen tot het benutten van uw gemeenschap. Open source-statistieken Neem weloverwogen beslissingen om uw open source-project te laten gedijen door het succes ervan te meten en bij te houden. Scroll to Top Bijdragen Wilt u een suggestie doen? Deze inhoud is open source. Help ons het te verbeteren. Bijdragen Blijf op de hoogte Wees de eerste die hoort over de nieuwste open source-tips en middellen van GitHub. Email adres fine print met van en vrienden | 2026-01-13T09:29:14 |
https://doc.rust-lang.org/std/iter/trait.Iterator.html#method.unzip | Iterator in std::iter - Rust This old browser is unsupported and will most likely display funky things. Iterator std 1.92.0 (ded5c06cf 2025-12-08) Iterator Required Associated Types Item Required Methods next Provided Methods advance_by all any array_chunks by_ref chain cloned cmp cmp_by collect collect_into copied count cycle enumerate eq eq_by filter filter_map find find_map flat_map flatten fold for_each fuse ge gt inspect intersperse intersperse_with is_partitioned is_sorted is_sorted_by is_sorted_by_key last le lt map map_while map_windows max max_by max_by_key min min_by min_by_key ne next_chunk nth partial_cmp partial_cmp_by partition partition_in_place peekable position product reduce rev rposition scan size_hint skip skip_while step_by sum take take_while try_collect try_find try_fold try_for_each try_reduce unzip zip Implementors In std:: iter std :: iter Trait Iterator Copy item path 1.0.0 · Source pub trait Iterator { type Item ; Show 76 methods // Required method fn next (&mut self) -> Option <Self:: Item >; // Provided methods fn next_chunk <const N: usize >( &mut self, ) -> Result <[Self:: Item ; N ], IntoIter <Self:: Item , N>> where Self: Sized { ... } fn size_hint (&self) -> ( usize , Option < usize >) { ... } fn count (self) -> usize where Self: Sized { ... } fn last (self) -> Option <Self:: Item > where Self: Sized { ... } fn advance_by (&mut self, n: usize ) -> Result < () , NonZero < usize >> { ... } fn nth (&mut self, n: usize ) -> Option <Self:: Item > { ... } fn step_by (self, step: usize ) -> StepBy <Self> ⓘ where Self: Sized { ... } fn chain <U>(self, other: U) -> Chain <Self, <U as IntoIterator >:: IntoIter > ⓘ where Self: Sized , U: IntoIterator <Item = Self:: Item > { ... } fn zip <U>(self, other: U) -> Zip <Self, <U as IntoIterator >:: IntoIter > ⓘ where Self: Sized , U: IntoIterator { ... } fn intersperse (self, separator: Self:: Item ) -> Intersperse <Self> ⓘ where Self: Sized , Self:: Item : Clone { ... } fn intersperse_with <G>(self, separator: G) -> IntersperseWith <Self, G> ⓘ where Self: Sized , G: FnMut () -> Self:: Item { ... } fn map <B, F>(self, f: F) -> Map <Self, F> ⓘ where Self: Sized , F: FnMut (Self:: Item ) -> B { ... } fn for_each <F>(self, f: F) where Self: Sized , F: FnMut (Self:: Item ) { ... } fn filter <P>(self, predicate: P) -> Filter <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool { ... } fn filter_map <B, F>(self, f: F) -> FilterMap <Self, F> ⓘ where Self: Sized , F: FnMut (Self:: Item ) -> Option <B> { ... } fn enumerate (self) -> Enumerate <Self> ⓘ where Self: Sized { ... } fn peekable (self) -> Peekable <Self> ⓘ where Self: Sized { ... } fn skip_while <P>(self, predicate: P) -> SkipWhile <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool { ... } fn take_while <P>(self, predicate: P) -> TakeWhile <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool { ... } fn map_while <B, P>(self, predicate: P) -> MapWhile <Self, P> ⓘ where Self: Sized , P: FnMut (Self:: Item ) -> Option <B> { ... } fn skip (self, n: usize ) -> Skip <Self> ⓘ where Self: Sized { ... } fn take (self, n: usize ) -> Take <Self> ⓘ where Self: Sized { ... } fn scan <St, B, F>(self, initial_state: St, f: F) -> Scan <Self, St, F> ⓘ where Self: Sized , F: FnMut ( &mut St , Self:: Item ) -> Option <B> { ... } fn flat_map <U, F>(self, f: F) -> FlatMap <Self, U, F> ⓘ where Self: Sized , U: IntoIterator , F: FnMut (Self:: Item ) -> U { ... } fn flatten (self) -> Flatten <Self> ⓘ where Self: Sized , Self:: Item : IntoIterator { ... } fn map_windows <F, R, const N: usize >(self, f: F) -> MapWindows <Self, F, N> ⓘ where Self: Sized , F: FnMut (&[Self:: Item ; N ]) -> R { ... } fn fuse (self) -> Fuse <Self> ⓘ where Self: Sized { ... } fn inspect <F>(self, f: F) -> Inspect <Self, F> ⓘ where Self: Sized , F: FnMut (&Self:: Item ) { ... } fn by_ref (&mut self) -> &mut Self where Self: Sized { ... } fn collect <B>(self) -> B where B: FromIterator <Self:: Item >, Self: Sized { ... } fn try_collect <B>( &mut self, ) -> <<Self:: Item as Try >:: Residual as Residual <B>>:: TryType where Self: Sized , Self:: Item : Try , <Self:: Item as Try >:: Residual : Residual <B>, B: FromIterator <<Self:: Item as Try >:: Output > { ... } fn collect_into <E>(self, collection: &mut E ) -> &mut E where E: Extend <Self:: Item >, Self: Sized { ... } fn partition <B, F>(self, f: F) -> (B, B) where Self: Sized , B: Default + Extend <Self:: Item >, F: FnMut (&Self:: Item ) -> bool { ... } fn partition_in_place <'a, T, P>(self, predicate: P) -> usize where T: 'a, Self: Sized + DoubleEndedIterator <Item = &'a mut T >, P: FnMut ( &T ) -> bool { ... } fn is_partitioned <P>(self, predicate: P) -> bool where Self: Sized , P: FnMut (Self:: Item ) -> bool { ... } fn try_fold <B, F, R>(&mut self, init: B, f: F) -> R where Self: Sized , F: FnMut (B, Self:: Item ) -> R, R: Try <Output = B> { ... } fn try_for_each <F, R>(&mut self, f: F) -> R where Self: Sized , F: FnMut (Self:: Item ) -> R, R: Try <Output = () > { ... } fn fold <B, F>(self, init: B, f: F) -> B where Self: Sized , F: FnMut (B, Self:: Item ) -> B { ... } fn reduce <F>(self, f: F) -> Option <Self:: Item > where Self: Sized , F: FnMut (Self:: Item , Self:: Item ) -> Self:: Item { ... } fn try_reduce <R>( &mut self, f: impl FnMut (Self:: Item , Self:: Item ) -> R, ) -> <<R as Try >:: Residual as Residual < Option <<R as Try >:: Output >>>:: TryType where Self: Sized , R: Try <Output = Self:: Item >, <R as Try >:: Residual : Residual < Option <Self:: Item >> { ... } fn all <F>(&mut self, f: F) -> bool where Self: Sized , F: FnMut (Self:: Item ) -> bool { ... } fn any <F>(&mut self, f: F) -> bool where Self: Sized , F: FnMut (Self:: Item ) -> bool { ... } fn find <P>(&mut self, predicate: P) -> Option <Self:: Item > where Self: Sized , P: FnMut (&Self:: Item ) -> bool { ... } fn find_map <B, F>(&mut self, f: F) -> Option <B> where Self: Sized , F: FnMut (Self:: Item ) -> Option <B> { ... } fn try_find <R>( &mut self, f: impl FnMut (&Self:: Item ) -> R, ) -> <<R as Try >:: Residual as Residual < Option <Self:: Item >>>:: TryType where Self: Sized , R: Try <Output = bool >, <R as Try >:: Residual : Residual < Option <Self:: Item >> { ... } fn position <P>(&mut self, predicate: P) -> Option < usize > where Self: Sized , P: FnMut (Self:: Item ) -> bool { ... } fn rposition <P>(&mut self, predicate: P) -> Option < usize > where P: FnMut (Self:: Item ) -> bool , Self: Sized + ExactSizeIterator + DoubleEndedIterator { ... } fn max (self) -> Option <Self:: Item > where Self: Sized , Self:: Item : Ord { ... } fn min (self) -> Option <Self:: Item > where Self: Sized , Self:: Item : Ord { ... } fn max_by_key <B, F>(self, f: F) -> Option <Self:: Item > where B: Ord , Self: Sized , F: FnMut (&Self:: Item ) -> B { ... } fn max_by <F>(self, compare: F) -> Option <Self:: Item > where Self: Sized , F: FnMut (&Self:: Item , &Self:: Item ) -> Ordering { ... } fn min_by_key <B, F>(self, f: F) -> Option <Self:: Item > where B: Ord , Self: Sized , F: FnMut (&Self:: Item ) -> B { ... } fn min_by <F>(self, compare: F) -> Option <Self:: Item > where Self: Sized , F: FnMut (&Self:: Item , &Self:: Item ) -> Ordering { ... } fn rev (self) -> Rev <Self> ⓘ where Self: Sized + DoubleEndedIterator { ... } fn unzip <A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend <A>, FromB: Default + Extend <B>, Self: Sized + Iterator <Item = (A, B) > { ... } fn copied <'a, T>(self) -> Copied <Self> ⓘ where T: Copy + 'a, Self: Sized + Iterator <Item = &'a T > { ... } fn cloned <'a, T>(self) -> Cloned <Self> ⓘ where T: Clone + 'a, Self: Sized + Iterator <Item = &'a T > { ... } fn cycle (self) -> Cycle <Self> ⓘ where Self: Sized + Clone { ... } fn array_chunks <const N: usize >(self) -> ArrayChunks <Self, N> ⓘ where Self: Sized { ... } fn sum <S>(self) -> S where Self: Sized , S: Sum <Self:: Item > { ... } fn product <P>(self) -> P where Self: Sized , P: Product <Self:: Item > { ... } fn cmp <I>(self, other: I) -> Ordering where I: IntoIterator <Item = Self:: Item >, Self:: Item : Ord , Self: Sized { ... } fn cmp_by <I, F>(self, other: I, cmp: F) -> Ordering where Self: Sized , I: IntoIterator , F: FnMut (Self:: Item , <I as IntoIterator >:: Item ) -> Ordering { ... } fn partial_cmp <I>(self, other: I) -> Option < Ordering > where I: IntoIterator , Self:: Item : PartialOrd <<I as IntoIterator >:: Item >, Self: Sized { ... } fn partial_cmp_by <I, F>(self, other: I, partial_cmp: F) -> Option < Ordering > where Self: Sized , I: IntoIterator , F: FnMut (Self:: Item , <I as IntoIterator >:: Item ) -> Option < Ordering > { ... } fn eq <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialEq <<I as IntoIterator >:: Item >, Self: Sized { ... } fn eq_by <I, F>(self, other: I, eq: F) -> bool where Self: Sized , I: IntoIterator , F: FnMut (Self:: Item , <I as IntoIterator >:: Item ) -> bool { ... } fn ne <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialEq <<I as IntoIterator >:: Item >, Self: Sized { ... } fn lt <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialOrd <<I as IntoIterator >:: Item >, Self: Sized { ... } fn le <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialOrd <<I as IntoIterator >:: Item >, Self: Sized { ... } fn gt <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialOrd <<I as IntoIterator >:: Item >, Self: Sized { ... } fn ge <I>(self, other: I) -> bool where I: IntoIterator , Self:: Item : PartialOrd <<I as IntoIterator >:: Item >, Self: Sized { ... } fn is_sorted (self) -> bool where Self: Sized , Self:: Item : PartialOrd { ... } fn is_sorted_by <F>(self, compare: F) -> bool where Self: Sized , F: FnMut (&Self:: Item , &Self:: Item ) -> bool { ... } fn is_sorted_by_key <F, K>(self, f: F) -> bool where Self: Sized , F: FnMut (Self:: Item ) -> K, K: PartialOrd { ... } } Expand description A trait for dealing with iterators. This is the main iterator trait. For more about the concept of iterators generally, please see the module-level documentation . In particular, you may want to know how to implement Iterator . Required Associated Types § 1.0.0 · Source type Item The type of the elements being iterated over. Required Methods § 1.0.0 · Source fn next (&mut self) -> Option <Self:: Item > Advances the iterator and returns the next value. Returns None when iteration is finished. Individual iterator implementations may choose to resume iteration, and so calling next() again may or may not eventually start returning Some(Item) again at some point. § Examples let a = [ 1 , 2 , 3 ]; let mut iter = a.into_iter(); // A call to next() returns the next value... assert_eq! ( Some ( 1 ), iter.next()); assert_eq! ( Some ( 2 ), iter.next()); assert_eq! ( Some ( 3 ), iter.next()); // ... and then None once it's over. assert_eq! ( None , iter.next()); // More calls may or may not return `None`. Here, they always will. assert_eq! ( None , iter.next()); assert_eq! ( None , iter.next()); Provided Methods § Source fn next_chunk <const N: usize >( &mut self, ) -> Result <[Self:: Item ; N ], IntoIter <Self:: Item , N>> where Self: Sized , 🔬 This is a nightly-only experimental API. ( iter_next_chunk #98326 ) Advances the iterator and returns an array containing the next N values. If there are not enough elements to fill the array then Err is returned containing an iterator over the remaining elements. § Examples Basic usage: #![feature(iter_next_chunk)] let mut iter = "lorem" .chars(); assert_eq! (iter.next_chunk().unwrap(), [ 'l' , 'o' ]); // N is inferred as 2 assert_eq! (iter.next_chunk().unwrap(), [ 'r' , 'e' , 'm' ]); // N is inferred as 3 assert_eq! (iter.next_chunk::< 4 >().unwrap_err().as_slice(), & []); // N is explicitly 4 Split a string and get the first three items. #![feature(iter_next_chunk)] let quote = "not all those who wander are lost" ; let [first, second, third] = quote.split_whitespace().next_chunk().unwrap(); assert_eq! (first, "not" ); assert_eq! (second, "all" ); assert_eq! (third, "those" ); 1.0.0 · Source fn size_hint (&self) -> ( usize , Option < usize >) Returns the bounds on the remaining length of the iterator. Specifically, size_hint() returns a tuple where the first element is the lower bound, and the second element is the upper bound. The second half of the tuple that is returned is an Option < usize > . A None here means that either there is no known upper bound, or the upper bound is larger than usize . § Implementation notes It is not enforced that an iterator implementation yields the declared number of elements. A buggy iterator may yield less than the lower bound or more than the upper bound of elements. size_hint() is primarily intended to be used for optimizations such as reserving space for the elements of the iterator, but must not be trusted to e.g., omit bounds checks in unsafe code. An incorrect implementation of size_hint() should not lead to memory safety violations. That said, the implementation should provide a correct estimation, because otherwise it would be a violation of the trait’s protocol. The default implementation returns (0, None ) which is correct for any iterator. § Examples Basic usage: let a = [ 1 , 2 , 3 ]; let mut iter = a.iter(); assert_eq! (( 3 , Some ( 3 )), iter.size_hint()); let _ = iter.next(); assert_eq! (( 2 , Some ( 2 )), iter.size_hint()); A more complex example: // The even numbers in the range of zero to nine. let iter = ( 0 .. 10 ).filter(|x| x % 2 == 0 ); // We might iterate from zero to ten times. Knowing that it's five // exactly wouldn't be possible without executing filter(). assert_eq! (( 0 , Some ( 10 )), iter.size_hint()); // Let's add five more numbers with chain() let iter = ( 0 .. 10 ).filter(|x| x % 2 == 0 ).chain( 15 .. 20 ); // now both bounds are increased by five assert_eq! (( 5 , Some ( 15 )), iter.size_hint()); Returning None for an upper bound: // an infinite iterator has no upper bound // and the maximum possible lower bound let iter = 0 ..; assert_eq! ((usize::MAX, None ), iter.size_hint()); 1.0.0 · Source fn count (self) -> usize where Self: Sized , Consumes the iterator, counting the number of iterations and returning it. This method will call next repeatedly until None is encountered, returning the number of times it saw Some . Note that next has to be called at least once even if the iterator does not have any elements. § Overflow Behavior The method does no guarding against overflows, so counting elements of an iterator with more than usize::MAX elements either produces the wrong result or panics. If overflow checks are enabled, a panic is guaranteed. § Panics This function might panic if the iterator has more than usize::MAX elements. § Examples let a = [ 1 , 2 , 3 ]; assert_eq! (a.iter().count(), 3 ); let a = [ 1 , 2 , 3 , 4 , 5 ]; assert_eq! (a.iter().count(), 5 ); 1.0.0 · Source fn last (self) -> Option <Self:: Item > where Self: Sized , Consumes the iterator, returning the last element. This method will evaluate the iterator until it returns None . While doing so, it keeps track of the current element. After None is returned, last() will then return the last element it saw. § Examples let a = [ 1 , 2 , 3 ]; assert_eq! (a.into_iter().last(), Some ( 3 )); let a = [ 1 , 2 , 3 , 4 , 5 ]; assert_eq! (a.into_iter().last(), Some ( 5 )); Source fn advance_by (&mut self, n: usize ) -> Result < () , NonZero < usize >> 🔬 This is a nightly-only experimental API. ( iter_advance_by #77404 ) Advances the iterator by n elements. This method will eagerly skip n elements by calling next up to n times until None is encountered. advance_by(n) will return Ok(()) if the iterator successfully advances by n elements, or a Err(NonZero<usize>) with value k if None is encountered, where k is remaining number of steps that could not be advanced because the iterator ran out. If self is empty and n is non-zero, then this returns Err(n) . Otherwise, k is always less than n . Calling advance_by(0) can do meaningful work, for example Flatten can advance its outer iterator until it finds an inner iterator that is not empty, which then often allows it to return a more accurate size_hint() than in its initial state. § Examples #![feature(iter_advance_by)] use std::num::NonZero; let a = [ 1 , 2 , 3 , 4 ]; let mut iter = a.into_iter(); assert_eq! (iter.advance_by( 2 ), Ok (())); assert_eq! (iter.next(), Some ( 3 )); assert_eq! (iter.advance_by( 0 ), Ok (())); assert_eq! (iter.advance_by( 100 ), Err (NonZero::new( 99 ).unwrap())); // only `4` was skipped 1.0.0 · Source fn nth (&mut self, n: usize ) -> Option <Self:: Item > Returns the n th element of the iterator. Like most indexing operations, the count starts from zero, so nth(0) returns the first value, nth(1) the second, and so on. Note that all preceding elements, as well as the returned element, will be consumed from the iterator. That means that the preceding elements will be discarded, and also that calling nth(0) multiple times on the same iterator will return different elements. nth() will return None if n is greater than or equal to the length of the iterator. § Examples Basic usage: let a = [ 1 , 2 , 3 ]; assert_eq! (a.into_iter().nth( 1 ), Some ( 2 )); Calling nth() multiple times doesn’t rewind the iterator: let a = [ 1 , 2 , 3 ]; let mut iter = a.into_iter(); assert_eq! (iter.nth( 1 ), Some ( 2 )); assert_eq! (iter.nth( 1 ), None ); Returning None if there are less than n + 1 elements: let a = [ 1 , 2 , 3 ]; assert_eq! (a.into_iter().nth( 10 ), None ); 1.28.0 · Source fn step_by (self, step: usize ) -> StepBy <Self> ⓘ where Self: Sized , Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Note 1: The first element of the iterator will always be returned, regardless of the step given. Note 2: The time at which ignored elements are pulled is not fixed. StepBy behaves like the sequence self.next() , self.nth(step-1) , self.nth(step-1) , …, but is also free to behave like the sequence advance_n_and_return_first(&mut self, step) , advance_n_and_return_first(&mut self, step) , … Which way is used may change for some iterators for performance reasons. The second way will advance the iterator earlier and may consume more items. advance_n_and_return_first is the equivalent of: fn advance_n_and_return_first<I>(iter: &mut I, n: usize) -> Option <I::Item> where I: Iterator, { let next = iter.next(); if n > 1 { iter.nth(n - 2 ); } next } § Panics The method will panic if the given step is 0 . § Examples let a = [ 0 , 1 , 2 , 3 , 4 , 5 ]; let mut iter = a.into_iter().step_by( 2 ); assert_eq! (iter.next(), Some ( 0 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), Some ( 4 )); assert_eq! (iter.next(), None ); 1.0.0 · Source fn chain <U>(self, other: U) -> Chain <Self, <U as IntoIterator >:: IntoIter > ⓘ where Self: Sized , U: IntoIterator <Item = Self:: Item >, Takes two iterators and creates a new iterator over both in sequence. chain() will return a new iterator which will first iterate over values from the first iterator and then over values from the second iterator. In other words, it links two iterators together, in a chain. 🔗 once is commonly used to adapt a single value into a chain of other kinds of iteration. § Examples Basic usage: let s1 = "abc" .chars(); let s2 = "def" .chars(); let mut iter = s1.chain(s2); assert_eq! (iter.next(), Some ( 'a' )); assert_eq! (iter.next(), Some ( 'b' )); assert_eq! (iter.next(), Some ( 'c' )); assert_eq! (iter.next(), Some ( 'd' )); assert_eq! (iter.next(), Some ( 'e' )); assert_eq! (iter.next(), Some ( 'f' )); assert_eq! (iter.next(), None ); Since the argument to chain() uses IntoIterator , we can pass anything that can be converted into an Iterator , not just an Iterator itself. For example, arrays ( [T] ) implement IntoIterator , and so can be passed to chain() directly: let a1 = [ 1 , 2 , 3 ]; let a2 = [ 4 , 5 , 6 ]; let mut iter = a1.into_iter().chain(a2); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), Some ( 3 )); assert_eq! (iter.next(), Some ( 4 )); assert_eq! (iter.next(), Some ( 5 )); assert_eq! (iter.next(), Some ( 6 )); assert_eq! (iter.next(), None ); If you work with Windows API, you may wish to convert OsStr to Vec<u16> : #[cfg(windows)] fn os_str_to_utf16(s: & std::ffi::OsStr) -> Vec<u16> { use std::os::windows::ffi::OsStrExt; s.encode_wide().chain(std::iter::once( 0 )).collect() } 1.0.0 · Source fn zip <U>(self, other: U) -> Zip <Self, <U as IntoIterator >:: IntoIter > ⓘ where Self: Sized , U: IntoIterator , ‘Zips up’ two iterators into a single iterator of pairs. zip() returns a new iterator that will iterate over two other iterators, returning a tuple where the first element comes from the first iterator, and the second element comes from the second iterator. In other words, it zips two iterators together, into a single one. If either iterator returns None , next from the zipped iterator will return None . If the zipped iterator has no more elements to return then each further attempt to advance it will first try to advance the first iterator at most one time and if it still yielded an item try to advance the second iterator at most one time. To ‘undo’ the result of zipping up two iterators, see unzip . § Examples Basic usage: let s1 = "abc" .chars(); let s2 = "def" .chars(); let mut iter = s1.zip(s2); assert_eq! (iter.next(), Some (( 'a' , 'd' ))); assert_eq! (iter.next(), Some (( 'b' , 'e' ))); assert_eq! (iter.next(), Some (( 'c' , 'f' ))); assert_eq! (iter.next(), None ); Since the argument to zip() uses IntoIterator , we can pass anything that can be converted into an Iterator , not just an Iterator itself. For example, arrays ( [T] ) implement IntoIterator , and so can be passed to zip() directly: let a1 = [ 1 , 2 , 3 ]; let a2 = [ 4 , 5 , 6 ]; let mut iter = a1.into_iter().zip(a2); assert_eq! (iter.next(), Some (( 1 , 4 ))); assert_eq! (iter.next(), Some (( 2 , 5 ))); assert_eq! (iter.next(), Some (( 3 , 6 ))); assert_eq! (iter.next(), None ); zip() is often used to zip an infinite iterator to a finite one. This works because the finite iterator will eventually return None , ending the zipper. Zipping with (0..) can look a lot like enumerate : let enumerate: Vec< _ > = "foo" .chars().enumerate().collect(); let zipper: Vec< _ > = ( 0 ..).zip( "foo" .chars()).collect(); assert_eq! (( 0 , 'f' ), enumerate[ 0 ]); assert_eq! (( 0 , 'f' ), zipper[ 0 ]); assert_eq! (( 1 , 'o' ), enumerate[ 1 ]); assert_eq! (( 1 , 'o' ), zipper[ 1 ]); assert_eq! (( 2 , 'o' ), enumerate[ 2 ]); assert_eq! (( 2 , 'o' ), zipper[ 2 ]); If both iterators have roughly equivalent syntax, it may be more readable to use zip : use std::iter::zip; let a = [ 1 , 2 , 3 ]; let b = [ 2 , 3 , 4 ]; let mut zipped = zip( a.into_iter().map(|x| x * 2 ).skip( 1 ), b.into_iter().map(|x| x * 2 ).skip( 1 ), ); assert_eq! (zipped.next(), Some (( 4 , 6 ))); assert_eq! (zipped.next(), Some (( 6 , 8 ))); assert_eq! (zipped.next(), None ); compared to: let mut zipped = a .into_iter() .map(|x| x * 2 ) .skip( 1 ) .zip(b.into_iter().map(|x| x * 2 ).skip( 1 )); Source fn intersperse (self, separator: Self:: Item ) -> Intersperse <Self> ⓘ where Self: Sized , Self:: Item : Clone , 🔬 This is a nightly-only experimental API. ( iter_intersperse #79524 ) Creates a new iterator which places a copy of separator between adjacent items of the original iterator. In case separator does not implement Clone or needs to be computed every time, use intersperse_with . § Examples Basic usage: #![feature(iter_intersperse)] let mut a = [ 0 , 1 , 2 ].into_iter().intersperse( 100 ); assert_eq! (a.next(), Some ( 0 )); // The first element from `a`. assert_eq! (a.next(), Some ( 100 )); // The separator. assert_eq! (a.next(), Some ( 1 )); // The next element from `a`. assert_eq! (a.next(), Some ( 100 )); // The separator. assert_eq! (a.next(), Some ( 2 )); // The last element from `a`. assert_eq! (a.next(), None ); // The iterator is finished. intersperse can be very useful to join an iterator’s items using a common element: #![feature(iter_intersperse)] let words = [ "Hello" , "World" , "!" ]; let hello: String = words.into_iter().intersperse( " " ).collect(); assert_eq! (hello, "Hello World !" ); Source fn intersperse_with <G>(self, separator: G) -> IntersperseWith <Self, G> ⓘ where Self: Sized , G: FnMut () -> Self:: Item , 🔬 This is a nightly-only experimental API. ( iter_intersperse #79524 ) Creates a new iterator which places an item generated by separator between adjacent items of the original iterator. The closure will be called exactly once each time an item is placed between two adjacent items from the underlying iterator; specifically, the closure is not called if the underlying iterator yields less than two items and after the last item is yielded. If the iterator’s item implements Clone , it may be easier to use intersperse . § Examples Basic usage: #![feature(iter_intersperse)] #[derive(PartialEq, Debug)] struct NotClone(usize); let v = [NotClone( 0 ), NotClone( 1 ), NotClone( 2 )]; let mut it = v.into_iter().intersperse_with(|| NotClone( 99 )); assert_eq! (it.next(), Some (NotClone( 0 ))); // The first element from `v`. assert_eq! (it.next(), Some (NotClone( 99 ))); // The separator. assert_eq! (it.next(), Some (NotClone( 1 ))); // The next element from `v`. assert_eq! (it.next(), Some (NotClone( 99 ))); // The separator. assert_eq! (it.next(), Some (NotClone( 2 ))); // The last element from `v`. assert_eq! (it.next(), None ); // The iterator is finished. intersperse_with can be used in situations where the separator needs to be computed: #![feature(iter_intersperse)] let src = [ "Hello" , "to" , "all" , "people" , "!!" ].iter().copied(); // The closure mutably borrows its context to generate an item. let mut happy_emojis = [ " ❤️ " , " 😀 " ].into_iter(); let separator = || happy_emojis.next().unwrap_or( " 🦀 " ); let result = src.intersperse_with(separator).collect::<String>(); assert_eq! (result, "Hello ❤️ to 😀 all 🦀 people 🦀 !!" ); 1.0.0 · Source fn map <B, F>(self, f: F) -> Map <Self, F> ⓘ where Self: Sized , F: FnMut (Self:: Item ) -> B, Takes a closure and creates an iterator which calls that closure on each element. map() transforms one iterator into another, by means of its argument: something that implements FnMut . It produces a new iterator which calls this closure on each element of the original iterator. If you are good at thinking in types, you can think of map() like this: If you have an iterator that gives you elements of some type A , and you want an iterator of some other type B , you can use map() , passing a closure that takes an A and returns a B . map() is conceptually similar to a for loop. However, as map() is lazy, it is best used when you’re already working with other iterators. If you’re doing some sort of looping for a side effect, it’s considered more idiomatic to use for than map() . § Examples Basic usage: let a = [ 1 , 2 , 3 ]; let mut iter = a.iter().map(|x| 2 * x); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), Some ( 4 )); assert_eq! (iter.next(), Some ( 6 )); assert_eq! (iter.next(), None ); If you’re doing some sort of side effect, prefer for to map() : // don't do this: ( 0 .. 5 ).map(|x| println! ( "{x}" )); // it won't even execute, as it is lazy. Rust will warn you about this. // Instead, use a for-loop: for x in 0 .. 5 { println! ( "{x}" ); } 1.21.0 · Source fn for_each <F>(self, f: F) where Self: Sized , F: FnMut (Self:: Item ), Calls a closure on each element of an iterator. This is equivalent to using a for loop on the iterator, although break and continue are not possible from a closure. It’s generally more idiomatic to use a for loop, but for_each may be more legible when processing items at the end of longer iterator chains. In some cases for_each may also be faster than a loop, because it will use internal iteration on adapters like Chain . § Examples Basic usage: use std::sync::mpsc::channel; let (tx, rx) = channel(); ( 0 .. 5 ).map(|x| x * 2 + 1 ) .for_each( move |x| tx.send(x).unwrap()); let v: Vec< _ > = rx.iter().collect(); assert_eq! (v, vec! [ 1 , 3 , 5 , 7 , 9 ]); For such a small example, a for loop may be cleaner, but for_each might be preferable to keep a functional style with longer iterators: ( 0 .. 5 ).flat_map(|x| (x * 100 )..(x * 110 )) .enumerate() .filter(| & (i, x)| (i + x) % 3 == 0 ) .for_each(|(i, x)| println! ( "{i}:{x}" )); 1.0.0 · Source fn filter <P>(self, predicate: P) -> Filter <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool , Creates an iterator which uses a closure to determine if an element should be yielded. Given an element the closure must return true or false . The returned iterator will yield only the elements for which the closure returns true . § Examples Basic usage: let a = [ 0i32 , 1 , 2 ]; let mut iter = a.into_iter().filter(|x| x.is_positive()); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), None ); Because the closure passed to filter() takes a reference, and many iterators iterate over references, this leads to a possibly confusing situation, where the type of the closure is a double reference: let s = & [ 0 , 1 , 2 ]; let mut iter = s.iter().filter(|x| ** x > 1 ); // needs two *s! assert_eq! (iter.next(), Some ( & 2 )); assert_eq! (iter.next(), None ); It’s common to instead use destructuring on the argument to strip away one: let s = & [ 0 , 1 , 2 ]; let mut iter = s.iter().filter(| & x| * x > 1 ); // both & and * assert_eq! (iter.next(), Some ( & 2 )); assert_eq! (iter.next(), None ); or both: let s = & [ 0 , 1 , 2 ]; let mut iter = s.iter().filter(|&&x| x > 1 ); // two &s assert_eq! (iter.next(), Some ( & 2 )); assert_eq! (iter.next(), None ); of these layers. Note that iter.filter(f).next() is equivalent to iter.find(f) . 1.0.0 · Source fn filter_map <B, F>(self, f: F) -> FilterMap <Self, F> ⓘ where Self: Sized , F: FnMut (Self:: Item ) -> Option <B>, Creates an iterator that both filters and maps. The returned iterator yields only the value s for which the supplied closure returns Some(value) . filter_map can be used to make chains of filter and map more concise. The example below shows how a map().filter().map() can be shortened to a single call to filter_map . § Examples Basic usage: let a = [ "1" , "two" , "NaN" , "four" , "5" ]; let mut iter = a.iter().filter_map(|s| s.parse().ok()); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 5 )); assert_eq! (iter.next(), None ); Here’s the same example, but with filter and map : let a = [ "1" , "two" , "NaN" , "four" , "5" ]; let mut iter = a.iter().map(|s| s.parse()).filter(|s| s.is_ok()).map(|s| s.unwrap()); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 5 )); assert_eq! (iter.next(), None ); 1.0.0 · Source fn enumerate (self) -> Enumerate <Self> ⓘ where Self: Sized , Creates an iterator which gives the current iteration count as well as the next value. The iterator returned yields pairs (i, val) , where i is the current index of iteration and val is the value returned by the iterator. enumerate() keeps its count as a usize . If you want to count by a different sized integer, the zip function provides similar functionality. § Overflow Behavior The method does no guarding against overflows, so enumerating more than usize::MAX elements either produces the wrong result or panics. If overflow checks are enabled, a panic is guaranteed. § Panics The returned iterator might panic if the to-be-returned index would overflow a usize . § Examples let a = [ 'a' , 'b' , 'c' ]; let mut iter = a.into_iter().enumerate(); assert_eq! (iter.next(), Some (( 0 , 'a' ))); assert_eq! (iter.next(), Some (( 1 , 'b' ))); assert_eq! (iter.next(), Some (( 2 , 'c' ))); assert_eq! (iter.next(), None ); 1.0.0 · Source fn peekable (self) -> Peekable <Self> ⓘ where Self: Sized , Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information. Note that the underlying iterator is still advanced when peek or peek_mut are called for the first time: In order to retrieve the next element, next is called on the underlying iterator, hence any side effects (i.e. anything other than fetching the next value) of the next method will occur. § Examples Basic usage: let xs = [ 1 , 2 , 3 ]; let mut iter = xs.into_iter().peekable(); // peek() lets us see into the future assert_eq! (iter.peek(), Some ( & 1 )); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); // we can peek() multiple times, the iterator won't advance assert_eq! (iter.peek(), Some ( & 3 )); assert_eq! (iter.peek(), Some ( & 3 )); assert_eq! (iter.next(), Some ( 3 )); // after the iterator is finished, so is peek() assert_eq! (iter.peek(), None ); assert_eq! (iter.next(), None ); Using peek_mut to mutate the next item without advancing the iterator: let xs = [ 1 , 2 , 3 ]; let mut iter = xs.into_iter().peekable(); // `peek_mut()` lets us see into the future assert_eq! (iter.peek_mut(), Some ( &mut 1 )); assert_eq! (iter.peek_mut(), Some ( &mut 1 )); assert_eq! (iter.next(), Some ( 1 )); if let Some (p) = iter.peek_mut() { assert_eq! ( * p, 2 ); // put a value into the iterator * p = 1000 ; } // The value reappears as the iterator continues assert_eq! (iter.collect::<Vec< _ >>(), vec! [ 1000 , 3 ]); 1.0.0 · Source fn skip_while <P>(self, predicate: P) -> SkipWhile <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool , Creates an iterator that skip s elements based on a predicate. skip_while() takes a closure as an argument. It will call this closure on each element of the iterator, and ignore elements until it returns false . After false is returned, skip_while() ’s job is over, and the rest of the elements are yielded. § Examples Basic usage: let a = [- 1i32 , 0 , 1 ]; let mut iter = a.into_iter().skip_while(|x| x.is_negative()); assert_eq! (iter.next(), Some ( 0 )); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), None ); Because the closure passed to skip_while() takes a reference, and many iterators iterate over references, this leads to a possibly confusing situation, where the type of the closure argument is a double reference: let s = & [- 1 , 0 , 1 ]; let mut iter = s.iter().skip_while(|x| ** x < 0 ); // need two *s! assert_eq! (iter.next(), Some ( & 0 )); assert_eq! (iter.next(), Some ( & 1 )); assert_eq! (iter.next(), None ); Stopping after an initial false : let a = [- 1 , 0 , 1 , - 2 ]; let mut iter = a.into_iter().skip_while(| & x| x < 0 ); assert_eq! (iter.next(), Some ( 0 )); assert_eq! (iter.next(), Some ( 1 )); // while this would have been false, since we already got a false, // skip_while() isn't used any more assert_eq! (iter.next(), Some (- 2 )); assert_eq! (iter.next(), None ); 1.0.0 · Source fn take_while <P>(self, predicate: P) -> TakeWhile <Self, P> ⓘ where Self: Sized , P: FnMut (&Self:: Item ) -> bool , Creates an iterator that yields elements based on a predicate. take_while() takes a closure as an argument. It will call this closure on each element of the iterator, and yield elements while it returns true . After false is returned, take_while() ’s job is over, and the rest of the elements are ignored. § Examples Basic usage: let a = [- 1i32 , 0 , 1 ]; let mut iter = a.into_iter().take_while(|x| x.is_negative()); assert_eq! (iter.next(), Some (- 1 )); assert_eq! (iter.next(), None ); Because the closure passed to take_while() takes a reference, and many iterators iterate over references, this leads to a possibly confusing situation, where the type of the closure is a double reference: let s = & [- 1 , 0 , 1 ]; let mut iter = s.iter().take_while(|x| ** x < 0 ); // need two *s! assert_eq! (iter.next(), Some ( & - 1 )); assert_eq! (iter.next(), None ); Stopping after an initial false : let a = [- 1 , 0 , 1 , - 2 ]; let mut iter = a.into_iter().take_while(| & x| x < 0 ); assert_eq! (iter.next(), Some (- 1 )); // We have more elements that are less than zero, but since we already // got a false, take_while() ignores the remaining elements. assert_eq! (iter.next(), None ); Because take_while() needs to look at the value in order to see if it should be included or not, consuming iterators will see that it is removed: let a = [ 1 , 2 , 3 , 4 ]; let mut iter = a.into_iter(); let result: Vec<i32> = iter.by_ref().take_while(| & n| n != 3 ).collect(); assert_eq! (result, [ 1 , 2 ]); let result: Vec<i32> = iter.collect(); assert_eq! (result, [ 4 ]); The 3 is no longer there, because it was consumed in order to see if the iteration should stop, but wasn’t placed back into the iterator. 1.57.0 · Source fn map_while <B, P>(self, predicate: P) -> MapWhile <Self, P> ⓘ where Self: Sized , P: FnMut (Self:: Item ) -> Option <B>, Creates an iterator that both yields elements based on a predicate and maps. map_while() takes a closure as an argument. It will call this closure on each element of the iterator, and yield elements while it returns Some(_) . § Examples Basic usage: let a = [- 1i32 , 4 , 0 , 1 ]; let mut iter = a.into_iter().map_while(|x| 16i32 .checked_div(x)); assert_eq! (iter.next(), Some (- 16 )); assert_eq! (iter.next(), Some ( 4 )); assert_eq! (iter.next(), None ); Here’s the same example, but with take_while and map : let a = [- 1i32 , 4 , 0 , 1 ]; let mut iter = a.into_iter() .map(|x| 16i32 .checked_div(x)) .take_while(|x| x.is_some()) .map(|x| x.unwrap()); assert_eq! (iter.next(), Some (- 16 )); assert_eq! (iter.next(), Some ( 4 )); assert_eq! (iter.next(), None ); Stopping after an initial None : let a = [ 0 , 1 , 2 , - 3 , 4 , 5 , - 6 ]; let iter = a.into_iter().map_while(|x| u32::try_from(x).ok()); let vec: Vec< _ > = iter.collect(); // We have more elements that could fit in u32 (such as 4, 5), but `map_while` returned `None` for `-3` // (as the `predicate` returned `None`) and `collect` stops at the first `None` encountered. assert_eq! (vec, [ 0 , 1 , 2 ]); Because map_while() needs to look at the value in order to see if it should be included or not, consuming iterators will see that it is removed: let a = [ 1 , 2 , - 3 , 4 ]; let mut iter = a.into_iter(); let result: Vec<u32> = iter.by_ref() .map_while(|n| u32::try_from(n).ok()) .collect(); assert_eq! (result, [ 1 , 2 ]); let result: Vec<i32> = iter.collect(); assert_eq! (result, [ 4 ]); The -3 is no longer there, because it was consumed in order to see if the iteration should stop, but wasn’t placed back into the iterator. Note that unlike take_while this iterator is not fused. It is also not specified what this iterator returns after the first None is returned. If you need a fused iterator, use fuse . 1.0.0 · Source fn skip (self, n: usize ) -> Skip <Self> ⓘ where Self: Sized , Creates an iterator that skips the first n elements. skip(n) skips elements until n elements are skipped or the end of the iterator is reached (whichever happens first). After that, all the remaining elements are yielded. In particular, if the original iterator is too short, then the returned iterator is empty. Rather than overriding this method directly, instead override the nth method. § Examples let a = [ 1 , 2 , 3 ]; let mut iter = a.into_iter().skip( 2 ); assert_eq! (iter.next(), Some ( 3 )); assert_eq! (iter.next(), None ); 1.0.0 · Source fn take (self, n: usize ) -> Take <Self> ⓘ where Self: Sized , Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner. take(n) yields elements until n elements are yielded or the end of the iterator is reached (whichever happens first). The returned iterator is a prefix of length n if the original iterator contains at least n elements, otherwise it contains all of the (fewer than n ) elements of the original iterator. § Examples Basic usage: let a = [ 1 , 2 , 3 ]; let mut iter = a.into_iter().take( 2 ); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), None ); take() is often used with an infinite iterator, to make it finite: let mut iter = ( 0 ..).take( 3 ); assert_eq! (iter.next(), Some ( 0 )); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), None ); If less than n elements are available, take will limit itself to the size of the underlying iterator: let v = [ 1 , 2 ]; let mut iter = v.into_iter().take( 5 ); assert_eq! (iter.next(), Some ( 1 )); assert_eq! (iter.next(), Some ( 2 )); assert_eq! (iter.next(), None ); Use by_ref to take from the iterator without consuming it, and then continue using the original iterator: let mut words = [ "hello" , "world" , "of" , "Rust" ].into_iter(); // Take the first two words. let hello_world: Vec< _ > = words.by_ref().take( 2 ).collect(); assert_eq! (hello_world, vec! [ "hello" , "world" ]); // Collect the rest of the words. // We can only do this because we used `by_ref` earlier. let of_rust: Vec< _ > = words.collect(); assert_eq! (of_rust, vec! [ "of" , "Rust" ]); 1.0.0 · Source fn scan <St, B, F>(self, initial_state: St, f: F) -> Scan <Self, St, F> ⓘ where Self: Sized , F: FnMut ( &mut St , Self:: Item ) -> Option <B>, An iterator adapter which, like fold , holds internal state, but unlike fold , produces a new iterator. scan() takes two arguments: an initial value which seeds the internal state, and a closure with two arguments, the first being a mutable reference to the internal state and the second an iterator element. The closure can assign to the internal state to share state between iterations. On iteration, the closure will be applied to each element of the iterator and the return value from the closure, an Option , is returned by the next method. Thus the closure can return Some(value) to yield value , or None to end the iteration. § Examples let a = [ 1 , 2 , 3 , 4 ]; let mut iter = a.into_iter().scan( 1 , |state, x| { // each iteration, we'll multiply the state by the element ... * state = * state * x; // ... and terminate if the state exceeds 6 if * state > 6 { return None ; } // ... else yield the negation of the state Some (- * state) }); assert_eq! (iter.next(), Some (- 1 )); assert_eq! (iter.next(), Some (- 2 )); assert_eq! (iter.next(), Some (- 6 )); assert_eq! (iter.next(), None ); 1.0.0 · Source fn flat_map <U, F>(self, f: F) -> FlatMap <Self, U, F> ⓘ where Self: Sized , U: IntoIterator , F: FnMut (Self:: Item ) -> U, Creates an iterator that works like map, but flattens nested structure. The map adapter is very useful, but only when the closure argument produces values. If it produces an iterator instead, there’s an extra layer of indirection. flat_map() will remove this extra layer on its own. You can think of flat_map(f) as the semantic equivalent of map ping, and then flatten ing as in map(f).flatten() . Another way of thinking about flat_map() : map ’s closure returns one item for each element, and flat_map() ’s closure returns an iterator for each element. § Examples let words = [ "alpha" , "beta" , "gamma" ]; // chars() returns an iterator let merged: String = words.iter() .flat_map(|s| s.chars()) .collect(); assert_eq! (merged, "alphabetagamma" ); 1.29.0 · Source fn flatten (self) -> Flatten <Self> ⓘ where Self: Sized , Self:: Item : IntoIterator , Creates an iterator that flattens nested structure. This is useful when you have an iterator of iterators or an iterator of things that can be turned into iterators and you want to remove one level of indirection. § Examples Basic usage: let data = vec! [ vec! [ 1 , 2 , 3 , 4 ], vec! [ 5 , 6 ]]; let flattened: Vec< _ > = data.into_iter().flatten().collect(); assert_eq! (flattened, [ 1 , 2 , 3 , 4 , 5 , 6 ]); Mapping and then flattening: let words = [ "alpha" , "beta" , "gamma" ]; // chars() returns an iterator let merged: String = words.iter() .map(|s| s.chars()) .flatten() .collect(); assert_eq! (merged, "alphabetagamma" ); You can also rewrite this in terms of flat_map() , which is preferable in this case since it conveys intent more clearly: let words = [ "alpha" , "beta" , "gamma" ]; // chars() returns an iterator let merged: String = words.iter() .flat_map(|s| s.chars()) .collect(); assert_eq! (merged, "alphabetagamma" ); Flattening works on any IntoIterator type, including Option and Result : let options = vec! [ Some ( 123 ), Some ( 321 ), None , Some ( 231 )]; let flattened_options: Vec< _ > = options.into_iter().flatten().collect(); assert_eq! (flattened_options, [ 123 , 321 , 231 ]); let results = vec! [ Ok ( 123 ), Ok ( 321 ), Err ( 456 ), Ok ( 231 )]; let flattened_results: Vec< _ > = results.into_iter().flatten().collect(); assert_eq! (flattened_results, [ 123 , 321 , 231 ]); Flattening only removes one level of nesting at a time: let d3 = [[[ 1 , 2 ], [ 3 , 4 ]], [[ 5 , 6 ], [ 7 , 8 ]]]; let d2: Vec< _ > = d3.into_iter().flatten().collect(); assert_eq! (d2, [[ 1 , 2 ], [ 3 , 4 ], [ 5 , 6 ], [ 7 , 8 ]]); let d1: Vec< _ > = d3.into_iter().flatten().flatten().collect(); assert_eq! (d1, [ 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 ]); Here we see that flatten() does not perform a “deep” flatten. Instead, only one level of nesting is removed. That is, if you flatten() a three-dimensional array, the result will be two-dimensional and not one-dimensional. To get a one-dimensional structure, you have to flatten() again. Source fn map_windows <F, R, const N: usize >(self, f: F) -> MapWindows <Self, F, N> ⓘ where Self: Sized , F: FnMut (&[Self:: Item ; N ]) -> R, 🔬 This is a nightly-only experimental API. ( iter_map_windows #87155 ) Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f . Like slice::windows() , the windows during mapping overlap as well. In the following example, the closure is called three times with the arguments &['a', 'b'] , &['b', 'c'] and &['c', 'd'] respectively. #![feature(iter_map_windows)] let strings = "abcd" .chars() .map_windows(|[x, y]| format! ( "{}+{}" , x, y)) .collect::<Vec<String>>(); assert_eq! (strings, vec! [ "a+b" , "b+c" , "c+d" ]); Note that the const parameter N is usually inferred by the destructured argument in the closure. The returned iterator yields 𝑘 − N + 1 items (where 𝑘 is the number of items yielded by self ). If 𝑘 is less than N , this method yields an empty iterator. The returned iterator implements FusedIterator , because once self returns None , even if it returns a Some(T) again in the next iterations, we cannot put it into a contiguous array buffer, and thus the returned iterator should be fused. § Panics Panics if N is zero. This check will most probably get changed to a compile time error before this method gets stabilized. ⓘ #![feature(iter_map_windows)] let iter = std::iter::repeat( 0 ).map_windows(| & []| ()); § Examples Building the sums of neighboring numbers. #![feature(iter_map_windows)] let mut it = [ 1 , 3 , 8 , 1 ].iter().map_windows(| & [a, b]| a + b); assert_eq! (it.next(), Some ( 4 )); // 1 + 3 assert_eq! (it.next(), Some ( 11 )); // 3 + 8 assert_eq! (it.next(), Some ( 9 )); // 8 + 1 assert_eq! (it.next(), None ); Since the elements in the following example implement Copy , we can just copy the array and get an iterator over the windows. #![feature(iter_map_windows)] let mut it = "ferris" .chars().map_windows(|w: &a | 2026-01-13T09:29:14 |
https://opensource.guide/ja/starting-a-project/ | オープンソースプロジェクトを始めよう | Open Source Guides このサイトについて 貢献する العربية Български Bangla Deutsch Ελληνικά English Español Farsi Français Hindi Magyar Indonesia Italiano 日本語 한국어 Malay Nederlands Pidgin Polski Português Romanian Русский संस्कृतम् Swahili தமிழ் Türkçe 简体中文 繁體中文 Open Source Guides オープンソースプロジェクトを始めよう オープンソースの世界のことをもっと学び、あなた自身のプロジェクトを立ち上げる準備をしましょう。 目次 オープンソースとは”なに”であり、”なぜ”それを行うのか 自分自身のオープンソースプロジェクトを立ち上げるべき？ あなた自身のオープンソースプロジェクトを立ち上げる あなたのプロジェクトに名前とブランドを付けよう 立ち上げ前のチェックリスト オープンソースとは”なに”であり、”なぜ”それを行うのか さて、あなたはオープンソースを始めようと考えているのですか？おめでとう！世界はあなたのコントリビュートに感謝します。オープンソースとはなんであってなぜ人々はそれを行うのかについて話しましょう。 「オープンソース」が意味するものは？ あるプロジェクトがオープンソースである時、それは 誰でも自由に使って、学び、修正して、あなたのプロジェクトをいかなる目的であっても配布できる ということを意味します。これらの行為を許可するということは オープンソースライセンス に定められています。 オープンソースは採用とコラボレーションの敷居を下げ、プロジェクトをすぐに広め、改善することを可能にするため強力です。また、クローズドソースと比べて、ユーザーに処理の内容を自分で制御できる可能性を提供することもオープンソースの特徴です。例えば、企業にとっては、クローズドソースのベンダーの製品に依存するのではなく、オープンソースソフトウェアに独自のカスタマイズを加えるようエンジニアを採用するという選択肢を提供します。 フリーソフトウェア という言葉も オープンソース と同じくプロジェクトを指します。ときには これらの言葉 を合わせて「free and open source software」 (FOSS) や「free, libre, and open source software」 (FLOSS) と呼ばれているのを目にするかもしれません。 Free や libre は自由を指しているのであって、 無料 を指しているわけではありません。 なぜ人々は彼らの成果をオープンソースにするのか？ オープンソースを使ったりコラボレーションすることからくる最もやりがいのある経験の一つは、私と同じ問題に遭遇している他の開発者と作り上げる関係から来ています。 — @kentcdodds, “How getting into Open Source has been awesome for me” 人々や組織がオープンソースプロジェクトを始めるには 様々な理由があります 。いくつか例を挙げてみましょう： コラボレーション： オープンソースプロジェクトは世界の誰からも変更を受け付けます。例えば Exercism は、350を超えるコントリビューターがいるプログラミング練習プラットフォームです。 取り入れて再構成： オープンソースプロジェクトは誰しもがほとんどいかなる理由のためにも使えるものです。人々は他のものを作るためにでも使うことができます。例えば WordPress は、 b2 と呼ばれる既存のプロジェクトのフォークとして始まりました。 透明性： 誰でもオープンソースプロジェクトにエラーがないかや一貫していないところがないか調べることができます。透明性は ブルガリア や アメリカ のような政府、銀行やヘルスケアのような規制産業、 Let’s Encrypt のようなセキュリティソフトウェアにとって重要です。 オープンソースはソフトウェアのためだけのものでもありません。データセットから本まであらゆるものをオープンソースにできるのです。他になにかオープンソースにできるものはないかアイデアを得るために GitHub Explore をチェックしてみましょう。 オープンソースは「無料で使える」事を意味している？ オープンソースの大きな魅力の一つがお金がかからないということです。しかし、「無料で使える」ことはオープンソースの全ての価値の副産物でしかありません。 オープンソースライセンスが要求しているように 、誰でも使え、修正でき、どんな目的でも共有できるため、プロジェクト自身は無料で使える傾向にあります。もしそのプロジェクトが使うのにお金がかかるとしたら、誰でも合法的にそのコピーを作って無料のバージョンを代わりに作ることができます。 結果として、ほとんどのオープンソースプロジェクトは無料です。しかし、「無料で使える」ことはオープンソースの定義には含まれていません。オープンソースプロジェクトでも、デュアルライセンスや機能制限によって間接的に料金を取る方法はあります。これでもまだオープンソースの公式な定義に則っています。 自分自身のオープンソースプロジェクトを立ち上げるべき？ 簡単な答えとしてはイエスです。なぜなら、成果がどうであれ、あなた自身のプロジェクトを立ち上げるのはオープンソースがどうやって成り立っているのかを学ぶ素晴らしい方法だからです。 もし今までプロジェクトをオープンソースにしたことがないのであれば、他の人から何を言われるか、誰も全く気づいてくれないんじゃないかと心配になっているかもしれません。もしあなたがそうだとしたら、あなたは一人ではありません！ オープンソース活動は他の執筆や絵画などのクリエイティブな活動と似ています。世界にあなたの作品を公開するのは怖いと感じるでしょうが、上達する唯一の方法は練習することなのです。たとえ、誰も見ている人が居ないとしても。 もしまだ納得していないのであれば、あなたのゴールがどういったものであるかを少し考えてみましょう。 ゴールを設定する ゴールを設定することによって、何をやるべきか、なににノーというべきか、他の人の助けが必要な箇所を明確にすることができます。 私はなぜこのプロジェクトをオープンソースにしたのか？ と自問してみましょう。 この質問に唯一の正解はありません。一つのプロジェクトに対して複数のゴールがあるかもしれないし、異なるプロジェクトで異なるゴールがあるかもしれません。 もしあなたのゴールがあなたの作品を見せびらかすことだけなのであれば、コントリビュートは望まないでしょうし、 README で表明すべきです。その一方で、コントリビューターを望むであれば、明確なドキュメントと新しく来た人が歓迎されていると感じるように時間を投資するでしょう。 ある時点で、私は自分で使っていたカスタムの UIAlertView を作りました…そして、オープンソースにすることを決めたのです。そこで私はそれをより機能的になるように修正し、 GitHub にアップロードしました。また、他の開発者が彼らのプロジェクトでどのように使うかを説明するはじめてのドキュメントも書きました。おそらく、非常にシンプルなプロジェクトだったので誰もこれまでに使っていないでしょうが、自分のコントリビュートに対して良い気分でした。 — @mavris, “Self-taught Software Developers: Why Open Source is important to us” あなたのプロジェクトが成長するにつれて、コミュニティがあなたに求めるものはコードを書くことだけではなくなるでしょう。イシューに返答したり、コードをレビューしたり、あなたのプロジェクトがオープンソースプロジェクトにとってとても重要なタスクなのであると説いて回るといったことです。 コーディング以外のタスクに費やす時間はあなたのプロジェクトのサイズと範囲に依存する一方で、メンテナーとしてそういった活動に取り組む準備をするか手伝ってくれる人を見つけるべきです。 もしあなたが企業でプロジェクトをオープンソースにすることに携わっているのであれば、 あなたのプロジェクトが盛り上がるのに必要な企業内部のリソースを持っているかどうか確かめましょう。立ち上げた後にプロジェクトをメンテナンスする担当の人は誰で、コミュニティとどのようにタスクを共有するのかを特定したいと思うでしょう。 プロジェクトの推進と運営、メンテナンスに予算と人員が必要なのであれば、その会話は早めに始めましょう。 オープンソースプロジェクトを始める時に、あなたの管理プロセスにおいてコントリビュートやそのプロジェクトのコミュニティの能力が考慮されているかどうかを確かめておくのは大事なことです。プロジェクトの大事な部分であなたの企業に雇われていないコントリビューターを巻き込むことを恐れてはいけません - 特に彼らが頻繁にコントリビュートをしてくれるのであれば。 — @captainsafia, “So you wanna open source a project, eh?” 他のプロジェクトにコントリビュートする もしあなたのゴールが他の人とコラボレーションする方法を学んだり、オープンソースがどうやって機能しているのかを理解することなのであれば、既存のプロジェクトにコントリビュートすることも考えてみましょう。あなたが既に使っていて気に入っているプロジェクトから始めましょう。プロジェクトにコントリビュートするのは誤植を直したり、ドキュメントを更新したりといったシンプルなものでもよいのです。 コントリビューターとして活動し始める方法がわからないのであれば、 オープンソースにコントリビュートする方法 をチェックしてみて下さい。 あなた自身のオープンソースプロジェクトを立ち上げる あなたの作品をオープンソースにするのに完璧なタイミングはありません。アイデアや作業中のもの、クローズドで何年も経ったものであってもオープンソースにできるのです。 一般的に言って、他の人があなたの作品をみて、フィードバックをくれることに対して苦痛がないのであれば、あなたのプロジェクトをオープンソースにするべきです。 あなたのプロジェクトをオープンソースにするのがどの段階であれ、全てのプロジェクトは下記のドキュメントを含んでいるべきです： オープンソースライセンス README コントリビュートのガイドライン 行動規範 メンテナーとして、これらの要素は期待値をコミュニケーションし、コントリビュートをマネジメントし、すべての人（あなた自身も含む）の法的権利を守る助けになります。これらによってあなたが良い経験を積むことができる可能性を大幅に増やします。 もしあなたのプロジェクトが GitHub 上にあるのであれば、これらのファイルを推奨されているファイル名でルートディレクトリに置くことで、 GitHub がそれを認識し、見ている人に自動的に表示してくれます。 ライセンスを選ぶ オープンソースライセンスは、他の人が恐れを感じることなくあなたのプロジェクトを使い、コピーし、修正し、コントリビュートする事を保証します。また、あなたを法的な面倒事からも守ってくれます。 あなたがプロジェクトをオープンソースにするときは必ずライセンスを含めるようにしましょう。 法的な作業は楽しくはありません。既存のライセンスをあなたのリポジトリにコピーペーストできるというのは良い知らせでしょう。あなたの大事な作品を守るのに1分しかかかりません。 MIT や Apache 2.0 、 GPLv3 が最も有名なオープンソースライセンスですが、 他の選択肢 もあります。 GitHub 上に新しいプロジェクトを作るときは、ライセンスを選択する選択肢が表示されます。オープンソースライセンスを含めることで、あなたの GitHub プロジェクトはオープンソースになります。 オープンソースプロジェクトを管理する上での法的な面でまだ疑問や懸念があるのであれば、 こちらを参照して下さい 。 README を書く README はあなたのプロジェクトをどうやって使うかを説明するだけにとどまりません。そこでは、なぜあなたのプロジェクトが重要なのか、そしてユーザーはあなたのプロジェクトで何ができるかということも説明するためのものです。 README には、下記の質問に答えるようにしましょう： このプロジェクトは何をするものなのか？ なぜこのプロジェクトは便利なのか？ どのようにして使い始められるのか？ もし必要な場合、どうやったら助けを得られるか？ README では、コントリビュートをどのように扱うか、プロジェクトのゴールはなにか、ライセンスや帰属についての情報などといった他の疑問に答えるのに使うこともできる。もしコントリビュートを受け入れたくなかったり、あなたのプロジェクトは運用に乗せる準備が整っていなかったりする場合は、その情報も書きましょう。 良いドキュメントを書くことで、ユーザーが増え、サポートのリクエストが減り、コントリビューターが増えることを意味します。（…）読者はあなたとは違うということを忘れないで下さい。完全に異なる経験を持った人がプロジェクトに来るかもしれないのです。 — @tracymakes, “Writing So Your Words Are Read (video)” 時々、プロジェクトが未完了であったりコントリビュートを求めていないといった理由で README を書くのを避ける人が居ます。これらも README に書いておくと良いでしょう。 さらなるヒントとしては、完全な README を書くために @18F の “Making READMEs Readable” か @PurpleBooth の README template を読んでみると良いでしょう。 README ファイルをルートディレクトリに置くことで、 GitHub が自動的にリポジトリのホームページに表示してくれます。 コントリビュートのガイドラインを書く CONTRIBUTING ファイルはあなたのプロジェクトにどうやって参加するのかを伝えるためのものです。例えば、下記の様な情報を含めると良いでしょう： バグレポートの登録の仕方 ( イシューやプルリクエストのテンプレート を使ってみましょう) 新しい機能の提案の仕方 環境のセットアップとテストの実行の仕方 技術的な詳細に加えて、 CONTRIBUTING ファイルはコントリビュートに対する期待値を伝える機会でもあります。例えば： あなたが求めているコントリビュートの種類 プロジェクトのロードマップやビジョン コントリビューターがどのようにしてあなたにコンタクトすべきか（もしくはすべきでないか） 暖かく友好的なトーンを使って、（ドキュメントを書く、もしくはウェブサイトを作る、といったような）コントリビュートを具体的に提示することで、新しく来る人が歓迎されていて是非参加したいと思ってもらうのにとても役に立ちます。 例えば、 Active Admin は コントリビュートガイド を下記の内容から始めています： まずはじめに、 Active Admin へのコントリビュートを考えてくれてありがとうございます。あなたのような人々が Active Admin を偉大なツールにしているのです。 あなたのプロジェクトの最初期では、 CONTRIBUTING ファイルはシンプルで大丈夫です。常にバグの報告の仕方かイシューの登録の仕方、コントリビュートをする際の技術的な要求（テストなど）を書くようにしましょう。 時間が経つにつれて、 CONTRIBUTING ファイルに頻繁に聞かれる質問を加えるでしょう。こういった情報を書くことによって、同じ質問を何度も繰り返ししてくる人が減っていくでしょう。 CONTRIBUTING ファイルを書くときに更に役に立つものとして、 @nayafia の contributing guide template や @mozilla の “How to Build a CONTRIBUTING.md” も参考になるでしょう。 README に CONTRIBUTING ファイルへのリンクをすることで、より多くの人の目に触れるようになります。 CONTRIBUTING ファイルをプロジェクトのリポジトリに置くことで 、 GitHub でコントリビューターがイシューを登録したり、プルリクエストをオープンする際に、そのファイルへのリンクが自動的に表示されます。 行動規範を定める 私達は皆、違反だと思われるような場面に遭遇したことがあります。ときにはメンテナーとしてなぜそういったやり方でやるべきなのかを説明しようとしたり、時にはユーザーとして単純な質問をしたり。行動規範は、あなたのチームが生産的な議論を非常に真剣に捉えていることを示すために参照してリンクするためのドキュメントとして使うことができます。 — @mlynch, “Making Open Source a Happier Place” 最後に、行動規範はあなたのプロジェクトの参加者の行動に対する基本原則を設定する助けになります。これは特にあなたがコミュニティや会社のためのオープンソースを立ち上げる時に役に立ちます。行動規範は健康的で生産的なコミュニティの振る舞いを促進する助けになります。そして、あなたのメンテナーとしてのストレスを減らしてくれるでしょう。 更に情報が必要な場合は、 行動規範ガイド を見てみましょう。 プロジェクトの参加者に どう 振る舞ってほしいかを伝えるのに加えて、行動規範では期待される行動が、誰に対して、いつ適用され、違反した場合には何をすべきなのかについても記載される傾向があります。 オープンソースライセンスによく似ていますが、行動規範にもスタンダードが出てきています。なので、あなた自身で書く必要はありません。 Contributor Covenant はカジュアルに使うことができる行動規範で、 40,000を超えるオープンソースプロジェクト に使われており、そこには Kubernetes 、 Rails や Swift も含まれます。どの文書を使うにしても、必要なときにはあなたの指針に従わせる準備をしておくべきです。 あなたのリポジトリの CODE_OF_CONDUCT ファイルに文書を直接貼り付けましょう。そのファイルをプロジェクトのルートディレクトリに置いておくことで、簡単に見つけることができ、 README からリンクすることができます。 あなたのプロジェクトに名前とブランドを付けよう ブランディングは華やかなロゴやキャッチーな名前以上のものです。それは、あなたのプロジェクトについてどう紹介し、あなたのメッセージが誰に届くのかということなのです。 適切な名前を選ぶ 覚えやすい名前を選びましょう。理想的には名前からそのプロジェクトが何をするのかがわかるようにしましょう。例： Sentry はクラッシュレポートのためにアプリケーションをモニターします Thin は高速でシンプルなRubyのウェブサーバーです 既存のプロジェクトに基づいて開発しているのであれば、その名前を頭につけることであなたのプロジェクトが何をするものかを明らかにする助けになります（例えば、 node-fetch は Node.js に window.fetch を追加するものです）。 明快さを第一に考えましょう。ダジャレは面白いですが、ジョークは他の文化やあなたとは異なる経験を持った人には通じないこともあるということを覚えておきましょう。潜在的なユーザーには企業の従業員もいるかもしれません。彼らがあなたのプロジェクトについて職場で説明する時に居心地の悪い思いをさせたくはないでしょう。 名前の衝突を避ける 同じような名前のオープンソースプロジェクトを調べましょう 。同じ言語やエコシステムを共有する場合は特にです。もし既存の有名なプロジェクトと名前が同じ部分があると、外から見た人を混乱させてしまうでしょう。 ウェブサイトや Twitter のハンドルや他であなたのプロジェクト名を使いたいのであれば、使いたい名前を使えるかどうか確かめましょう。理想的には、心の平穏のために すぐにそれらの名前を予約しましょう 。たとえ、今すぐに使うつもりがないとしても。 プロジェクトの名前が商標の侵害をしていないか確かめましょう。後になってある企業があなたのプロジェクトをやめるように言ってきたり、法的措置さえしてくるかもしれません。そんなリスクは見合いません。 商標を侵害していないかを調べるには WIPO Global Brand Database を確認しましょう。もし企業にいるのであれば、この点は 法務部門が助けてくれる ことの一つでしょう。 最後に、あなたのプロジェクト名で Google 検索をしてみましょう。人々は簡単にあなたのプロジェクトを見つけることができるでしょうか？検索結果の中になにか望ましくないものが表示されていないでしょうか？ 文書（やコード）の書き方はあなたのブランディングにも影響します！ あなたのプロジェクト全体を通して、多くの文書を書くでしょう： README 、チュートリアル、コミュニティドキュメント、イシューへの返答、もしかしたらニュースレターやメーリングリストもあるかもしれません。 公式のドキュメントであれ、カジュアルなメールであれ、あなたの文書のスタイルはプロジェクトのブランドの一部になります。見る人にどのようにして伝わるかや、あなたが伝えたいトーンかどうかを検討しましょう。 メーリングリストのすべてのスレッドに関わるようにしましたし、模範的な行動を示し、人々に親切にし、イシューを真剣に捉え、何より助けになるようにしました。しばらくすると、人々は質問をするだけでなく、質問に答えたり、何よりも嬉しいことに私のスタイルを真似してくれたのです。 — @janl on CouchDB , “Sustainable Open Source” 暖かく、排他的でない言葉遣い（一人の人を指すときであっても「彼ら」を使う、といったような）をすることで、あなたのプロジェクトで新しいコントリビューターが歓迎されていると感じてもらうことに繋がります。シンプルな言葉遣いをすることにこだわりましょう。あなたのプロジェクトを見る人の多くは英語のネイティブスピーカーではないかもしれません。 あなたがどう文書を書くかに加えて、あなたのコーディングスタイルもプロジェクトのブランドの一部になるかもしれません。 Angular と jQuery の2つは厳密なコーディングスタイルとガイドラインを持つプロジェクトの例です。 かならずしもプロジェクトを始める際にスタイルガイドを書く必要はありませんし、とにかく異なるコーディングスタイルを盛り込むのが楽しいと思うかもしれません。しかし、あなたの文書やコーディングスタイルが異なるタイプの人々を惹きつけることもあれば落胆させることもあるということを予期しておくべきです。プロジェクトの最初期はあなたが望む先例を作る良い機会です。 立ち上げ前のチェックリスト あなたのプロジェクトをオープンソースにする準備が整いましたか？ここにあなたの助けとなるよう、チェックリストを用意しました。全てにチェックが付きましたか？そうであれば準備万端です！ “publish” をクリックして 、自分を褒めてあげましょう。 ドキュメント オープンソースライセンスの LICENSE ファイルがある 基本的なドキュメント（ README 、 CONTRIBUTING 、 CODE_OF_CONDUCT ）がある 名前が覚えやすく、プロジェクトが何をするのかがある程度わかり、既存のプロジェクトと重複したり、商標を侵害していない イシューのキューが最新であり、イシューが整理されてラベル付けされている コード 一貫した命名規則を使っていて、明快な関数名/メソッド名/変数名を使っている コードに明快なコメントがあり、そこには意図やエッジケースが書かれている リビジョンの履歴やイシュー、プルリクエストに機密情報（例えばパスワードやそれ以外の非公開情報）が含まれていない 人々 もし個人でやっているのであれば： （もしどこかの従業員であれば）法務部門と話をして、あなたの会社の知的財産やオープンソースの方針を理解している 企業や組織でやっているのであれば： 法務部門と話をした プロジェクトのアナウンスや売り込みのマーケティングプランを持っている コミュニティのやりとり（イシューへの返答、レビュー、プルリクエストのマージ）の担当者がいる プロジェクトの管理権限を持っている人が少なくとも2人いる やりました！ おめでとう！あなたの最初のプロジェクトをオープンソースにしました。成果はどうあれ、公の場で働くことはコミュニティへの贈り物です。あらゆるコミット、コメント、プルリクエストによって、あなた自身や他の人が学び、成長する機会を提供しているのです。 すべてのガイドに戻る 関連するガイド あなたのプロジェクトのユーザーを見つけよう あなたのプロジェクトを喜んで使ってくれるユーザーを獲得してプロジェクトを拡大しよう。 居心地の良いコミュニティを築こう 人々があなたのプロジェクトを使ったり、コントリビュートしたり、人に伝えたくなるようなコミュニティを築きましょう。 Scroll to Top 貢献する 提案したいことがありますか？このコンテンツはオープンソースです。改善にご協力ください。 貢献する 情報を受け取る GitHub の最新のオープンソースに関するヒントや情報をすぐに受け取りましょう。 メールアドレス fine print と 友達 による のこもった | 2026-01-13T09:29:14 |
https://www.linkedin.com/uas/login?session_redirect=https%3A%2F%2Fwww%2Elinkedin%2Ecom%2Fposts%2Fmakerxau_were-incredibly-proud-to-have-been-nominated-activity-7401472884281692161-_WTa&fromSignIn=true&trk=cold_join_sign_in | LinkedIn Login, Sign in | LinkedIn Sign in Sign in with Apple Sign in with a passkey By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . or Email or phone Password Show Forgot password? Keep me logged in Sign in We’ve emailed a one-time link to your primary email address Click on the link to sign in instantly to your LinkedIn account. If you don’t see the email in your inbox, check your spam folder. Resend email Back New to LinkedIn? Join now Agree & Join LinkedIn By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . LinkedIn © 2026 User Agreement Privacy Policy Community Guidelines Cookie Policy Copyright Policy Send Feedback Language العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) | 2026-01-13T09:29:14 |
https://www.lagrange.dev/deepprove | DeepProve Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY Stake $LA for 20% Expected APY TECHNOLOGY Defense DeepProve ZK Prover Network ECOSYSTEM FOUNDATION DOCS ARTICLES Blog Engineering Technology DEFENSE DEEP PROVE ZK PROVER NETWORK ECOSYSTEM FOUNDATION DOCS Articles BLOG ENGINEERING DeepProve Cryptography as America’s Global Advantage See Docs DeepProve allows anyone to take a ML model and prove that ⟶ 01
The correct model is run 02
The results are correct Lagrange’s DeepProve—the fastest zkML in existence—makes it easy to prove that AI inferences are correct, scaling verifiable computation as the demand for AI grows. inquire Up to 1000x faster proof generation than the baseline Up to 671x faster proof verification than the baseline Drop-in ready for real-world applications DeepProve is the first zkML system to prove full inferences of the world’s most popular models, including Gemma3 and GPT-2. Why DeepProve? AI You Can Verify DeepProve lets anyone cryptographically verify that a model performed the right task, with the right input, and produced the correct output—no matter where or how it’s run. Protect Model Integrity Ensure that AI models deployed in production haven’t been tampered with. Verify performance, audit behavior, and safeguard IP—all while keeping model parameters private. Trust Without Tradeoffs Today, trust in AI often requires giving up control, oversight, or data privacy. DeepProve solves that. Every inference comes with a proof—provable trust, without compromise. Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> Learn how partners are leveraging DeepProve. >>> “DeepProve is a technological intersection that subsumes everything as each technology subsumes everything.” - Ismael, founder of Lagrange, at Token 2049, April 2025 How does DeepProve Work for Developers? DeepProve is a zkML library that generates proofs for the inferences of Multilayer Perceptrons (MLPs) and the inferences of popular convolutional neural networks (CNNs). browse the Docs 01
Model Training The developer trains a neural network and exports it as an ONNX file. 02
Preprocessing The executable parses the ONNX file, generates circuits, and prepares prover/verifier keys for the SNARK proof system. 03
Proving A prover runs the SNARK prover to compute inferences and generate proofs for given inputs. 04
Verification Any verifier can validate these proofs to confirm the correctness of outputs. What the user experiences: 01
They use a product backed by DeepProve 02
There is a proof that the inferences done are correct with every AI output 03
They no longer need to verify that AI is correct — it already has been verified by DeepProve As DeepProve scales with each proof generated, millions of parameters can lead to faster results, better parallelization, distributed proving, GPU/ASIC enhancements, reduced GKR overhead and more, pushing scalability even further. Powered by DeepProve, the Turing Roulette tournament challenged 144,309 people to decipher whether they were talking to a human or an AI, proving over 3.7M AI inferences. Learn More Sign up for updates Thank you! Your submission has been received! Oops! Something went wrong while submitting the form. Resources Github DeepProve Defense Docs ZK Prover Network Ecosystem Blog ZK Coprocessor Engineering About Careers Press Kit Foundation Terms & Conditions Privacy Policy Follow © Lagrange 2025 | 2026-01-13T09:29:14 |
https://ben.balter.com// | Posts | Ben Balter Ben Balter Posts About Contact Technology leadership, collaboration, and open source How to run LanguageTool on macOS January 30, 2025 The “I don’t like what they’re saying, so they shouldn’t be allowed to say it” approach to crisis management January 8, 2024 Cathedral vs Bazaar People Management December 8, 2023 How to communicate like a GitHub engineer October 4, 2023 Transparent collaboration is the andon of your knowledge production system August 30, 2023 Remote work requires communicating more, less frequently August 4, 2023 Pull requests are a form of documentation May 19, 2023 Practice inclusive scheduling May 19, 2023 Meetings are a point of escalation, not the starting point of a conversation April 20, 2023 Intro to GitHub for non-technical roles March 2, 2023 How to write a great extended leave document January 13, 2023 Manage like an engineer January 10, 2023 Helpful 404s for Jekyll (and GitHub Pages) June 30, 2022 Why you should work asynchronously March 17, 2022 The seven things a corporate Chief of Staff does March 9, 2022 Leaders show their work February 16, 2022 Using GitHub Actions to get notified when an API response (or web page) changes December 15, 2021 How I re-over-engineered my home network for privacy and security September 1, 2021 Advice for managing open source communities at scale June 15, 2021 Moderating open source conversations to keep them productive June 15, 2021 Five (and a half) practical tips for governing your open source project June 14, 2021 Nine things a (technical) program manager does March 26, 2021 Octoversary - eight years of optimizing for developer happiness March 4, 2021 What to read before starting (or interviewing) at GitHub February 1, 2021 Analysis of federal .gov domains, pre-Biden edition January 11, 2021 How I over-engineered my home network for privacy and security December 4, 2020 The top 10 posts of the past 10 years September 12, 2020 Budget for the hidden “internet tax” August 31, 2020 How I manage GitHub notifications August 25, 2020 Tools of the trade: How I communicate at GitHub (and why) August 14, 2020 Automate common open source community management tasks August 10, 2020 Seven ways to set open source contributors up for success May 15, 2020 Eight tips for working remotely March 18, 2020 User blocking vs. user muting February 6, 2020 10 lessons learned fostering a community of communities at GitHub January 17, 2020 Resolutions for sustaining and growing open source communities January 2, 2020 A community of communities: Empowering maintainers to grow communities around their code July 18, 2019 Go near, go far, meet in the middle June 28, 2019 What lawyers can learn from open source February 6, 2019 Problems, not solutions July 16, 2018 Yes, No, Maybe May 4, 2018 Why you probably shouldn’t add a CLA to your open source project January 2, 2018 Everything an open source maintainer might need to know about open source licensing November 28, 2017 Twelve tips for growing communities around your open source project November 10, 2017 How not to prioritize a feature June 19, 2017 Seven ways to consistently ship great features May 23, 2017 Your project’s README is your project’s constitution April 14, 2017 Using protected branches to empower non-code contributors on GitHub April 14, 2017 Three easy ways to show employees they’re appreciated April 4, 2017 Bikeshed honeypots March 1, 2017 How I Atom (for prose) December 23, 2016 Eight things I wish I knew my first week at GitHub October 31, 2016 The seven habits of highly effective GitHubbers September 13, 2016 How to make a product great August 22, 2016 Why you shouldn’t write your own open source license August 1, 2016 Removing a feature is a feature July 21, 2016 Books for geeks July 11, 2016 Twelve things a product manager does June 6, 2016 Moderating a controversial pull request May 11, 2016 The missed opportunity that is the White House Open Source Policy April 11, 2016 Optimizing for power users and edge cases is the easy part March 8, 2016 How to derail any meeting January 15, 2016 The six types of pull requests you see on GitHub December 8, 2015 Open source as Yelp for software December 8, 2015 Why open source November 23, 2015 Four characteristics of modern collaboration tools November 18, 2015 Why everything should have a URL November 12, 2015 The three biggest challenges in government IT October 18, 2015 Bringing open source workflows to the enterprise September 21, 2015 How to add an “improve this content” button to your GitHub Pages site September 13, 2015 How GitHub uses automated testing to empower developers to write less-corporate blog posts September 10, 2015 Five principles to guide any government IT effort August 23, 2015 The Zen of GitHub August 12, 2015 Speak like a human: 12 ways tech companies can write less-corporate blog posts July 20, 2015 Open procurement: procurement in an increasingly open source world July 11, 2015 Merge by committee June 22, 2015 Using GitHub Pages to showcase your organization’s open source efforts June 11, 2015 Copyright notices for open source projects June 3, 2015 Test your content May 22, 2015 Analysis of federal .gov domains, 2015 edition May 11, 2015 Eight lessons learned hacking on GitHub Pages for six months April 27, 2015 The difference between 18F and USDS April 22, 2015 19 reasons why technologists don’t want to work at your government agency April 21, 2015 Five best practices in open source: external engagement March 17, 2015 Five best practices in open source: internal collaboration March 8, 2015 Explain like I’m five: Jekyll collections February 20, 2015 Why your agency’s first open source project is going to be a flop February 11, 2015 Diff (and collaborate on) Microsoft Word documents using GitHub February 6, 2015 What does your organization optimize for? January 27, 2015 The fine print nobody reads: what to do so government can use your service January 26, 2015 Hacking GitHub: 14 simple tools to help introduce open source to the uninitiated January 11, 2015 Why you should care about HTTPS, even if you have nothing to hide January 6, 2015 Geeks and suits December 18, 2014 The myth of government IT December 17, 2014 A White House open source policy written by a geek November 24, 2014 15 rules for communicating at GitHub November 6, 2014 What is a Government Evangelist? October 15, 2014 What’s next for federal IT policy, IMHO October 15, 2014 Eight reasons why government contractors should embrace open source software October 8, 2014 Everything a government attorney needs to know about open source software licensing October 8, 2014 If you liked it then you should have put a URL on it October 7, 2014 Disclosed source is not the same as open source September 29, 2014 Our code deserves better September 29, 2014 Open source is (not) insecure September 22, 2014 Three things you learn going from the most bureaucratic organization in the world to the least August 24, 2014 Why isn’t all government software open source? August 3, 2014 Why FedRAMP actually makes it harder for government agencies to move to the cloud July 29, 2014 Analysis of Federal Executive .govs (Part Deux) July 7, 2014 How to identify a strong open source project June 2, 2014 Open government is so ‘08, or why collaborative government is the next big thing June 2, 2014 Word versus Markdown: more than mere semantics March 31, 2014 Want to innovate government? Focus on culture March 21, 2014 Header hover anchor links on GitHub Pages using Jekyll March 13, 2014 Open source, not just software anymore January 27, 2014 Why no one uses your government data December 30, 2013 That’s not how the internet works November 21, 2013 Jekyll: Where content is truly king October 30, 2013 Ten Things You Learn as a Presidential Innovation Fellow September 30, 2013 Treat Data as Code September 16, 2013 Friction August 11, 2013 Everyone Contributes August 11, 2013 Bet on the little guy July 2, 2013 The technology’s the easy part July 1, 2013 How to convert Shapefiles to GeoJSON maps for use on GitHub (and why you should) June 26, 2013 An open letter to government CIOs June 12, 2013 We’ve Been Selling Open Source Wrong May 14, 2013 The store that sells only one thing. February 27, 2013 The next big thing is already here February 6, 2013 What is a ‘Hacker’? February 4, 2013 Securing the Status Quo December 26, 2012 Deprecate Management December 16, 2012 Why WordPress’s next version should just give it a REST already December 15, 2012 We’ve been trained to make paper October 19, 2012 Open Source is not a verb October 15, 2012 Welcome to the Post-CMS World October 1, 2012 Government’s Release of Federally Funded Source Code: Public Domain or Open Source? Yes. July 26, 2012 The Demise of the Personal Dashboard July 10, 2012 Why You Should Always Write Software as Open Source, Even When It’s Never Going to Be June 26, 2012 Publishing Government Data That Developers Will Actually Use June 2, 2012 WordPress as a Collaboration Platform May 8, 2012 Enterprise Open Source Usage Is Up, But Challenges Remain April 23, 2012 CFPB Accepts First Citizen-Submitted Code on Behalf of Federal Government April 15, 2012 What’s Missing from CFPB’s Awesome New Source Code Policy April 10, 2012 WordPress for Government - A Problem of Perception March 5, 2012 PHP is Insecure (and Other Enterprise Open-Source F.U.D.) March 2, 2012 GitHub for Journalism — What WordPress Post Forking could do to Editorial Workflows February 28, 2012 Open-Source Alternatives to Proprietary Enterprise Software February 27, 2012 Towards a More Agile Government November 29, 2011 Federal Agility: a Cultural Solution to a Technical Problem November 1, 2011 Why Digital Talent Doesn’t Want To Work At Your Company October 29, 2011 Advanced Workflow Management Tools for WP Document Revisions October 24, 2011 Analysis of Federal Executive .govs September 7, 2011 Why WordPress September 1, 2011 Enterprise, Open Source, and Why Better is not Enough August 31, 2011 WP Document Revisions — Document Management and Version Control for WordPress August 29, 2011 When all you have is a pair of bolt cutters… April 4, 2011 Other recommended reading Fine Print | 2026-01-13T09:29:14 |
https://huggingface.co/login?next=%2Fpapers%2F2310.06770 | Hugging Face – The AI community building the future. Hugging Face Models Datasets Spaces Community Docs Enterprise Pricing Log In Sign Up Log In Don't have an account? Sign Up Username or Email address Password Login Forgot your password? SSO is available for Team & Enterprise accounts. | 2026-01-13T09:29:14 |
https://www.linkedin.com/uas/login?session_redirect=%2Fproducts%2Ftencentglobal-cloud-native-database-tdsqlc&trk=products_details_guest_primary_call_to_action | LinkedIn Login, Sign in | LinkedIn Sign in Sign in with Apple Sign in with a passkey By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . or Email or phone Password Show Forgot password? Keep me logged in Sign in We’ve emailed a one-time link to your primary email address Click on the link to sign in instantly to your LinkedIn account. If you don’t see the email in your inbox, check your spam folder. Resend email Back New to LinkedIn? Join now Agree & Join LinkedIn By clicking Continue, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . LinkedIn © 2026 User Agreement Privacy Policy Community Guidelines Cookie Policy Copyright Policy Send Feedback Language العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) | 2026-01-13T09:29:14 |
https://opensource.guide/ar/starting-a-project/ | البدء بمشروع مفتوح المصدر | Open Source Guides عن المشروع ساهِم العربية Български Bangla Deutsch Ελληνικά English Español Farsi Français Hindi Magyar Indonesia Italiano 日本語 한국어 Malay Nederlands Pidgin Polski Português Romanian Русский संस्कृतम् Swahili தமிழ் Türkçe 简体中文 繁體中文 Open Source Guides البدء بمشروع مفتوح المصدر تعلّم المزيد عن عالم المصادر المفتوحة واستعد لإطلاق مشروعك الخاص قائمة المحتويات الـ”ماذا” و”لماذا” في المشاريع مفتوحة المصدر هل يجب أن أطلق مشروعي مفتوح المصدر الخاص؟ إطلاق مشروعك مفتوح المصدر الخاص تسمية مشروعك ووضع علامة تجارية عليه قائمة التحقق قبل الإطلاق الـ”ماذا” و”لماذا” في المشاريع مفتوحة المصدر إذًا، أنت تفكر في البدء بالمصادر المفتوحة؟ تهانينا! العالم يقدّر مساهمتك. دعنا نتحدث عن ماهية المصادر المفتوحة ولماذا يفعل الناس ذلك. ماذا يعني “مفتوح المصدر”؟ عندما يكون المشروع مفتوح المصدر، فهذا يعني أن أي شخص حر في استخدام مشروعك ودراسته وتعديله وتوزيعه لأي غرض. يتم فرض هذه الأذونات من خلال ترخيص مفتوح المصدر . المصدر المفتوح قوي لأنه يخفض حواجز التبني والتعاون، مما يسمح للناس بنشر المشاريع وتحسينها بسرعة. كما أنه يمنح المستخدمين إمكانية التحكم في حوسبتهم الخاصة، مقارنةً بالمصادر المغلقة. على سبيل المثال، الشركة التي تستخدم برامج مفتوحة المصدر لديها خيار توظيف شخص ما لإجراء تحسينات مخصصة على البرنامج، بدلاً من الاعتماد حصريًا على قرارات منتج بائع vendor المصادر المغلقة. يشير Free software إلى نفس مجموعة المشاريع مثل open source. أحيانًا ستجد هذين المصطلحين مجتمعين في عبارة “free and open source software (FOSS)” أو “free, libre, and open source software (FLOSS)”. كلمتا Free و Libre هنا تدلان على الحرية وليس السعر. لماذا يفتح الناس مصدر أعمالهم؟ واحدة من أكثر التجارب المجزية التي أحصل عليها من استخدام والتعاون في المصادر المفتوحة تأتي من العلاقات التي أبنيها مع مطورين آخرين يواجهون العديد من نفس المشاكل التي أواجهها. — @kentcdodds, “كيف كان الدخول إلى المصادر المفتوحة رائعًا بالنسبة لي” هناك العديد من الأسباب التي قد تجعل شخصًا أو منظمة يرغب في فتح مصدر مشروع. بعض الأمثلة تشمل: التعاون: يمكن لمشاريع المصادر المفتوحة قبول التغييرات من أي شخص في العالم. Exercism ، على سبيل المثال، هي منصة تمارين برمجية تضم أكثر من 350 مساهمًا. التبني والاقتباس: يمكن لأي شخص استخدام مشاريع المصادر المفتوحة لأي غرض تقريبًا. يمكن للناس حتى استخدامها لبناء أشياء أخرى. WordPress ، على سبيل المثال، بدأ كـ fork لمشروع موجود يسمى b2 . الشفافية: يمكن لأي شخص فحص مشروع مفتوح المصدر بحثًا عن أخطاء أو تناقضات. الشفافية مهمة للحكومات مثل بلغاريا أو الولايات المتحدة ، والصناعات المنظمة مثل البنوك أو الرعاية الصحية، وبرامج الأمان مثل Let’s Encrypt . المصادر المفتوحة ليست للبرمجيات فقط. يمكنك فتح مصدر كل شيء من مجموعات البيانات إلى الكتب. راجع GitHub Explore للأفكار حول ما يمكنك فتح مصدره. هل مفتوح المصدر يعني “مجاني”؟ أحد أكبر عوامل الجذب للمصادر المفتوحة هو أنها لا تكلف مالاً. ومع ذلك، فإن “المجانية” هي مجرد نتيجة ثانوية للقيمة الإجمالية للمصادر المفتوحة. نظرًا لأن ترخيص المصدر المفتوح يتطلب أن يتمكن أي شخص من استخدام مشروعك وتعديله ومشاركته لأي غرض تقريبًا، فإن المشاريع نفسها تميل إلى أن تكون مجانية. إذا كان المشروع يكلف مالاً لاستخدامه، يمكن لأي شخص قانونيًا عمل نسخة واستخدام النسخة المجانية بدلاً من ذلك. ونتيجة لذلك، فإن معظم مشاريع المصادر المفتوحة مجانية، لكن “المجانية” ليست جزءًا من تعريف المصدر المفتوح. هناك طرق لفرض رسوم على مشاريع المصادر المفتوحة بشكل غير مباشر من خلال الترخيص المزدوج dual licensing أو الميزات المحدودة limited features، مع الالتزام بالتعريف الرسمي للمصادر المفتوحة. هل يجب أن أطلق مشروعي مفتوح المصدر الخاص؟ الإجابة القصيرة هي نعم، لأنه بغض النظر عن النتيجة، فإن إطلاق مشروعك الخاص هو طريقة رائعة لتعلم كيفية عمل المصادر المفتوحة. إذا لم تفتح مصدر مشروع من قبل، فقد تكون متوترًا بشأن ما سيقوله الناس، أو ما إذا كان أي شخص سيلاحظ على الإطلاق. إذا كان هذا يبدو مثلك، فأنت لست وحدك! عمل المصادر المفتوحة يشبه أي نشاط إبداعي آخر، سواء كان الكتابة أو الرسم. قد يبدو من المخيف مشاركة عملك مع العالم، لكن الطريقة الوحيدة لتحسين مهاراتك هي الممارسة - حتى لو لم يكن لديك جمهور. إذا لم تكن مقتنعًا بعد، خذ لحظة للتفكير في ما قد تكون أهدافك. تحديد أهدافك يمكن أن تساعدك الأهداف في معرفة ما يجب العمل عليه، وما يجب قول “لا” له، وأين تحتاج إلى مساعدة من الآخرين. ابدأ بسؤال نفسك، لماذا أفتح مصدر هذا المشروع؟ لا توجد إجابة صحيحة واحدة على هذا السؤال. قد يكون لديك أهداف متعددة لمشروع واحد، أو مشاريع مختلفة بأهداف مختلفة. إذا كان هدفك الوحيد هو إظهار عملك، فقد لا تريد حتى مساهمات، بل وحتى تقول ذلك في ملف README الخاص بك. من ناحية أخرى، إذا كنت تريد مساهمين، فستستثمر الوقت في توثيق واضح وجعل الوافدين الجدد يشعرون بالترحيب. في مرحلة ما أنشأت UIAlertView مخصصًا كنت أستخدمه… وقررت جعله مفتوح المصدر. لذلك قمت بتعديله ليكون أكثر ديناميكية ورفعته إلى GitHub. كتبت أيضًا توثيقي الأول لأشرح للمطورين الآخرين كيفية استخدامه في مشاريعهم. من المحتمل أن لا أحد استخدمه لأنه كان مشروعًا بسيطًا لكنني كنت أشعر بالرضا عن مساهمتي. — @mavris, “مطورو البرمجيات ذاتيو التعلم: لماذا المصادر المفتوحة مهمة لنا” مع نمو مشروعك، قد يحتاج مجتمعك إلى أكثر من مجرد كود منك. الرد على issues، ومراجعة الكود، والترويج لمشروعك كلها مهام مهمة في مشروع مفتوح المصدر. بينما تعتمد كمية الوقت الذي تقضيه في المهام غير البرمجية على حجم مشروعك ونطاقه، يجب أن تكون مستعدًا كمسؤول للتعامل معها بنفسك أو العثور على شخص لمساعدتك. إذا كنت جزءًا من شركة تفتح مصدر مشروع، تأكد من أن مشروعك لديه الموارد الداخلية التي يحتاجها للازدهار. ستحتاج إلى تحديد من المسؤول عن صيانة المشروع بعد الإطلاق، وكيف ستشارك هذه المهام مع مجتمعك. إذا كنت بحاجة إلى ميزانية مخصصة أو موظفين للترويج والعمليات وصيانة المشروع، ابدأ تلك المحادثات مبكرًا. عندما تبدأ في فتح مصدر المشروع، من المهم التأكد من أن عمليات إدارتك تأخذ في الاعتبار المساهمات والقدرات للمجتمع المحيط بمشروعك. لا تخف من إشراك المساهمين غير الموظفين في نشاطك التجاري في الجوانب الرئيسية للمشروع - خاصة إذا كانوا مساهمين متكررين. — @captainsafia, “إذن تريد فتح مصدر مشروع، صحيح؟” المساهمة في مشاريع أخرى إذا كان هدفك هو تعلم كيفية التعاون مع الآخرين أو فهم كيفية عمل المصادر المفتوحة، ففكر في المساهمة في مشروع موجود. ابدأ بمشروع تستخدمه وتحبه بالفعل. يمكن أن تكون المساهمة في مشروع بسيطة مثل إصلاح الأخطاء الإملائية أو تحديث التوثيق. إذا لم تكن متأكدًا من كيفية البدء كمساهم، تحقق من دليل كيفية المساهمة في المشاريع مفتوحة المصدر . إطلاق مشروعك مفتوح المصدر الخاص لا يوجد وقت مثالي لفتح مصدر عملك. يمكنك فتح مصدر فكرة، أو عمل قيد التقدم، أو بعد سنوات من كونه مصدرًا مغلقًا. بشكل عام، يجب عليك فتح مصدر مشروعك عندما تشعر بالراحة في أن يشاهد الآخرون عملك ويقدمون ملاحظات عليه. بغض النظر عن المرحلة التي تقرر فيها فتح مصدر مشروعك، يجب أن يتضمن كل مشروع التوثيق التالي: ترخيص المصدر المفتوح README إرشادات المساهمة قواعد السلوك كمسؤول، ستساعدك هذه المكونات في توصيل التوقعات، وإدارة المساهمات، وحماية الحقوق القانونية للجميع (بما في ذلك حقوقك). تزيد بشكل كبير من فرص حصولك على تجربة إيجابية. إذا كان مشروعك على GitHub، فإن وضع هذه الملفات في دليلك الجذري بأسماء الملفات الموصى بها سيساعد GitHub على التعرف عليها وإظهارها تلقائيًا لقرائك. اختيار ترخيص يضمن ترخيص المصدر المفتوح أن يتمكن الآخرون من استخدام مشروعك ونسخه وتعديله والمساهمة فيه دون عواقب. كما يحميك من المواقف القانونية اللزجة. يجب عليك تضمين ترخيص عند إطلاق مشروع مفتوح المصدر. العمل القانوني ليس ممتعًا. الخبر السار هو أنه يمكنك نسخ ولصق ترخيص موجود في مستودعك. سيستغرق الأمر دقيقة واحدة فقط لحماية عملك الشاق. MIT ، Apache 2.0 ، و GPLv3 هي تراخيص المصادر المفتوحة الأكثر شعبية، لكن هناك خيارات أخرى للاختيار من بينها. عند إنشاء مشروع جديد على GitHub، يتم منحك خيار تحديد ترخيص. سيجعل تضمين ترخيص مفتوح المصدر مشروعك على GitHub مفتوح المصدر. إذا كانت لديك أسئلة أو مخاوف أخرى حول الجوانب القانونية لإدارة مشروع مفتوح المصدر، فنحن نغطيك . كتابة ملف README تفعل ملفات README أكثر من مجرد شرح كيفية استخدام مشروعك. كما أنها تشرح لماذا مشروعك مهم، وماذا يمكن لمستخدميك فعله به. في README الخاص بك، حاول الإجابة على الأسئلة التالية: ماذا يفعل هذا المشروع؟ لماذا هذا المشروع مفيد؟ كيف أبدأ؟ أين يمكنني الحصول على مزيد من المساعدة، إذا كنت بحاجة إليها؟ يمكنك استخدام README الخاص بك للإجابة على أسئلة أخرى، مثل كيفية التعامل مع المساهمات، وما هي أهداف المشروع، ومعلومات حول التراخيص والإسناد. إذا كنت لا تريد قبول المساهمات، أو أن مشروعك ليس جاهزًا بعد للإنتاج، اكتب هذه المعلومات. توثيق أفضل يعني المزيد من المستخدمين، وطلبات دعم أقل، والمزيد من المساهمين. (…) تذكر أن قراءك ليسوا أنت. هناك أشخاص قد يأتون إلى مشروع لديهم تجارب مختلفة تمامًا. — @tracymakes, “الكتابة بحيث تُقرأ كلماتك (فيديو)” في بعض الأحيان، يتجنب الناس كتابة README لأنهم يشعرون أن المشروع غير مكتمل، أو أنهم لا يريدون مساهمات. هذه كلها أسباب وجيهة جدًا لكتابة واحد. للمزيد من الإلهام، جرب استخدام دليل @dguo “اصنع README” أو قالب @PurpleBooth لملف README لكتابة README كامل. عند تضمين ملف README في الدليل الجذري، سيعرضه GitHub تلقائيًا على الصفحة الرئيسية للمستودع. كتابة إرشادات المساهمة الخاصة بك يخبر ملف CONTRIBUTING جمهورك بكيفية المشاركة في مشروعك. على سبيل المثال، قد تتضمن معلومات حول: كيفية تقديم تقرير عن خطأ (حاول استخدام قوالب issue وpull request ) كيفية اقتراح ميزة جديدة كيفية إعداد بيئتك وتشغيل الاختبارات بالإضافة إلى التفاصيل التقنية، يُعد ملف CONTRIBUTING فرصة لتوصيل توقعاتك للمساهمات، مثل: أنواع المساهمات التي تبحث عنها خارطة طريقك أو رؤيتك للمشروع كيف يجب (أو لا يجب) على المساهمين التواصل معك استخدام نبرة دافئة وودية وتقديم اقتراحات محددة للمساهمات (مثل كتابة التوثيق، أو إنشاء موقع ويب) يمكن أن يقطع شوطًا طويلاً في جعل الوافدين الجدد يشعرون بالترحيب والحماس للمشاركة. على سبيل المثال، يبدأ Active Admin دليل المساهمة الخاص به بـ: أولاً، شكرًا لك على التفكير في المساهمة في Active Admin. إنه أشخاص مثلك الذين يجعلون Active Admin أداة رائعة. في المراحل الأولى من مشروعك، يمكن أن يكون ملف CONTRIBUTING بسيطًا. يجب عليك دائمًا شرح كيفية الإبلاغ عن الأخطاء أو تقديم issues، وأي متطلبات تقنية (مثل الاختبارات) لتقديم مساهمة. مع مرور الوقت، قد تضيف أسئلة أخرى يتم طرحها بشكل متكرر إلى ملف CONTRIBUTING الخاص بك. كتابة هذه المعلومات يعني أن عددًا أقل من الناس سيسألك نفس الأسئلة مرارًا وتكرارًا. للمزيد من المساعدة في كتابة ملف CONTRIBUTING الخاص بك، راجع قالب دليل المساهمة لـ @nayafia contributing guide template أو “كيفية بناء CONTRIBUTING.md” لـ @mozilla. اربط ملف CONTRIBUTING الخاص بك من README، حتى يراه المزيد من الناس. إذا وضعت ملف CONTRIBUTING في مستودع مشروعك ، فسيربط GitHub تلقائيًا إلى ملفك عندما ينشئ مساهم issue أو يفتح pull request. إنشاء قواعد السلوك لقد مررنا جميعًا بتجارب واجهنا فيها ما كان على الأرجح سوء معاملة إما كمسؤول يحاول شرح لماذا يجب أن يكون شيء ما بطريقة معينة، أو كمستخدم… يطرح سؤالاً بسيطًا. (…) قواعد السلوك تصبح وثيقة يسهل الرجوع إليها وربطها والتي تشير إلى أن فريقك يأخذ الخطاب البناء على محمل الجد. — @mlynch, “جعل المصادر المفتوحة مكانًا أكثر سعادة” أخيرًا، تساعد قواعد السلوك في وضع قواعد أساسية للسلوك لمشاركي مشروعك. هذا ذو قيمة خاصة إذا كنت تطلق مشروع مفتوح المصدر لمجتمع أو شركة. تمكّنك قواعد السلوك من تسهيل سلوك المجتمع الصحي والبنّاء، مما سيقلل من توترك كمسؤول. لمزيد من المعلومات، راجع دليل قواعد السلوك . بالإضافة إلى توصيل كيف تتوقع من المشاركين أن يتصرفوا، تميل قواعد السلوك أيضًا إلى وصف من تنطبق عليه هذه التوقعات، ومتى تنطبق، وماذا تفعل إذا حدث انتهاك. مثل تراخيص المصادر المفتوحة، هناك أيضًا معايير ناشئة لقواعد السلوك، لذلك لا داعي لكتابة قواعدك الخاصة. Contributor Covenant هي قواعد سلوك جاهزة للاستخدام يستخدمها أكثر من 40,000 مشروع مفتوح المصدر ، بما في ذلك Kubernetes وRails Swift. بغض النظر عن النص الذي تستخدمه، يجب أن تكون مستعدًا لفرض قواعد السلوك الخاصة بك عند الضرورة. الصق النص مباشرة في ملف CODE_OF_CONDUCT في مستودعك. احتفظ بالملف في الدليل الجذري لمشروعك حتى يسهل العثور عليه، واربطه من README الخاص بك. تسمية مشروعك ووضع علامة تجارية عليه العلامة التجارية هي أكثر من مجرد شعار لامع أو اسم مشروع جذاب. إنها تتعلق بكيفية حديثك عن مشروعك، ومن تصل إليه برسالتك. اختيار الاسم الصحيح اختر اسمًا يسهل تذكره، ومن الناحية المثالية، يعطي فكرة عما يفعله المشروع. على سبيل المثال: Sentry يراقب التطبيقات للإبلاغ عن الأعطال Thin هو خادم ويب Ruby سريع وبسيط إذا كنت تبني على مشروع موجود، فإن استخدام اسمهم كبادئة يمكن أن يساعد في توضيح ما يفعله مشروعك (على سبيل المثال، node-fetch يجلب window.fetch إلى Node.js). ضع الوضوح قبل كل شيء. التورية ممتعة، لكن تذكر أن بعض النكات قد لا تُترجم إلى ثقافات أخرى أو أشخاص ذوي تجارب مختلفة عنك. قد يكون بعض مستخدميك المحتملين موظفين في الشركة: لا تريد أن تجعلهم غير مرتاحين عندما يضطرون إلى شرح مشروعك في العمل! تجنب تعارضات الأسماء تحقق من مشاريع المصادر المفتوحة ذات الأسماء المشابهة ، خاصة إذا كنت تشارك نفس اللغة أو النظام البيئي. إذا كان اسمك يتداخل مع مشروع شائع موجود، فقد تربك جمهورك. إذا كنت تريد موقع ويب، أو مقبض Twitter، أو خصائص أخرى لتمثيل مشروعك، فتأكد من أنه يمكنك الحصول على الأسماء التي تريدها. من الناحية المثالية، احجز هذه الأسماء الآن لراحة البال، حتى لو لم تكن تنوي استخدامها بعد. تأكد من أن اسم مشروعك لا ينتهك أي علامات تجارية. قد تطلب منك شركة ما إزالة مشروعك لاحقًا، أو حتى اتخاذ إجراء قانوني ضدك. الأمر لا يستحق المخاطرة. يمكنك التحقق من قاعدة بيانات العلامات التجارية العالمية لـ WIPO لتعارضات العلامات التجارية. إذا كنت في شركة، فهذا أحد الأشياء التي يمكن لـ فريقك القانوني مساعدتك فيها . أخيرًا، قم بإجراء بحث سريع على Google عن اسم مشروعك. هل سيتمكن الناس من العثور على مشروعك بسهولة؟ هل يظهر شيء آخر في نتائج البحث لا تريد منهم رؤيته? كيفية كتابتك (وكتابة الكود) تؤثر على علامتك التجارية أيضًا! طوال حياة مشروعك، ستقوم بالكثير من الكتابة: ملفات README، والبرامج التعليمية، ووثائق المجتمع، والرد على issues، وربما حتى النشرات الإخبارية وقوائم البريد. سواء كانت وثائق رسمية أو بريدًا إلكترونيًا عاديًا، فإن أسلوب كتابتك هو جزء من علامة مشروعك التجارية. ضع في اعتبارك كيف قد تبدو لجمهورك وما إذا كانت هذه هي النبرة التي ترغب في نقلها. حاولت أن أشارك في كل موضوع في القائمة البريدية، وأظهر سلوكًا نموذجيًا، وأكون لطيفًا مع الناس، وأخذ مشاكلهم على محمل الجد وأحاول أن أكون مفيدًا بشكل عام. بعد فترة، التزم الناس ليس فقط لطرح الأسئلة، ولكن للمساعدة في الإجابة أيضًا، وكانت سعادتي كاملة، فقد قلدوا أسلوبي. — @janl على CouchDB , “المصادر المفتوحة المستدامة” استخدام لغة دافئة وشاملة (مثل “هم”، حتى عند الإشارة إلى شخص واحد) يمكن أن يقطع شوطًا طويلاً في جعل مشروعك يبدو ترحيبيًا للمساهمين الجدد. التزم باللغة البسيطة، حيث قد لا يكون العديد من قرائك متحدثين أصليين للغة الإنجليزية. بالإضافة إلى كيفية كتابة الكلمات، قد يصبح أسلوب البرمجة الخاص بك أيضًا جزءًا من علامة مشروعك التجارية. Angular و jQuery مثالان من المشاريع ذات أساليب البرمجة والإرشادات الصارمة. ليس من الضروري كتابة دليل أسلوب لمشروعك عندما تبدأ للتو، وقد تجد أنك تستمتع بدمج أساليب برمجة مختلفة في مشروعك على أي حال. لكن يجب أن تتوقع كيف يمكن لأسلوب كتابتك وبرمجتك أن يجذب أو يثني أنواعًا مختلفة من الناس. المراحل الأولى من مشروعك هي فرصتك لتحديد السابقة التي ترغب في رؤيتها. قائمة التحقق قبل الإطلاق هل أنت مستعد لفتح مصدر مشروعك؟ إليك قائمة تحقق للمساعدة. ضع علامة على جميع المربعات؟ أنت مستعد للانطلاق! انقر على “نشر” وربت على ظهرك. التوثيق يحتوي المشروع على ملف LICENSE مع ترخيص مفتوح المصدر يحتوي المشروع على توثيق أساسي (README, CONTRIBUTING, CODE_OF_CONDUCT) الاسم سهل التذكر، يعطي فكرة عما يفعله المشروع، ولا يتعارض مع مشروع موجود أو ينتهك العلامات التجارية قائمة issues محدثة، مع issues منظمة ومصنفة بوضوح الكود يستخدم المشروع اتفاقيات كود متسقة وأسماء واضحة للدوال/الأساليب/المتغيرات الكود مُعلّق بوضوح، يوثق النوايا والحالات الحدية لا توجد مواد حساسة في سجل المراجعات أو issues أو pull requests (على سبيل المثال، كلمات المرور أو معلومات أخرى غير عامة) الأشخاص إذا كنت فردًا: لقد تحدثت إلى القسم القانوني و/أو تفهم الملكية الفكرية وسياسات المصادر المفتوحة لشركتك (إذا كنت موظفًا في مكان ما) إذا كنت شركة أو منظمة: لقد تحدثت إلى قسمك القانوني لديك خطة تسويقية للإعلان والترويج للمشروع هناك شخص ملتزم بإدارة تفاعلات المجتمع (الرد علىissues، مراجعة ودمج pull requests) لدى شخصين على الأقل صلاحيات إدارية للمشروع لقد فَعَلتَها! تهانينا على فتح مصدر مشروعك الأول. بغض النظر عن النتيجة، فإن العمل بشكل علني هو هدية للمجتمع. مع كل commit وتعليق وpull request، أنت تخلق فرصًا لنفسك وللآخرين للتعلم والنمو. رجوع للأدلة أدلة ذات صلة العثور على مستخدمين لمشروعك ساعد مشروعك مفتوح المصدر على النمو من خلال إتاحته للمستخدمين السعداء بناء مُجتمعات مُرحِّبة إنشاء مجتمع يدعم مشاركة الناس في مشروعك، ويحفّزهم على استخدامه والمساهمة فيه والترويج له Scroll to Top ساهِم هل تريد تقديم اقتراح؟ هذا المحتوى مفتوح المصدر. ساعدنا على تحسينه ساهِم ابقَ على تواصل GitHubكُن أول من يطّلِع على أحدث نصائح وموارد البريد الإلكتروني fine print with by and friends | 2026-01-13T09:29:14 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.