| /////////////////////////////////////////////////////////////////////////////// | |
| // ABOUT: A unity Shader .cginc to draw numbers in the fragment shader | |
| // AUTHOR: Freya Holmér | |
| // LICENSE: Use for whatever, commercial or otherwise! | |
| // Don't hold me liable for issues though | |
| // But pls credit me if it works super well <3 | |
| // LIMITATIONS: There's some precision loss beyond 3 decimal places | |
| // CONTRIBUTORS: yes please! if you know a more precise way to get | |
| // decimal digits then pls lemme know! | |
| // GetDecimalSymbolAt() could use some more love/precision |
| Shader "Unlit/InfiniteGrid" | |
| { | |
| Properties | |
| { | |
| [Toggle] _WorldUV ("Use World Space UV", Float) = 1.0 | |
| _GridScale ("Grid Scale", Float) = 1.0 | |
| _GridBias ("Grid Bias", Float) = 0.5 | |
| _GridDiv ("Grid Divisions", Float) = 10.0 | |
| _BaseColor ("Base Color", Color) = (0,0,0,1) | |
| _LineColor ("Line Color", Color) = (1,1,1,1) |
| // Copyright (c) 2023 Tomasz Stachowiak | |
| // | |
| // This contribution is dual licensed under EITHER OF | |
| // | |
| // Apache License, Version 2.0, (http://www.apache.org/licenses/LICENSE-2.0) | |
| // MIT license (http://opensource.org/licenses/MIT) | |
| // | |
| // at your option. | |
| #include "/inc/frame_constants.hlsl" |
This command-line utility generates a bitonic merge sort network based on number of sortable items n, and workgroup size.
Choose workgroup size to be ==n for an ideal sorting network. Number of sortable elements n must be power of two.
In-depth discussion, GPU implementation, and context for this code: https://poniesandlight.co.uk/reflect/bitonic_merge_sort/
