代码搜索:Rotates

找到约 176 项符合「Rotates」的源代码

代码结果 176
www.eeworm.com/read/154772/11927414

asm rot.asm

; Double-word (32-bit) rotates on an 8086 ; This is just some hacking around with an 8086 to see how to ; implement MD5 and SHA efficiently, as the start of an ; implementation. The biggest prob
www.eeworm.com/read/361403/10054283

html rbtree.html

Red-Black Tree Lafore's Red-Black Tree
www.eeworm.com/read/467498/7004566

html rbtree.html

Red-Black Tree Lafore's Red-Black Tree
www.eeworm.com/read/485014/6570934

html rbtree.html

Red-Black Tree Lafore's Red-Black Tree
www.eeworm.com/read/129189/14258970

html rbtree.html

Red-Black Tree Lafore's Red-Black Tree
www.eeworm.com/read/247431/12659212

html rbtree.html

Red-Black Tree Lafore's Red-Black Tree
www.eeworm.com/read/289487/8548797

m givrot.m

function [G] = givrot (x); %GIVROT % [G] = givrot (x); % returns Givens-rotation matrix % [c -s; s c] which rotates x(2) to zero. if (x(2) ~= 0), r = norm (x, 2); G = 1/r*[x(1) x(2);
www.eeworm.com/read/428269/8880625

m givrot.m

function [G] = givrot (x); %GIVROT % [G] = givrot (x); % returns Givens-rotation matrix % [c -s; s c] which rotates x(2) to zero. if (x(2) ~= 0), r = norm (x, 2); G = 1/r*[x(1) x(2);
www.eeworm.com/read/468922/6981940

m givrot.m

function [G] = givrot (x); %GIVROT % [G] = givrot (x); % returns Givens-rotation matrix % [c -s; s c] which rotates x(2) to zero. if (x(2) ~= 0), r = norm (x, 2); G = 1/r*[x(1) x(2);
www.eeworm.com/read/458392/7297289

m givrot.m

function [G] = givrot (x); %GIVROT % [G] = givrot (x); % returns Givens-rotation matrix % [c -s; s c] which rotates x(2) to zero. if (x(2) ~= 0), r = norm (x, 2); G = 1/r*[x(1) x(2);