{"blocks":[{"type":"paragraph","data":{"text":"Нашли и оформили подборку различных хитрых приёмов с битовыми операциями. С основами битовых операций также можно ознакомиться в нашей статье. Если вы знаете какие-то трюки, которые не вошли в этот список, делитесь ими в комментариях! "}},{"type":"separator","data":{"text":"***"}},{"type":"header3","data":{"level":3,"text":"Целые числа"}},{"type":"paragraph","data":{"text":"Установка n-ого бита"}},{"type":"code","data":{"code":"x | (1<> 1;\r\nv |= v >> 2;\r\nv |= v >> 4;\r\nv |= v >> 8;\r\nv |= v >> 16;\r\nv++;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Получение максимального целого"}},{"type":"code","data":{"code":"int maxInt = ~(1 << 31);\r\nint maxInt = (1 << 31) - 1;\r\nint maxInt = (1 << -1) - 1;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Получение минимального целого"}},{"type":"code","data":{"code":"int minInt = 1 << 31;\r\nint minInt = 1 << -1;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Получение максимального long"}},{"type":"code","data":{"code":"long maxLong = ((long)1 << 127) - 1;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Умножение на 2"}},{"type":"code","data":{"code":"n << 1;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Деление на 2"}},{"type":"code","data":{"code":"n >> 1;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Умножение на m-тую степень 2"}},{"type":"code","data":{"code":"n << m;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Деление на m-тую степень 2"}},{"type":"code","data":{"code":"n >> m;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Проверка на равенство"}},{"type":"paragraph","data":{"text":"На 35% быстрее, чем JS ?"}},{"type":"code","data":{"code":"(a^b) == 0; // a == b","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Проверка на чётность"}},{"type":"code","data":{"code":"(n & 1) == 1;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Обмен значениями"}},{"type":"code","data":{"code":"a ^= b;\r\nb ^= a;\r\na ^= b;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Модуль"}},{"type":"code","data":{"code":"//version 1\r\nx < 0 ? -x : x;\r\n\r\n//version 2\r\n(x ^ (x >> 31)) - (x >> 31);","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Максимум двух чисел"}},{"type":"code","data":{"code":"b & ((a-b) >> 31) | a & (~(a-b) >> 31);","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Минимум двух чисел"}},{"type":"code","data":{"code":"a & ((a-b) >> 31) | b & (~(a-b) >> 31);","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Проверка на одинаковый знак"}},{"type":"code","data":{"code":"(x ^ y) >= 0;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Смена знака"}},{"type":"code","data":{"code":"i = ~i + 1; // or\r\ni = (i ^ -1) + 1; // i = -i","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Вычисление 2^n"}},{"type":"code","data":{"code":"2 << (n-1);","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Проверка на степень 2"}},{"type":"code","data":{"code":"n > 0 && (n & (n - 1)) == 0;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Остаток от деления 2^n на m"}},{"type":"code","data":{"code":"m & (n - 1);","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Среднее арифметическое"}},{"type":"code","data":{"code":"(x + y) >> 1;\r\n((x ^ y) >> 1) + (x & y);","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Получение m-ого бита n (справа налево)"}},{"type":"code","data":{"code":"(n >> (m-1)) & 1;","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Установка m-ого бита n (справа налево)"}},{"type":"code","data":{"code":"n & ~(1 << (m-1));","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Проверка n-ого бита"}},{"type":"code","data":{"code":"if (x & (1< (x | ' ')\r\nResult is always lowercase even if letter is already lowercase\r\neg. ('a' | ' ') => 'a' ; ('A' | ' ') => 'a'","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Преобразование буквы в заглавную"}},{"type":"code","data":{"code":"AND by underline => (x & '_')\r\nResult is always uppercase even if letter is already uppercase\r\neg. ('a' & '_') => 'A' ; ('A' & '_') => 'A'","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Смена вида буквы"}},{"type":"code","data":{"code":"XOR by space => (x ^ ' ')\r\neg. ('a' ^ ' ') => 'A' ; ('A' ^ ' ') => 'a'","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Номер буквы в алфавите"}},{"type":"code","data":{"code":"AND by chr(31)/binary('11111')/(hex('1F') => (x & \"\\x1F\")\r\nResult is in 1..26 range, letter case is not important\r\neg. ('a' & \"\\x1F\") => 1 ; ('B' & \"\\x1F\") => 2","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Номер заглавной буквы в алфавите"}},{"type":"code","data":{"code":"AND by ? => (x & '?') or XOR by @ => (x ^ '@')\r\neg. ('C' & '?') => 3 ; ('Z' ^ '@') => 26","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Номер строчной буквы в алфавите"}},{"type":"code","data":{"code":"XOR by backtick/chr(96)/binary('1100000')/hex('60') => (x ^ '`')\r\neg. ('d' ^ '`') => 4 ; ('x' ^ '`') => 25","language":"clike lazy-code"}},{"type":"separator","data":{"text":"***"}},{"type":"header3","data":{"level":3,"text":"Прочее"}},{"type":"paragraph","data":{"text":"Быстрая смена цвета с R5G5B5 на R8G8B8"}},{"type":"code","data":{"code":"R8 = (R5 << 3) | (R5 >> 2)\r\nG8 = (R5 << 3) | (R5 >> 2)\r\nB8 = (R5 << 3) | (R5 >> 2)","language":"clike lazy-code"}},{"type":"paragraph","data":{"text":"Примечание: можно использовать только латиницу."}}]}

Ошибка в настройках сайта